Terrain Polygon Decomposition, with Application to Layered Manufacturing

Authors:
Ivaylo Ilinkin;Ravi Janardan;Michiel H. M. Smid
Affiliations:
-;-;-
Venue:
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Year:
2002

Citing 9
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Moldable and castable polygons

Computational Geometry: Theory and Applications
A pedestrian approach to ray shooting: shoot a ray, take a walk

SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Efficiently Planning Compliant Motion in thePlane

SIAM Journal on Computing
Multi-criteria geometric optimization problems in layered manufacturing

Proceedings of the fourteenth annual symposium on Computational geometry
On some geometric optimization problems in layered manufacturing

Computational Geometry: Theory and Applications
Minimizing support structures and trapped area in two-dimensional layered manufacturing

Computational Geometry: Theory and Applications
A Decomposition-Based Approach to Layered Manufacturing

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Rapid Prototyping: Principles and Applications in Manufacturing

Rapid Prototyping: Principles and Applications in Manufacturing

Quantified Score

Hi-index	0.00

Visualization

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.