Skip to main content
SpringerLink
Log in

A Constraint Programming Approach for Solving Rigid Geometric Systems

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming – CP 2000 (CP 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1894))

Abstract

This paper introduces a new rigidification method-using interval constraint programming techniques- to solve geometric constraint systems. Standard rigidification techniques are graph-constructive methods exploiting the degrees of freedom of geometric objects. They work in two steps: a planning phase which identifies rigid clusters, and a solving phase which computes the coordinates of the geometric objects in every cluster. We propose here a new heuristic for the planning algorithm that yields in general small systems of equations. We also show that interval constraint techniques can be used not only to efficiently implement the solving phase, but also generalize former ad-hoc solving techniques. First experimental results show that this approach is more efficient than systems based on equational decomposition techniques.

Supported by CNRS and region Provence Alpes Côte d’Azur

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Samy Ait-Aoudia, Roland Jegou, and Dominique Michelucci. Reduction of constraint systems. In Compugraphic, 1993.

    Google Scholar 

  2. F. Benhamou, D. McAllester, and P. Van Hentenryck. Clp(intervals) revisited. In Proc. Logic Programming, MIT Press, 1994.

    Google Scholar 

  3. William Bouma, Ioannis Fudos, Christoph Hoffmann, Jiazhen Cai, and Robert Paige. Geometric constraint solver. Computer Aided Design, 27(6):487–501, 1995.

    Article  MATH  Google Scholar 

  4. Christian Bliek, Bertrand Neveu, and Gilles Trombettoni. Using graph decomposition for solving continuous csps. In Principles and Practice of Constraint Programming, CP’98, volume 1520 of LNCS, pages 102–116. Springer, 1998.

    Chapter  Google Scholar 

  5. Jean-François Dufourd, Pascal Mathis, and Pascal Schreck. Geometric construction by assembling subfigures. Artificial Intelligence, 99:73–119, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  6. Iaonnis Fudos and Christoph Hoffmann. Correctness proof of a geometric constraint solver. Technical Report TR-CSD-93-076, Purdue University, West Lafayette, Indiana, 1993.

    Google Scholar 

  7. Iaonnis Fudos and Christoph Hoffmann. A graph-constructive approach to solving systems of geometric constraints. ACM Transactions on Graphics, 16(2):179–216, 1997.

    Article  Google Scholar 

  8. Bruce Hendrickson. Conditions for unique realizations. SIAM J Computing, 21(1):65–84, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  9. Christoph Hoffmann, Andrew Lomonosov, and Meera Sitharam. Finding solvable subsets of constraint graphs. In Proc. Constraint Programming CP’97, pages 463–477, 1997.

    Google Scholar 

  10. Christoph Hoffmann, Andrew Lomonosov, and Meera Sitharam. Geometric constraint decomposition. In B. Brüderlin and D. Roller, editors, Geometric Constraint Solving and Applications, pages 170–195. Springer, 1998.

    Google Scholar 

  11. Pascal Van Hentenryck, Laurent Michel, and Yves Deville. Numerica: A Modeling Language for Global Optimization. MIT Press, 1997.

    Google Scholar 

  12. C. M. Hoffmann and P. J. Vermeer. A spatial constraint problem. In J.-P. Merlet and B. Ravani, editors, Computational Kinematics’95, pages 83–92. Kluwer Academic Publishers, 1995.

    Google Scholar 

  13. ILOG. Ilog solver reference manual. Technical report, ILOG, 1998.

    Google Scholar 

  14. R. Joan-Arinyo and A. Soto-Riera. Combining constructive and equational constraint solving techniques. ACM Transactions on Graphics, 18(3):35–55, 1999.

    Article  Google Scholar 

  15. Christophe Jermann, Gilles Trombettoni, Bertrand Neveu, and Michel Rueher. A constraint programming approach for solving rigid geometric systems. Technical Report 00-43, University of Nice, France, 2000.

    Google Scholar 

  16. G. Kramer. Solving Geometric Constraint Systems. MIT Press, 1992.

    Google Scholar 

  17. O. Lhomme. Consistency techniques for numeric csps. In Proc. IJCAI, Chambery, France, 1993.

    Google Scholar 

  18. Hervé Lamure and Dominique Michelucci. Qualitative study of geometric constraints. In Beat Bruderlin and Dieter Roller, editors, Geometric Constraint Solving and Applications, pages 234–258. Springer, 1998.

    Google Scholar 

  19. A. Verroust, F. Schonek, and D. Roller. Rule oriented method for parametrized computer aided design. Computer Aided Design, 24(6):531–540, 1992.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Nice-Sophia Antipolis, I3S, ESSI, 930 route des Colles, B.P. 145, 06903, Sophia Antipolis Cedex, France

    Christophe Jermann, Gilles Trombettoni & Michel Rueher

  2. CERMICS, 2004 route des lucioles, 06902, Sophia.Antipolis cedex, B.P. 93, France

    Bertrand Neveu

Authors
  1. Christophe Jermann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gilles Trombettoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bertrand Neveu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michel Rueher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California at Irvine, Irvine, CA, 92697, USA

    Rina Dechter

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jermann, C., Trombettoni, G., Neveu, B., Rueher, M. (2000). A Constraint Programming Approach for Solving Rigid Geometric Systems. In: Dechter, R. (eds) Principles and Practice of Constraint Programming – CP 2000. CP 2000. Lecture Notes in Computer Science, vol 1894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45349-0_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-45349-0_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41053-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation