Subject: CGAL users discussion list
List archive
- From: Peter Hachenberger <>
- To:
- Subject: RE: [cgal-discuss] Convex Decomposition of Polyhedron inside CGALor elsewhere?
- Date: Wed, 02 Apr 2008 14:21:42 +0200
Hi David,
no, it is an exact method. It decomposes Nef polyhedra exactly into
worst-case O(r^2) pieces, where r is the number of reflex edges.
Here is my paper:
http://www.win.tue.nl/~phachenb/Publications/3DMinkowskiSumConvexDecomposition.pdf
Peter
On Wed, 2008-04-02 at 08:11 -0400, David Lariviere wrote:
> Hi Peter,
>
> Great! Was it an implementation of Lien and Amato's ACD or another method?
>
> Is it possible to get a copy of the source? When is the next CGAL release
> planned?
>
> - David
>
- Convex Decomposition of Polyhedron inside CGAL or elsewhere?, Maik Schulze, 04/01/2008
- RE: [cgal-discuss] Convex Decomposition of Polyhedron inside CGAL or elsewhere?, David Lariviere, 04/01/2008
- Re: [cgal-discuss] Convex Decomposition of Polyhedron inside CGAL or elsewhere?, Maik Schulze, 04/04/2008
- Re: [cgal-discuss] Convex Decomposition of Polyhedron inside CGAL or elsewhere?, Peter Hachenberger, 04/02/2008
- RE: [cgal-discuss] Convex Decomposition of Polyhedron inside CGALor elsewhere?, David Lariviere, 04/02/2008
- RE: [cgal-discuss] Convex Decomposition of Polyhedron inside CGALor elsewhere?, Peter Hachenberger, 04/02/2008
- RE: [cgal-discuss] Convex Decomposition of Polyhedron inside CGALor elsewhere?, David Lariviere, 04/02/2008
- RE: [cgal-discuss] Convex Decomposition of Polyhedron inside CGAL or elsewhere?, David Lariviere, 04/01/2008
Archive powered by MHonArc 2.6.16.