Fast, robust predicates for geometric algorithms
summary
Describes a C++ template metaprogramming library that implements fast, robust floating-point geometric predicates (e.g., 2D/3D orientation tests) used in algorithms like geospatial queries and Delaunay triangulation. Explains how the implementation guarantees correct predicate results despite round-off errors while avoiding large performance penalties.
AI-written summary · about
related talks
58mPortable floating-point calculations
16mGeometry Types for Graphics Programming
14mFPL: Fast Presburger Arithmetic through Transprecision
52mConcepts: The Future of Generic Programming
15mSealing Pointer-Based Optimizations Behind Pure Functions
06mProjections
54mGeneric Programming Without (Writing Your Own) Templates
51mSimple, Extensible Pattern Matching in C++14