Reproduce “Indirect predicates for geometric constructions” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Marco Attene

Marco Attene from CNR-IMATI developed indirect geometric predicates to robustly and efficiently manage intermediate geometric constructions within computational geometry algorithms. This method significantly outperforms existing lazy exact kernel approaches, achieving up to 11.7 times faster execution and requiring up to 3.5 times less memory for algorithms that generate and use these constructions.

Key insights

  • By modeling intermediate constructions symbolically as polynomial fractions of original inputs, the robustness of arithmetic filtering can be extended to these constructions without explicitly computing their approximate floating-point coordinates.
  • The cascaded evaluation model prioritizes fast, approximate arithmetic, falling back to progressively more precise (and slower) methods only when necessary, thus balancing efficiency and guaranteed correctness.
  • A caching strategy for floating-point and interval arithmetic models significantly improves performance by reducing redundant computations of implicit point components.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.