Controlled perturbation for Delaunay triangulations
From MaRDI portal
Publication:2921776
zbMATH Open1297.68240MaRDI QIDQ2921776FDOQ2921776
Authors: Stefan Funke, C. Klein, K. Mehlhorn, Susanne Schmitt 
Publication date: 13 October 2014
Recommendations
- Reliable and Efficient Computational Geometry Via Controlled Perturbation
- Reliable and Efficient Geometric Computing
- A general approach to the analysis of controlled perturbation algorithms
- NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS
- Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic
convex hullsDelaunay triangulationsrandomized incremental constructioncontrolled perturbationrandomized incremental algorithmfloating point computation
Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (16)
- Out-of-order event processing in kinetic data structures
- Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order
- Of What Use Is Floating-Point Arithmetic in Computational Geometry?
- CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES
- A generalized Delaunay triangulation algorithm with adaptive grid size control
- FARAWAY POINT: A SENTINEL POINT FOR DELAUNAY COMPUTATION
- Title not available (Why is that?)
- Controlled perturbation for arrangements of circles
- Classroom examples of robustness problems in geometric computations
- A general approach to the analysis of controlled perturbation algorithms
- Delaunay stability via perturbations
- A probabilistic approach to reducing algebraic complexity of Delaunay triangulations
- Reliable and Efficient Geometric Computing
- Analytical aspects of tie breaking
- Crushing disks efficiently
- Anisotropic triangulations via discrete Riemannian Voronoi diagrams
This page was built for publication: Controlled perturbation for Delaunay triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921776)
