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

An efficient sweep-line Delaunay triangulation algorithm

TL;DR: A new algorithm for constructing a 2D Delaunay triangulation is introduced, based on a sweep-line paradigm, which is combined with a local optimization criterion-a characteristic of incremental insertion algorithms.
Journal ArticleDOI

New morphometric measurements of craters and basins on Mercury and the Moon from MESSENGER and LRO altimetry and image data: An observational framework for evaluating models of peak-ring basin formation

TL;DR: In this paper, the morphometric properties of impact structures in the transition from complex craters with central peaks to peak-ring basins are measured using altimetry and image data from the MESSENGER and LRO spacecraft in orbit around Mercury and the Moon.
Journal ArticleDOI

A Lagrangian gradient smoothing method for solid‐flow problems using simplicial mesh

TL;DR: Both the theoretical analysis and the numerical testing results demonstrate that the proposed Lagrangian gradient smoothing method approach restores first‐order accuracy unconditionally and does not suffer from the tensile instability.
Journal ArticleDOI

Preserving Personalized Location Privacy in Ride-Hailing Service

TL;DR: This work proposes an enhanced scheme that allows a rider to specify his privacy preference and provides much better ride matching results that are close to the optimal solution, while preserving personalized location privacy for riders.
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.