CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES
From MaRDI portal
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
- A perturbation scheme for spherical arrangements with application to molecular modeling
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs
- EXACT GEOMETRIC COMPUTATION USING CASCADING
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Practical segment intersection with finite precision output
- Towards exact geometric computation
- Verifiable implementations of geometric algorithms using finite precision arithmetic
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
- A general approach to the analysis of controlled perturbation algorithms
- Controlled perturbation for arrangements of circles
- Delaunay stability via perturbations
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)
