Show simple item record

dc.contributor.authorChen, Minen_US
dc.contributor.authorTownsend, Teeteren_US
dc.date.accessioned2015-10-05T07:55:25Z
dc.date.available2015-10-05T07:55:25Z
dc.date.issued1987en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttp://dx.doi.org/10.2312/egtp.19871032en_US
dc.description.abstractAlgorithms are presented for the determination of whether a given point E<sup>2</sup> in is interior to, exterior to or on an arbitrary polygonal boundary and for the determination of whether a point in E <sup>3</sup> is interior to, exterior to or on a simple polyhedral boundary. The algorithms are based on the principle of using binary coded coordinate systems and parity counting of the number of intersections of the polygon or polyhedron boundary with an infinite vector. The amount of floating-point arithmetic, including arithmetical and comparative operations has been reduced to a minimum making the algorithms very suitable for implementation in either low-level language software or by hardware. Performance of the algorithms is compared with a number of others taken from the literature and a considerable increase in efficiency is apparent. The algorithms are also shown to be consistent.en_US
dc.publisherEurographics Associationen_US
dc.titleEfficient and Consistent Algorithms for Determining the Containment of Points in Polygons and Polyhedraen_US
dc.description.seriesinformationEG 1987-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19871032en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record