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

Building adjacency matrix from delaunay triangle values

I have a large matrix containing 3D coordinates of points and I want to have the adjacency matrix of them using their delaunay triangulation results. To have their delaunay triangulation values I used 'geometry' package. To have an example of what I…
minoo
  • 555
  • 5
  • 20
0
votes
0 answers

How to extract the triangles existing in a path of rectangle in a svg file?

I'm working on Delaunay triangulation. I tried this code: https://github.com/esimov/triangle and I wanted to explore the svg file which is the result of the triangulation, but when I have inspected certain elements, I realized that the variable path…
Hajar Ch
  • 39
  • 3
  • 13
0
votes
1 answer

How to use computational geometry techniques to deal with inaccurate map coordinates

I am trying to build route optimization software and I am using openstreetmaps for the interface. I have an implementation of the savings algorithm on the backend that helps determine the optimal route for making a series of deliveries. The problem…
Abdul Mohammed
  • 11
  • 4
0
votes
1 answer

Create a surface mesh using CGAL's Delaunay in 3D space with points as input

I want to create a surface mesh using CGAL's Delaunay in 3D space with points as input. Right now I have got a working version of 3D Delaunay from CGAL, but now I want to only return a surface from this result. I found…
Dariuszz
  • 55
  • 4
0
votes
0 answers

How to draw surface of a solid model which have inside points that must not be drawned?

I am trying to draw a geometry of a solid mesh which has inside nodes. From my research I understood that I can use delaunay triangulation for connecting vertices to produce faces. However my data has additional nodes that positioned at the inside…
user3160302
  • 227
  • 1
  • 4
  • 11
0
votes
1 answer

CGAL add data to face handle

I am using CGAL in Python and I'd like to be able to add data to the face handle in a triangulation. It seems like Python lets me store this information but it doesn't persist, for example: from CGAL.CGAL_Kernel import Point_2 from…
mv3
  • 469
  • 5
  • 16
0
votes
2 answers

When should i do Edge Flip in this case ? (For Delaunay Triangulation)

The problem is the following : I have to transform a triangulation $t1$ intro a triangulation $t2$ of the same set of points. First i use the Edge Flip Algorithm to get the flips needed to transform triangulation $t1$ into the Delaunay triangulation…
Eduard6421
  • 295
  • 1
  • 11
0
votes
0 answers

Delaunay Triangulation Divide and Conquer Algorithm

I am attempting to implement Delaunay Triangulation in order to create a Navigation Mesh for a top down 2d game that I am making for one of my courses. First question, is Delaunay Triangulation a good idea for this, or are there better ways? I would…
Connor
  • 45
  • 8
0
votes
0 answers

CGAL kruskal isolated edge

I have created a finite Delaunay graph and launched kruskal MST on it, and it seems that in one of my test, I have an isolated edge in the MST (not connected to the others). Is that supposed to happen? How can I prevent that from happening, having…
Risine
  • 3
  • 1
0
votes
1 answer

why CGAL::Triangulation_3::locate does not give you the vertices of the tetrahedron contains your request point?

I am using CGAL::Delaunay_triangulation_3 to generate mesh for interpolation. I have three questions regarding Triangulation_3::locate. In the following, if Cell returns the four vertices of the tetrahedron which contains the point Location?…
saar
  • 1
0
votes
0 answers

How to avoid adding nodes on a line during delaunay triangulation

I am using the open source program triangle.c (A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator) which can be found here. I have to use this program to mesh a 2d circle and then rotate it to get 3d mesh of a sphere. Once I specify…
praveen kr
  • 115
  • 8
0
votes
0 answers

CGAL: k nearest neighbor periodic points

I want to find k nearest neighbors of a series of periodic points using Point_set_2, the following piece of code is the header files and related typedefs, in which I used periodic version of delaunay triangulation: #include…
user252935
  • 317
  • 3
  • 15
0
votes
2 answers

CGAL find interior points in a mesh

Im trying to use CGAL to find the points that are in the interior of a triangle mesh. (i.e. the set of points that are not on its boundary. There is a similar example here for a 3D mesh which uses the function CGAL::Side_of_triangle_mesh<>. Can…
CobaltGray
  • 41
  • 8
0
votes
1 answer

Is there an implementation of hyperbolic Delaunay triangulations?

I'd like to have random tessellations of regions in a hyperbolic space. In the Euclidean plane I get good results by scattering random points and performing a periodic Delaunay triangulation using CGAL. For the hyperbolic case, though, there is…
stafusa
  • 195
  • 1
  • 15
0
votes
2 answers

Delaunay triangulation in 3D

How would I implement Delaunay triangulation in three dimensions and aside from that, would this be efficient for plotting graphs in spherical coordinates? (If not, do you know of a more efficient method? Thanks.) Also, are there any disadvantages…
Samy
  • 3
  • 2
1 2 3
…
32 33