Advertisement

Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time

  • Matthias Fischer
  • Tamás Lukovszki
  • Martin Ziegler
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1461)

Abstract

We study algorithmic aspects in the management of geometric scenes in interactive walkthrough animations. We consider arbitrarily large scenes consisting of unit size balls. For a smooth navigation in the scene we have to fulfill hard real time requirements. Therefore, we need algorithms whose running time is independent of the total number of objects in the scene and that use as small space as possible. In this work we focus on one of the basic operations in our walkthrough system: reporting the objects around the visitor within a certain distance.

Previously a randomized data structure was presented that supports reporting the balls around the visitor in an output sensitive time and allows insertion and deletion of objects nearly as fast as searching. These results were achieved by exploiting the fact that the visitor moves “slowly” through the scene. A serious disadvantage of the aforementioned data structure is a big space overhead and the use of randomization.

Our first result is a construction of weak spanners that leads to an improvement of the space requirement of the previously known data structures. Then we develop a deterministic data structure for the searching problem in which insertion of objects are allowed. Our incremental data structure supports O(1+k) reporting time, where k is a certain quantity close to the number of reported objects. The insertion time is similar to the reporting time and the space is linear to the total number of objects.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.Google Scholar
  2. 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.Google Scholar
  3. 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.Google Scholar
  4. 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.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    M. Bern, D. Eppstein, and J. Gilbert. Provably good mesh generation. J. Comp. Syst. Sci., 48:384–409, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 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.Google Scholar
  7. 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.Google Scholar
  8. 8.
    B. Chazelle, R. Cole, F. P. Preparata, and C. Yap. New upper bounds for neighbor searching. Information and Control, 68:105–124, 1986.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 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 (CCCG’ 96), pages 155–160, 1996.Google Scholar
  10. 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.Google Scholar
  11. 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.Google Scholar
  12. 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.zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    F. P. Preparata and M. I. Shamos. Computational Geometry An Introduction. Springer Verlag, New York, 1985.Google Scholar
  14. 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.Google Scholar
  15. 15.
    J. S. Salowe. Constructing multidimensional spanner graphs. International Journal of Computational Geometry and Applications, 1:99–107, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    M. Smid. Closest-Point Problems in Computational Geometry. To appear in: Handbook on Computational Geometry, edited by J.-R. Sack, North Holand, Amsterdam.Google Scholar
  17. 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.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Matthias Fischer
    • 1
  • Tamás Lukovszki
    • 1
  • Martin Ziegler
    • 1
  1. 1.Department of Computer Science and Heinz Nixdorf InstituteUniversity of PaderbornPaderbornGermany

Personalised recommendations