TY - GEN
T1 - Query-sensitive ray shooting
AU - Mitchell, Joseph S.B.
AU - Mount, David M.
AU - Suri, Subhash
PY - 1994
Y1 - 1994
N2 - Ray shooting is the problem of determining the first intersection of a ray with a set of obstacles. In this paper, a fully general algorithm is presented for the ray shooting problem, whose performance is not described as a function of input, but rather as a function of the complexity of a query with respect to an intrinsic parameter of the input. This parameter is called the simple cover complexity. A generalization of ray shooting, called directed segment shooting is focused in the paper.
AB - Ray shooting is the problem of determining the first intersection of a ray with a set of obstacles. In this paper, a fully general algorithm is presented for the ray shooting problem, whose performance is not described as a function of input, but rather as a function of the complexity of a query with respect to an intrinsic parameter of the input. This parameter is called the simple cover complexity. A generalization of ray shooting, called directed segment shooting is focused in the paper.
UR - https://www.scopus.com/pages/publications/0027969695
U2 - 10.1145/177424.178094
DO - 10.1145/177424.178094
M3 - Conference contribution
AN - SCOPUS:0027969695
SN - 0897916484
SN - 9780897916486
T3 - Proceedings of the Annual Symposium on Computational Geometry
SP - 359
EP - 368
BT - Proceedings of the Annual Symposium on Computational Geometry
PB - Publ by ACM
T2 - Proceedings of the 10th Annual Symposium on Computational Geometry
Y2 - 6 June 1994 through 8 June 1994
ER -