Segment intersection searching problems in general settings

DOI10.1007/S00454-003-2924-7zbMath1038.68040OpenAlexW2035626386MaRDI QIDQ1404529

Vladlen Koltun

Publication date: 21 August 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-003-2924-7

zbMATH Keywords

efficient data structuretriangular windowing problem

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (2)

On Ray Shooting for Triangles in 3-Space and Related Problems ⋮ EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA

This page was built for publication: Segment intersection searching problems in general settings