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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the… 
2008
2008
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n… 
Highly Cited
2007
Highly Cited
2007
This paper presents a new method of specific cavity analysis in protein molecules. Long-term biochemical research has the… 
2004
2004
Although a number of methods have been proposed to process exact match or range queries in P2P network, very few attention has… 
2003
2003
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether… 
2003
2003
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
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… 
2001
2001
The triangulation of constrained data set is widely used in Geographic Information System(GIS),geo-science,computational geometry… 
Highly Cited
1995
Highly Cited
1995
We present a simulation for endoscopic procedures. The anatomy of the patient is represented by 3D polyhedral models, computed… 
1991
1991
We describe and analyze the complexity of a procedure for computing and updating a Delaunay triangulation of a set of points in…