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

Delaunay triangulation using a uniform grid

TL;DR: An algorithm for triangulating 2-D data points that is based on a uniform grid structure and a triangulation strategy that builds triangles in a circular fashion is discussed and two ways to compute the convex hull using the algorithm are presented.
Journal ArticleDOI

Problems with handling spatial data — the voronoi approach

TL;DR: In this article, the authors identify a variety of "awkward" problems, including interpolation, error estimation and dynamic polygon building and e.g., the problem of polygon construction.
Journal ArticleDOI

Potential Climate Change Effects on the Habitat of Antarctic Krill in the Weddell Quadrant of the Southern Ocean

TL;DR: It is suggested that future climate change could have a significant negative effect on Antarctic krill growth habitat and, consequently, on Southern Ocean biodiversity and ecosystem services.
Proceedings ArticleDOI

MorGAN: Recognition Vulnerability and Attack Detectability of Face Morphing Attacks Created by Generative Adversarial Network

TL;DR: A novel face morphing attacks database that contains 1000 morph images for both, the proposed MorGAN and landmark-based attacks, and vulnerability analysis of two face recognition approaches facing the proposed attacks.
Journal ArticleDOI

From the betweenness centrality in street networks to structural invariants in random planar graphs.

TL;DR: In this article, the authors demonstrate that the spatial distribution of betweenness centrality is invariant for planar networks, that are used to model many infrastructural and biological systems.
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.