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

Soil Erosion Caused by Snow Avalanches: a Case Study in the Aosta Valley

TL;DR: In this paper, the authors monitored a channeled avalanche path in the Aosta Valley of NW Italy in order to assess the contribution of avalanche debris to the formation of soils in the runout zone.
Proceedings ArticleDOI

A Genetic Algorithm enhanced with Fuzzy-Logic for multi-objective Unmanned Aircraft Vehicle path planning missions*

TL;DR: A novel Genetic Algorithm enhanced with Fuzzy Logic (GAF) is developed for solving the UAV multi-objective path planning problem and aims to find an optimal path with respect to contradicted objective terms, such as distance, energy efficiency and path’s curvature.
Journal ArticleDOI

A nodal‐based evolutionary optimization algorithm for frame structures

TL;DR: In this article , a nodal-based evolutionary design optimization algorithm was proposed to design frame structures whose edges are the Delaunay triangulation of homogeneously distributed nodes in the design domain.
Proceedings ArticleDOI

Elliptical Slice Sampling for Probabilistic Verification of Stochastic Systems with Signal Temporal Logic Specifications

TL;DR: A method for probabilistic verification of linearizable systems with Gaussian and Gaussian mixture noise models (e.g. from perception modules, machine learning components) using a Markov Chain Monte-Carlo slice sampler.
Journal ArticleDOI

An efficient dichotomizing interpolation algorithm for the refinement of TIN-based terrain surface from contour maps

TL;DR: This paper investigates commonly-used processes for eliminating PSTs and puts forward a new algorithm, referred to as 'dichotomizing' interpolation algorithm, to achieve a higher efficiency than from the conventional 'skeleton' extraction algorithm.
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.