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
Book

Progress in pattern recognition, image analysis and applications : 9th Iberoamerican Congress on Pattern Recognition, CIARP 2004, Puebla, Mexico, October 26-29, 2004 : proceedings

TL;DR: Adaptive Color Model for Figure-Ground Segmentation in Dynamic Environments and Radiance Function Estimation for Object Classification for Food Technology: The Desired Correlation.
Journal ArticleDOI

Localization in Unstructured Environments: Towards Autonomous Robots in Forests with Delaunay Triangulation

TL;DR: In this article, a topology-based method is proposed to match local point clouds to a global tree map using the Delaunay triangularization as the representation format, which is used to estimate the position of the robot.
Journal ArticleDOI

An efficient computational procedure for the dynamic analysis of liquid storage tanks

TL;DR: In this paper, a computationally efficient numerical model for evaluating the dynamic behavior of liquid storage tanks is developed, where the liquid is assumed to be inviscid, incompressible and irrotational, and its motion is completely characterized by a velocity potential function.
Journal ArticleDOI

The three main steps of the Marrakech High Atlas building in Morocco: Structural evidences from the southern foreland, Imini area

TL;DR: In this paper, the authors proposed a coherent chronology of deformation in the High Atlas of Morocco that proceeded in three stages: (i) a Late Eocene event that set local and minor structures, barely visible nowadays, but important enough to trigger the record of a first detrital pulse; (ii) an Early(?)-Middle Miocene event, that is not related to important shortening, setting gravity “sheets” that provoke cover deformation and feed a second deformation.
Posted Content

On New Approaches of Maximum Weighted Target Coverage and Sensor Connectivity: Hardness and Approximation

TL;DR: In this article, an approximation algorithm, termed the weighted-maximum-coverage-based algorithm (WMCBA), is proposed for the subproblem of the MWTCSCLMS problem.
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.