Ray shooting and stone throwing with near-linear storage

DOI10.1016/j.comgeo.2004.10.001zbMath1070.65016OpenAlexW2015637097MaRDI QIDQ1776898

Hayim Shaul, Micha Sharir

Publication date: 12 May 2005

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

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.10.001

zbMATH Keywords

algorithmsData structuresParametric searchRange searchingRay shooting

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

PARABOLA SEPARATION QUERIES AND THEIR APPLICATION TO STONE THROWING ⋮ A research note on design of fair surfaces over irregular domains using data-dependent triangulation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Range searching with efficient hierarchical cuttings
• Visibility and intersection problems in plane geometry
• Reporting points in halfspaces
• Applications of a new space-partitioning technique
• Quasi-optimal upper bounds for simplex range searching and new zone theorems
• Ray shooting, depth orders and hidden surface removal
• On range searching with semialgebraic sets
• Efficient ray shooting and hidden surface removal
• Ray shooting in polygons using geodesic triangulations
• Lines in space: Combinatorics and algorithms
• Ray Shooting and Parametric Search
• Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
• Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
• Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions

This page was built for publication: Ray shooting and stone throwing with near-linear storage