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.
Questions tagged [delaunay]
488 questions
-1
votes
1 answer
What in my implementation of the Bowyer-Watson algorithm is making it O(n^2) or worse instead of O(n log n) like it's supposed to?
I've recently finished implementing the Bowyer-Watson algorithm for calculating Delaunay triangulations in the plane in Javascript. The Wikipedia article (Wikipedia Watson algorithm) says it's O(n log n) to O(n^2) in especially degenerate cases. How…

Truls Henriksson
- 51
- 7
-1
votes
1 answer
Python Delaunay Triangulation
I have an array with different vectors which represent points. What I'm trying to get is all neighbors from each point. Those points are in 'numpy.ndarray' and have the type 'numpy.float64'. I want to use Delaunay Triangulation but my problem is…

M.S
- 13
- 1
- 3
-1
votes
1 answer
Algorithm used in scipy.spatial.Delaunay for Delaunay Triangulation
In my Python code I use scipy.spatial.Delaunay to obtain a Delaunay triangulation. I can't figure out, but I'm really curious, which algorithm is used in this function in order to create the Delaunay triangulation. Does anyone know?
Thank you in…

Liduine
- 1
- 1
-1
votes
1 answer
finding all triangles from an array of lines (Delaunay diagram)
im using the Mesh library in processing to create a grid of triangles based on an array of points.
my problem is that this library can only return an array of lines that make up the triangles and not the triangles themselfs.
does anyone know how to…

yoav sarfaty
- 43
- 1
- 1
- 8
-1
votes
1 answer
Delaunay Walk point outside triangles
I'm implementing a 2d delaunay triangulation using the remembering stochastic walk. What I don't understand is what happens if a point is inserted that is not in any of the previous triangles.
triangle τ = α;
triangle ψ = τ; // the previous triangle…

Bas
- 203
- 1
- 3
- 10
-1
votes
1 answer
Delaunay triangulation - How to prevent twisted mesh?
I've found a good sample of triangulation: High performance version by Salvatore Previti in C# 2.0.
The left side of the mesh is twisted in the following image. Is there some way to prevent it?
-1
votes
1 answer
Optimising Delaunay triangulation algorithm
Dear Community Members,
I’ve been working recently on Delaunay triangulation implementation in cpp. While I’ve algorithm that works.. it’s terribly slow (100 objects are computed in about ~16 seconds).
Algorithm is basing on brute force approach.…

newIncognito
- 1
- 1
-1
votes
1 answer
Python - matplotlib subplots in tripcolor case
I m trying to organize and ajust my three subplots obtained with tripcolor od Delaunay triangulation. The problem is i cant use the function : plt.tight_layout(pad=0.5, w_pad=2.5, h_pad=2.0) to set the windows size, it doesnt work in this case.
The…

user3601754
- 3,792
- 11
- 43
- 77
-1
votes
2 answers
How to create arcs on boundary points of voronoi?
I am writing some 2D graphic software. And in my project i used Voronoi algorithm. And result is correct as I expected (Pic 1). Then i want to add some feature on boundary points just like (Pic 2). So i think i need to implement Concave hull on…

Edmon
- 108
- 2
- 5
-1
votes
1 answer
CGAL triangulation over 3D points - trying to 'skin'
I hope this is not too vague. I find the CGAl library quite difficult to understand and it may just be a difference in terminology that is confusing me.
I am trying to create a triangulation over a set of 3D points but I'm not sure I am using the…

BirminghamOwl
- 1
- 1
-1
votes
2 answers
Get connected points (edges) from a d-dimensional Delaunay Triangulation in CGAL
I have a set of points. I want to calculate the Delaunay Triangulation of them using CGAL and then get the neighbors back.
Input:
p1, p2, p3, p4, ...
Output:
p1-p2, p1-p4, ....
I found answers to this problem for 2 or 3 dimensions. However I need…

Simon Hanna
- 1
- 1
-1
votes
1 answer
ill conditioned status of delaunay tetrahedralization
Alexandre,
I am interested in using (and possibly implementing) software for (constained) 3d tetrahedralization and so I was concerned when I saw your comment:
"3D delaunay (I assume you want tetrahedra, not that you're trying to fit a surface) is…

sitiposit
- 149
- 1
- 13
-1
votes
2 answers
Concave Hull From GPS Coordinates in Javascript
this is my first question in stackoverflow after reading a lot about concave hulls and alpha shapes but unfortunately I still have not found a working solution :(
My input is a big array of GPS-Coordinates (lat,lon) (around 1000-2000 points)…

Patrick Stahel
- 1
- 1
-1
votes
1 answer
voronoi diagram and delaunay triangulation understanding
Can someone help me to understand the purpose of delaunay triangulation? what is it use for?
Also I got to know that delaunay triangulation is the dual graph of voronoi diagram but not really fully understand it. Thanks so much

amin
- 9
- 2
-1
votes
1 answer
what does the output of 3D delaunay triangulation represent?
I want to know what does the ConnectivityList in Delaunay triangulation in Matlab represent? Why does it have 4 columns?

ala
- 1
- 1