ACM Home Page
Please provide us with feedback. Feedback
Starburst: a target expansion algorithm for non-uniform target distributions
Full text PdfPdf (3.85 MB)
Source
AVI archive
Proceedings of the working conference on Advanced visual interfaces table of contents
Napoli, Italy
SESSION: Surface - oriented interaction table of contents
Pages 129-137  
Year of Publication: 2008
ISBN:1-978-60558-141-5
Authors
Patrick Baudisch  Microsoft Research, One Microsoft Way, Redmond, WA
Alexander Zotov  Microsoft Research, One Microsoft Way, Redmond, WA
Edward Cutrell  Microsoft Research, One Microsoft Way, Redmond, WA
Ken Hinckley  Microsoft Research, One Microsoft Way, Redmond, WA
Sponsors
SIGCHI Italy : SIGCHI Italy
SIGCHI : Specialist Interest Group in Computer-Human Interaction of the ACM
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 107,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1385569.1385592
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
Baudisch, P., Cutrell, E., Robbins, D., Czerwinski, M., Tandler, P. Bederson, B., and Zierlinger, A. Drag-and-Pop and Drag-and-Pick: Techniques for Accessing Remote Screen Content on Touch- and Pen-operated Systems. In Proc. Interact'03, pp. 57--64.
5
6
7
8
9
 
10
Dion, J. (1987). Fast printed circuit board routing. ACM Press New York, NY, USA.
11
 
12
Fortune, S. A sweepline algorithm for Voronoi diagrams. In Algorithmica 2(1):153--174, March 1987.
 
13
Furnas, G. W. and Qu, Y. Shape manipulation using pixel rewrites. In Proc. Visual Computing 2002 (VC'02), published in Proc. DMS2002, pp. 630--639.
14
15
 
16
17
 
18
 
19
Kakoulis, K. and Tollis, I. Intl. Journal of Computational Geometry and Applications 13(1):23--59. (2003).
 
20
21
22
 
23
Parker, J., Mandryk, R., Nunes, M., and Inkpen, K. Improving target acquisition for pointing input on tabletop displays. In Proc. INTERACT 2005, pp 80--93.
24
 
25
26
 
27
28
29
30


Collaborative Colleagues:
Patrick Baudisch: colleagues
Alexander Zotov: colleagues
Edward Cutrell: colleagues
Ken Hinckley: colleagues