Skip to main content
SpringerLink
Log in

Maximal independent set graph partitions for representations of body-centered cubic lattices

  • Original Article
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

A maximal independent set graph data structure for a body-centered cubic lattice is presented. Refinement and coarsening operations are defined in terms of set-operations resulting in robust and easy implementation compared to a quad-tree-based implementation. The graph only stores information corresponding to the leaves of a quad-tree thus has a smaller memory foot-print. The adjacency information in the graph relieves one from going up and down the quad-tree when searching for neighbors. This results in constant time complexities for refinement and coarsening operations.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cormen, T.H., Leiserson, C.E., Riverst, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  2. De Floriani, L., Magillo, P.: Multiresolution mesh representation: Models and data structures. In: Tutorials on Multiresolution in Geometric Modelling, pp. 363–418. Springer, New York (2002)

    Google Scholar 

  3. Delgado-Friedrichs, O., O’Keeffe, M.: Crystal nets as graphs: Terminology and definitions. J. Solid State Chem. 178(8) (2005)

  4. Duchaineau, M., Wolinsky, M., Sigeti, D.E., Miller, M.C., Aldrich, C., Mineev-Weinstein, M.B.: Roaming terrain: real-time optimally adapting meshes. In: VIS ’97: Proceedings of the 8th Conference on Visualization ’97, Los Alamitos, CA, USA, 1997, pp. 81–88. IEEE Computer Society Press, Los Alamitos (1997)

    Google Scholar 

  5. Entezari, A., Van De Ville, D., Möller, T.: Practical box splines for reconstruction on the body centered cubic lattice. IEEE Trans. Vis. Comput. Graph. 14(2), 313–328 (2008)

    Article  Google Scholar 

  6. Labelle, F., Shewchuk, J.R.: Isosurface stuffing: Fast tetrahedral meshes with good dihedral angles. ACM Trans. Graph. 26(3), 57 (2007)

    Article  Google Scholar 

  7. Molino, N., Bridson, R., Teran, J., Fedkiw, R.: A crystalline, red green strategy for meshing highly deformable objects with tetrahedra. In: Proceedings of the 12th International Meshing Roundtable, pp. 103–114, Santa Fe, New Mexico, USA, September 2003

  8. Samet, H.: Spatital data structures. In: SIGGRAPH ’07: ACM SIGGRAPH 2007 Courses, New York, NY, USA, 2007. ACM, New York (2007)

    Google Scholar 

  9. Velho, L., Zorin, D.: 4–8 subdivision. Comput. Aided Geom. Des. 18(5), 397–427 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Wojtan, C., Turk, G.: Fast viscoelastic behavior with thin features. In: SIGGRAPH ’08: ACM SIGGRAPH 2008 Papers, New York, NY, USA, 2008, pp. 1–8. ACM, New York (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. eScience Center, University of Copenhagen, Copenhagen, Denmark

    Kenny Erleben

Authors
  1. Kenny Erleben
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kenny Erleben.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Erleben, K. Maximal independent set graph partitions for representations of body-centered cubic lattices. Vis Comput 25, 423–430 (2009). https://doi.org/10.1007/s00371-009-0330-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-009-0330-8

Keywords

Search

Navigation