Skip to main content

B-rep of Plane Regions: Pristine Problems in Computational Geometry and Topology

  • Chapter

Part of the book series: IFIP Series on Computer Graphics ((IFIP SER.COMP.))

Abstract

This paper describes the computation of topological representations of plane partitions induced by finite collections of plane parametric curves. The computation of this arrangement is described through the solutions of six different simpler problems. The final output obtained is a data structure called an rp-tree. An rp-tree captures contention, incidence, connection and bounding relations between 2D open regions, contours defined by oriented parametric curves and points. It is shown how to label the nodes of an rp-tree which results from boolean operations between plane regions; this labeling reflects the precise “history” of output regions as a function of the names of regions in an arbitrary finite boolean expression.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B.G. Baumgart, A Polyhedron Representation for Computer Vision, National Computer Conference, AFIPS Proceedings, Vol. 44, 1975, pp 589–596.

    Article  Google Scholar 

  2. H. Edelsbrunner, E.P. Mücke, Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms, ACM Transactions on Graphics, Vol. 9, No. 1, Jan. 1990, pp 66–104.

    Article  MATH  Google Scholar 

  3. M. Gangnet, J.C. Hervé, T. Pudet and J. M . Van Thong, Incremental Computation of Planar Maps, SIGGRAPH′89 Proceedings, Computer Graphics, Vol. 23, No. 3, Jul. 1989, pp 345–354.

    Article  Google Scholar 

  4. V. Guillemin and A. Pollack, Differential Topology, Prentice Hall Inc., Engle-wood Cliffs, N.J., 1974.

    MATH  Google Scholar 

  5. F. Harary, Graph Theory, Addison-Wesley Publishing Co., Reading, Mass., 1972.

    Google Scholar 

  6. CM. Hoffman, The Problems of Accuracy and Robustness in Geometric Computation, IEEE Computer Society, Computer, Vol. 22, No. 3, Mar. 1989, pp 31–41.

    Article  Google Scholar 

  7. G.L. Lastra, J.S. Santana, M.F. Angeles, The Four-wings-edge for Solid Boolean Operations with Trimmed Surface Patches, in Lastra, Encarnação, Requicha (Editors), Proceedings of the IFIP TC5 Conference on CAD/CAM Technology Transfer: Applications of Computers to Engineering Design, Manufacturing and Management, (August 1988, Mexico City) Elsvier Science Publishers B.V., The Netherlands, 1989, pp 51–64.

    Google Scholar 

  8. D.H. Laidlaw, W.B. Trumbore and J. F. Hughes, Constructive Solid Geometry for Polyhedral Objects, ACM SIGGRAPH ′86 Proceedings, Computer Graphics, Vol. 20, No. 4, Aug. 1986, pp 161–170.

    Google Scholar 

  9. M. Mäntylä, M. O’Connor and J. Rossignac, Advanced Topics in Solid Modeling, tutorial course notes distributed at EUROGRAPHICS 89, Hamburg, F.R.G., Sept. 1989.

    Google Scholar 

  10. V. Milenkovic, Double Precision Geometry: A General Technique for Calculating Line and Segment Intersections Using Rounded Arithmetic, IEEE Computer Society, 30th. Annual Symposium on Foundations of Computer Science Proceedings, Oct.-Nov. 1989, pp 500–505.

    Google Scholar 

  11. H. Samet and R. E. Webber, Hierarchical Data Structures and Algorithms for Computer Graphics, IEEE CG&A, Vol. 8, No. 3, May. 1988, pp 48–68.

    Google Scholar 

  12. K. Weiler, Polygon comparision using Graph Representation, ACM SIGGRAPH ′80 Proceedings, Computer Graphics, Vol. 14, No. 3, July 1980, pp 10–18.

    Article  Google Scholar 

  13. K. Weiler, Edge-Based Data Structures for Solid Modeling in Curved-Surface Environments, IEEE CG&A, Vol. 5, No. 1, Jan. 1985, pp 21–40.

    Google Scholar 

  14. K. Weiler, Non-manifold Geometric Boundary Modeling, Draft Prepared for SIG-GRAPH′87 Advanced Solid Modeling Tutorial, ACM, 1987. (General Electric, Corporate Research and Development, Schenectady, NY 12301).

    Google Scholar 

  15. Wilson, P.R., Euler Formulas and Geometric Modeling, IEEE CG&A, Vol. 5, No. 8, August 1988, pp 25–36.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 IFIP International Federation for Information Processing, 16 place Longemalle, CH-1204 Geneva, Switzerland

About this chapter

Cite this chapter

Lastra, G.L., Santana-Sepúlveda, J.S. (1991). B-rep of Plane Regions: Pristine Problems in Computational Geometry and Topology. In: Kunii, T.L. (eds) Modeling in Computer Graphics. IFIP Series on Computer Graphics. Springer, Tokyo. https://doi.org/10.1007/978-4-431-68147-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-4-431-68147-2_6

  • Publisher Name: Springer, Tokyo

  • Print ISBN: 978-4-431-68149-6

  • Online ISBN: 978-4-431-68147-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics