Questions tagged [delaunay-triangulation]

A Delaunay triangulation is one where no point in the source set is within the circumcircle of any triangle in the result set.

Filter by
Sorted by
Tagged with
4
votes
1answer
107 views

Restrict A* pathfinding to overlapping “safe zones” within map

I've been bashing my head against this idea for a few days without luck, I'm hoping someone sees something I don't. So I have a 2D map containing walls and obstacles, and I have a unit that navigates ...
2
votes
1answer
65 views

Reducing adjacency bookkeeping work in constrained Delaunay triangulation

I'm using the Sloan algorithm for constraining a generated Delaunay triangulation. This primarily consists of edge flipping for the edges that overlap the constrained edges. In order to flip an edge, ...
0
votes
0answers
34 views

How can I create a mesh of triangles made from the vertices of a polygon and contained within that polygon?

I'm trying to programatically generate a mesh, given the vertices of a polygon, which is contained within that polygon. For example, starting with these points: I would want to generate a mesh ...
1
vote
0answers
102 views

How does heavily constrained delaunay triangulation work?

In short: I'm trying to find an algorithm for performing a Delaunay triangulation of a heavily constrained polygon (for the purpose of pathfinding), with the understanding that most of the resulting ...
1
vote
2answers
121 views

Mesh Triangulation that is inside<->outside aware

am working on an algorithm for procedural generation of 3D meshes for caves in a side-scroller game. The algorithm nicely computes contours and also points inside the caves that are supposed to be ...
1
vote
1answer
1k views

High-level advice on procedural river (Unity3D) [closed]

I'm working on some procedural content for Unity3D - in C# My main aim is to build a flat plane (or maybe later a terrain / mesh), with a single river running through it, based on a seed value. I ...
2
votes
0answers
569 views

Triangulating a 3D mesh from a set of data points

I'm trying to implement the Bowyer-Watson point insertion version of the Delaunay triangulation algorithm, but in 3D. I previously implemented the 2D version without problems, but when transitioning ...
5
votes
1answer
810 views

How to generate tiled delaunay triangulation mesh (delaunay triangulation within a rectangle with triangles connecting opposing edges)?

I have a nice triangulation of a square mesh. The way I do this currently is generate square mesh (two triangles), from (0.,0.) to (1.,1.) (axis-aligned and normalized for simplicity) add point ...