Triangulating a nonconvex polytope
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Rapid Prototyping: Principles and Applications in Manufacturing
Rapid Prototyping: Principles and Applications in Manufacturing
Terrain Polygon Decomposition, with Application to Layered Manufacturing
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
| Hi-index | 0.00 |
Layered Manufacturing allows physical prototypes of 3D parts to be built directly from their computer models, as a stack of 2D layers. This paper proposes a new approach, which decomposes the model into a small number of pieces, builds each separately, and glues them together to generate the prototype. This allows large models to be built in parallel and also reduces the need for so-called support structures. Decomposition algorithms that minimize support requirements are given for convex and non-convex polyhedra. Experiments, on convex polyhedra, show that the approach can reduce support requirements substantially.