delaunay

For the purposes of implementing a high-performance dynamic pathfinding algorithm on a sphere (in C++), I'm interested in performing an incremental constrained delaunay triangulation on the surface of a sphere. Existing libraries do not seem to be sufficient - the closest that I've been able to find so far is CGAL, which has the topological space right but the metric space wrong. The library should have: Reasonable performance (I have about 100k points to put into it) Spherical topological and metric space (honestly, this overrules #1 by a wide margin) Incremental point insertion and deletion

I have a set of 2D points each with an associated id. (e.g. if the points are stored in an array, the id is the index into each point 0,....,n-1 ). Now I create a Delaunay triangulation of these points and want to list down all the finite edges. For each edge, I would like to have the ids of the points represented by corresponding 2 vertices. Example: if there's an edge between point 0 and point 2 then (0,2). Is this possible? #include <vector> #include <CGAL\Exact_predicates_inexact_constructions_kernel.h> #include <CGAL\Delaunay_triangulation_2.h> typedef CGAL::Exact_predicates_inexact

I'm trying to implement one of active appearance models (AMM) and on one of the steps I need to get triangulated mesh of a face , e.g.: Delaunay triangulation seems to be a good fit for this task (correct me if there are better options), and OpenCV has C API for it . But is there C++ API for Delaunay triangulation? Of course if is not a big deal to write a wrapper for C version if there's really no C++ API, but it's possible that's just lack of my knowledge of API, and not the API itself. In this case I will definitely prefer native OpenCV implementation. Andrey Kamaev OpenCV has C++ API for

Given a set of points in the plane, a notion of alpha-shape, for a given positive number alpha, is defined by finding the Delaunay triangulation and deleting any triangles for which at least one edge exceeds alpha in length. Here's an example using d3: http://bl.ocks.org/gka/1552725 The problem is that, when there are thousands of points, simply drawing all the interior triangles is too slow for an interactive visualization, so I'd like to just find the bounding polygons. This isn't so simple, because as you can see from that example sometimes there might be two such polygons. As a

I have this Java code that with a set of Point in input return a set of graph's edge that represent a Delaunay triangulation. I would like to know what strategy was used to do this, if exist, the name of algorithm used. In this code GraphEdge contains two awt Point and represent an edge in the triangulation, GraphPoint extends Awt Point, and the edges of final triangulation are returned in a TreeSet object. My purpose is to understand how this method works: public TreeSet getEdges(int n, int[] x, int[] y, int[] z) below the complete source code of this triangulation : import java.awt.Point;

Problem: Mesh generation from 3D points (with x, y and z coordinates). What I have is points in 3D space (with x, y and z coordinates) you can see it in image 1. What would be the output is image 2 or image 3, or image 4. In short it would be mesh. Material on it can be provided if I have the mesh. I have seen many people say about Delaunay triangulations or constrained Delaunay triangulations will help me in mesh generation, but what I mostly found is its implementation in 2D points (with only x and Y coordinates). But my problem is: I have points in 3D as you can see from image 1. Will