CumInCAD is a Cumulative Index about publications in Computer Aided Architectural Design
supported by the sibling associations ACADIA, CAADRIA, eCAADe, SIGraDi, ASCAAD and CAAD futures

authors Burton, Warren
year 1977
title Representation of Many-Sided Polygons and Polygonal Lines for Rapid Processing
source communications of the ACMò. March, 1977. vol. 20: pp. 166-171 : 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 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
keywords representation, GIS, mapping, computer graphics, algorithms, information, intersection, curves, polygons, B-rep
series CADline
references Content-type: text/plain
last changed 1999/02/12 14:07
HOMELOGIN (you are user _anon_761559 from group guest) Works Powered by SciX Open Publishing Services 1.002