An experimental study of point location in planar arrangements in CGAL

DOI10.1145/1412228.1412237zbMath1284.68634OpenAlexW1973106653MaRDI QIDQ5406190

Idit Haran, Dan Halperin

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1412228.1412237

zbMATH Keywords

arrangementscomputational geometrypoint locationgeneric programmingCGAL

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Practical distribution-sensitive point location in triangulations

Uses Software

• 2D Arrangement
• 2D triangulations