Terrain polygon decomposition, with application to layered manufacturing

Ivaylo Ilinkin, Ravi Janardan, Michiel Smid

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationComputing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings
EditorsOscar H. Ibarra, Louxin Zhang
PublisherSpringer Verlag
Pages381-390
Number of pages10
ISBN (Print)354043996X, 9783540439967
DOIs
StatePublished - 2002
Event8th Annual International Conference on Computing and Combinatorics, COCOON 2002 - Singapore, Singapore
Duration: Aug 15 2002Aug 17 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2387
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th Annual International Conference on Computing and Combinatorics, COCOON 2002
CountrySingapore
CitySingapore
Period8/15/028/17/02

Fingerprint Dive into the research topics of 'Terrain polygon decomposition, with application to layered manufacturing'. Together they form a unique fingerprint.

Cite this