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
Proceedings ArticleDOI

Layout Style Modeling for Automating Banner Design

TL;DR: A novel style transfer technique is invented so that creating a multi-size style becomes as easy as designing a single banner, and a robust and easy-to-use layout style model is built, upon which the banner design is automated.
Journal ArticleDOI

Fast seismic horizon reconstruction based on local dip transformation

TL;DR: In this paper, the reconstruction domain is subdivided in quadrilateral domains which are determined from input points while the entire horizon is obtained part-by-part by juxtaposing independent partial reconstructions.
Journal ArticleDOI

Division-based analysis of symmetry and its application

TL;DR: A computational method, DAS, is proposed for symmetry analysis of a planar figure closed by a simply connected curve, consistently, based on the duality of two geometric plane divisions, the Delaunay triangulation and the Voronoi diagram.
Journal ArticleDOI

A broader view on jamming: from spring networks to circle packings.

TL;DR: This paper points out the paramount importance of the underlying contact network for jammed systems; the network must have one contact in excess of isostaticity and a finite bulk modulus.
Journal ArticleDOI

Connectivity enhancement due to film flow in porous media

TL;DR: In this paper, thin liquid films can interconnect different parts of a porous network and effectively enhance the overall connectivity of the system, allowing for the drainage of fluid clusters that otherwise would be entirely trapped in the matrix.
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.