Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
15,285
Constrained Delaunay triangulations
- 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 217 (5 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
Laplacian Smoothing and Delaunay Triangulations
- 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
The Stability of Delaunay Triangulations
, 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
Computing Delaunay Triangulation with Imprecise . . .
, 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
The Delaunay Triangulation and Function Learning
, 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 ✩
, 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
- 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. © 1999 Published
Hierarchical Delaunay Triangulation for Meshing
"... Abstract. This paper discusses an elliptical pad structure and its polygonal approximation. The elliptical pad is a part of via model structures, which are important and critical components on today’s multilayered Printed Circuit Board (PCB) and electrical packaging. To explore meshing characterizat ..."
Abstract
- Add to MetaCart
is not only constrained Delaunay triangulation but also Delaunay triangulation.
Application-layer multicast with Delaunay triangulations
- 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 184 (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
Results 1 - 10
of
15,285
