Abstract
Efficient algorithms are given for decomposing a simple polygon into two special polygons, each with the property that every boundary and interior point can be connected to a single edge by a perpendicular line segment interior to the polygon. This allows efficient construction of certain classes of 3D parts via Layered Manufacturing.
Cite
CITATION STYLE
Ilinkin, I., Janardan, R., & Smid, M. (2002). Terrain polygon decomposition, with application to layered manufacturing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2387, pp. 381–390). Springer Verlag. https://doi.org/10.1007/3-540-45655-4_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
