Abstract
We consider a problem that arises in generating three-dimensional models by methods of layered manufacturing: How does one decompose a given model P into a small number of sub-models each of which is a terrain polyhedron? Terrain polyhedra have a base facet such that, for each point of the polyhedron, the line segment joining the point to its orthogonal projection on the base facet lies within the polyhedron. Terrain polyhedra are exactly the class of polyhedral models for which it is possible to construct the model using layered manufacturing (with layers parallel to the base facet), without the need for constructing "supports" (which must later be removed). In order to maximize the integrity of a prototype, one wants to minimize the number of individual sub-models that are manufactured and then glued together. We show that it is NP-hard to decide if a three-dimensional model P of genus O can be decomposed into k terrain polyhedra. We also prove a two-dimensional version of this theorem, for the case in which P is a polygonal region with holes. Both results still hold if we are restricted to isothetic objects and/or axis-parallel layering directions.
| Original language | English |
|---|---|
| Pages (from-to) | 647-668 |
| Number of pages | 22 |
| Journal | International Journal of Computational Geometry and Applications |
| Volume | 11 |
| Issue number | 6 |
| DOIs | |
| State | Published - Dec 2001 |
Keywords
- Histogram decomposition
- Layered manufacturing
- NP-complete
- Polyhedra
- Process planning
- Terrain
Fingerprint
Dive into the research topics of 'Terrain decomposition and layered manufacturing'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver