TY - GEN
T1 - Approximate convex decomposition of polyhedra
AU - Lien, Jyh Ming
AU - Amato, Nancy M.
N1 - Publisher Copyright:
© ACM 2004.
PY - 2004/8/8
Y1 - 2004/8/8
N2 - In summary, if an application can tolerate some concavities in the resulting model, then the decompositions produced by our approach should be useful because they can contain fewer components than an exact convex decomposition in significantly less time. Figure 1 shows the difference between exact and approximate convex surface decomposition [Chazelle et al. 1995]. The approximate convex decompositions produced by our algorithms can be used in applications in areas such as collision detection, skeletonization, model simplification, shape identification, and rendering.
AB - In summary, if an application can tolerate some concavities in the resulting model, then the decompositions produced by our approach should be useful because they can contain fewer components than an exact convex decomposition in significantly less time. Figure 1 shows the difference between exact and approximate convex surface decomposition [Chazelle et al. 1995]. The approximate convex decompositions produced by our algorithms can be used in applications in areas such as collision detection, skeletonization, model simplification, shape identification, and rendering.
UR - http://www.scopus.com/inward/record.url?scp=46449097101&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=46449097101&partnerID=8YFLogxK
U2 - 10.1145/1186415.1186418
DO - 10.1145/1186415.1186418
M3 - Conference contribution
AN - SCOPUS:46449097101
T3 - ACM SIGGRAPH 2004 Posters, SIGGRAPH 2004
SP - 2
BT - ACM SIGGRAPH 2004 Posters, SIGGRAPH 2004
A2 - Barzel, Ronen
PB - Association for Computing Machinery
T2 - International Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2004
Y2 - 8 August 2004 through 12 August 2004
ER -