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
6
votes
4 answers

A Brute-Force Constrained Delaunay Triangulation?

I need to create a triangle mesh from a set of points. The set has very few points so it doesn't need to be fast or optimised (I will deal with 100 points maximum). The mesh needs to be a constrained "delaunay triangulation". In the image below I…
user18490
  • 3,546
  • 4
  • 33
  • 52
6
votes
1 answer

Difference between Matlab delaunayn and Scipy Delaunay

I'm trying to replicate an N dimensional Delaunay triangulation that is performed by the Matlab delaunayn function in Python using the scipy.spatial.Delaunay function. However, while the Matlab function gives me the result I want and expect, scipy…
zephyr
  • 2,182
  • 3
  • 29
  • 51
6
votes
1 answer

How to work with cgal circulators?

I'm trying to make delaunay triangulation of point set, find nearest point to input point, and get it's incident vertices, but somehow following code doesn't work. #include #include…
aptypr
  • 417
  • 5
  • 15
6
votes
2 answers

How to construct Voronoi diagram on the sphere with CGAL easily?

Firstly, I am new to CGAL, but program in C++ a lot. I would like to use CGAL to construct Voronoi diagram of points on the sphere. I have implemented one by myself for one of my research, but the data structure is not very generic, and I want to…
Li Dong
  • 1,088
  • 2
  • 16
  • 27
6
votes
1 answer

Convex hull routines in scipy.spatial gives me back my original set of points

I have a set of points and want to find the convex hull. When I give them to scipy.spatial (either ConvexHull or Delaunay), I just get the original set of points back. By construction, this should not be the case. Here are the points as a pickled…
benten
  • 1,995
  • 2
  • 23
  • 38
6
votes
1 answer

How to set maximum length of triangle side in Delaunay triangulation?

How to remove distances from Delaunay triangulation which are larger than I need? Example data: x<-rep(1:12, c(2,2,7,9,10,5,4,6,10,10,9,4)) y<-c(1,2,1,2,1:3,5:8,1:9,1:10,2,7:10,8:11,7:12,3:12,3:12,4:12,5,8:10) x_plus<-seq(0.2:0.8,…
Ladislav Naďo
  • 822
  • 12
  • 27
6
votes
2 answers

Polygon Triangulation c#

I need to calculate triangles of a polygon. Polygon can contain holes. And Req an efficient way. So I think I need Constrained Delaunay Triangulation. I must do that in c#, only need calculation not drawing or something. poly2tri seems good but idk…
user1708062
  • 75
  • 1
  • 4
5
votes
1 answer

CGAL: Find face/triangle a point belongs to?

After reading about it I've come to this: #include #include #include typedef CGAL::Exact_predicates_inexact_constructions_kernel K; typedef…
fml
  • 51
  • 1
  • 3
5
votes
0 answers

Is it possible to consider points coplanar in CGAL Delaunay triangulation (or any other supported triangulation) even if they are not?

I have got a polyhedron and the face points (for each of the faces) are basically coplanar but CGALsays they are not, this makes sense as the points are read from a file and there are only 14 significant digits so they will not be exactly coplanar.…
lucmobz
  • 453
  • 3
  • 8
5
votes
1 answer

Euclidean distance of Delaney triangulation - Scipy

The spatial package imported from Scipy can measure the Euclidean distance between specified points. Is it possible to return the same measurement by using the Delaunay package? Using the df below, the average distance between all points is measured…
jonboy
  • 415
  • 4
  • 14
  • 45
5
votes
2 answers

A Bowyer-Watson Delaunay Triangulation I implemented doesn't remove the triangles that contain points of the super-triangle

Python 3.7.2, though I doubt that piece of information would be very useful. Pygame 1.7.2. I'm using this mainly to draw the triangulation. All calculations are done with plain formulas. The pseudocode for the Bowyer-Watson algorithm is as shown,…
GiveMe30Dollars
  • 97
  • 5
5
votes
3 answers

How to use delaunay trianglation in 3d points?

I understand how to use delaunay triangulation in 2d points? But how to use delaunay triangulation in 3d points? I mean I want to generate surface triangle mesh not tetrahedron mesh, so how can I use delaunay triangulation to generate 3d surface…
Damons
  • 153
  • 1
  • 1
  • 7
5
votes
3 answers

Delaunay from Voronoi with boost: missing triangle with non-integral point coordinates

Following this two resources: Boost basic tutorial SO Question I wrote a Delaunay triangulation with boost. It works fine if the points coordinates are integral (I generated several random tests and I did not observed error). However if the points…
JRR
  • 3,024
  • 2
  • 13
  • 37
5
votes
2 answers

Find all simplices a point is a part of in scipy.spatial.Delaunay python

Is there anyway to get all the simplices/triangles a certain point is a part of in a Delaunay triangulation using scipy.spatial.Delaunay? I know there is the find_simplex() function, that that only returns 1 triangle that a point is a part of but I…
Daniel
  • 95
  • 5
5
votes
1 answer

How to set a maximum distance of a Delaunay triangle side in Python

I'm trying to work on some datasets using the scipy.spatial.Delaunay object. But the problem is that I'm not able to set a maximum triangle side lenght. I would like to do something like How to set maximum length of triangle side in Delaunay…
Krogiar
  • 137
  • 2
  • 7
1 2
3
…
32 33