The nature and meaning of perturbations in geometric computing

DOI10.1007/PL00009330zbMath0892.68100OpenAlexW1971135470MaRDI QIDQ1380782

D. Massart

Publication date: 11 March 1998

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009330

zbMATH Keywords

perturbationsgeometric degeneracy

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (19)

Solving the minimum convex partition of point sets with integer programming ⋮ How good are convex hull algorithms? ⋮ Linear perturbation methods for topologically consistent representations of free-form surface intersections ⋮ ON DELETION IN DELAUNAY TRIANGULATIONS ⋮ On geometric optimization with few violated constraints ⋮ Analytical aspects of tie breaking ⋮ Perturbations for Delaunay and weighted Delaunay 3D triangulations ⋮ Exact and heuristic solutions for the prize‐collecting geometric enclosure problem ⋮ Counting hexagonal patches and independent sets in circle graphs ⋮ A general approach to the analysis of controlled perturbation algorithms ⋮ Exact, robust, and efficient regularized Booleans on general 3D meshes ⋮ Preferred directions for resolving the non-uniqueness of Delaunay triangulations ⋮ A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters ⋮ A perturbation scheme for spherical arrangements with application to molecular modeling ⋮ THE ANCHORED VORONOI DIAGRAM: STATIC, DYNAMIC VERSIONS AND APPLICATIONS ⋮ Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time ⋮ The predicates of the Apollonius diagram: algorithmic analysis and implementation ⋮ Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended ⋮ The higher-order Voronoi diagram of line segments

This page was built for publication: The nature and meaning of perturbations in geometric computing