The “highly intelligent” tablet as an efficient pointing device for interactive graphics (Preliminary Report)

Described is a simple, efficient algorithm for determining the nearest displayed point on a screen to an arbitrary cursor position. The algorithm seems particularly appropriate for interactive systems using a data tablet with a “smart” controller. The algorithm is based on partitioning the screen among the currently displayed points and minimally modifing this structure as points are added and deleted. Finding the nearest point for cursor position consists then of moving through this partitioning structure until the region is determined. A divide-and-conquer method is used for both inclusion testing in a particular region and also for speeding the search for the proper nearest point.

[1]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[2]  Robert E. Tarjan,et al.  Application of a Planar Separator Theorem , 1977, FOCS.

[3]  Michael Ian Shamos,et al.  Geometric complexity , 1975, STOC.