论文信息 - Analysis and construction of worst-case optimal ray shooting algorithms

Analysis and construction of worst-case optimal ray shooting algorithms

Abstract This paper examines the lower-bounds of worst-case complexity measures of ray-shooting algorithms. It demonstrates that ray-shooting requires at least logarithmic time and discusses the strategies of how to design such optimal algorithms. It also examines the lower-bounds of storage complexity of logarithmic-time algorithms and concludes that logarithmic time has a very high price in terms of required storage.

László Szirmay-Kalos | Gábor Márton

[1] Andrew S. Glassner,et al. An introduction to ray tracing , 1989 .

[2] Kenneth L. Clarkson,et al. Applications of random sampling in computational geometry, II , 1988, SCG '88.

[3] Edward M. Reingold,et al. On the Optimality of Some Set Algorithms , 1972, JACM.

[4] Richard J. Lipton,et al. On the Complexity of Computations under Varying Sets of Primitives , 1975, J. Comput. Syst. Sci..

[5] Kenneth L. Clarkson,et al. New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..

[6] Joseph O'Rourke,et al. Arrangements of lines in 3-space: a data structure with applications , 1988, SCG '88.

[7] Marco Pellegrini. Ray-shooting and Isotopy Classes of Lines in 3-Dimensional Space , 1991, WADS.

[8] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[9] J. Michael Steele,et al. Lower Bounds for Algebraic Decision Trees , 1982, J. Algorithms.

[10] Leonidas J. Guibas,et al. Lines in space - combinatorics, algorithms and applications , 1989, Symposium on the Theory of Computing.