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
Book ChapterDOI

3D Image Segmentation and Cylinder Recognition for Composite Materials

TL;DR: A mathematical method exploiting tomographic data to determine carbon localization with a Markov Random Field segmentation, identify carbon straight cylinders, and accurately determine fibers orientation is proposed.
Journal ArticleDOI

PCNDT-an electromagnetic finite element package for personal computers

TL;DR: The main emphasis throughout the package is on useful options, simplification of user input, and minimization of the time needed to define correctly a geometry for finite element analysis.
Journal ArticleDOI

High-Precision Registration of Lunar Global Mapping Products Based on Spherical Triangular Mesh

TL;DR: Zhang et al. as mentioned in this paper proposed a spherical triangular-mesh-based method for high-precision registration of lunar global mapping products, which involves four steps: data preprocessing, feature point extraction and matching, spherical Delaunay triangulation, and geometric correction with spherical barycentric coordinates.
Proceedings ArticleDOI

A Clustering-Based Obstacle Segmentation Approach for Urban Environments

TL;DR: This paper presents a method for the segmentation of general obstacles by stereo vision with no need of dense disparity maps or assumptions about the scenario, and shows satisfactory results in scenarios with different types of objects.
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.