Stack Overflow
Stack Overflow

Questions tagged [delaunay]

A *Delaunay* triangulation is a triangulation such that no vertex of the triangulation is inside the interior of the circumcircle of any triangle of the triangulation.

See the Wikipedia page Delaunay triangulation.

488 questions
0
votes
1 answer

Optimizing scipy.spatial.Delaunay.find_simplex

I have a set of points in a plane where each point has an associated altitude. I'm thinking of using the scipy.spatial library to compute the Delaunay triangulation of the point set and then use the result to interpolate for the points in…
Fran Borcic
  • 696
  • 6
  • 8
0
votes
1 answer

Patching Delaunay Triangles

I have a number of 2D points x and y, and I need to color delaunay triangles, which have edges that exceed a certain limit. However I can't figure out how to write it down so that it would compare each edge of each triangle and add it to a vector of…
Paulius Razma
  • 3
  • 3
0
votes
1 answer

Relocate points in Delaunay triangulation

I just finished an implementation of the Delaunay's incremental flipping algorithm. This algorithm has a time complexity O(N log N). The application of the algorithm is based on taking each point as an antenna of a telephone company. Using the…
Valentina Ramirez
  • 103
  • 8
0
votes
1 answer

CGAL triangulation with constraints changes points coords

I'm using Constrained_triangulation_2 and Constrained_Delaunay_triangulation_2 for triangulating my point set with constraints. In some cases I've got negative indieces (f_it->vertex(0)->info()) in some neighbor faces for both methods. After…
Mike
  • 43
  • 1
  • 5
0
votes
2 answers

Equivalent to Lloyd's algorithm using solelly the Delaunay triangulation

I'm trying to develop a program, where in a 2D space, a random set of points generates a graph using Delaunay triangulations. For this part there is a great amount of algorithms which can do so. The second part I want to implement consists in…
Treebranch
  • 13
  • 1
0
votes
1 answer

Speed up Python MST calculation using Delaunay Triangulation

I have a code that makes Minimum Spanning Trees of many sets of points (about 25000 data sets containing 40-10000 points in each set) and this is obviously taking a while. I am using the MST algorithm from scipy.sparse.csgraph. I have been told that…
FJC
  • 166
  • 12
0
votes
2 answers

Drawing 3D voronoi polyhedrons over human body points in MATLAB

I am trying to draw voronoi polyhedrons in 3D around a set of points (which are coordinates of the position of sensors) placed on a human frame. I found a couple of ways to do it in MATLAB. Except that none of them are giving me the right kind of…
Swathi
  • 3
  • 3
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…
Carlos A. Rabelo
  • 1
  • 2
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

Make conforming Delaunay - Wrong (?) points inserted

I'm using CGAL 2D Delaunay triangulation to define a terrain. I can't use the terrain class because my triangulation has constraints and they can't be used on terrain or 3D triangulations. (That's what I see so far, since there are no terrain…
Carlos A. Rabelo
  • 1
  • 2
0
votes
1 answer

Triangulation method to plot a density map in Python

I have a file with the coordinates (x,y) of a set of points and I am using the triangulation method to generate a net of triangles representative of a surface. The triangulation consist of an unstructured triangular grid consisting of n points and n…
Mraquel
  • 23
  • 8
0
votes
3 answers

How to calculate the neighbors of a list of Delaunay triangles know the vertex of each triangle in Python

I have been working on this for quite some time. I have a list of Delaunay triangles with knowing all the vertex, now I need to calculate the neighbors of each triangle. I know that python has the module Delaunay in scipy.spatial, which can be used…
fengdongyuxi
  • 101
  • 1
  • 7
0
votes
1 answer

Ensuring that all points are on the convex hull of a triangulation

I currently have a program that takes in a set of points, triangulates it using CGAL, and then extracts the convex hull of these points. However, I was wondering, instead of finding the convex hull of the points, how can I create a triangulation…
user1549792
  • 79
  • 9
0
votes
2 answers

What is the best initial shape for 3D Delaunay incremental algorithm?

I'm doing 3D Delaunay, with the incremental method. I've tested it in 2D with an initial triangle for inserting the vertices and it works great, but if I use a triangle for 3D, some vertices do not fall into any circumscribed sphere therefore they…
demilp
  • 43
  • 1
  • 12
0
votes
1 answer

CGAL 2D delaunay triangulation with mixed boundary conditions

I am new to CGAL, so I do not know where to start. I want CGAL to calculate a delaunay triangulation of a set of points in 2D. My problem is that there is a class for nonperiodic systems and another one for periodic systems (sorry, can not post more…
Lukas Engelke
  • 164
  • 7
1 2 3
…
32 33