Reliable and Efficient Computational Geometry Via Controlled Perturbation
From MaRDI portal
Publication:3613768
DOI10.1007/11786986_27zbMath1183.68671OpenAlexW1956324564MaRDI QIDQ3613768
Ralf Osbild, Kurt Mehlhorn, Michael Sagraloff
Publication date: 12 March 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11786986_27
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (7)
A general approach to the analysis of controlled perturbation algorithms ⋮ Exact Fast Parallel Intersection of Large 3-D Triangular Meshes ⋮ Combinatorial properties of support vectors of separating hyperplanes ⋮ Out-of-order event processing in kinetic data structures ⋮ Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order ⋮ Building Mathematics-Based Software Systems to Advance Science and Create Knowledge ⋮ Of What Use Is Floating-Point Arithmetic in Computational Geometry?
Uses Software
This page was built for publication: Reliable and Efficient Computational Geometry Via Controlled Perturbation
