Stack Overflow
Stack Overflow

Questions tagged [cgal]

The Computational Geometry Algorithms Library (CGAL) is a software library that aims to provide easy access to efficient and reliable algorithms in computational geometry.

The goal of the CGAL Open Source Project is to provide easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, robotics and motion planning, mesh generation, numerical methods...

The CGAL library is primarily written in , but bindings using are provided by the CGAL bindings project (for example and bindings).

1299 questions
138
votes
9 answers

Visual C++: How to disable specific linker warnings?

I'm using a library from CGAL which during the linking stage of my code compilation produces a lot of linking warnings of this form: warning LNK4099: PDB 'vc80.pdb' was not found with 'gmp-vc80-mt-sgd.lib' or at 'vc80.pdb'; linking object as if no…
Ashwin Nanjappa
  • 76,204
  • 83
  • 211
  • 292
41
votes
2 answers

Compiling a static executable with CMake

for a project I need to create an executable that includes all the libraries that I used (opencv, cgal) in order to execute it on a computer that has not those libraries. Currently, this is my CMakeLists.txt (I use…
Andrea
  • 1,597
  • 3
  • 18
  • 24
34
votes
5 answers

CMake is not finding Boost

I am trying to install CGAL. They describe their installation process as ever-so-simple here, section 6.1. When I run cmake-gui and then click configure, I get the following output: CMake Error at D:/program files/CMake…
olamundo
  • 23,991
  • 34
  • 108
  • 149
32
votes
9 answers

Polygon Triangulation with Holes

I am looking for an algorithm or library (better) to break down a polygon into triangles. I will be using these triangles in a Direct3D application. What are the best available options? Here is what I have found so far: Ben Discoe's notes FIST:…
Agnel Kurian
  • 57,975
  • 43
  • 146
  • 217
22
votes
3 answers

Lightweight Delaunay trianguation library (for c++)

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 fairly simple and straightforward out there. Things I would…
Andrew Prock
  • 6,900
  • 6
  • 40
  • 60
19
votes
3 answers

Qt4 + CGAL - Parse error at "BOOST_JOIN"

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_TT_HAS_OPERATOR_HPP_INCLUDEDand…
Mauricio Zambon
  • 695
  • 2
  • 9
  • 17
18
votes
5 answers

What's a good library to do computational geometry (like CGAL) in a garbage-collected language?

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 sort of project I would hesitate to make without…
Squash Monster
  • 191
  • 1
  • 1
  • 5
15
votes
5 answers

How do I iterate over faces in CGAL

I am trying to use CGAL to do some Delaunay triangulation. I used one of the CGAL samples to compute a triangulation which includes a height field attribute. The problem I have having is that I have no idea how to get the resulting triangulation. …
Adam Tegen
  • 25,378
  • 33
  • 125
  • 153
14
votes
5 answers

CGAL for .Net ( or C#)

I am not sure whether there is a .Net version of CGAL? The last time I check there is only one CGAL equivalent in garbage-collected language. If would be tremendously helpful if we have CGAL.net. P/S: I know I can use interop, but still, a full…
Graviton
  • 81,782
  • 146
  • 424
  • 602
13
votes
3 answers

Points, Lines, and Polygons on Spheres with C/C++

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 radians (just like geographic coordinates). A line segment…
user327684
  • 163
  • 2
  • 6
13
votes
5 answers

Why are KD-trees so damn slow for nearest neighbor search in point sets?

I am using CGAL's (the latest) KD-tree implementation for searching nearest neighbors in point sets. And also Wikipedia and other resources seem to suggest that KD-trees are the way to go. But somehow they are too slow and Wiki also suggests their…
thesaint
  • 1,253
  • 1
  • 12
  • 22
11
votes
2 answers

Visual Studio/C++: How to turn off certain first-chance exception debug messages?

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 am aware of what a first-chance exception is. Now,…
Ashwin Nanjappa
  • 76,204
  • 83
  • 211
  • 292
11
votes
2 answers

CGAL connecting 2 geometries

Currently I try to join different parts of the Mesh, which are not connected. From the example I found this ( blobby_3cc.off ). With the keep_large_connected_components and the keep_largest_connected_components I remove all the smaller components.…
Niels
  • 48,601
  • 4
  • 62
  • 81
11
votes
1 answer

Getting a vertex_handle from an edge_iterator

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 one of you guys could help me out with this…
cdecker
  • 4,515
  • 8
  • 46
  • 75
11
votes
2 answers

Geodesic computation on triangle meshes?

I am trying to find the distance between two points on a triangulated surface (geodesic distance). It looks like a basic operation and is not trivial. So I am wondering if there are any libraries that do this? My google fo failed, so I would greatly…
jason
  • 3,471
  • 6
  • 30
  • 43
1
2 3
…
86 87