Computing multidimensional Delaunay tessellations

Authors:
Pierre A. Devijver;Michel Dekesel
Affiliations:
Philips Research Laboratory, Avenue Em. van Becelaere 2, Box 8, B-1170 Brussels, Belgium;Philips Research Laboratory, Avenue Em. van Becelaere 2, Box 8, B-1170 Brussels, Belgium
Venue:
Pattern Recognition Letters
Year:
1983

Citing 3
Cited 1

Medial Axis Transformation of a Planar Shape

IEEE Transactions on Pattern Analysis and Machine Intelligence
Mosaic Models for Textures

IEEE Transactions on Pattern Analysis and Machine Intelligence
Insert and delete algorithms for maintaining dynamic Delaunay triangulations

Pattern Recognition Letters

Estimation, learning, and adaptation: systems that improve with use

SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition

Quantified Score

Hi-index	0.10

Visualization

Abstract

We recall some properties of Voronoi and Delaunay tessellations in any numbers of dimensions. We then propose a solution to the following problem: Given the Delaunay tessellation of nd-dimensional data points X"1,..., X"n, the proble is to insert a new data point X and to update the tessellation accordingly. The solution proposed achieves minimum space-complexity.