On vertical ray shooting in arrangements

DOI10.1016/0925-7721(93)90024-ZzbMath0778.68091OpenAlexW2040685023MaRDI QIDQ1803272

Ji{ří} Matoušek

Publication date: 29 June 1993

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

Full work available at URL: https://doi.org/10.1016/0925-7721(93)90024-z

zbMATH Keywords

arrangementpoint locationpreprocessing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (3)

Iterated nearest neighbors and finding minimal polytopes ⋮ On ray shooting in convex polytopes ⋮ On the sum of squares of cell complexities in hyperplane arrangements

Cites Work

• Unnamed Item
• A deterministic view of random sampling and its use in geometry
• Cutting hyperplanes for divide-and-conquer
• Efficient ray shooting and hidden surface removal
• New applications of random sampling in computational geometry

This page was built for publication: On vertical ray shooting in arrangements