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

Processing Group Reverse kNN in Spatial Databases

TL;DR: The proposed Group Reverse kNN algorithm will find a specific region based on multiple query objects that will always consider all of the query objects as the nearest compare to the non-query objects.
Journal Article

Study on the Reconstruction of 3D Temperature Field in Furnaces Based on Visual C++6.0 and Opengl

TL;DR: Based on ultrasonic pyrometry, an algorithm is proposed to reconstruct 3D temperature field of furnace flame in this paper, and according to characteristics of discrete temperature points, a method for tracing isotherms and isothermal surfaces in temperature field is also designed.
Journal ArticleDOI

High-Fidelity Depth Upsampling Using the Self-Learning Framework.

TL;DR: Li et al. as mentioned in this paper proposed a self-learning framework to estimate the reliability of the upsampled depth map without human-labeled annotation, which can produce a clear and high-fidelity dense depth map that preserves the shape of object structures well.
Journal ArticleDOI

Triangulation Based on 3D Reconstruction Technique

TL;DR: The Combination of the incremental method and divide algorithm is proposed, which directly realize the triangulation of scattered points in space, which eventually meet the triangular mesh model of the reconstruction and the mesh is very uniform.
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.