Efficient algorithms for line and curve segment intersection using restricted predicates
From MaRDI portal
Publication:1567304
DOI10.1016/S0925-7721(99)00057-7zbMath0958.68175OpenAlexW2216891925MaRDI QIDQ1567304
Jean-Daniel Boissonnat, Jack Scott Snoeyink
Publication date: 9 April 2001
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(99)00057-7
Related Items (7)
Optimal and suboptimal robust algorithms for proximity graphs ⋮ Line-segment intersection made in-place ⋮ Ham-sandwich cuts for abstract order types ⋮ Moving coins ⋮ A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING ⋮ An elementary algorithm for reporting intersections of red/blue curve segments ⋮ Reporting intersections among thick objects.
Uses Software
This page was built for publication: Efficient algorithms for line and curve segment intersection using restricted predicates
