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

Robust road marking detection using convex grouping method in around-view monitoring system

TL;DR: An algorithm which can robustly detect non-lane road markings on AVM images is proposed and a difference-of-Gaussian based method for extracting a connected component set, followed by a novel grouping method for grouping connected components based on convexity condition is proposed.
Journal ArticleDOI

Flow simulation considering adsorption boundary layer based on digital rock and finite element method

TL;DR: In this article, the effect of adaption boundary layer (ABL) on fluid flow in throats was investigated based on the digital rock method and microscopic pore structures were extracted with watershed segmentation and pore geometries were meshed through Delaunay triangulation approach.
Book ChapterDOI

BOR$$^$$G: Building Optimal Regularised Reconstructions with GPUs (in Cubes)

TL;DR: This paper proposes a method to execute the optimisation and regularisation in a 3D volume which has been only partially observed and thereby avoiding inappropriate interpolation and extrapolation and offers empirical analysis of the precision of the reconstructions.
Journal ArticleDOI

Multiple obnoxious facilities location: A cooperative model

TL;DR: An innovative, specially designed Voronoi-based heuristic produced much better results in a small fraction of the run time, and in many cases, nuisance is cut by more than half, and run time is more than a hundred times faster.
Journal ArticleDOI

A Co-Point Mapping-Based Approach to Drivable Area Detection for Self-Driving Cars

TL;DR: A new concept called co-point mapping, which is a bijection that maps points from the LIDAR scanner to points on the edge of the image segmentation, is introduced in the proposed method and yields a state-of-art performance when tested on the ROAD-KITTI benchmark.
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.