Skip to main content
SpringerLink
Log in

The Orthant Neighborhood Graph: A Decentralized Spatial Data Structure for Dynamic Point Sets

  • Conference paper
Computer Vision and Computer Graphics. Theory and Applications (VISIGRAPP 2007)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 21))

Included in the following conference series:

  • 641 Accesses

Abstract

This work presents a novel approach for proximity queries in dynamic point sets, a common problem in computer graphics. We introduce the notion of Orthant Neighborhood Graphs, yielding a simple, decentralized spatial data structure based on weak spanners. We present efficient algorithms for dynamic insertions, deletions and movements of points, as well as range searching and other proximity queries. All our algorithms work in the local neighborhood of given points and are therefore independent of the global point set. This makes ONGs scalable to large point sets, where the total number of points does not influence local operations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Reeves, W.T.: Particle Systems – A Technique for Modeling a Class of Fuzzy Objects. In: Computer Graphics Proceedings of ACM SIGGRAPH 1983, vol. 17, pp. 359–376 (1983)

    Google Scholar 

  2. Schlechtweg, S., Germer, T., Strothotte, T.: RenderBots—Multi Agent Systems for Direct Image Generation. Computer Graphics Forum 24, 137–148 (2005)

    Article  Google Scholar 

  3. Kim, D.J., Guibas, L.J., Shin, S.Y.: Fast collision detection among multiple moving spheres. IEEE Transactions on Visualization and Computer Graphics 4, 230–242 (1998)

    Article  Google Scholar 

  4. Teschner, M., Heidelberger, B., Müller, M., Pomerantes, D., Gross, M.H.: Optimized spatial hashing for collision detection of deformable objects. In: Proceedings of the Vision, Modeling, and Visualization Conference 2003 (VMV 2003), Aka GmbH, pp. 47–54 (2003)

    Google Scholar 

  5. Samet, H.: The design and analysis of spatial data structures. Addison-Wesley Longman Publishing Co., Inc., Boston (1990)

    Google Scholar 

  6. Bentley, J.L.: K-d trees for semidynamic point sets. In: SCG 1990: Proceedings of the 6th Annual Symposium on Computational Geometry, pp. 187–197 (1990)

    Google Scholar 

  7. Gottschalk, S., Lin, M.C., Manocha, D.: Obbtree: a hierarchical structure for rapid interference detection. In: Proceedings of ACM SIGGRAPH 1996. Computer Graphics Proceedings, Annual Conference Series, pp. 171–180. ACM Press, New York (1996)

    Google Scholar 

  8. James, D.L., Pai, D.K.: BD-Tree: Output-sensitive collision detection for reduced deformable models. ACM Transactions on Graphics 23, 393–398 (2004)

    Article  Google Scholar 

  9. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, Oxford (1999)

    MATH  Google Scholar 

  10. Reynolds, C.W.: Flocks, Herds, and Schools: A Distributed Behavioral Model. In: Computer Graphics (Proceedings of ACM SIGGRAPH 1983), vol. 21, pp. 25–34 (1987)

    Google Scholar 

  11. Fischer, M., auf der Heide, F.M., Strothmann, W.B.: Dynamic data structures for realtime management of large geometric scenes. In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol. 1284, pp. 157–170. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  12. Fischer, M., Lukovszki, T., Ziegler, M.: Geometric searching in walkthrough animations with weak spanners in real time. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 163–174. Springer, Heidelberg (1998)

    Google Scholar 

  13. Fischer, M., Lukovszki, T., Ziegler, M.: Partitioned neighborhood spanners of minimal outdegree. In: Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG 1999), pp. 47–50 (1999)

    Google Scholar 

  14. Arya, S., Das, G., Mount, D.M., Salowe, J.S., Smid, M.: Euclidean spanners: short, thin, and lanky. In: STOC 1995: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 489–498 (1995)

    Google Scholar 

  15. Yao, A.C.C.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing 11, 721–736 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  16. Ruppert, J., Seidel, R.: Approximating the d-dimensional complete euclidean graph. In: Proceedings of the 3rd Canadian Conference on Computational Geometry, pp. 207–210 (1991)

    Google Scholar 

  17. Maheshwari, A., Vahrenhold, J., Zeh, N.: On reverse nearest neighbor queries. In: Proceedings of the 14th Canadian Conference on Computational Geometry, pp. 128–132 (2002)

    Google Scholar 

  18. Agarwal, P.K.: Range searching. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, pp. 575–598. CRC Press, Inc., Boca Raton (1997)

    Google Scholar 

  19. Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. In: SODA 1997: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 747–756 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Simulation and Graphics, Otto-von-Guericke University of Magdeburg, Universitätsplatz 2, 39106, Magdeburg, Germany

    Tobias Germer & Thomas Strothotte

Authors
  1. Tobias Germer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Strothotte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Sistemas e Informatica, Escola Superior de Tecnologia do IPS, Estefanilha,, Rua do Vale de Chaves, 2910, Setúbal, Portugal

    José Braz

  2. INSTICC, Avenida D. Manuel I, 2910, Setúbal, Portugal

    Alpesh Ranchordas

  3. Institute for Systems and Robotics, Department of Electrical and Computer Engineering Polo II, University of Coimbra, 3030-290, Coimbra, Portugal

    Hélder J. Araújo

  4. IST/INESC-ID, Rua Alves Redol 9, 1000-029, Lisboa, Portugal

    João Madeiras Pereira

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Germer, T., Strothotte, T. (2008). The Orthant Neighborhood Graph: A Decentralized Spatial Data Structure for Dynamic Point Sets. In: Braz, J., Ranchordas, A., Araújo, H.J., Pereira, J.M. (eds) Computer Vision and Computer Graphics. Theory and Applications. VISIGRAPP 2007. Communications in Computer and Information Science, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89682-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89682-1_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89681-4

  • Online ISBN: 978-3-540-89682-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation