Planning geometric constraint decomposition via optimal graph transformations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1779, Issue , 2000, Pages 309-324

  Hoffmann, Christoph M ^a   Lomonosov, Andrew ^b   Sitharam, Meera ^b  

^a Purdue University   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; GRAPH THEORY;

CONSTRAINT SYSTEMS; GEOMETRIC CONSTRAINT; GEOMETRIC CONSTRAINT SYSTEMS; GRAPH TRANSFORMATION; OBJECTIVE FUNCTIONS; OPTIMAL DECOMPOSITION; PERFORMANCE MEASURE; PLANNING ALGORITHMS;

MATHEMATICAL TRANSFORMATIONS;

EID: 84974688519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45104-8_25     Document Type: Conference Paper

References (27)

1. S. Ait-Aoudia, R. Jegou, and D. Michelucci. Reduction of constraint systems. In Compugraphics, pages 83-92, 1993.
2. W. Bouma, I. Fudos, C. Hoffmann, J. Cai, and R. Paige. A geometric constraint solver. Computer Aided Design, 27:487-501, 1995.
3. B. Bruderlin and R. Roller eds. Geometric constraint solving and applications. Springer-Verlag, 1998.
4. G. Crippen and T. Havel. Distance Geometry and Molecular Conformation. John Wiley & Sons, 1988.
5. I. Fudos. Geometric Constraint Solving. PhD thesis, Purdue University, Dept of Computer Science, 1995.
6. I. Fudos and C. M. Hoffmann. Correctness proof of a geometric constraint solver. Intl. J. of Computational Geometry and Applications, 6:405-420, 1996.
7. I. Fudos and C. M. Hoffmann. A graph-constructive approach to solving systems of geometric constraints. ACM Trans on Graphics, pages 179-216, 1997.
8. H. Gottler, J. Gunther, and G. Nieskens. Use graph grammars to design cad-systems! In Lect. Notes in CS, Vol 532, pages 396-410. Springer-Verlag, 1991.
9. ϵ. In Proceedings of Founda-tions of Computer Science, pages 627-636. IEEE press, 1996.
10. T. Havel. Some examples of the use of distances as coordinates for Euclidean geometry. J. of Symbolic Computation, 11:579-594, 1991.
11. C. M. Hoffmann. Solid modeling. In J. E. Goodman and J. O'Rourke, editors, CRC Handbook on Discrete and Computational Geometry, pages 863-880. CRC Press, Boca Raton, FL, 1997.
12. C. M. Hoffmann and J. Rossignac. A road map to solid modeling. IEEE Trans. Visualization and Comp. Graphics, 2:3-10, 1996.
13. Christoph M. Hoffmann, Andrew Lomonosov, and Meera Sitharam. Finding solv-able subsets of constraint graphs. In Constraint Programming '97, pages 463-477, Linz, Austria, 1997.
14. Christoph M. Hoffmann, Andrew Lomonosov, and Meera Sitharam. Decomposition of geometric constraints systems: Part i and part ii. In Manuscript submitted to a journal, University of Florida technical report, pages 1-51, 1998.
15. 3. In D. Z. Du and F. Hwang, editors, Computing in Euclidean Geometry, pages 266-298. World Scientific Publishing, 1994. second edition.
16. Christoph M. Hoffmann and Pamela J. Vermeer. A spatial constraint problem. In Workshop on Computational Kinematics, pages 83-92, France, 1995. INRIA Sophia-Antipolis.
17. Ching-Yao Hsu. Graph-based approach for solving geometric constraint problems. PhD thesis, University of Utah, Dept. of Comp. Sci., 1996.
18. G. Kramer. Solving Geometric Constraint Systems. MIT Press, 1992.
19. R. Latham and A. Middleditch. Connectivity analysis: a tool for processing geo-metric constraints. Computer Aided Design, 28:917-928, 1996.
20. M. Nagl. A tutorial and bibliographical survey on graph grammars. In Lect. Notes in CS, Vol 73, pages 70-126. Springer-Verlag, 1979.
21. J. Owen. Algebraic solution for geometry from dimensional constraints. In ACM Symp. Found. of Solid Modeling, pages 397-407, Austin, Tex, 1991.
22. J. Owen. Constraints on simple geometry in two and three dimensions. In Third SIAM Conference on Geometric Design. SIAM, November 1993. To appear in Int J of Computational Geometry and Applications.
23. J.A. Pabon. Modeling method for sorting dependencies among geometric entities. In US States Patent 5,251,290, Oct 1993.
24. Detlev Ruland. Edm-a data model for electronic cad/cam-applications. In Got-tfried Tinhofer and Gnther Schmidt, editors, Graph-theoretic concepts in computer science, volume 246, pages 290-305. Lecture Notes in Computer Science, Springer-Verlag, 1986.
25. Detlev Ruland. Cadula-a graph-based model for monitoring cad-processes. In M. Nagl, editor, Graph-theoretic concepts in computer science, volume 411, pages 63-77. Lecture Notes in Computer Science, Springer-Verlag, 1989.
26. D. Serrano. Managing constraints in concurrent design: First steps. In Proc. Com-puters in Engineering, pages 159-164, Boston, MA, 1990.
27. D. Serrano and D.C. Gossard. Combining mathematical models with geomet-ric models in cae systems. In Proc. Computers in Engineering, pages 903-909, Chicago, IL, 1986.