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: How can I successfully compile and link CGAL examples (on Mac OS X 10.9 Mavericks)

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, I am receiving errors as shown below. Specifically,…
Chris
  • 3,245
  • 4
  • 29
  • 53
0
votes
1 answer

Trying to set --std=c++0x or -std=gnu++0x via CGAL_CXX_FLAGS ignores values

I am trying to compile some code that will use CGAL but uses an include file that produces an error. The error says to compile with with either -std=c++0x or -std=gnu++0x. If I add either -std=c++0x or -std=gnu++0x to CGAL_CXX_FLAGS i,e cmake…
0
votes
3 answers

Compliing C++ CGAL Module that is callable from Python

I am trying to compile some C++ code that is to be called from Python and then calls CGAL. I need to be able to specify some flags on compilation, but not sure how to do this as the build process is ./CGAL-4.2/scripts/cgal_create_CMakeLists -s…
0
votes
1 answer

How to get vertices of a triangle in constraint delaunay triangulation?

I have written a program using cgal as follows: typedef CGAL::Exact_predicates_inexact_constructions_kernel K; typedef CGAL::Triangulation_vertex_base_2 Vb; typedef…
Mehdi bayat
  • 199
  • 2
  • 13
0
votes
1 answer

CGAL:: Is there a fast way to produce the intersection of two polyhedra?

For the simulation of moving obstacles in a fluid I need to calculate the intersecting volume of a parallelepiped and a cube as well as arbitrary polyhedron and a cube. I am using Nef_polyhedron of the CGAL library. Since I have to do around…
0
votes
2 answers

how can i do delaunay triangulation of simple polygon and find it's neighbors for any triangles in cgal

how can i do using CGAl, Delaunay triangulation of polygon (simple without hole and in cw order) and get a list of the neighbors of triangles for any triangle that generated from the Delaunay triangulation?
Mehdi bayat
  • 199
  • 2
  • 13
0
votes
1 answer

What's the correct academic reference for CGAL's Min_sphere_of_sphere algorithm?

I'm using CGAL's class Min_sphere_of_spheres_d<> and would like to provide the appropriate academic reference describing the algorithm implemented. However, the documentation…
Walter
  • 44,150
  • 20
  • 113
  • 196
0
votes
1 answer

CGAL: remove faces from a constrained Delaunay triangulation

I have a constrained Delaunay Triangulation and i want to create w hole in a shape of a polygon. a hole in which there are no faces. How can i do that using CGAL ?
0
votes
0 answers

CGAL::Delaunay_d C++ on UCI Seeds dataset: segmentation fault

For my PhD work, I need to construct the Delaunay triangulation of a given point set in any (low) dimension. So far, I have been using the C++ CGAL library with data up to 4D without any noticeable problem. However, as I used the same class…
Octavio
  • 33
  • 4
0
votes
1 answer

How to render CGAL objects in OpenGL properly?

I am quite new to CGAL as well as OpenGL. I know that CGAL provides a Qt interface to display objects but I want to use only OpenGL and I am able to render polyhedrons and nef polyhedrons in openGL(I referred to polyhedron demo). Question is, how to…
sandeep p
  • 121
  • 1
  • 12
0
votes
3 answers

CGAL-implementation of the intersection of two cubic (planar) Bezier/Splines offsets

CGAL's manual suggests that there is no such implementation, if you know anything more let me know N
Nikolaos Giotis
  • 281
  • 2
  • 23
0
votes
2 answers

Modifying functor variable when using incremental spatial searching with cgal

I've modified an example given by the computational geometry cgal library (link) that demonstrates incremental searching on a 2D plane (Section 49.3.2). The example uses a functor to set spatial bounds for searching only positive points on the…
Nicholas Kinar
  • 1,440
  • 5
  • 24
  • 36
0
votes
0 answers

Why are compound assignment operators missing for kernel object?

With CGAL kernel objects, I can do Vector + Vector, but not Vector += Vector. Same for Point + Vector, but not Point += Vector, etc. Is there any good reason for that, or are they just missing ? The CGAL kernel and some algorithms require the…
Sylvain Pion
  • 575
  • 1
  • 4
  • 11
0
votes
2 answers

Outlier in the Alpha_Shapes_2 CGAL demo

I started using CGAL for a project, and I wanted to test alpha shapes with the alpha shapes 2 demo, furnished with CGAL. My input file has been correctly formatted (cf http://pastelink.me/dl/c83d1b warning 22087 lines), but I still have an outlier…
Cyril
  • 559
  • 5
  • 17
0
votes
2 answers

Secure usage of Cell_handle in a CGAL Delaunay triangulation after point insertion

I'm planning to write an algorithm that will use CGAL Delaunay triangulation data structure. Basically I need to insert some point into the triangulation, save reference to some cells, and then make some other insertion. I'm wondering how can I…
Nicola Pezzotti
  • 2,317
  • 1
  • 16
  • 26