Advertisement

Term rewrite systems to derive set boolean operations on 2D objects

  • David Cazier
  • Jean-François Dufourd
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1313)

Abstract

Set boolean operations between 2-dimensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent system of rewrite rules modulo equations to cope with their design. This system is complete is the sense that it gives a detailed description for all particular cases. This specification leans on a new operation of labeling self-refinement of planar subdivisions. Starting from these abstract descriptions, we design concrete algorithms with a new method. The rewrite system is successively transformed in specialized ones from which we derive efficient treatments, like plane-sweep algorithms.

Keywords

Boolean Operation Computational Geometry Boundary Representation Rule Application Common Coordinate System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J.F. Dufourd, C. Gross, and J.C. Spehner. A digitization algorithm for the entry of planar maps. In Proc. Computer Graphics International Conf., pages 649–661, Leeds, U.K., 1989. Springer-Verlag.Google Scholar
  2. 2.
    M. Gangnet, J.C. Hervé, T. Pudet, and J.M. van Thong. Incremental computation of planar maps. In Proc. of ACM Siggraph Conf., Boston, Computer Graphics, volume 23, pages 345–354, July 1989.Google Scholar
  3. 3.
    Y. Gardan and E. Perrin. An algorithm reducing 3D boolean operations to a 2D problem: concepts and results. Computer-Aided Design, 28(4):277–287, 1996.Google Scholar
  4. 4.
    J.R. Rossignac and M.A O'Connor. SGC: A dimension-independent model for pointsets with internal structures and incomplete boundary. CAD, 1991.Google Scholar
  5. 5.
    A.A.G. Requicha and H.B. Voelcker. Boolean operations in solid modeling: Boundary evaluation and merging algorithms. In Proc. of IEEE, volume 73, january 1985.Google Scholar
  6. 6.
    Y. Bertrand, J.F. Dufourd, J.F. Françon, and P. Lienhardt. Algebraic specification and development in geometric modeling. In LNCS, volume 668 of EATCS conf. TAPSOFT, pages 75–89, Orsay, France, 1993. Springer-Verlag.Google Scholar
  7. 7.
    Y. Bertrand and J.F. Dufourd. Algebraic specification of a 3D-modeler based on hypermaps. CVGIP: Graphical Models and Image Processing, 56(1):29–60, 1994.Google Scholar
  8. 8.
    D. Cazier and J.F. Dufourd. Rewrite-based derivation of efficient algorithms to build planar subdivisions. In Proc. Spring Conf. on Comp. Graphics, pages 45–54, 1996.Google Scholar
  9. 9.
    D. Cazier and J.F. Dufourd. Reliable boolean operations on polyhedral solids defined as rewrite systems. In Proc. WSCG'97, pages 40–49, Plzen, 1997.Google Scholar
  10. 10.
    D. Cazier. Construction de Système de réécriture pour les operations booléennes en modélisation géométrique. PhD thesis, University L. Pasteur, Strasbourg, 1997.Google Scholar
  11. 11.
    W. Tutte. Graph theory. In Encyclopedia of Mathematics and its Applications, chapter 21. Cambridge University Press, 1984.Google Scholar
  12. 12.
    P. Lienhardt. Topological models for boundary representation: a comparison with n-dimensional generalized maps. Computer-Aided Design, 23(1):59–82, 1991.Google Scholar
  13. 13.
    J.L. Bentley and T. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput., 28:643–647, 1979.Google Scholar
  14. 14.
    J. Nievergelt and F.P. Preparata. Plane-sweep algorithms for intersecting geometric figures. Com. of ACM, 25(10):739–747, 1982.Google Scholar
  15. 15.
    B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. Journal of ACM, 39(1):1–54, 1992.Google Scholar
  16. 16.
    H. Ehrig and B. Mahr. Fundamentals of algebraic specification 1. Equations and initial semantics, volume 6 of EATCS Monograph on Theoretical Computer Science. Springer, 1985.Google Scholar
  17. 17.
    M. Wirsing. Algebraic specifications. In Formal models and semantics, Handbook of Theoretical Computer Science, chapter 13, pages 675–788. Elsevier, 1990.Google Scholar
  18. 18.
    N. Dershowitz and J.P. Jouannaud. Rewrite systems. In Formal models and semantics, Handbook of Theoretical Computer Science, chapter 6, pages 243–320. Elsevier, 1990.Google Scholar
  19. 19.
    W.R. Mallgren. Formal specification of interactive graphic programming languages. ACM Dist. Dissertation. MIT Press, USA, 1982.Google Scholar
  20. 20.
    D.A. Duce, E.V. Fielding, and L.S. Marshall. Formal specification of a small example based on GKS. ACM Trans. on Graphics, 7(3):180–197, 1988.Google Scholar
  21. 21.
    B. Brüderlin. Using geometric rewrite rules for solving geometric problems symbolically. Theoretical Computer Science, 116:291–303, 1993.Google Scholar
  22. 22.
    J.F. Dufourd. Algebraic map-based topological kernel for polyhedron modellers: algebraic specification and logic prototyping. In Proc. Eurographics, pages 649–662, 1989.Google Scholar
  23. 23.
    V.J. Milenkovic. Practical methods for set operations on polygons using exact arithmetic. In Proc. Canadian Conf. on Computational Geometry, Qubec, 1995.Google Scholar
  24. 24.
    A.A.G. Requicha. Representation for rigid solids: theory, methods and systems. Computing Survey, 12(4):437–463, 1980.CrossRefGoogle Scholar
  25. 25.
    J. A. Goguen, T. Winkler, J. Meseguer, K. Futasugi, and J.P. Jouannaud. Introducing OBJ, Cambridge University Press edition, 1992.Google Scholar
  26. 26.
    N. Dershowitz and M. Okada. A rational for conditional equational programming. Theoretical Computer Science, 75:111–138, 1990.MathSciNetGoogle Scholar
  27. 27.
    J.F. Dufourd. An OBJ3 functional specification for the boundary representation. In ACM Press, editor, First ACM-SIGGRAPH Symp. on Solid Modeling, pages 61–72, Austin, Texas, 1991.Google Scholar
  28. 28.
    E. Bevers and J. Lewi. Proving termination of (conditional) rewrite systems. A semantic approach. Acta Informatica, 30:537–568, 1993.CrossRefGoogle Scholar
  29. 29.
    D. Cazier and J.F. Dufourd. A rewrite system to build planar subdivisions. In Proc. Canadian Conf. on Computational Geometry, pages 235–240, Qubec, 1995.Google Scholar
  30. 30.
    C.B. Jones. Systematic software development using VDM. In Texts and Monographs in Computer Science. Prentice-Hall international, 2nd edition, 1990.Google Scholar
  31. 31.
    J.B. Wordsworth. Software development with Z. a practical approach to formal methods in software engineering. Addison-Wesley, Workingham, England, 1992.Google Scholar
  32. 32.
    J.M. Spivey. The Z notation — A reference manual. Prentice-Hall international, 2nd edition, 1992.Google Scholar
  33. 33.
    J.V. Guttag and J.J. Horning. Larch: language and tools for formal specification. In Texts and Monographs in Computer Science. Springer-Verlag, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • David Cazier
    • 1
  • Jean-François Dufourd
    • 1
  1. 1.Laboratoire des Sciences de l'Image, de l'Informatique et de la Télédétection (LSIIT, URA CNRS 1871)Université Louis Pasteur, Département d'InformatiqueStrasbourg Cedex

Personalised recommendations