Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Oversimplified Euler Operators for a Non-oriented, Non-manifold B-Rep Data Structure

  • Conference paper
Advances in Visual Computing (ISVC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 3804))

Included in the following conference series:

  • 1817 Accesses

Abstract

Traditionally, B-rep geometric kernels possess oriented data structures, i.e. they possess oriented cells (e.g. half-edges, co-edges, face uses, etc.). The use of explicit oriented cells makes these data structures quite verbose and expensive in terms of memory space. Although orientation is important for visualization and engineering analysis purposes, it gives rise to difficult issues at the representation level; for example, keeping inclusion relationships between incident surfaces at a non-manifold vertex. Instead, we propose a non-manifold B-rep data structure whose cells are not oriented. This facilitates the design and implementation of its associated Euler operators, each one of which then reduces itself to a sequence of insertion and removal operations of cells into or from a list. Besides, these Euler operators call a single query operator to retrieve all incidence and adjacency information through a minimal number of accesses. As a result, we obtain a simple, responsive, concise and general non-oriented, non-manifold B-rep geometric kernel.

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.

Similar content being viewed by others

References

  1. Mäntylä, M.: An Introduction to Solid Modeling. Computer Science Press, Rockville (1988)

    Google Scholar 

  2. Weiler, K.: The radial edge structure: a topological representation for non-manifold geometric boundary modelling. In: Geometric Modelling for CAD applications, pp. 3–36 (1988)

    Google Scholar 

  3. Baumgart, B.G.: Winged-edge polyhedron representation. Technical report, STAN-CS-320, Stanford University (1972)

    Google Scholar 

  4. Meagher, D.: Geometric modeling using octree encoding. Computer Graphics and Image Processing 19, 129–147 (1982)

    Article  Google Scholar 

  5. Requicha, A.: Representation for rigid solids: theory, methods and systems. ACM Computing Surveys 12, 437–464 (1980)

    Article  Google Scholar 

  6. Brisson, E.: Representing geometric structures in d dimension: topology and order. Discrete & Computational Geometry 9, 387–426 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  7. Popovic, J., Hoppe, H.: Progressive simplicial complexes. In: Proceedings of Siggraph, pp. 217–224. ACM Press, New York (1997)

    Chapter  Google Scholar 

  8. Gomes, A.J.P.: A concise b-rep data structure for stratified subanalytic objects. In: Proceedings of the 2003 Eurographics/ACM SIGGRAPH Symposium on Geometry Processing, Eurographics Association, pp. 83–93 (2003)

    Google Scholar 

  9. Baumgart, B.G.: A polyhedral representation for computer vision. In: Proceedings of AFIPS Natl. Comput. Conf., vol. 44, pp. 589–596 (1975)

    Google Scholar 

  10. Guibas, L., Stolfi, J.: Primitives for the manipulation of general subdivisions and the computation of voronoi diagrams. ACM Transactions on Graphics 4, 74–123 (1985)

    Article  MATH  Google Scholar 

  11. Lee, S.H., Lee, K.: Partial entity structure: A fast and compact non-manifold boundary representation based on partial topological entities. In: Proceedings of the Sixth ACM Symposium on Solid Modeling and Applications, pp. 159–170 (2001)

    Google Scholar 

  12. Silva, F.G.M., Gomes, A.J.P.: AIF - a data structure for polygonal meshes. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds.) ICCSA 2003. LNCS, vol. 2669, pp. 478–487. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Weiler, K.: Edge-based data structure for solid modelling in curved-surface environments. IEEE Computer Graphics & Applications 5, 21–40 (1985)

    Article  Google Scholar 

  14. Ni, X., Bloor, M.S.: Performance evaluation of boundary data structures. IEEE Computer Graphics and Applications 14, 66–77 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IT – Networks and Multimedia Group, Department of Computer Science and Engineering, University of Beira Interior, Portugal

    Frutuoso G. M. Silva & Abel J. P. Gomes

Authors
  1. Frutuoso G. M. Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abel J. P. Gomes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Nevada, Reno, USA

    George Bebis

  2. NASA Ames Research Center, Moffett Field, CA, USA

    Richard Boyle

  3. Desert Research Institute, Reno, NV, USA

    Darko Koracin

  4. Lawrence Berkeley National Laboratory, Berkeley, CA, USA

    Bahram Parvin

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Silva, F.G.M., Gomes, A.J.P. (2005). Oversimplified Euler Operators for a Non-oriented, Non-manifold B-Rep Data Structure. In: Bebis, G., Boyle, R., Koracin, D., Parvin, B. (eds) Advances in Visual Computing. ISVC 2005. Lecture Notes in Computer Science, vol 3804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11595755_4

Download citation

  • DOI: https://doi.org/10.1007/11595755_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30750-1

  • Online ISBN: 978-3-540-32284-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation