Skip to search formSkip to main contentSkip to account menu

Delaunay triangulation

Known as: Delaunay tessellation, Delaunay, Thiessen triangulation 
In mathematics and computational geometry, a Delaunay triangulation for a set P of points in a plane is a triangulation DT(P) such that no point in P… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
Alpha shapeBeta skeletonBowyer–Watson algorithmBregman divergence

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Blocking delaunay triangulations
Given a set B of n blue points in general position, we say that a set of red points R blocks B if in the Delaunay triangulation… 
Highly Cited
2007
Highly Cited
2007
Computation of Tunnels in Protein Molecules using Delaunay Triangulation
This paper presents a new method of specific cavity analysis in protein molecules. Long-term biochemical research has the… 
2005
2005
An almost distribution-independent incremental Delaunay triangulation algorithm
This paper presents a new incremental insertion algorithm for constructing a Delaunay triangulation. Firstly, the nearest point… 
2004
2004
P2P Spatial Query Processing by Delaunay Triangulation
Although a number of methods have been proposed to process exact match or range queries in P2P network, very few attention has… 
Highly Cited
2004
Highly Cited
2004
Robust Three Dimensional Delaunay Refinement
The Delaunay Refinement Algorithm for quality meshing is extended to three dimensions. The algorithm accepts input with… 
2003
2003
Computing Delaunay Triangulation with Imprecise Input Data
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether… 
2003
2003
A Weak Definition of Delaunay Triangulation
We show that the traditional criterion for a simplex to belong to the Delaunay triangulation of a point set is equivalent to a… 
2002
2002
Delaunay triangulation programs on surface data
The Delaunay triangulation of a set of points in 3D can have size Θ(n2) in the worst case, but this is rarely if ever observed in… 
Highly Cited
1995
Highly Cited
1995
Simulation of Endoscopy
We present a simulation for endoscopic procedures. The anatomy of the patient is represented by 3D polyhedral models, computed… 
1991
1991
Dynamic maintenance of Delaunay triangulations
We describe and analyze the complexity of a procedure for computing and updating a Delaunay triangulation of a set of points in… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)