scispace - formally typeset
Journal ArticleDOI

Two algorithms for constructing a Delaunay triangulation

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

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Analysis of the 2001 lava flow eruption of Mt. Etna from three-dimensional mapping

TL;DR: In this paper, the authors describe a method adopted to obtain the three-dimensional geometry of the whole lava flow field and for the reconstruction, based on topographic data, of the temporal evolution of the largest lava flow emitted from a vent located at 2100 m a.s.l.
Journal ArticleDOI

Multi-scale measures of rugosity, slope and aspect from benthic stereo image reconstructions.

TL;DR: This paper presents a new method for calculating rugosity in a Delaunay triangulated surface mesh by projecting areas onto the plane of best fit using Principal Component Analysis (PCA), and thoroughly validates it against traditional in-situ measurements.
Journal ArticleDOI

Arbitrary-Oriented Ship Detection Framework in Optical Remote-Sensing Images

TL;DR: In this letter, an effective ship detection framework in remote-sensing images based on the convolutional neural network is proposed and designed to predict bounding box of ship with orientation angle information.
Journal ArticleDOI

Rapid Delaunay triangulation for randomly distributed point cloud data using adaptive Hilbert curve

TL;DR: The experimental results show that the efficiency of Delaunay triangulation by the adaptive Hilbert curve insertion algorithm can be improved significantly for both uniformly and non-uniformly distributed point cloud data, compared with CGAL, regular grid insertion and multi-grid insertion algorithms.
Journal ArticleDOI

Regulated tissue fluidity steers zebrafish body elongation

TL;DR: Modeling and additional data analyses suggest that the balance between the coherence and rate of cell flow determines whether body elongation is linear or whether congestion forms within the flow and the body axis becomes contorted.
References
More filters
Book

Computational geometry

Proceedings ArticleDOI

Closest-point problems

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.