Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,226,786 papers from all fields of science
Search
Sign In
Create Free Account
Delaunay triangulation
Known as:
Delaunay tessellation
, Delaunay
, Thiessen triangulation
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
Alpha shape
Beta skeleton
Bowyer–Watson algorithm
Bregman divergence
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Delaunay-triangulation based complete coverage in wireless sensor networks
Chinh T. Vu
,
Yingshu Li
Annual IEEE International Conference on Pervasive…
2009
Corpus ID: 5779970
One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the…
Expand
2008
2008
Self-improving algorithms for delaunay triangulations
K. Clarkson
,
C. Seshadhri
SCG '08
2008
Corpus ID: 131650
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n…
Expand
Highly Cited
2007
Highly Cited
2007
Computation of Tunnels in Protein Molecules using Delaunay Triangulation
Petr Medek
,
P. Benes
,
Jirí Sochor
Journal of WSCG
2007
Corpus ID: 14807628
This paper presents a new method of specific cavity analysis in protein molecules. Long-term biochemical research has the…
Expand
2004
2004
P2P Spatial Query Processing by Delaunay Triangulation
Hye-Young Kang
,
Bog-Ja Lim
,
Ki-Joune Li
International Workshop on Web and Wireless…
2004
Corpus ID: 6119165
Although a number of methods have been proposed to process exact match or range queries in P2P network, very few attention has…
Expand
2003
2003
Computing Delaunay Triangulation with Imprecise Input Data
A. Khanban
,
A. Edalat
Canadian Conference on Computational Geometry
2003
Corpus ID: 9473813
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether…
Expand
2003
2003
A Weak Definition of Delaunay Triangulation
V. de Silva
2003
Corpus ID: 1681
We show that the traditional criterion for a simplex to belong to the Delaunay triangulation of a point set is equivalent to a…
Expand
2002
2002
Delaunay triangulation programs on surface data
Sunghee Choi
,
N. Amenta
ACM-SIAM Symposium on Discrete Algorithms
2002
Corpus ID: 38508917
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…
Expand
2001
2001
Delaunay Triangulation of Constrained Data Set
Gong Jian-ya
2001
Corpus ID: 130494269
The triangulation of constrained data set is widely used in Geographic Information System(GIS),geo-science,computational geometry…
Expand
Highly Cited
1995
Highly Cited
1995
Simulation of Endoscopy
B. Geiger
,
R. Kikinis
Computer Vision, Virtual Reality and Robotics in…
1995
Corpus ID: 14607846
We present a simulation for endoscopic procedures. The anatomy of the patient is represented by 3D polyhedral models, computed…
Expand
1991
1991
Dynamic maintenance of Delaunay triangulations
T. C. Kao
,
D. Mount
,
A. Saalfeld
1991
Corpus ID: 16924210
We describe and analyze the complexity of a procedure for computing and updating a Delaunay triangulation of a set of points in…
Expand
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)
ACCEPT & CONTINUE