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

Tomo-PIV measurement of flow around an arbitrarily moving body with surface reconstruction

TL;DR: In this article, a 3D surface of an arbitrarily moving body in a flow field was reconstructed using the DAISY descriptor and epipolar geometry constraints using tomographic PIV flow measurement.

Tetrahedral mesh generation with good dihedral angles using point lattices

TL;DR: Two tetrahedral mesh generation algorithms are developed that, for the first time, come with meaningful guarantees on the quality of the elements, and are guaranteed by computer-assisted proofs.
Journal ArticleDOI

Incremental Road Network Generation Based on Vehicle Trajectories

TL;DR: Experiments show that this method can build the road network from scratch and refine it with the input data continuously and the accuracy and timeliness of the extracted road network can continuously be improved with the growth of real-time trajectory data.
Journal ArticleDOI

High-Precision 3D Reconstruction for Small-to-Medium-Sized Objects Utilizing Line-Structured Light Scanning: A Review

Cui Bin, +2 more
- 06 Nov 2021 - 
TL;DR: A review of approaches, algorithms, and techniques for high-precision 3D reconstruction utilizing line-structured light scanning, which is analyzed from a deeper perspective of elementary details, is lacking as discussed by the authors.
Journal ArticleDOI

Delaunay partitioning in three dimensions and semiconductor models

TL;DR: In this article, an algorithm for Delaunay partitioning in three dimensions is given, and its use in numerical semiconductor models is examined, in particular, tetrahedral elements are found to be compatible with the Scharfetter Gummel discretization of the stationary continuity equations associated with such models, using the Voronoi cross-sections for each edge in the obtained network.
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.