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

How to linearly subdivide a 2D quad mesh?

How can I linearly subdivide a 2D quad mesh ?? It involves simple division of 1 quad face into 4 quad faces. I cannot find such implementation in cgal , openMesh.
Rishabh
  • 25
  • 1
  • 6
0
votes
2 answers

Access all tetrahedrons incident on a vertex

I would like to know that how can we access all tetrahedrons incident on a vertex in a CGAL 3D triangulation? I have seen cell() function for vertex, but it seems to allow access to one(arbitrarily selected?) tetrahedron only.
Pranav
  • 475
  • 4
  • 25
0
votes
0 answers

CGAL: check if the insertion of a given point on existing CDT affects natural neighbor interpolation inside a rectangle

I'll describe the whole scenario to avoid asking for how to implement what i think is the solution rather than asking what actually could be a solution to my problem. I have to generate a raster from sparse points and constraints doing natural…
Marco Di Benedetto
  • 75
  • 6
0
votes
0 answers

[reconstuction of surface]how can I calculate the area of a point set?

I have met an issue, I would like retrieve the object area from point cloud data, (x y z) format. The problem is the object is an 'open' surface. ( a twisted paper for example ) I used convex hull 3 to calculate the outlier facets area, then…
Shengye Jin
  • 35
  • 1
  • 6
0
votes
1 answer

CGAL - Polyhedron dijkstra shortest path

I found that for BGL computations on CGAL::Polyhedron_3 the squared distance is used for edge weigths, which is defined in: CGAL/boost/graph/properties_Polyhedron_3.h This produces wrong results on polyhedral…
tm.tu
  • 1
0
votes
1 answer

Printing arrangements_2 in CGAL vertex-wise

So I have a disparate number of line segments which I want to combine to form a polygon. So imagine 4 points p0,p1,p2,p3 which form a open polygon p0-p1-p2-p3. (This is illustrative : the polygon could be closed also) But my algorithm generates the…
rajaditya_m
  • 289
  • 1
  • 4
  • 14
0
votes
1 answer

CGAL - Mesh Collision - How to avoid Adjacent Triangles

This is a follow-up of a previous question of mine that was resolved. I'm trying to develop a mesh collision method in order to penalize inter-penetrations. For this reason I started working with CGAL, and I have a working first attempt by closely…
dim_tz
  • 1,451
  • 5
  • 20
  • 37
0
votes
2 answers

How to obtain border edges (CGAL) after deleting some faces?

I have a Cdt from constrained delaunay triangulation. I need to obtain border edges which should be trivial: edges which have one face only but I don't know how to obtain these in CGAL: for(Cdt::Finite_edges_iterator eit = cdt.finite_edges_begin();…
azer89
  • 1,529
  • 1
  • 15
  • 29
0
votes
1 answer

CGAL 4.4/4.3 cygCGAL_Core-10.dll does not work

I am a fresh. I try to use CGAL under Cygwin. CGAL seems to be installed successfully, but cannot compile any example, when i try to 'cmake .' (succeeded) -> 'make' (failed) they throw me following bomb, make Scanning dependencies of target…
Shengye Jin
  • 35
  • 1
  • 6
0
votes
1 answer

how to convert planar mesh to arrangement in CGAL

I need to convert 2d planar polygonal meshes to 2D Arrangements in CGAL. for example if I have the following mesh in Wavefront obj format: v -5.687006 -4.782805 0.000000 v 4.878987 -4.782805 0.000000 v -5.687006 4.782805 0.000000 v 4.878987…
DontCareBear
  • 825
  • 2
  • 11
  • 25
0
votes
1 answer

Error when add constraint in 2D Triangulation

I have some 2D constrained triangulation. When I add a constraint error occurs. This is my simple example for using it: #include "stdafx.h" #include #include…
devcrio
  • 1
  • 1
0
votes
1 answer

Print CGAL arrangement with Qt

I am using a CGAL Arrangement. Here is my Arrangement_2 type: typedef CGAL::CORE_algebraic_number_traits Nt_traits; typedef Nt_traits::Rational Rational; typedef Nt_traits::Algebraic …
user3320603
  • 3
  • 1
0
votes
1 answer

Error inserting a vertex in a 2D Delaunay triangulation

I would like to add N random vertex to a 2D Delaunay triangulation. My code is: template class DT : public CGAL::Delaunay_triangulation_2 { public: typedef typename Kernel::FT FT; typedef typename…
lucasn
  • 137
  • 2
  • 7
0
votes
1 answer

compiling CGAL 4.3 on Windows 7

I have Windows 7 64 bit Visual Studio 10 32 bit QT 4.84 Boost 1.55 CMake 2.8.8 CGAL 4.3 I did Downloaded and built everyting before building CGAL 4.3 itself. Run Cmake as administrator to avoid possible permissione issues. I get "Impossible to…
Tigran
  • 61,654
  • 8
  • 86
  • 123
0
votes
0 answers

CGAL - Extracting 2D contours form a sequence of segments

I am looking for some way how I could use CGAL to extract a 2D silhouette from a 2D graph. The 2D graph can have cycles and therefore holes. Just imagine something like a stick figure. The Input information would be pairs of points (defining…
HesselKRaymond
  • 39
  • 5
1 2 3
…
86 87