.png){kind=icon}
Return
Approximate Pyramidal Shape Decomposition
.png){kind=icon}
PRE
AI
DOI：10.1145/2661229.2661244.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A shape is pyramidal if it has a flat base with the remaining boundary forming a height function over the base. Pyramidal shapes are optimal for molding, casting, and layered 3D printing. However, many common objects are not pyramidal. We introduce an algorithm for approximate pyramidal shape decomposition. The general exact pyramidal decomposition problem is NP-hard. We turn this problem into an NP-complete problem which admits a practical solution. Specifically, we link pyramidal decomposition to the Exact Cover Problem (ECP). Given an input shape S, we develop clustering schemes to derive a set of building blocks for approximate pyramidal parts of S. The building blocks are then combined to yield a set of candidate pyramidal parts. Finally, we employ Knuth's Algorithm X over the candidate parts to obtain solutions to ECP as pyramidal shape decompositions. Our solution is equally applicable to 2D or 3D shapes, and to shapes with polygonal or smooth boundaries, with or without holes. We demonstrate our algorithm on numerous shapes and evaluate its performance.
Keywords:
pyramidality
shape decomposition
3D printing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.5
Papers:
4.8K
Citations:
3.6W
Organization
Cited Papers
Distribution and ultrastructure of neurosecretory cells in the cerebral ganglion of the earthworm
.png){kind=icon}
PREAI
ShareSaveSelf-focusing effects of dispositional self-consciousness, mirror presence, and audience presence.
PREAI
ShareSave
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients
PREAI
ShareSave
ShareSaveShareSave
View more