Subject: CGAL users discussion list
List archive
- From: "Fei (Sophie) Che" <>
- To:
- Subject: Re: [cgal-discuss] Nearest Neighbor Search
- Date: Thu, 20 May 2010 10:13:10 -0400
Actually, CGAL does have 3D voronoi by calling dual() from a 3D delaunay triangulation... You may want to use the point location in delaunay and here is its running time analysis: Best, ~Sophie On May 20, 2010, at 1:23 AM, Panagiotis Foteinos wrote: It gives you the nearest neighbor of a point in almost constant time. Like the (dual) Voronoi diagram. 3D Voronoi is not implemented in CGAL though. |
- [cgal-discuss] Nearest Neighbor Search, Panagiotis Foteinos, 05/19/2010
- Re: [cgal-discuss] Nearest Neighbor Search, Sophie Che, 05/19/2010
- Re: [cgal-discuss] Nearest Neighbor Search, 杨成林, 05/19/2010
- Re: [cgal-discuss] Nearest Neighbor Search, Panagiotis Foteinos, 05/19/2010
- Re: [cgal-discuss] Nearest Neighbor Search, 杨成林, 05/20/2010
- Re: [cgal-discuss] Nearest Neighbor Search, Panagiotis Foteinos, 05/20/2010
- Re: [cgal-discuss] Nearest Neighbor Search, Fei (Sophie) Che, 05/20/2010
- Re: [cgal-discuss] Nearest Neighbor Search, Panagiotis Foteinos, 05/20/2010
- Re: [cgal-discuss] Nearest Neighbor Search, 杨成林, 05/20/2010
- Re: [cgal-discuss] Nearest Neighbor Search, Panagiotis Foteinos, 05/19/2010
Archive powered by MHonArc 2.6.16.