Starburst: a target expansion algorithm for non-uniform target distributions
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Acquiring small targets on a tablet or touch screen can be challenging. To address the problem, researchers have proposed techniques that enlarge the effective size of targets by extending targets into adjacent screen space. When applied to targets organized in clusters, however, these techniques show little effect because there is no space to grow into. Unfortunately, target clusters are common in many popular applications. We present Starburst, a space partitioning algorithm that works for target clusters. Starburst identifies areas of available screen space, grows a line from each target into the available space, and then expands that line into a clickable surface. We present the basic algorithm and extensions. We then present 2 user studies in which Starburst led to a reduction in error rate by factors of 9 and 3 compared to traditional target expansion.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Acquisition of expanding targets
McGuffin, M., & Balakrishnan, R. (2002) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/503376.503388 · Cited by 215 · cited 2×
“For clusters of adjacent targets, however, target expansion in visual space causes targets to push each other away [ 21 ].”
BackgroundReification, polymorphism and reuse: three principles for designing visual interfaces
Beaudouin-Lafon, M., & Mackay, W. E. (2000) · Proceedings of the working conference on Advanced visual interfaces · doi:10.1145/345513.345267 · Cited by 145
Cited by
Back-of-device interaction allows creating very small touch devices
Baudisch, P., & Chu, G. (2009) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1518701.1518995 · Cited by 306
Self-citationAccess overlays: improving non-visual access to large touch screens for blind users
Kane, S. K., Morris, M. R., Perkins, A. Z., Wigdor, D., Ladner, R. E., & Wobbrock, J. O. (2011) · Proceedings of the 24th annual ACM symposium on User interface software and technology · doi:10.1145/2047196.2047232 · Cited by 127
Surfpad: riding towards targets on a squeeze film effect
Casiez, G., Roussel, N., Vanbelleghem, R., & Giraud, F. (2011) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1978942.1979307 · Cited by 73
“In real-world applications however, locally dense clusters of potential targets emerge for various reasons [8].”
BackgroundAfergan, D., Shibata, T., Hincks, S. W., Peck, E. M., Yuksel, B. F., Chang, R., & Jacob, R. J. K. (2014) · Proceedings of the 27th annual ACM symposium on User interface software and technology · doi:10.1145/2642918.2647414 · Cited by 19
Examining the costs of multiple trajectory pointing techniques
Quinn, P., Cockburn, A., & Delamarche, J. (2013) · International Journal of Human-Computer Studies · doi:10.1016/j.ijhcs.2012.12.001 · Cited by 6
Metadata
- Authors
- Baudisch, P., Zotov, A., Cutrell, E., & Hinckley, K.
- Venue
- Proceedings of the working conference on Advanced visual interfaces
- Publisher
- ACM
- Published
- 2008-05-28
- Pages
- 129-137
- OpenAlex
- W2129330066
- Cited by
- 37
- References
- 2
- FWCI
- 3.09
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Starburst: a target expansion algorithm for non-uniform target distributions. https://app.cochat.ai/papers/10.1145/1385569.1385592
- The paper
- Baudisch, P., Zotov, A., Cutrell, E., & Hinckley, K. (2008). Starburst: a target expansion algorithm for non-uniform target distributions. Proceedings of the working conference on Advanced visual interfaces. https://doi.org/10.1145/1385569.1385592
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.