Skip to main content
SpringerLink
Log in

A Tuple-based data structure for distributed parallel processing of 3D dynamic meshes

  • Theory
  • Conference paper
  • First Online:
Book cover Parallel Computing Technologies (PaCT 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1277))

Included in the following conference series:

  • 221 Accesses

Abstract

A data structure for the distributed representation of inhomogeneous and dynamically changing spatial structures is introduced. It is based on the concept of cellular hypergraphs (CHG), which provides us with a universal framework in this domain: a CHG is used to represent the topological relationships within a spatial structure, and the temporal dynamics are formulated with the productions of a parallel replacement system. The presented data structure is based on tuples keeping relationships between edges of the graph and components storing state information. A method for moving cells between processor nodes is described in detail, for it has a central meaning in load balancing algorithms and the distributed implementation of the parallel replacement systems.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Berge. Hypergraphs. North-Holland Mathematical Library, 1989.

    Google Scholar 

  2. H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1987.

    Google Scholar 

  3. P. Hartmann. Models of Information Processing in Inhomogeneous Cellular Structures. Proceedings of the First International Workshop on Information Processing in Cells and Tissues, Liverpool, 1995.

    Google Scholar 

  4. P. Hartmann. Parallel and Distributed Processing of Cellular Hypergraphs. Proceedings of: Third International Conference on Parallel Computing Technologies (PaCT-96), St. Petersburg, Russia, LNCS Vol. 964, Sept. 1995.

    Google Scholar 

  5. P. Hartmann. Implementation of Parallel Replacement Systems for Cellular Hypergraphs. Journal of Automata, Languages and Combinatorics, 1(2:129–146, 1996.

    Google Scholar 

  6. F.P. Preparata and M.I. Shamos. Computational Geometry. An Introduction. Springer-Verlag, 1985.

    Google Scholar 

  7. P. Prusinkiewicz and A. Lindenmayer. The Algorithmic Beauty of Plants. SpringerVerlag, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachgebiet Mikroprogrammierung, Fachbereich Informatik TH Darmstadt, Alexanderstraße 10, D-64283, Darmstadt, Germany

    Peter Hartmann

Authors
  1. Peter Hartmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hartmann, P. (1997). A Tuple-based data structure for distributed parallel processing of 3D dynamic meshes. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1997. Lecture Notes in Computer Science, vol 1277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63371-5_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-63371-5_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63371-6

  • Online ISBN: 978-3-540-69525-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation