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

BatTri: A two-dimensional bathymetry-based unstructured triangular grid generator for finite element circulation modeling

TL;DR: Matlab public-domain two-dimensional mesh generation package BatTri is easily upgradeable to meet the future demands by the addition of new grid generation algorithms and Delaunay refinement schemes as they are made available.
Proceedings ArticleDOI

Pain recognition using spatiotemporal oriented energy of facial muscles

TL;DR: The proposed system employs steerable and separable filters to measures energies released by the facial muscles during the pain process and not only detects the pain but recognizes its level.
Journal ArticleDOI

Application of the fast marching method for outdoor motion planning in robotics

TL;DR: This algorithm is useful for calculating paths for climbing robots in much more complex environments and can also be used for robot avoidance when two robots approach each other, and they know each other's position.
Book ChapterDOI

Early Experiences with Olden

TL;DR: This paper reports on the implementation of a new technique for the SPMD parallelization of programs that use dynamic data structures, called Olden, and presents some early performance results from a series of non-trivial benchmarks.
Proceedings ArticleDOI

To Detect or not to Detect: The Right Faces to Morph

TL;DR: This work extensively study the face morphing attack detection performance generalization over variations in morphing approaches, image re-digitization, and image source variations by building a novel database with three different pairing protocols and two different morphed approaches.
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.