CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES
From MaRDI portal
Publication:4824660
DOI10.1142/S0218195904001482zbMATH Open1084.68133MaRDI QIDQ4824660FDOQ4824660
Authors: Eran Leiserowitz, Dan Halperin 
Publication date: 1 November 2004
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Recommendations
- Controlled perturbation for arrangements of circles
- Controlled perturbation for Delaunay triangulations
- A general approach to the analysis of controlled perturbation algorithms
- Reliable and Efficient Computational Geometry Via Controlled Perturbation
- Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order
Cites Work
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- EXACT GEOMETRIC COMPUTATION USING CASCADING
- Verifiable implementations of geometric algorithms using finite precision arithmetic
- A perturbation scheme for spherical arrangements with application to molecular modeling
- Towards exact geometric computation
- Practical segment intersection with finite precision output
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs
Cited In (7)
- An intersection-sensitive algorithm for snap rounding
- Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order
- Planar shape manipulation using approximate geometric primitives
- Certifying algorithms
- Controlled perturbation for arrangements of circles
- A general approach to the analysis of controlled perturbation algorithms
- Delaunay stability via perturbations
Uses Software
This page was built for publication: CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4824660)
