authors 
Burton, Warren 
year 
1977 
title 
Representation of ManySided Polygons and Polygonal Lines for Rapid Processing 
source 
communications of the ACMò. March, 1977. vol. 20: pp. 166171 : ill. includes bibliography 
summary 
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 manysided 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 
keywords 
representation, GIS, mapping, computer graphics, algorithms, information, intersection, curves, polygons, Brep 
series 
CADline 
references 
Contenttype: text/plain

last changed 
1999/02/12 14:07 
