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

Subject: CGAL users discussion list

List archive

[cgal-discuss] Delaunay v/s Voronoi

From: "Chaman Singh Verma" <>
To:
Subject: [cgal-discuss] Delaunay v/s Voronoi
Date: Fri, 3 Oct 2008 18:19:26 +0530
Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:mime-version:content-type; b=XfmdK+RvHqm/GthSpsdREGCuF4D3yC7jbOK3h06XsmjLGQ5XPfE6zfTk4/2q89wxZt mh/JIlXqQNit+ia6K5UwfWAQDxJJlHMwHhs1X28QB1frVvSwU5COR1WdnJV2qUVZqPIT TDnnKC1Zaz9FsKl69DfJeAO/yedJxezVFlIX0=

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

[cgal-discuss] Delaunay v/s Voronoi, Chaman Singh Verma, 10/03/2008
- Re: [cgal-discuss] Delaunay v/s Voronoi, Olivier Devillers, 10/03/2008
  - Re: [cgal-discuss] Delaunay v/s Voronoi, Chaman Singh Verma, 10/03/2008
    - Re: [cgal-discuss] Delaunay v/s Voronoi, Sylvain Pion, 10/03/2008
    - Re: [cgal-discuss] Delaunay v/s Voronoi, Monique Teillaud, 10/06/2008
- Re: [cgal-discuss] Delaunay v/s Voronoi, Steve Chan, 10/03/2008
- <Possible follow-up(s)>
- Re: [cgal-discuss] Delaunay v/s Voronoi, daniel . duque, 10/03/2008
  - Re: [cgal-discuss] Delaunay v/s Voronoi, Laurent Rineau, 10/03/2008
    - Re: [cgal-discuss] Delaunay v/s Voronoi, Chaman Singh Verma, 10/03/2008
      - Re: [cgal-discuss] Delaunay v/s Voronoi, Daniel Duque Campayo, 10/06/2008
        
        Re: [cgal-discuss] Delaunay v/s Voronoi, Monique Teillaud, 10/06/2008

List archive

[cgal-discuss] Delaunay v/s Voronoi