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.
Highly Cited
2013
Highly Cited
2013
Voronoi Diagrams and Delaunay Triangulations
  • R. Klein
  • Encyclopedia of Algorithms
  • 2013
  • Corpus ID: 28324403
Voronoi diagrams partition space according to the influence certain sites exert on their environment. Since the 17th century… 
Highly Cited
2009
Highly Cited
2009
A Delaunay triangulation approach for segmenting clumps of nuclei
Cell-based fluorescence imaging assays have the potential to generate massive amount of data, which requires detailed… 
Highly Cited
2007
Highly Cited
2007
Simultaneous storage of primal and dual three-dimensional subdivisions
Highly Cited
2007
Highly Cited
2007
Delaunay Triangulation with Transactions and Barriers
Transactional memory has been widely hailed as a simpler alternative to locks in multithreaded programs, but few nontrivial… 
Highly Cited
2004
Highly Cited
2004
Partial Delaunay triangulation and degree limited localized Bluetooth scatternet formation
We address the problem of localized scatternet formation for multihop Bluetooth-based personal area ad hoc networks. Nodes are… 
Highly Cited
2003
Highly Cited
2003
Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks
Several localized routing protocols guarantee the delivery of the packets when the underlying network topology is a planar graph… 
Highly Cited
2002
Highly Cited
2002
Conforming Delaunay triangulations in 3D
We describe an algorithm which, for any piecewise linear complex (PLC) in 3D, builds a Delaunay triangulation conforming to this… 
Highly Cited
1996
Highly Cited
1996
Algorithm 751: TRIPACK: a constrained two-dimensional Delaunay triangulation package
TRIPACK is a Fortran 77 software package that employs an incremental algorithm to construct a constrained Delaunay traingulation… 
Highly Cited
1995
Highly Cited
1995
Delaunay triangulation in three dimensions
Triangulation in two and higher dimensions began with Dirichlet, Voronoi, Thiessen, and Delaunay. A number of textbooks and… 
Highly Cited
1986
Highly Cited
1986
Generalized delaunay triangulation for planar graphs
We introduce the notion of generalized Delaunay triangulation of a planar straight-line graphG=(V, E) in the Euclidean plane and… 
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)