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
Journal ArticleDOI
An interface-fitted mesh generator and virtual element methods for elliptic interface problems ☆
TL;DR: A simple and efficient interface-fitted mesh generation algorithm which can produce a semi-structured interface- fitted mesh in two and three dimensions quickly is developed in this paper.
Book ChapterDOI
A new and efficient k-medoid algorithm for spatial clustering
TL;DR: A new k-medoids algorithm is presented for spatial clustering in large applications that utilizes the TIN of medoids to facilitate local computation when searching for the optimal medoids.
Journal ArticleDOI
Image Registration for Digital Subtraction Angiography
TL;DR: A new approach to the registration of digital angiographic images is proposed that involves an edge-based selection of control points for which the displacement is computed by means of template matching, and from which the complete displacement vector field is constructed by Means of interpolation.
Journal ArticleDOI
Occlusion-adaptive, content-based mesh design and forward tracking
Yucel Altunbasak,A.M. Tekalp +1 more
TL;DR: An occlusion-adaptive forward-tracking mesh model, where connectivity of the mesh elements (patches) across covered and uncovered region boundaries are broken, enables better rendition of the motion, while tracking is necessary to avoid transmission of all node locations at each frame.
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.