• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,283
Next 10 →

Constrained Delaunay triangulations

by L. Paul Chew - Algorithmica , 1989
"... Given a set of n vertices in the plane together with a set of noncrossing edges, the constrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the prespecified edges are included in the triangulation, and (2) it is as close as possible to the De ..."
Abstract - Cited by 207 (4 self) - Add to MetaCart
Given a set of n vertices in the plane together with a set of noncrossing edges, the constrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the prespecified edges are included in the triangulation, and (2) it is as close as possible

The Stability of Delaunay Triangulations

by Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh , 2013
"... We introduce a parametrized notion of genericity for Delaunay triangulations which, in particular, implies that the Delaunay simplices of δ-generic point sets are thick. Equipped with this notion, we study the stability of Delaunay triangulations under perturbations of the metric and of the vertex p ..."
Abstract - Cited by 7 (5 self) - Add to MetaCart
We introduce a parametrized notion of genericity for Delaunay triangulations which, in particular, implies that the Delaunay simplices of δ-generic point sets are thick. Equipped with this notion, we study the stability of Delaunay triangulations under perturbations of the metric and of the vertex

Laplacian Smoothing and Delaunay Triangulations

by David A. Field - Communications in Applied Numerical Methods , 1988
"... In contrast to most triangulation algorithms which implicitly assume that triangulation point locations are fixed, 'Laplacian ' smoothing focuses on moving point locations to improve triangulation. Laplacian smoothing is attractive for its simplicity but it does require an existing triangu ..."
Abstract - Cited by 140 (0 self) - Add to MetaCart
triangulation. In this paper the effect of Laplacian smoothing on Delaunay triangulations is explored. It will become clear that constraining Laplacian smoothing to maintain a Delaunay triangulation measurably improves Laplacian smoothing. An early reference to the use of Laplacian smoothing is to be found in a

Voronoi diagrams and Delaunay triangulations

by Steven Fortune , 1995
"... ..."
Abstract - Cited by 250 (3 self) - Add to MetaCart
Abstract not found

ON THE AVERAGE LENGTH OF DELAUNAY TRIANGULATIONS

by R. C. Chang, R. C. T. Lee , 1984
"... We shall show that on the average, the total length of a Delaunay triangulation is of the same order as that of a minimum triangulation, u der the assumption that our points are drawn from a homogeneous planar Poisson point distribution. ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
We shall show that on the average, the total length of a Delaunay triangulation is of the same order as that of a minimum triangulation, u der the assumption that our points are drawn from a homogeneous planar Poisson point distribution.

The Delaunay Triangulation and Function Learning

by Stephen M. Omohundro , 1990
"... In this report we consider the use of the Delaunay triangulation for learning smooth nonlinear functions with bounded second derivatives from sets of random input output pairs. We show that if interpolation is implemented by piecewise-linear approximation over a triangulation of the input sampl ..."
Abstract - Cited by 15 (0 self) - Add to MetaCart
In this report we consider the use of the Delaunay triangulation for learning smooth nonlinear functions with bounded second derivatives from sets of random input output pairs. We show that if interpolation is implemented by piecewise-linear approximation over a triangulation of the input

Structural tolerance and Delaunay triangulation

by Manuel Abellanas , Ferran Hurtado , Pedroa. Ramos , 1999
"... In this paper we consider the tolerance of a geometric or combinatorial structure associated to a set of points as a measure of how much the set of points can be perturbed while leaving the (topological or combinatorial) structure essentially unchanged. We concentrate on studying the Delaunay triang ..."
Abstract - Cited by 11 (1 self) - Add to MetaCart
that the tolerance of all the edges can be computed in O(n log n) time. Finally, we extend our study to some subgraphs of the Delaunay triangulation.

Computing Delaunay Triangulation with Imprecise . . .

by A. A. Khanban, A. Edalat , 2003
"... The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside oroutside the circle determined by any other three points. We address the problem of formulating the in-circle testwhen the coordinate ..."
Abstract - Cited by 12 (2 self) - Add to MetaCart
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside oroutside the circle determined by any other three points. We address the problem of formulating the in-circle testwhen

Outerplanar graphs and Delaunay triangulations

by Ashraful Alam, Igor Rivin, Ileana Streinu , 2011
"... Over 20 years ago, Dillencourt [1] showed that all outerplanar graphs can be realized as Delaunay triangulations of points in convex position. His proof is elementary, constructive and leads to a simple algorithm for obtaining a concrete Delaunay realization. In this note, we provide two new, altern ..."
Abstract - Add to MetaCart
Over 20 years ago, Dillencourt [1] showed that all outerplanar graphs can be realized as Delaunay triangulations of points in convex position. His proof is elementary, constructive and leads to a simple algorithm for obtaining a concrete Delaunay realization. In this note, we provide two new

Application-layer multicast with Delaunay triangulations

by Jörg Liebeherr, Michael Nahas, Weisheng Si - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS , 2002
"... Application-layer multicast supports group applications without the need for a network-layer multicast protocol. Here, applications arrange themselves in a logical overlay network and transfer data within the overlay. In this paper, we present an application-layer multicast solution that uses a Del ..."
Abstract - Cited by 179 (4 self) - Add to MetaCart
Delaunay triangulation as an overlay network topology. An advantage of using a Delaunay triangulation is that it allows each application to locally derive next-hop routing information without requiring a routing protocol in the overlay. A disadvantage of using a Delaunay triangulation is that the mapping
Next 10 →
Results 1 - 10 of 1,283
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University