Skip to main content

Adjacency Finding Algorithms in a Variable-Resolution Boundary Model

  • Conference paper
New Trends in Computer Graphics
  • 177 Accesses

Abstract

A variable-resolution boundary model of three dimensional objects provides a representation of the surfaces enclosing it at successively finer levels of specification. A hierarchical graph structure, called a structured edge-face graph (SEFG) is described, which encodes the boundary of a solid object at variable resolution is described. The structured edge-face graph is based on a face-oriented relational description of the object boundary. The concept of adjacency relation between pairs of primitive boundary entities at fixed accuracy is introduced, and adjacency finding algorithms which operate on a structured edge-face graph object representation are presented.

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

Access this chapter

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. Ansaldi, S., De Floriani, L., Falcidieno, B., Geometric modeling of solid objects by using a face adjacency graph representation, Computer Graphics (SIGGRAPH185), 19, 3, 1985, pp.131–139.

    Article  Google Scholar 

  2. Ballard, D.H., Striptrees: a hierarchical representation for curves, Comm. ACM, 214, 5, 1981, pp.310–321.

    Article  Google Scholar 

  3. Besl, P.J., Jain, R.C., Three-dimensional object recognition, Computing Surveys, 17, 1, 1985, pp.75–145.

    Article  Google Scholar 

  4. Boissonat, J.D., Tellaud, M., A hierarchical representation of objects: the Delaunay tree, Proceedings 2nd ACM Symposium on Computational Geometry, Yorktown Heights, New York, 1986, pp.260–268.

    Google Scholar 

  5. De Floriani, L., Falcidieno, B., Nagy, G., Pienovi, C., A hierarchical structure for surface approximation, Computer and Graphics, 8, 2, 1984,pp.183–193.

    Article  Google Scholar 

  6. De Floriani, L., A Hierarchical Boundary Model for Variable-Resolution Representation of Three-Dimensional Objects, Proceedings 8th Int. Conference on Pattern Recognition., Paris, 1986.

    Google Scholar 

  7. De Floriani, L., Falcidieno, B., A Hierarchical Boundary Model for Solid Object Representation, ACM Trans. on Graphics, 7, 1, January 1988 (in print).

    Article  Google Scholar 

  8. Dobkin, D.P., Kirkpatrick, D.G., Fast detection of polyhedral intersections, Theoretical Computer Science, 27, 1983, pp.241–253.

    Article  MathSciNet  MATH  Google Scholar 

  9. Dutton, G., Geodesic modeling of planetary relief, Proceedings AUTOCARTO, 1983, pp.186–201.

    Google Scholar 

  10. Faugeras, O.D., Ponce, J., Prismtrees: a hierarchical representation for 3D objects, Proceedings 8th International Conference on Artificial Intelligence, Karlsruhe, 1983, pp.982–988.

    Google Scholar 

  11. Gomez, D., Guzman, A., Digital model for three dimensioanl surface representation, Geo-Processing, 1, 1979, pp.53–70.

    Google Scholar 

  12. Meagher, D., Geometric modeling using octree encoding, Computer Graphics and Image Processing, 19, 2, 1982, pp.129–147.

    Article  Google Scholar 

  13. Requicha, A.A.G., Representations of rigid solids - theory, methods and systems, Computing Surveys, 12, 4, 1980, pp.437–464.

    Article  Google Scholar 

  14. Samet, H., The quadtree and related hierarchical data structures, Computing Surveys, 16, 2, 1984, pp.187–260.

    Article  MathSciNet  Google Scholar 

  15. Weiler, K., Edge based data structures for solid modeling in curved surface environments, IEEE Computer Graphics and Applications, 5, 1, 1985,pp.21–40.

    Google Scholar 

  16. Woo, T.C., A combinatorial analysis of boundary data structure schemata, IEEE Computer Graphics and Applications, 5, 3, pp.19–27.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Floriani, L. (1988). Adjacency Finding Algorithms in a Variable-Resolution Boundary Model. In: Magnenat-Thalmann, N., Thalmann, D. (eds) New Trends in Computer Graphics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83492-9_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-83492-9_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-83494-3

  • Online ISBN: 978-3-642-83492-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics