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
0
votes
1 answer

CGAL + Polygon_set Join fail

I am trying to compile an example from the book CGAL Arrangements and Their Applications: A Step-by-Step Guide By Efi Fogel, Dan Halperin, Ron Wein. The example can be seen at this link:…
Nick
  • 862
  • 12
  • 35
0
votes
1 answer

CGAL on Windows: Problems with Boost and cmake

I've been trying to build CGAL using cmake-gui for quite a while now but I keep getting the same error. In CmakeError.log I get entries of the sort: fatal error C1083: Datei (Include) kann nicht ge”ffnet werden: "boost/variant.hpp": No such file or…
dineri
  • 21
  • 3
0
votes
1 answer

CGAL Combinatorial map and Geomview

For some reason Combinatorial_map objects cause segmentation fault after being called. For instance (from CGAL examples): #include #include #include #include…
user1513100
  • 191
  • 1
  • 2
  • 12
0
votes
1 answer

CGAL: Modify an extended DCEL fetched from a locate call

I have an Arrangement_2 class, instantiated with a custom Arr_face_extended_dcel to map some data to each cell. I'd like to find some cells with a locate invocation and change their associated data, but unfortunately locate returns an iterator to…
akappa
  • 10,220
  • 3
  • 39
  • 56
0
votes
3 answers

Get 2d alpha shape boundary vertices from set of points

I haven't used CGAL before, and all I want is a function that takes a 2d set of points and alpha parameter, and returns a vector of points that represents the bounding polygon. I can make an alpha shape object, but I don't know how to get a vector…
Flowers
  • 191
  • 1
  • 9
0
votes
1 answer

Boost error with CGAL SDF algorithm

I'm currently trying to use the SDF algorithm of CGAL but I have some boost errors and I don't know where it's from. I followed the example code from CGAL doc Here's the part of my code : #include…
CornFlex
  • 1
  • 3
0
votes
1 answer

Creating General_polygon_2 from a Polyline

Since CGAL 4.3, Arr_polyline_traits_2 has the ability to reverse the direction of X_monotone_curves. Does this mean I can break up a Polyline into X_montone_curves to generate a General_Polygon_2? In the book CGAL Arragements and their…
Peter Sadrozinski
  • 3
  • 2
0
votes
1 answer

CGAL 2D delaunay triangulation with mixed boundary conditions

I am new to CGAL, so I do not know where to start. I want CGAL to calculate a delaunay triangulation of a set of points in 2D. My problem is that there is a class for nonperiodic systems and another one for periodic systems (sorry, can not post more…
Lukas Engelke
  • 164
  • 7
0
votes
1 answer

Is polygon operation in CGAL working with polygon that has duplicated edge?

I have a polygon as such: {0}, {1}, {2}, {3},... denote the sequence of the points on the polygon. I wonder whether CGAL polygon boolean set-operations work with polygon as such? From the user manual, the input polygon must be simple or…
Graviton
  • 81,782
  • 146
  • 424
  • 602
0
votes
1 answer

Building Visual C++ Applications with CGAL Library

I need to use delaunay traingulation (3D) method to be integrated in a Visual C++ project I am working with. I followed the CGAL installation guide and was able to build it using cmake and so, however can someone please explain me in detail: How…
Gihan Samarasinghe
  • 73
  • 1
  • 6
0
votes
1 answer

CGAL Polyhedron_3 flip_edge function breaks surface

I am using a Polyhedron_3 as a surface. I distort the surface and to ensure quality I want to flip edges to avoid bad triangles. So far my code looks like : std::vector > vEdgeToFlip; for…
Cyril
  • 559
  • 5
  • 17
0
votes
1 answer

Updating CGAL program to use AABB_face_graph_triangle_primitive

I have a C++ program that uses the CGAL 4.5.2_0 library, installed using macports. Recently, I have been getting compile-time warnings that the CGAL/AABB_polyhedron_triangle_primitive.h header is deprecated and that I now should start using…
Jeff Bullard
  • 345
  • 1
  • 4
  • 14
0
votes
2 answers

Get all points with integer coordinates inside the convex hull of a CGAL triangulation

Given a CGAL triangulation, I would like to find all points with integer coordinates inside its convex hull. I know we can iterate through all integer points and find their locations by locate(). But that would not be efficient. Is there a way we…
Rapidturtle
  • 217
  • 1
  • 3
  • 13
0
votes
2 answers

make[2]: *** No rule to make target `/usr/lib/i386-linux-gnu/libmpfr.so' in CGAL

I am using CGAL and I have this minimal example (which should be fine since it's an example): #include #include #include #include typedef CGAL::Cartesian_d Kd; typedef…
gsamaras
  • 71,951
  • 46
  • 188
  • 305
0
votes
1 answer

cgal: Surface simplification of 3d triangulated mesh

I would like to use the surface simplification algorithm of CGAL with C3t3 (Mesh_complex_3_in_triangulation_3) object. I have the C3t3 object, how do I use this function with this kind of object. The only examples I found were using Polyhedron…
squall
  • 13
  • 3
1 2 3
…
86 87