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
Posted Content

KerGM: Kernelized Graph Matching

TL;DR: In this article, the entropy regularized Frank-Wolfe (EnFW) algorithm was proposed to solve the Lawler's QAP problem in reproducing kernel Hilbert spaces (RKHS).
Journal ArticleDOI

Electromagnetic induction sounding and 3D laser imaging in support of a Mars methane analogue mission

TL;DR: In this paper, an EMIS and a high-resolution triangulation-based 3D laser scanner were tested at the Jeffrey open-pit asbestos mine to identify and characterize geological environments favorable to the occurrence of methane.
Journal ArticleDOI

Infrared Imaging Spectroscopy Using Massively Multiplexed Slit-Based Techniques and Sub-Field Motion Correction

TL;DR: In this article, a co-spatial, 17 parallel-long-slit, grating-based spectrograph was used at the Dunn Solar Telescope in New Mexico, USA, that provides wide-field, rapid-scanning, high-resolution imaging spectroscopy of the neutral helium spectral triplet.
Journal ArticleDOI

Classifying ecosystems with metaproperties from terrestrial laser scanner data.

TL;DR: The results demonstrate the potential for metaproperty analysis to identify subtle and important ecosystem conditions, including diseases and anthropogenic disturbances, and can characterize regional heterogeneity.
Proceedings ArticleDOI

The Robust Canadian Traveler Problem Applied to Robot Routing

TL;DR: The RCTP framework is able to search for sub-optimal policy alternatives with significantly lower worst-case cost and less computational time compared to the optimal policy, but with little sacrifice on the expected cost.
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.