Ray shooting amid balls, farthest point from a line, and range emptiness searching

MaRDI QIDQ2921709zbMATH OpenFDO

Authors Hayim Shaul, Micha Sharir

Publication date 13 October 2014

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
• Ray shooting from convex ranges
• Ray Shooting and Parametric Search
• scientific article; zbMATH DE number 1182925
• Shooting randomly against a line in Euclidean and non-Euclidean spaces
• scientific article; zbMATH DE number 437551
• Ray Shooting Amidst Convex Polygons in 2D
• On vertical ray shooting in arrangements
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• Shooting permanent rays among disjoint polygons in the plane

Cited in

(3)

• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
• Relative (p, )-approximations in geometry
• Extremal point queries with lines and line segments and related problems

This page was built for publication: Ray shooting amid balls, farthest point from a line, and range emptiness searching

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