CGAL users discussion list

["Serge Rehbinder" <>]

Hi,

I'm reading this paper and I have a question . When Mr Karavelas is describing the algorithm, he talks about DFS, I don't know what this means. 
"In the former case though, i.e., when one of the endpoints of e is in conflict with p, we need to find the rest of the conflict region. This 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 ?

Regards,
Serge.

2008/4/8, Andreas Fabri <>:

Serge Rehbinder wrote:

Hello,

I would like to know if there is somewhere the description of the algorithm used to compute Voronoï diagrams of segments.
thanks for help,

Regards,
Serge

[Kar04]         Menelaos I. Karavelas. A robust and efficient implementation for the segment Voronoi diagram. In Proc. Internat. Symp. on Voronoi diagrams in Science and Engineering (VD2004), pages 51-62, 2004.
--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss