Approximate convex decomposition of polyhedra

Jyh Ming Lien, Nancy M. Amato

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationACM SIGGRAPH 2004 Posters, SIGGRAPH 2004
EditorsRonen Barzel
PublisherAssociation for Computing Machinery, Inc
Pages2
Number of pages1
ISBN (Electronic)1581138962, 9781581138962
DOIs
StatePublished - Aug 8 2004
Externally publishedYes
EventInternational Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2004 - Los Angeles, United States
Duration: Aug 8 2004Aug 12 2004

Publication series

NameACM SIGGRAPH 2004 Posters, SIGGRAPH 2004

Other

OtherInternational Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2004
CountryUnited States
CityLos Angeles
Period8/8/048/12/04

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Human-Computer Interaction

Fingerprint Dive into the research topics of 'Approximate convex decomposition of polyhedra'. Together they form a unique fingerprint.

Cite this