Subject: CGAL users discussion list
List archive
- From: Olivier Devillers <>
- To:
- Subject: Re: [cgal-discuss] Delaunay, convex hull, Voronoi, kernels
- Date: Fri, 21 Nov 2008 11:56:07 +0100
a écrit :
In other words, I don't know how to order an unordered set of voronoi cell vertices so that when they are connected the edges between them do not cross.
all information needed is in the triangulation
on the sphere incidences between 2 Voronoi vertices
match
incidences between 3D cells having the infinite vertex
and so on
- [cgal-discuss] Delaunay, convex hull, Voronoi, kernels, pgoeleven, 11/19/2008
- Re: [cgal-discuss] Delaunay, convex hull, Voronoi, kernels, Olivier Devillers, 11/20/2008
- [cgal-discuss] Deleting halfedges from a polyhedron, Jens K. Becker, 11/20/2008
- RE: [cgal-discuss] Delaunay, convex hull, Voronoi, kernels, pgoeleven, 11/20/2008
- Re: [cgal-discuss] Delaunay, convex hull, Voronoi, kernels, Andreas Fabri, 11/20/2008
- RE: [cgal-discuss] Delaunay, convex hull, Voronoi, kernels, pgoeleven, 11/20/2008
- Re: [cgal-discuss] Delaunay, convex hull, Voronoi, kernels, Olivier Devillers, 11/21/2008
- Re: [cgal-discuss] Delaunay, convex hull, Voronoi, kernels, Andreas Fabri, 11/20/2008
- <Possible follow-up(s)>
- Re: [cgal-discuss] Delaunay, convex hull, Voronoi, kernels, songbai, 11/20/2008
- Re: [cgal-discuss] Delaunay, convex hull, Voronoi, kernels, Olivier Devillers, 11/20/2008
Archive powered by MHonArc 2.6.16.