I am using Point Cloud Library (PCL) based C++ implementation of kd-tree nearest neighbour(NN) searching. The data set contains about 2.2 million points. I am searching NN points for every other po...

I'm getting the error Parse error at "BOOST_JOIN" while trying to compile a code with Qt4 and CGAL. I'm not using Boost directly and I've already searched and tried a bunch of options like -DBOOST_...

I'm trying to make delaunay triangulation of point set, find nearest point to input point, and get it's incident vertices, but somehow following code doesn't work. #include <CGAL/Exact_predicat...

I'm hoping to make use of CGAL in an iOS / iPad app. I'm a reasonably experienced iOS developer, but I haven't ever tried including a C++ library such as this one, and I haven't actually used CGAL ...

I need a library to handle computational geometry in a project, especially boolean operations, but just about every feature is useful. The best library I can find for this is CGAL, but this is the ...

I am computing the 2D delaunay triangulation of a few thousand points. Each point has more data associated with it beyond x and y coordinates. Therefore, I was wondering if it is possible to retrie...

I found the CGAL examples not to compile under Mac OS X 10.9 (Mavericks). You can compile the main CGAL 4.3 library successfully and also link with it, but when using certain types of the library, ...

Can anyone recommend a good set of CGAL tutorials for beginners? I have tried to read the documentation but it seems very dense to me even as a moderately experienced C++ programmer. Therefor...

I'd like to play around with some (2D) Delaunay triangulations, and am looking for a reasonably small library to work with. I'm aware of CGAL, but I was wondering if there was something fairl...

I have a set of 2D points each with an associated id. (e.g. if the points are stored in an array, the id is the index into each point 0,....,n-1 ). Now I create a Delaunay triangulation of these p...

When I tried to compile Voronoi_Diagram_2 example I am getting this output: singhg@~/Programming/examples/Voronoi_diagram_2 $ cmake -DCGAL_DIR=/opt/local/lib/cmake/ CMake Error at CMakeLists.txt:2...

I have a set of polygons and I want to test intersection between it and a segment. I checked the manual but I cannot find a matching function. The intersection between points, lines, segments, tria...

I'm having quite some difficulty getting a vertex_handle for each of the end points of an edge in a Delaunay triangulation. Since I hammered my head against this for several hours I thought maybe o...

Given a 3D line in CGAL, how do I compute a point on that line that is some known distance from an endpoint?

My application is to represent shapes on the Earth's (using a sphere is sufficient) surface. Those can be points, lines, and polygons. Coordinates should be defined by using degrees or radian...

When I execute my C++ code (which uses the CGAL library) under debug mode, I see a lot of debug messages in the Output window about a first-chance exception CGAL::Uncertain_conversion_exception. I ...