Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Delaunay v/s Voronoi

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Delaunay v/s Voronoi


Chronological Thread 
  • From: "Steve Chan" <>
  • To: <>
  • Subject: Re: [cgal-discuss] Delaunay v/s Voronoi
  • Date: Fri, 3 Oct 2008 06:13:21 -0700

It all depends on what problem you are solving. For motion planning or obstacle avoidance, I use Delaunay.
Regards
 
Steve
----- Original Message -----
From:
To:
Sent: Friday, October 03, 2008 5:49 AM
Subject: [cgal-discuss] Delaunay v/s Voronoi

Hello,

I have one fundamental doubt. Delaunay triangulation and Voronoi Diagrams are dual to each other. From
implementation point of view, which one has less complexity ?  Almost all the books in Computational
Geometry describe both the algorithms but I couldn't find the comparison between two approaches.
Can someone clarify ?


Chaman Singh Verma
Poona, India




Archive powered by MHonArc 2.6.16.

Top of Page