| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
Delaunay Stability via Perturbations
Abstract : We present an algorithm that takes as input a finite point set in Rm , and performs a perturbation that guarantees that the Delaunay triangulation of the resulting perturbed point set has quantifiable stability with respect to the metric and the point positions. There is also a guarantee on the quality of the simplices: they cannot be too flat. The algorithm provides an alternative tool to the weighting or refinement methods to remove poorly shaped simplices in Delaunay triangulations of arbitrary dimension, but in addition it provides a guarantee of stability for the resulting triangulation.
Cited literature [13 references]
https://hal.inria.fr/hal-01097086
Contributor : Jean-Daniel Boissonnat <>
Submitted on : Thursday, December 18, 2014 - 5:35:05 PM
Last modification on : Tuesday, April 30, 2019 - 5:14:02 PM
Long-term archiving on: : Monday, March 23, 2015 - 5:28:00 PM
Contributor : Jean-Daniel Boissonnat <>
Submitted on : Thursday, December 18, 2014 - 5:35:05 PM
Last modification on : Tuesday, April 30, 2019 - 5:14:02 PM
Long-term archiving on: : Monday, March 23, 2015 - 5:28:00 PM
Files
flat_pert.pdf
Files produced by the author(s)