cgal/Segment_Delaunay_graph_2/description.txt

5 lines
211 B
Plaintext

This package computes the Delaunay graph for a set of segments on the
plane, i.e., the triangulated dual of the Voronoi diagram for the
set of segments. The segments are allowed to intersect at interior
points.