tags:

views:

9

answers:

0
Q: 

How to construct an arrangement with the duality transform of a point set in CGAL?

I can only find the suitable traits with line segments(Arr_segment_traits_2), but the duality of point is a line, do I have to compute the intersection of lines in the dual plane by myself? Is there exists an approach to directly construct arrangement with the dual of a point set?

related questions

CGAL Newbie Question: Which segments intersect?
How to compute a point on a line in CGAL
cgal python exception
CGAL half-edge data structure
creating and intersecting hexahedrons with CGAL
Customizing CGAL Kernel with my own Point class
CGAL 3.4: How do I get end vertex co-ordinates from a Finite_edges_iterator?
Do I really need cmake to create CGAL/compiler_config.h?
Representing planar graphs / GIS topology: ArcObjects vs. CGAL arrangements
How do I iterate over faces in CGAL
c++: CGAL 2D delauny triangulation: Concave Shapes
CGAL for .Net ( or C#)
What's a good library to do computational geometry (like CGAL) in a garbage-collected language?
Lightweight Delaunay trianguation library (for c++)
CGAL: erroneous Delaunay result?
CGAL inheritance
CGAL: Transformation Matrix for Rotation given two lines/vectors/directions
Visual C++: How to disable specific linker warnings?
Visual Studio/C++: How to turn off certain first-chance exception debug messages?
Polygon Triangulation with Holes
What happened to the python bindings for CGAL?
Visual C++ App crashes before main in Release, but runs fine in Debug