Reporting curve segment intersections using restricted predicates

DOI10.1016/S0925-7721(00)00012-2zbMath0957.68090OpenAlexW2048246906WikidataQ128109078 ScholiaQ128109078MaRDI QIDQ1581057

Timothy M. Chan

Publication date: 25 March 2001

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(00)00012-2

zbMATH Keywords

segment-tree method

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Optimal and suboptimal robust algorithms for proximity graphs ⋮ Computing the Implicit Voronoi Diagram in Triple Precision ⋮ An elementary algorithm for reporting intersections of red/blue curve segments ⋮ An exact and efficient approach for computing a cell in an arrangement of quadrics ⋮ Reporting intersections among thick objects.

This page was built for publication: Reporting curve segment intersections using restricted predicates