Lower bounds for intersection reporting among flat objects

DOI10.4230/LIPICS.SOCG.2023.3MaRDI QIDQ6620489zbMATH OpenFDO

Authors Peyman Afshani, Pingan Cheng

Publication date 16 October 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2023.3

zbMATH Keywords

computational geometrydata structure lower boundsintersection searching

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On ray shooting for triangles in 3-space and related problems
• Lower bounds for intersection searching and fractional cascading in higher dimension
• Lower bounds for intersection searching and fractional cascading in higher dimension
• Improved pointer machine and I/O lower bounds for simplex range reporting and related problems

Cited in

(3)

• Intersection queries for flat semi-algebraic objects in three dimensions and related problems
• Intersection searching amid tetrahedra in four dimensions
• Line intersection searching amid unit balls in 3-space

This page was built for publication: Lower bounds for intersection reporting among flat objects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6620489)