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
4
votes
1 answer

Obtaining the intersection points of two circles in CGAL

I am trying to find out the intersection points of two unit-radius circles in CGAL. Inspired by the CGAL sample codes and tutorials, I have succeeded in creating the following code. But unfortunately, I am unable to print out the points. I have…
aghost
  • 235
  • 2
  • 12
4
votes
4 answers

How to get the source and target points from Edge_iterator in CGAL

I have a Delaunay triangulation over some points and want to iterate over all of the edges in it in length-ascending order in order to build a minimum spanning thread. I've tried with the following approach but cannot get it to compile: typedef…
Etan
  • 17,014
  • 17
  • 89
  • 148
4
votes
1 answer

CGAL Error: LNK1104: cannot open file CGAL-...4.11.lib

This has been a common problem on forums but solutions elude me. Windows 10 64 bit, CGAL 4.11, Cmake 3.9.2, Boost 1.65.1, Qt5 for MSVS 2017, libQGLViewer 2.7.0, Visual Studio 2017, CGAL built both as Debug and Release, myriad C++ include paths and…
NikNYC
  • 81
  • 5
4
votes
2 answers

CGAL replacement for iOS

I have a set of nodes that define streets. Each node has latitude and longitude. Also I have user location with latitude and longitude. My intention is to build Voronoi diagram for segments defined by each pair of nodes, and then find which node…
Aleks N.
  • 6,051
  • 3
  • 42
  • 42
4
votes
1 answer

3d surface triangulation of an open surface with CGAL

I'm a newbie to CGAL library. However, I think it's a very suitable package for what I want to do. I have a set of points representing a 3D surface (as shown in figure 1). I want to fit a 3d triangulation on this surface. The surface is not closed…
Alibemz
  • 115
  • 1
  • 7
4
votes
1 answer

Check whether a given point is on the (un)bounded side/boundary of a circle (CGAL)

I'm using Kernel::Circle_2 with CGAL::Arr_circle_segment_traits_2. Given a point (of the nested type Point_2 of this set of traits), I would like to check whether it's on the bounded side, unbounded side or on the boundary of a given circle. There…
Mega
  • 495
  • 5
  • 16
4
votes
1 answer

CGAL: Read vertices and triangles from mesh

I just spend few hours with CGAL in Visual Studio C++ trying to understand how meshes work. What I want to get is an access to list of vertices and triangles (vertices in form of double[3], triangles in form of int[3]). Here is the script I am…
Cheshire Cat
  • 335
  • 3
  • 13
4
votes
2 answers

How to print the faces of a Voronoi diagram?

Code bellow assumes input is points, not line segments (which is wrong). Following this 2D Voronoi Diagram Adaptor example, I am trying to write a program which takes as input line segments and prints the vertices of the faces of the Voronoi…
gsamaras
  • 71,951
  • 46
  • 188
  • 305
4
votes
1 answer

CGAL installation + CGAL and QT5

I just installed CGAL from ubuntu 16.04 package manger and tried to run an example according to this: http://www.cgal.org/FAQ.html#debian_demos after runing, the following message appeared: NOTICE: This demo requires CGAL and Qt5, and will not be…
user252935
  • 317
  • 3
  • 15
4
votes
3 answers

Efficient data structure for storing 3d points

I'm looking for efficient data structures for storing 3d points (x,y,z). The effect of storing in at the points in a data structure should generate a more memory efficient structure and a faster search for a specific set of coordinates. The 3d…
Yoko
  • 59
  • 1
  • 3
4
votes
1 answer

CGAL 3D surface mesh generation setting initial points

I use CGAL for meshing an implicit surface and up to now this example is close to what I want to accomplish. However,the implicit surface consists of several connected components among which one may not be detected. For example, if the number of…
Jürgen Böhm
  • 389
  • 3
  • 11
4
votes
0 answers

CGAL Nef_polyhedron compile error in bounding_box_3.h

I am attempting to create a simple test case for Nef_Polyhedron but keep running into a compile error even if there is only one line in the main function and I am not sure what to try next. Below is my entire program: #include #include…
J.Wei
  • 51
  • 4
4
votes
0 answers

Surface parametrization

I am trying to get a parametrized surface on a surface mesh (which is read from a STL format file.). I read some examples about parametrization provided by CGAL examples directory. I get to know that seam line should be provided in order to get a…
Seong
  • 556
  • 4
  • 18
4
votes
1 answer

Intersection of a (possibly unbounded) convex polygon with a halfplane

This is a follow-up question to How to test if a line intersects a convex polygon? Lets say I am able to test if a line intersects a convex polygon or not (I'm still not sure what's the best method, and this question is linked with my difficulty).…
elexhobby
  • 2,588
  • 5
  • 24
  • 33
4
votes
0 answers

Compile python dolfin with cgal

I wanted to install fenics and used the suggested commands sudo add-apt-repository ppa:fenics-packages/fenics sudo apt-get update sudo apt-get install fenics sudo apt-get dist-upgrade During the installation I got the error: Processing triggers…
user3528789
  • 103
  • 7
1 2 3
…
86 87