Journal ArticleDOI
Two algorithms for constructing a Delaunay triangulation
Der-Tsai Lee,Bruce Schachter +1 more
TLDR
This paper provides a unified discussion of the Delaunay triangulation and two algorithms are presented for constructing the triangulations over a planar set ofN points.Abstract:
This paper provides a unified discussion of the Delaunay triangulation. Its geometric properties are reviewed and several applications are discussed. Two algorithms are presented for constructing the triangulation over a planar set ofN points. The first algorithm uses a divide-and-conquer approach. It runs inO(N logN) time, which is asymptotically optimal. The second algorithm is iterative and requiresO(N
2) time in the worst case. However, its average case performance is comparable to that of the first algorithm.read more
Citations
More filters
Proceedings ArticleDOI
Turning a Vulnerability into an Asset: Accelerating Facial Identification with Morphing
TL;DR: Two hitherto unrelated topics within the biometrics domain are combined: the properties of morphed images are exploited for the purpose of improving the transaction times of a biometric identification system and morphs of two or more samples are used in the pre-selection step of a two-stage biomet identification system.
Journal ArticleDOI
A divide-and-conquer algorithm for constructing relative neighborhood graph
TL;DR: AnO(n logn) divide-and-conquer algorithm for finding the relative neighborhood graph RNG(V) of a set V ofn points in Euclidean space is presented and its time complexity is O(n) and it requiresO(logn) processors.
Journal ArticleDOI
Matching of corroded defects in onshore pipelines based on In-Line Inspections and Voronoi partitions
Rafael Amaya-Gómez,Franck Schoefs,Mauricio Sánchez-Silva,Felipe Muñoz,Emilio Bastidas-Arteaga +4 more
TL;DR: In this article , an alternative using Voronoi cells to filter possible matches and an iterative approach to determine the best affine transformation, considering the uncertainty in any direction, is presented.
Journal ArticleDOI
Automatic mesh generation for multiply connected planar regions based on mesh grading propagation
TL;DR: A method based on mesh grading propagation which automatically produces a triangular mesh in a multiply connected planar region which is incorporated with domain decomposition techniques to generate satisfactory quasi-uniform meshes for 2D arbitrary domains.
Journal ArticleDOI
Regularization of multidimensional sparse seismic data using Delaunay tessellation
TL;DR: This study proposes an efficient linear interpolation algorithm for higher-dimensional regularization using Delaunay tessellation, which has been used for various purposes, such as surface reconstruction and determining the nearest neighbourhood in computational geometry.
References
More filters
Journal ArticleDOI
Nouvelles applications des paramètres continus à théorie des formes quadratiques. Deuxième Mémoire. Recherches sur les paralléloèdres primitifs.
Proceedings ArticleDOI
Closest-point problems
Michael Ian Shamos,Dan Hoey +1 more
TL;DR: The purpose of this paper is to introduce a single geometric structure, called the Voronoi diagram, which can be constructed rapidly and contains all of the relevant proximity information in only linear space, and is used to obtain O(N log N) algorithms for most of the problems considered.