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

On the prediction of persistent processes using the output of deterministic models.

TL;DR: In this paper, the authors apply the well-established Bayesian processor of forecasts (BPF) for forecasting hydroclimatic variables using stochastic models through coupling them with GCMs.
Proceedings ArticleDOI

SimpleRecon: 3D Reconstruction Without 3D Convolutions

TL;DR: This work proposes a simple state-of-the-art multi-view depth estimator with two main contributions: a carefully-designed 2D CNN which utilizes strong image priors alongside a plane-sweep feature volume and geometric losses, combined with the integration of keyframe and geometric metadata into the cost volume which allows informed depth plane scoring.
Journal ArticleDOI

Three-dimensional point cloud registration by matching surface features with relaxation labeling method

TL;DR: In this article, a robust polygon surface feature-matching method is proposed to automatically obtain the initial orientation and mismatch estimates for each overlapped data set, using both simulated and measured experimental data to quantify the performance of the method.
Journal ArticleDOI

Recursive Learning for Sparse Markov Models

TL;DR: A recursive computation scheme based on Delaunay triangulation of the parameter space is introduced to enable fast approximation of the posterior mode partition and it is shown that this approach is both considerably faster and leads on average to a more accurate estimate of the underlying partition.
Journal ArticleDOI

An efficient three-dimensional adaptive quasicontinuum method using variable-node elements

TL;DR: A new quasicontinuum (QC) implementation using the so-called ''variable-node finite elements'' is reported in this work, enabling an effective adaptive mesh refinement in QC, leading to fast and efficient simulations compared with the conventional QC.
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.