# Delaunay triangulation

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2004

Highly Cited

2004

- Handbook of Discrete and Computational Geometryâ€¦
- 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)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- IEEE Trans. Parallel Distrib. Syst.
- 2003

Several localized routing protocols guarantee the delivery of the packets when the underlying network topology is a planar graphâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Symposium on Computational Geometry
- 2003

We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we deriveâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- IEEE Journal on Selected Areas in Communications
- 2002

Application-layer multicast supports group applications without the need for a network-layer mul ticast protocol. Hereâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Comput. Graph. Forum
- 2000

We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganizedâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- 1999

This paper presents a new indexing-based approach to fingerprint identification. Central to the proposed approach is the idea ofâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- J. Algorithms
- 1995

We present a simple new algorithm for triangulating polygons and planar straightline graphs. It provides \shape" and \sizeâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Symposium on Computational Geometry
- 1995

This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. Theâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Symposium on Computational Geometry
- 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)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Computer Aided Geometric Design
- 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)

Is this relevant?