On Ray Shooting for Triangles in 3-Space and Related Problems

02/15/2021
by   Esther Ezra, et al.
0

We consider several problems that involve lines in three dimensions, and present improved algorithms for solving them. The problems include (i) ray shooting amid triangles in R^3, (ii) reporting intersections between query lines (segments, or rays) and input triangles, as well as approximately counting the number of such intersections, (iii) computing the intersection of two nonconvex polyhedra, (iv) detecting, counting, or reporting intersections in a set of lines in R^3, and (v) output-sensitive construction of an arrangement of triangles in three dimensions. Our approach is based on the polynomial partitioning technique. For example, our ray-shooting algorithm processes a set of n triangles in R^3 into a data structure for answering ray shooting queries amid the given triangles, which uses O(n^3/2+ε) storage and preprocessing, and answers a query in O(n^1/2+ε) time, for any ε>0. This is a significant improvement over known results, obtained more than 25 years ago, in which, with this amount of storage, the query time bound is roughly n^5/8. The algorithms for the other problems have similar performance bounds, with similar improvements over previous results. We also derive a nontrivial improved tradeoff between storage and query time. Using it, we obtain algorithms that answer m queries on n objects in max{ O(m^2/3n^5/6+ε + n^1+ε), O(m^5/6+εn^2/3 + m^1+ε) } time, for any ε>0, again an improvement over the earlier bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/19/2022

Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems

Let 𝒯 be a set of n planar semi-algebraic regions in ℝ^3 of constant com...
research
08/13/2022

Intersection Searching amid Tetrahedra in Four Dimensions

We develop data structures for intersection queries in four dimensions t...
research
02/25/2020

Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments

In this paper, we first consider the subpath convex hull query problem: ...
research
02/25/2019

Dynamic Maintenance of the Lower Envelope of Pseudo-Lines

We present a fully dynamic data structure for the maintenance of lower e...
research
03/20/2019

Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead

We present efficient data structures for problems on unit discs and arcs...
research
02/22/2023

Lower Bounds for Intersection Reporting among Flat Objects

Recently, Ezra and Sharir [ES22a] showed an O(n^3/2+σ) space and O(n^1/2...
research
07/09/2022

Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions

Let two static sequences of strings P and S, representing prefix and suf...

Please sign up or login with your details

Forgot password? Click here to reset