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
0 answers

Compiling CGAL programs on mac. What's wrong?

OS X El Capitan 10.11.2, CGAL library via macports (version 2.3.4). I have a file (/Users/Arseniy/Desktop/vec.cpp): #include #include typedef CGAL::Simple_cartesian Kernel; typedef Kernel::Point_2…
Arseniy Spiridonov
  • 337
  • 1
  • 2
  • 16
0
votes
2 answers

How to compile CGAL programs on Mac?

OS X El Capitan 10.11.2 Installed CGAL library via macports (version 2.3.4) I have a file (/Users/Arseniy/Desktop/vec.cpp): #include #include #include typedef…
Arseniy Spiridonov
  • 337
  • 1
  • 2
  • 16
0
votes
1 answer

CGAL Endpoint Vertices of 3D Polyhedron

Is there any way to get the two endpoint vertices of an edge from a 3D Polyhedron? I know I can iterate over halfedges, but I would rather iterate over every other halfedge because I only need the edge length along each side of a given facet.
kdottiemo
  • 79
  • 1
  • 8
0
votes
0 answers

cgal the demo Polyhedron, the debugger Crashes in qscopedpointer.h

I haven't make any change in this demo, and it works fine firstly. But after lunch, I ran it again, the debugger crashed, and I got an error(below), the debugger reached this line in qscopedpointer.h: inline T *data() const { return d; …
Daniel
  • 5
  • 2
0
votes
1 answer

Is CGAL compatible with the Clang compiler on OSX?

Ever since switching to std=c++11 mode (or gnu++11, which seems slightly more stable), CGAL has been exceptionally crash-prone for me on OSX (there might have been more changes made at the same time; it was very chaotic). We are building with Clang.…
Raven
  • 1,264
  • 1
  • 12
  • 22
0
votes
1 answer

when I load .off file in CGAL Polyhedron demo, nothing were showed in the window

enter image description here I have build the demo succesfully, and runs the demo, but when I try to load .off file, it comes out nothing. In the console window, the error message "…
Daniel
  • 5
  • 2
0
votes
1 answer

how to set criteria in cgal 3d mesh?

I am using C-Gal for 3d mesh generation from segmented images. However I don't understand exactly how the mesh criteria work and I setting them through trials. How I can optimize my choice? Thanks, Konstantinos.
0
votes
1 answer

Create parameterized 3D primitives with cgal

I'm using cgal to evaluate scientfic data (Polyhedron surface, mass fraction, void fraction,...). I preforme boolean operations to cut out my measurment volumes (subvolume where I want to average the data). In this special case it is a cylinder. By…
monchi
  • 310
  • 3
  • 12
0
votes
1 answer

How to compute normals of a set of unorganized triangled mesh as the picture?

I addressed the result of Delauny triangulation of the point set, the result shown is not closed,so I can't use the ray shooting method.In the picture I just compute normal of every vertex,so it shows bright and dark.Is there a efficient method to…
jxfngu
  • 1
  • 1
0
votes
1 answer

CGAL - clock slew when making?

I'm tired of manually executing one command after another just to compile a C++11 program that makes use of CGAL. So I thought I'd create a small .sh file that would take care of it for me: #!/bin/bash cgal_create_cmake_script && cmake . && echo…
User1291
  • 7,664
  • 8
  • 51
  • 108
0
votes
0 answers

Splitting Nef polyhedra into discrete volumes for conversion to regular polyhedra

I am doing some boolean operation on Nef polyhedra converted from regular polyhedra. After doing the boolean operation I want to convert the resulting Nef polyhedra into regular polyhedra. However it seems that Nef polyhedra only support if the…
Taus
  • 344
  • 2
  • 15
0
votes
1 answer

Frontier in a Delaunay Triangulation

I´m working in a Delaunay triangulation. I have my own frontier that is not the convex hull polygon. I want to use the my own frontier, instead of use the cgal convex hull. I haven´t found in the documentation how to do that. I suppouse that this…
0
votes
1 answer

How to implement "recalculate outside" in Blender

When importing CAD file like STL format file, sometimes, some of the facets are reversed so their normal vectors are directing inside the volume while others going outside. the "recalculate outside" comes in to fix the situation. But, I am wondering…
Seong
  • 556
  • 4
  • 18
0
votes
2 answers

Smoothing generated Delaunay using CGAL

I have problem with low quality of Tetrahedrons in my generated Mesh. I am using CGAL::Delaunay_Triangulation_3 for triangulation, from pre-defined point cloud. My problem is that Elements generated by CGAL are a bit of low quality - presence of…
Aleksander Fular
  • 803
  • 9
  • 18
0
votes
1 answer

CGAL Point_2 Polygon_set_2 Distance

I've been searching google for a while now and I think I'm doing something wrong. As the title suggests, I'm logging for the cgal-way to determine the min distance of a Point_2 to a Polygon_set_2. Did I overlook something in the documentation? I did…