CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES

DOI10.1142/S0218195904001482zbMath1084.68133MaRDI QIDQ4824660

Eran Leiserowitz, Dan Halperin

Publication date: 1 November 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

robustness

Mathematics Subject Classification ID

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

Related Items (6)

PLANAR SHAPE MANIPULATION USING APPROXIMATE GEOMETRIC PRIMITIVES ⋮ An intersection-sensitive algorithm for snap rounding ⋮ DELAUNAY STABILITY VIA PERTURBATIONS ⋮ Certifying algorithms ⋮ A general approach to the analysis of controlled perturbation algorithms ⋮ Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order

Uses Software

• CGAL

Cites Work

• Towards exact geometric computation
• Verifiable implementations of geometric algorithms using finite precision arithmetic
• 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
• Practical segment intersection with finite precision output
• EXACT GEOMETRIC COMPUTATION USING CASCADING
• Interval arithmetic yields efficient dynamic filters for computational geometry

This page was built for publication: CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES