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 perform Range Search on 3D points set with CGAL?

So I saw this nice 2D Range and Neighbor Search I alsow saw dD Range and Segment Trees yet I can not understand how to perform a 3D Range and Neighbor Search on a 3D point set. Generaly I want to query some points container for an array of points…
DuckQueen
  • 772
  • 10
  • 62
  • 134
0
votes
1 answer

CGAL::assign function

everyone. I am new to CGAL library. Here I am reading a CGAL demo. The code uses CGAL::assign function quite often, but I cann't find any reference to it. Anyone can point it out where I can see the how it is implemented? Thanks in advance!
liudaisuda
  • 125
  • 1
  • 8
0
votes
1 answer

How can I use a Boost Interprocess allocator with a CGAL Nef_polyhedron_3?

There are two types of 3D polys in CGAL, Polyhedron, and Nef_polyhedron. The former allows one to specify an allocator as its fourth…
Marcos Scriven
  • 581
  • 1
  • 5
  • 15
0
votes
1 answer

Mapping of 3d point to face of Platonic (Archimedian) Solid

I want to compute the resulting surface mesh of platonic (or maybe archimedian) solids applied with a displacement map for each face. The mesh should show fine details of the displacement map and be watertight and manifold (for 3d printing). For…
Sebastian Baltes
  • 512
  • 5
  • 14
0
votes
0 answers

How to load complex array of triangles into CGAL's Nef Polyhedra to do 3D Boolean Operations on it?

So I have an array of vertexes + triangles (not one solid enclosed body; multiple triangles some unified some, not alike N islands/planes). I want to treat all these vertexes + triangles as one Nef Polyhedra and perform boolean operations on them.…
Rella
  • 65,003
  • 109
  • 363
  • 636
0
votes
1 answer

Delaunay triangulation: vertex storing Point_handle instead of Point

I am storing points in a custom container and I would like to build the Delaunay triangulation on a subset of these points. As the points already exist in the container I don't want the Delaunay triangulation to store copies of these points. My…
Kamouth
  • 134
  • 2
  • 9
0
votes
1 answer

Deriving from a CGAL class compatible with CGAL::assign

I want to derive from the CGAL::Parabola_segment_2 class. Because I would like to access two protected data members which can not be accessible through public member functions. typedef CGAL::Exact_predicates_exact_constructions_kernel…
Murat Yirci
  • 91
  • 2
0
votes
1 answer

Remesh method in CGAL

I have a low-quality mesh, I want to remesh it but keeping the topology(only adjust the vertex position, keep vertex size, face unchanged). Is there an exist method could do this in CGAL?
areslp
  • 383
  • 1
  • 4
  • 17
0
votes
1 answer

How to use cgal triangulation_3 locate?

Hi i'm using a Delaunay_triangulation_2 and Delaunay_triangulation_3 for finding points for interpolation. I found how to use locate for Delaunay_triangulation_2: Locate_type loc; int li; CgalPoint point(_params[0], _params[1]); Face_handle handle =…
Dorian
  • 377
  • 5
  • 18
0
votes
1 answer

Troubles with the CGAL library Vertex_visibility_graph_2.h

I'm having troubles with the CGAL library Vertex_visibility_graph_2.h, for visibility graphs. The code I'm trying is like the following: typedef CGAL::Cartesian Kernel; typedef CGAL::Arr_segment_traits_2 Traits_2; …
Mauricio Zambon
  • 695
  • 2
  • 9
  • 17
-1
votes
1 answer

CGAL: How to use CGAL::Polygon_mesh_processing::area()? C++

I am trying to estimate the area of a segmented leaf. I already triangulated the leaf using advancing front surface reconstruction. Currently, I am having a hard time understanding the CGAL documentation of area() function. The result of the…
zerotwo
  • 21
  • 4
-1
votes
1 answer

Are unreadable error messages form CGAL or cppyy?

I have trying to wrap a small part of CGAL (Computational Geometry Algorithms Library) using cppyy. I get completely unreadable error messages. Are these messages just being passed through from CGAL? Here is one of the messages. I have chopped…
Edward C. Jones
  • 25
  • 2
-1
votes
1 answer

Write a skeleton to PLY

I had some code that wrote skeletons to ply using tinyPLY. Recently, CGAL has added IO for several formats, including PLY. Out of curiosity, I thought I would use the built-in methods and try and remove tinyPly. I need to write both surface_mesh…
Dan Bumbarger
  • 9
  • 2
-1
votes
1 answer

Given points, calculate normals and perform polygonal surface reconstruction in CGAL

I have .xyz files and I want to recreate the surface using 'polygonal surface reconstruction' in CGAL. Normals are needed to reconstruct the surface, so I want to first calculate these in CGAL and then use the points and their normals as input for…
Barbara
  • 1
-1
votes
1 answer

Finding neighbour vertices of a mesh inside a given radius

How to get neighbour vertices of a mesh inside a given radius using, e.g., CGAL? A simple K-nearest search on vertices neglecting face and edge properties is not sufficient, because if meshes are close to each other, vertices of both will be found…
kenomo
  • 59
  • 6
1 2 3
…
86 87