Geometric nonrobustness is a problem wherein branching decisions in computational geometry algorithms are based on approximate numerical computations.

INTRODUCTION. Nonrobustness refers to qualitative or catastrophic failures in geometric algorithms arising from numerical errors.

INTRODUCTION. Nonrobustness refers to qualitative or catastrophic failures in geometric algorithms arising from numerical errors.

Computational geometry develops algorithms for geometry and topology problems. The algorithms assume that arithmetic operations have.

An interactive exploration of numeric robustness issues based on Robust Arithmetic Notes by Mikola Lysenko + demo of robust-predicates.

Apr 15, 2013 · There are two types of geometric calculations, or primitives, found in geometric algorithms: predicates, which make a two-way or three-way ...

Geometric algorithms characterize the combinatorial structure by numerically computing the discrete relations (that are embodied in geometric predicates) ...

I've produced algorithms and implementations for performing the 2D and 3D orientation and incircle tests correctly and reasonably quickly.

Homepage for book: Robust Geometric Computation (tentative title) by Kurt Mehlhorn and Chee Yap. This is a draft of a book under preparation.

We give examples that make the algorithms fail in many different ways. We also show how to construct such examples systematically and discuss the geometry of ...