The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Continuous Skeletons from Digitized Images
Journal of the ACM (JACM)
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
Representation of contours and regions for efficient computer search
Communications of the ACM
A note on minimal length polygonal approximation to a digitized contour
Communications of the ACM
Computer representation of planar regions by their skeletons
Communications of the ACM
Communications of the ACM
Compact representation of contour plots for phone line transmission
Communications of the ACM
Algorithm 112: Position of point relative to polygon
Communications of the ACM
Certification of Algorithm 112: Position of point relative to polygon
Communications of the ACM
ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Strip trees: a hierarchical representation for curves
Communications of the ACM
Approximation of polygonal maps by cellular maps
Communications of the ACM
A fixed grid curve representation for efficient processing
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
ACM SIGDA Newsletter
| Hi-index | 48.25 |
A representation for polygons and polygonal lines is described which allows sets of consecutive sides to be collectively examined. The set of sides are arranged in a binary tree hierarchy by inclusion. A fast algorithm for testing the inclusion of a point in a many-sided polygon is given. The speed of the algorithm is discussed for both ideal and practical examples. It is shown that the points of intersection of two polygonal lines can be located by what is essentially a binary tree search. The algorithm and a practical example are discussed. The representation overcomes many of the disadvantages associated with the various fixed-grid methods for representing curves and regions.