Polygon Triangulation Algorithm as a Powerful Core Processor of PLAN-I

Simple item page
dc.contributor.authorChen, Xiangpingen_US
dc.contributor.authorYing, Daoningen_US
dc.date.accessioned2014-10-21T06:10:45Z
dc.date.available2014-10-21T06:10:45Z
dc.date.issued1989en_US
dc.description.abstractA concise, complete and reliable algorithm for triangulating an arbitrary polygon is presented as a powerful core processor of PLAN-I (Production Layout Automation Nucleus) system1. A polygon with inner loops is converted into a non-self-intersecting polygon (NIP) through adding Bridge Edges . A triangular splitting algorithm for NIP is described in detail and successfully implemented. The program is about 300 lines in FORTRAN-77. Sweeping and local operations with respect to the triangular-faceted boundary representation are designed with the algorithm to improve functions of solid modeling in PLAN-I. The algorithm of triangulation can also be applied to Boolean operations and other issues.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume8en_US
dc.identifier.doi10.1111/j.1467-8659.1989.tb00485.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages193-196en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.1989.tb00485.xen_US
dc.publisherBlackwell Publishing Ltd and the Eurographics Associationen_US
dc.titlePolygon Triangulation Algorithm as a Powerful Core Processor of PLAN-Ien_US
Files
Collections
Issue 3