Improved Bounds for Orthogonal Point Enclosure Query and Point Location in Orthogonal Subdivisions in ℝ3
Saladi Rahul · 2014
In this paper, new results for two fundamental problems in the field of computational geometry are presented: orthogonal point enclosure query (OPEQ) in ℝ3 and point location in orthogonal subdivisions in ℝ3. All the results are in the pointer machine model of computation.