scientific article; zbMATH DE number 437529

MaRDI QIDQ3140401zbMATH OpenFDO

Authors John Hershberger, Subhash Suri

Publication date 4 December 1994

zbMATH Keywords

data structurequery algorithmray shootingsimple polygonSteiner triangulation

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Recommendations

• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
• scientific article; zbMATH DE number 176772
• Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
• Ray shooting in polygons using geodesic triangulations
• Ray Shooting Amidst Convex Polygons in 2D

Cited in

(13)

• On range searching with semialgebraic sets
• Ray shooting in polygons using geodesic triangulations
• Distance measures on intersecting objects and their applications
• Rectilinear decompositions with low stabbing number
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• Efficient visibility queries in simple polygons
• Computing depth orders for fat objects and related problems
• scientific article; zbMATH DE number 176772 (Why is no real title available?)
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
• Computing depth orders and related problems
• Computing a shortest watchman path in a simple polygon in polynomial-time
• Rectangulating rectilinear polygons in parallel
• An optimal algorithm for the boundary of a cell in a union of rays

This page was built for publication:

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