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

Sampling triangle mesh obtained with Delaunay function

I have a colection of 3d cloud points such as the one that follows, representing a 3d shape: My goal is to increase the number of points on each cloud so that I obtain more 'continuous' clouds. Also it would be important to be able to set the…
Filipe Aleixo
  • 3,924
  • 3
  • 41
  • 74
0
votes
1 answer

Duplicate edges not being removed in Delaunay Triangle construction

I'm trying to implement Delaunay Triangulation. However, I seem to be having a problem with edges creating overlapping triangles: I'm basing my implementation as described on this site. I'm just using a brute force loop to check whether or not an…
idlackage
  • 2,715
  • 8
  • 31
  • 52
0
votes
1 answer

Interpolation and Morphing of an image in labview and/or openCV

I am working on an image manipulation problem. I have an overhead projector that projects onto a screen, and I have a camera that takes pictures of that. I can establish a 1:1 correspondence between a subset of projector coordinates and a subset…
Marc
  • 5,315
  • 5
  • 30
  • 36
0
votes
1 answer

Python scipy.spatial.Delaunay and copy.deepcopy malfunctioning with incremental parameter

I have had a big problem using scipy.spatial.Delaunay function. I initialize a variable named tri as it follows: tri = Delaunay(ApsArray, incremental=True) This code works perfectly, but since I have to use this triangulation in a for loop, I want…
JLD
  • 89
  • 5
0
votes
0 answers

surface plots of large 3D datasets using R

Although this post may be related previous ones (e.g., here), it also involves a larger dataset (i.e., numbers of points ~1e5), which describes the surface of a 3D object (think of a single particle in high definition), defined by regularly-spaced…
Rolf
  • 139
  • 1
  • 9
0
votes
1 answer

3D alpha shape yielding unexpected convex hull of surface

I executed the 3D alpha shape function with CGAL and I got unexpected results. My input data was a set of 3D points (x, y, z) that represents one building (box) in a flat area (with some noise in the coordinates - small ones). I supposed I would get…
ricãO
  • 61
  • 1
  • 10
0
votes
2 answers

error building Delaunay triangulation example OpenCV C++

I am trying to run the Delaunay example code https://github.com/Itseez/opencv/blob/master/samples/cpp/delaunay2.cpp. but I face this error when building: "identifier "LINE_AA" is undefined", and "identifier "LINE_8" is undefined". where do you think…
CV_passionate
  • 115
  • 1
  • 4
  • 18
0
votes
0 answers

bad triangles in triangulation of CGAL

I'm trying to build a triangulation (or mesh) of 2D figure. But it fails for some figures, because bad triangles are produced. These triangles are built by points which lie at the one line. I identify these triangles by the area. Does anybody know…
Artem Blonsky
  • 11
  • 4
0
votes
0 answers

Randomly Incremental Approach for Delaunay Triangulation degenerated case 4 don't behave properly

I am trying to implement the algorithm given in (1) for get a Delaunay Triangulation of a set of points, but I get stuck when I try it to handle degenerated cases. First at all, I implement an approach presented by Glenn Eguchi at The 6.838…
monk
  • 134
  • 1
  • 7
0
votes
0 answers

Link closest points accross altitudes in Matlab and form chains

I have a 3d matrix with scattered points (Nx4 matrix, x-y-z-data). My aim is to link the closest points together and register each chain in an Kx4 array (x, y, z, data), K being the chain length. The total number of chains depends on the points... A…
pcpc
  • 3
  • 2
0
votes
0 answers

Correct usage of package RTriangle in R

I'm trying to compunte a triangulation in R with package RTriangle. Here's my code pslgobj<-pslg(coord_rid[,1:2],S=Boundaries) Where coord_rid contains all the coordinates of 911 points, and Boundaries contains the segments for the region…
Darko
  • 1,448
  • 4
  • 27
  • 44
0
votes
1 answer

CGAL Using Locate() to Find Cell on Triangulation Surface

Using CGAL, I have a 3D Delaunay Triangulation of a set of random points on the unit sphere, that I obtained via: Delaunay T(points.begin(), points.end()); Now, what I would like to be able to do is query T (using locate() or something like that) to…
kdottiemo
  • 79
  • 1
  • 8
0
votes
2 answers

CGAL 3D Delaunay Triangulation - First Vertex is Origin?

I am performing a 3D Delaunay Triangulation of points sampled from a sphere, and I am looking at the vertices of the resultant triangulation essentially by doing this: for(Delaunay_Vertex_iter p = T.vertices_begin(); p != T.vertices_end();…
kdottiemo
  • 79
  • 1
  • 8
0
votes
1 answer

Delaunay triangulation implementation in matlab

Hello it`s my first post here. I want to write matlab script for Delaunay triangulation. Here is my script: clear all;clc %% Delaunay x=[ 160.1671 366.9226 430.7894 540.1208 660.2771 508.7287 252.1787]; y=[ 223.9615 259.5000 120.5769 245.5000…
ddr8
  • 31
  • 3
0
votes
0 answers

Python generate a 2D tesselation map of 3D mesh's triangles

I have a cloud of 3D points ("colors.csv") and a code that generates its convex hull: #loading cloud of points points = np.array([(XYZRGB(rank, name, X, Y, Z)) for rank, name, X, Y, Z in csv.reader(open('colors.csv'))]) #doing…
adrienlucca.net
  • 677
  • 2
  • 10
  • 26
1 2 3
…
32 33