Subject: CGAL users discussion list
List archive
- From: Bernd Gaertner <>
- To:
- Subject: Re: [cgal-discuss] algorithm Voronoï segments
- Date: Tue, 15 Apr 2008 11:06:04 +0200
Serge Rehbinder wrote:
is done by performing a DFS on the Voronoï skeleton, until all Voronoï edges in conflict with p are found."
Does someone know what it is ?
Depth-first search, a well-known graph search technique.
Bernd.
- algorithm Voronoï segments, Serge Rehbinder, 04/08/2008
- Re: [cgal-discuss] algorithm Voronoï segments, Andreas Fabri, 04/08/2008
- Re: [cgal-discuss] algorithm Voronoï segments, Serge Rehbinder, 04/15/2008
- Re: [cgal-discuss] algorithm Voronoï segments, Bernd Gaertner, 04/15/2008
- Re: [cgal-discuss] algorithm Voronoï segments, Elias P. TSIGARIDAS, 04/15/2008
- Re: [cgal-discuss] algorithm Voronoï segments, Serge Rehbinder, 04/15/2008
- Re: [cgal-discuss] algorithm Voronoï segments, Andreas Fabri, 04/08/2008
Archive powered by MHonArc 2.6.16.