Boris Aronov, Steven Fortune  Home/Search
Context Related
| uci.edu/~eppstein/...unerayshoot.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: uci.edu/~eppstein/pubs/notmine... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Consider an environment filled with polyhedral obstacles. The answer to a ray-shooting query is the first obstacle encountered by the ray. A simple way to answer ray-shooting queries is to triangulate space in a manner compatible with the obstacles, and then walk through the triangulation along the ray until the first obstacle is encountered. We suggest that the average walk length can be reduced by choosing a triangulation with weight (i.e., length in two dimensions or area in three... (Update)
Similar documents based on text: More All
0.2: Approximating Minimum-Weight Triangulations in Three Dimensions - Aronov, Fortune (1998) (Correct)
0.2: On Cell Complexities in Hyperplane Arrangements - Aronov, Sharir (2000) (Correct)
0.2: On the Number of Regular Vertices of the Union of Jordan .. - Aronov, Efrat.. (Correct)
Related documents from co-citation: More All
5: A pedestrian approach to ray shooting: Shoot a ray (context) - Hershberger, Suri - 1993
4: A data structuring technique (context) - Chazelle, Guibas et al. - 1986
4: Efficient binary space partitions for hidden-surface removal and solid modeling (context) - PATERSON, YAO - 1990
BibTeX entry: (Update)
B. Aronov and S. Fortune, Average-case ray shooting and minimum weight triangulation, in Proc. 13th ACM Symposium on Computational Geometry, 204-- 211, 1997. http://citeseer.ist.psu.edu/aronov97averagecase.html More
@inproceedings{ aronov97averagecase,
author = "Boris Aronov and Steven Fortune",
title = "Average-Case Ray Shooting and Minimum Weight Triangulations",
booktitle = "Symposium on Computational Geometry",
pages = "203-211",
year = "1997",
url = "citeseer.ist.psu.edu/aronov97averagecase.html" }
Citations (may not include all citations):481 Algorithms in Combinatorial Geometry (context) - Edelsbrunner - 1987
178 Cambridge University Press (context) - O'Rourke, in - 1994
58 A pedestrian approach to ray shooting: shoot a ray (context) - Hershberger, Suri - 1993
50 Approximation algorithms for geometric problems - Bern, Eppstein - 1997
42 Query-sensitive ray shooting - Mitchell, Mount et al. - 1994
15 Encyclopedia of Mathematics and its Applications (context) - Santal'o, Probability et al. - 1979
11 Simplicial mesh generation with applications (context) - Moore - 1992
11 Approximating the minimum weight Steiner triangulation - Eppstein - 1994
9 Applications of a new partition scheme (context) - Agrawal, Sharir - 1993
7 Approximation algorithms for planar traveling salesman tours.. - Clarkson - 1991
6 Stabbing triangulations by lines in 3D (context) - Agrawal, Aronov et al. - 1995
6 A beam-tracing algorithm for prediction of indoor radio prop.. - Fortune - 1996
3 CRC Handbook of Discrete and Computational Geometry (context) - Agrawal, searching - 1997
1 On range searching with semialgebraic sets (context) - Agrawal, Matousek - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ics.uci.edu/~eppstein/pubs/notmine/): More
Quasi-Greedy Triangulations Approximating the Minimum.. - Levcopoulos, Krznaric (1996) (Correct)
Lovász's Lemma for the Three-Dimensional K-Level of Concave.. - Katoh, Tokuyama (1999) (Correct)
Selection in Monotone Matrices and Computing kth Nearest.. - Agarwal, Sen (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC