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

Surface area of a convex hull in 3D

Trying to calculate the surface area of a convex hull in 3D, using CGAL. I have looked at the user manual (http://doc.cgal.org/latest/Convex_hull_3/index.html#Chapter_3D_Convex_Hulls) and have not found any material covering this. I have tried to…
xksh
  • 3
  • 3
0
votes
1 answer

CGAL Arrangement: faces in curves

Using the 2D Arrangements package from CGAL, is it possible to quickly identify which faces are internal to a given closed curve, after aggregately inserting a large number of closed, possibly intersecting curves?
user2425792
0
votes
1 answer

Definition of singly-connected set

please - help - what does mean singly-connected set? this is set without holes and which has one bounded contour? the sample http://doc.cgal.org/latest/Straight_skeleton_2/index.html#Chapter_2D_Straight_Skeleton_and_Polygon_Offsetting means that…
user3706947
  • 45
  • 5
0
votes
1 answer

Compiling triangulation_2 demo on CGAL

Im just installed CGAL on Windows 8 for Visual Studio 2010 following this tutorial http://www.cgal.org/windows_installation.html#PrerequisitesforCompilingthe32-bitCGALLibraryusingMicrosoftVisualStudio2010. When im trying to compile a demo with…
Roger PA
  • 17
  • 1
  • 3
0
votes
1 answer

CGAL: Access to Results of find_conflicts()

So I am very confused about the find_conflicts function in CGAL. I thought I knew std::pair, and I thought I knew what was going on in find_conflicts(), but for the life of me, I am not sure how to access the results. I thought that the iterator…
kdottiemo
  • 79
  • 1
  • 8
0
votes
1 answer

CGAL Using Locate() to Find Cell on Triangulation Surface

Using CGAL, I have a 3D Delaunay Triangulation of a set of random points on the unit sphere, that I obtained via: Delaunay T(points.begin(), points.end()); Now, what I would like to be able to do is query T (using locate() or something like that) to…
kdottiemo
  • 79
  • 1
  • 8
0
votes
2 answers

CGAL 3D Delaunay Triangulation - First Vertex is Origin?

I am performing a 3D Delaunay Triangulation of points sampled from a sphere, and I am looking at the vertices of the resultant triangulation essentially by doing this: for(Delaunay_Vertex_iter p = T.vertices_begin(); p != T.vertices_end();…
kdottiemo
  • 79
  • 1
  • 8
0
votes
0 answers

CGAL 2D Deluanay triangulations

I have the same query as this SO question. I am using CGAL in Ubuntu. I am trying to execute the same code as follows. #include #include #include…
aghost
  • 235
  • 2
  • 12
0
votes
1 answer

Algorithm to compute set of bins bounded by a discrete contour

On a discrete grid-based plane (think: pixels of an image), I have a closed contour that can be expressed either by: a set of 2D points (x1,y1);(x2,y2);(x3,y3);... or a 4-connected Freeman code, with a starting point: (x1,y1) + 00001112... I know…
kebs
  • 6,387
  • 4
  • 41
  • 70
0
votes
1 answer

Loop the halfedge_handle around a vertex

I have a vertex_handle, and what I want to do is to get the halfedge_handles around the vertex,here is my attempt: HV_circulator hc = v -> vertex_begin(); do{ hc++; Polyhedron::Halfedge halfedge = *hc; HE_handle hh = &halfedge; …
tintin
  • 1,459
  • 1
  • 10
  • 27
0
votes
1 answer

Compiling a CGAL example program on Arch Linux with icpc

I want to compile an example program with CGAL 4.4 on Arch Linux with Intel Compiler. But, on compiling this code, I got the following error: $ icpc -o first_qp first_qp.cpp -lCGAL -I/usr/include/CGAL The error message is here (pastebin) What can I…
withforesight
  • 3
  • 2
0
votes
1 answer

How do I run the subdivision example in the CGAL user manual

Ok, so I finally installed CGAL and managed to run some of the examples. Now I need to run the code below, which I found in the CGAL SubDivision manual…
NickKost
  • 3
  • 3
0
votes
1 answer

Triangulating a polygon using CGAL::Constrained_Delaunay_triangulation_2

I am trying to triangulate a 2D polygon using CGAL`s Constrained Delaunay Triangulation. But the program is genarating this runtime error: ~ what(): CGAL ERROR: precondition violation! Expr: vaa != vbb File:…
user3666771
  • 11
  • 2
0
votes
1 answer

How to efficiently access vertex_handle from CGAL::Triangulation_3 for a vertex in a std::list?

I am working on an algorithm for mesh generation in which I need to maintain a collection of vertices,segments and triangles in a structure called Piecwise Linear Complex(PLC) and a Delaunay tetrahedralization(DT)(extension of Delaunay triangulation…
Pranav
  • 475
  • 4
  • 25
0
votes
0 answers

Using CGAL with parameterized meshes

I have a mesh (close to polygon soup) with texture coordinates. I'd like to use CGAL for various operaitons on this mesh; most specifically the Naf_polyhedron class. I can "thicken" each triangle to make sure it's manifold and acceptable as a Naf,…
Jon Watte
  • 6,579
  • 4
  • 53
  • 63
1 2 3
…
86 87