Ray shooting and stone throwing with near-linear storage

Micha Sharir, Hayim Shaul

Research output: Contribution to journalArticlepeer-review

Abstract

The paper presents two algorithms involving shooting in three dimensions. We first present an algorithm for performing ray shooting amid several special classes of n triangles in three dimensions, including sets of fat triangles, and sets of triangles stabbed by a common line. In all these special cases, our technique requires near-linear preprocessing and storage, and answers a query in O(n2 /3+ε) time. This improves the best known result of O(n3 /4+ε) query time (with near-linear storage) for general triangles. The second algorithm handles stone-throwing amid arbitrary triangles in 3-space, where the curves along which we shoot are vertical parabolic arcs that are trajectories of stones thrown under gravity. We present an algorithm that answers stone-throwing queries in O(n3 /4+ε) time, using near linear storage and preprocessing. As far as we know, this is the first nontrivial solution of this problem. Several extensions of both algorithms are also presented.

Original languageEnglish
Pages (from-to)239-252
Number of pages14
JournalComputational Geometry: Theory and Applications
Volume30
Issue number3
DOIs
StatePublished - Mar 2005

Keywords

  • Data structures
  • Parametric search
  • Range searching
  • Ray shooting

Fingerprint

Dive into the research topics of 'Ray shooting and stone throwing with near-linear storage'. Together they form a unique fingerprint.

Cite this