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

No abstract is available for this paper.

• Publication year

  2005

• Venue

  ACM-SIAM Symposium on Discrete Algorithms

• Publication date

  2005-01-23

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Geometric Range Searching and Its Relatives

  2007cited by this paper
• Dynamic half-space range reporting and its applications

  2005cited by this paper
• Ray shooting and stone throwing with near-linear storage

  2005cited by this paper
• 3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations

  2003cited by this paper
• Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations

  2002cited by this paper
• Efficiently Approximating Polygonal Paths in Three and Higher Dimensions

  2001cited by this paper
• Almost tight upper bounds for vertical decompositions in four dimensions

  2001cited by this paper
• Ray Shooting Amidst Spheres in Three Dimensions and Related Problems

  1997cited by this paper
• Davenport-Schinzel sequences and their geometric applications

  1995cited by this paper
• Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications

  1995cited by this paper
• On range searching with semialgebraic sets

  1994cited by this paper
• Computing envelopes in four dimensions with applications

  1994cited by this paper
• Almost tight upper bounds for lower envelopes in higher dimensions

  1993cited by this paper
• Reporting Points in Halfspaces

  1992cited by this paper
• Ray shooting and parametric search

  1992cited by this paper
• A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications

  1991cited by this paper
• Efficient partition trees

  1991influential reference
• Applications of a new space-partitioning technique

  1991cited by this paper
• A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications

  1989cited by this paper
• A deterministic view of random sampling and its use in geometry

  1988cited by this paper
• Algorithms in Combinatorial Geometry

  1987cited by this paper

• A Simple Framework for the Generalized Nearest Neighbor Problem

  2012cites this paper
• Partially Specified Nearest Neighbor Search

  2012cites this paper
• Computing and Combinatorics

  2012influential citation
• Range searching: emptiness, reporting, and approximate counting

  2011cites this paper
• Approximate Halfspace Range Counting

  2010cites this paper
• Semialgebraic Range Reporting and Emptiness Searching with Applications

  2009cites this paper
• Non-orthogonal Range Searching : A Review Technical Report No . 2008-546

  2008cites this paper
• Non-orthogonal Range Searching: A Review

  2008cites this paper
• Non-orthogonal Range Searching

  2007cites this paper
• Relative ε-Approximations in Geometry ∗

  2006cites this paper
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space

  2006cites this paper
• Ray shooting amidst fat convex polyhedra in 3-space

  2006cites this paper
• Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting

  2006cites this paper
• Extremal point queries with lines and line segments and related problems

  2005cites this paper
• Algorithms for Fat Objects: Decompositions and Applications

  2004cites this paper