Geometric searching in walkthrough animations with weak spanners in real time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1461 LNCS, Issue , 1998, Pages 163-174

  Fischer, Matthias ^a   Lukovszki, Tamás ^a   Ziegler, Martin ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGORITHMIC ASPECTS; BASIC OPERATION; DETERMINISTIC DATA; INCREMENTAL DATA; INTERACTIVE WALKTHROUGH; OUTPUT-SENSITIVE; SPACE REQUIREMENTS; WALKTHROUGH SYSTEMS;

DATA STRUCTURES;

EID: 84896693819     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_14     Document Type: Conference Paper

References (17)

1. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. Technical Report CS-1997-11, Duke Univ., Dep. of Comp. Sci., 1997. To appear: in Discrete and Computational Geometry: Ten Years Later.
2. A. Aggarwal, M. Hansen, and T. Leighton. Solving query-retrival problems by compact voronoi diagrams. In 22nd ACM Symposium on Theory of Computing (STOC'90), pages 331-340, 1990.
3. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. In 5th ACM-SIAM Symposium on Discrete Algorithms (SODA'94), pages 573-582, 1994.
4. J. L. Bentley and H. A. Maurer. A note on the euclidean near neighbor searching in the plane. Information Processing Letters, 8: 133-136, 1979.
5. M. Bern, D. Eppstein, and J. Gilbert. Provably good mesh generation. J. Comp. Syst. Sci., 48: 384-409, 1994.
6. M. Bern, D. Eppstein, and S. H. Teng. Parallel construction of quadtrees and quality triangulations. In 3rd Workshop on Algorithms and Data Structures (WADS'93), pages 188-199, 1993.
7. P. B. Callahan and S. R. Kosaraju. Faster algorithms for some geometric graph problems in higher dimensions. In 4th ACM-SIAM Symposium on Discrete Algorithms (SODA'93), pages 291-300, 1993.
8. B. Chazelle, R. Cole, F. P. Preparata, and C. Yap. New upper bounds for neighbor searching. Information and Control, 68: 105-124, 1986.
9. D. Z. Chen, G. Das, and M. Smid. Lower bounds for computing geometric spanners and approximate shortest paths. In 8th Canadian Conference in Computational Geometry (CC-CG'96), pages 155-160, 1996.
10. L. P. Chew. There is a planar graph almost as good as the complete graph. In 2nd Annual ACM Symposium on Computational Geometry, pages 169-177, 1986.
11. M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann. Dynamic data structures for realtime management of large geometric scenes. In 5th Annual European Symposium on Algorithms (ESA'97), pages 157-170, 1997.
12. J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete euclidean graph. Discrete and Computational Geometry, 7: 13-28, 1992.
13. F. P. Preparata and M. I. Shamos. Computational Geometry An Introduction. Springer Verlag, New York, 1985.
14. J. Ruppert and R. Seidel. Approximating the d-dimensional complete euclidean graph. In 3rd Canadian Conference in Computational Geometry (CCCG'91), pages 207-210, 1991.
15. J. S. Salowe. Constructing multidimensional spanner graphs. International Journal of Computational Geometry and Applications, 1: 99-107, 1991.
16. M. Smid. Closest-Point Problems in Computational Geometry. To appear in: Handbook on Computational Geometry, edited by J.-R. Sack, North Holand, Amsterdam.
17. P. M. Vaidya. A sparse graph almost as good as the complete graph on points in k dimensions. Discrete and Computational Geometry, 6: 369-381, 1991.