Approximate convex decomposition of polyhedra Conference Paper uri icon

abstract

  • ACM 2004. 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.

name of conference

  • ACM SIGGRAPH 2004 Posters

published proceedings

  • ACM SIGGRAPH 2004 Posters on - SIGGRAPH '04

author list (cited authors)

  • Lien, J., & Amato, N. M.

citation count

  • 7

complete list of authors

  • Lien, Jyh-Ming||Amato, Nancy M

publication date

  • January 2004