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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
The Voronoi diagram of a set of sites partitions space into regions, one per site; the region for a site s consists of all points… (More)
  • figure 27.1
  • figure 27.1
  • table 27.3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Several localized routing protocols guarantee the delivery of the packets when the underlying network topology is a planar graph… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Application-layer multicast supports group applications without the need for a network-layer mul ticast protocol. Here… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper presents a new indexing-based approach to fingerprint identification. Central to the proposed approach is the idea of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We present a simple new algorithm for triangulating polygons and planar straightline graphs. It provides \shape" and \size… (More)
  • figure 27
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
In this paper we present an optimality result for the Delaunay triangulation of a set of points in Etd. We also show that some of… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1990
Highly Cited
1990
A set of scattered data in the plane consists of function values measured on a set of data points in R2. A surface model of this… (More)
  • figure 1
  • figure 2
Is this relevant?