dc.contributor.author | Chen, Xiangping | en_US |
dc.contributor.author | Ying, Daoning | en_US |
dc.date.accessioned | 2014-10-21T06:10:45Z | |
dc.date.available | 2014-10-21T06:10:45Z | |
dc.date.issued | 1989 | en_US |
dc.identifier.issn | 1467-8659 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1111/j.1467-8659.1989.tb00485.x | en_US |
dc.description.abstract | A 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.publisher | Blackwell Publishing Ltd and the Eurographics Association | en_US |
dc.title | Polygon Triangulation Algorithm as a Powerful Core Processor of PLAN-I | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |
dc.description.volume | 8 | en_US |
dc.description.number | 3 | en_US |
dc.identifier.doi | 10.1111/j.1467-8659.1989.tb00485.x | en_US |
dc.identifier.pages | 193-196 | en_US |