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

how can i do delaunay triangulation of simple polygon and find it's neighbors for any triangles in cgal

how can i do using CGAl, Delaunay triangulation of polygon (simple without hole and in cw order) and get a list of the neighbors of triangles for any triangle that generated from the Delaunay triangulation?
Mehdi bayat
  • 199
  • 2
  • 13
0
votes
1 answer

How can I connect all Delaunay triangle to voronoi?

I have a list of all triangle sharing an edge. How can I draw a voronoi diagram? I loop over the Delaunay triangles and compare it to vertex 1 = vertex 2 and vertex 2 = vertex 1, I. e. if there are the same edges. It also checks when vertex 1 =…
Micromega
  • 12,486
  • 7
  • 35
  • 72
0
votes
1 answer

Rasterizing Delaunay triangulation in Matlab

I have computed a Delaunay triangulation using DelaunayTri() in Matlab R2010b. Now I would like to burn a subset of the triangles (i.e. 12200 triangles) into a matrix (Raster). Is there any fast/efficient way of doing this? I have tried using both…
jatobat
  • 749
  • 3
  • 8
  • 21
0
votes
1 answer

Matlab triangulation using DelaunayTri

I would like to obtain the following triangulation in Matlab using the command DelaunayTri: I tried the following code: xgrid = [-0.5233 -0.3488 -0.1743 0.0001 0.1746 0.3490 0.5235]; ygrid = [-0.1745 0.3054 0.5454 …
Pietair
  • 396
  • 2
  • 8
  • 18
0
votes
1 answer

why treating the supertriangle's vertices in Bourke's Delaunay triangulation algorithm?

P. Bourke proposes an interesting algorithm here: http://paulbourke.net/papers/triangulate/ but I don't understand why he adds the supertriangle's vertices to the end of the vertices list in "add supertriangle vertices to the end of the vertex list"…
nraynaud
  • 4,924
  • 7
  • 39
  • 54
0
votes
2 answers

Secure usage of Cell_handle in a CGAL Delaunay triangulation after point insertion

I'm planning to write an algorithm that will use CGAL Delaunay triangulation data structure. Basically I need to insert some point into the triangulation, save reference to some cells, and then make some other insertion. I'm wondering how can I…
Nicola Pezzotti
  • 2,317
  • 1
  • 16
  • 26
0
votes
1 answer

Voronoi diagrams based on non metric distances in R

I want to voronoi diagrams in R. I have a set of points in N-dimensions(say 10). I dont want to use multi dimensional scaling(MDS). I want voronoi diagrams to be plotted using non metric measures. Is there any package which has this implementation?…
dp758
  • 106
  • 10
0
votes
1 answer

constrained delauncy traingulation opencv on a contour or convexhull

I want to know the method of doing CDT(constrained delauncy triangulation) using opencv C++ / C api , on a contour or convex hull . my question is similar to C++-ObjC OpenCV Constrained Delaunay
Devendra
  • 89
  • 2
  • 11
0
votes
3 answers

OpenCV,C++: Missing Triangles in Delaunay Triangulation

I am using NetBeans 7.1 on Ubuntu 11.04 and would like to obtain triangles from a set of points using OpenCV. I build the Delaunay triangulation as follows. vector< Triangle > CTwoDTriangulation::delaunayDiv(const vector< Point_ > & vP, …
OtagoHarbour
  • 3,969
  • 6
  • 43
  • 81
0
votes
1 answer

Parallel delaunay triangulation naive algorithm

The following code(Pg.187,Computational Geom in C by Rourke) takes same time to run serially as well as in parallel(2 proc). Please help me identify the problem. Here's the parallel portion int chunk; chunk=10; #pragma omp parallel…
haxor
  • 211
  • 1
  • 2
  • 11
0
votes
1 answer

Create delaunay triangulation in N-Dimensions from points forming non-convex surface (DelaunayTri for 5-D case)

I'd like to build triangulation for larger that 3 dimensions (4-6) cases. I have points representing non-convex surface. for 2D and 3D cases DelaunayTri is a way to go. What about higher dimensions? (Original problem is to approximate some…
user1244924
  • 25
  • 5
0
votes
1 answer

Delaunay Triangulation Equivalent for Undirected Graph

I'm working on a path planning algorithm that is equivalent to a traveling salesman problem. I don't know how many nodes I might have so I'm willing to sacrifice accuracy for speed. My problem can be modeled as a fully connected graph, with the cost…
Alex Londeree
  • 181
  • 1
  • 6
0
votes
1 answer

guibas stolfi delaunay triangulation distorted output

I am using the delaunay triangulation code by Geoff Leach based on the guibas stolfi algorithm. here's the link I took randomly generated integers between 50 to 1550 as the coordinates for the points.When i take more than 280 points the output gets…
haxor
  • 211
  • 1
  • 2
  • 11
-1
votes
1 answer

How to sort 2D Points in a 2D-Raster

I have a lot of unsorted 2D points which represent the positions of randomized picked pixels of an image. In the next step I try sort/rasterize them in a 2D array, by point with smallest x, y value at array[0][0] and Point with highest x,y value…
cosmonaut
  • 414
  • 1
  • 3
  • 14
-1
votes
1 answer

Fastest Type of Collection of indexed complex Ocjects

I'm looking for the most elegant, fastest and most efficient way to store several objects of the class Point with an index/key in any kind of collection. Point contains attributes like index, posX, posY, area, neighborPoints[], AdjacentTriangles[],…
Pixel_95
  • 954
  • 2
  • 9
  • 21
1 2 3
…
32 33