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
A Robust Intersection Algorithm Based on Delaunay Triangulation
TL;DR: A new robust method for finding points of intersection of line segments in the plane based on the Delaunay triangulation that is stable in the sense that it does not miss intersection that can be easily detected by naive pairwise check with the precision at hand.
Proceedings ArticleDOI
The optimum method for building delaunay triangulation based on the Virtual Grid
Lichao Chen,Shaofang Xia,Jia Liu +2 more
TL;DR: The virtual grid is introduced into the improved algorithm and the discrete set of points is partitioned scientifically and the insertion sequence about the discrete points is optimized improving the efficiency of the incremental inserting algorithm.
Dissertation
Investigation of the Joint Probability of Waves and High Sea Levels along the Cumbrian Coastline
TL;DR: Hames et al. as discussed by the authors investigated the joint probability relationship between waves and high sea levels at nearshore locations, and investigated this relationship spatially for an approximate 1 OOkm length of coastline for different nearshore beach levels in Cumbria.
Proceedings ArticleDOI
Automatically extracting contours of cross-sections from 3D point clouds of tunnel
TL;DR: For 3-d laser scanning point clouds of an expressway tunnel, a method of automatically extracting complete contours of cross-sections from them is proposed and the effectiveness and high efficiency of this method by the use of the point clouds acquired from a real highway tunnel are demonstrated.
Proceedings ArticleDOI
An anthropomorphic binocular-vision planning for grasping parts by robots
Jae-Moon Chung,T. Nagata +1 more
TL;DR: On the basis of the importance of the contour information and the scheme of stereo vision in recognizing objects by humans, the occluding contour pairs of objects are used as inputs, in order to show the proposed vision planning.
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.