Abstract
A central issue in dealing with geometric constraint systems that arise in Computer Aided Design and Assembly is the generation of an optimal decomposition recombination plan that is the foundation of an efficient solution of the constraint system. For the first time, in this paper, we formalize, motivate and explain the optimal decomposition-recombination (DR) planning problem as a problem of finding a sequence of graph transformations T i, that maximizes an objective function subject to a certain criteria. We also give several performance measures phrased as graph transformation properties by which DR-planning algorithms can be analyzed and compared. Using these perfomance measures and formulation of the problem we develop a new DR-planner which represents a significant improvement over existing algorithms.
Supported in part by NSF Grants CDA 92-23502 and CCR 95-05745, and by ONR Contract N00014-96-1-0635.
Supported in part by NSF Grant CCR 94-09809.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Ait-Aoudia, R. Jegou, and D. Michelucci. Reduction of constraint systems. In Compugraphics, pages 83–92, 1993.
W. Bouma, I. Fudos, C. Hoffmann, J. Cai, and R. Paige. A geometric constraint solver. Computer Aided Design, 27:487–501, 1995.
B. Bruderlin and R. Roller eds. Geometric constraint solving and applications. Springer-Verlag, 1998.
G. Crippen and T. Havel. Distance Geometry and Molecular Conformation. John Wiley & Sons, 1988.
I. Fudos. Geometric Constraint Solving. PhD thesis, Purdue University, Dept of Computer Science, 1995.
I. Fudos and C. M. Hoffmann. Correctness proof of a geometric constraint solver. Intl. J. of Computational Geometry and Applications, 6:405–420, 1996.
I. Fudos and C. M. Hoffmann. A graph-constructive approach to solving systems of geometric constraints. ACM Trans on Graphics, pages 179–216, 1997.
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.
J. Hastad. Clique is hard to approximate within n 1−ε. In Proceedings of Foundations of Computer Science, pages 627–636. IEEE press, 1996.
T. Havel. Some examples of the use of distances as coordinates for Euclidean geometry. J. of Symbolic Computation, 11:579–594, 1991.
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.
C. M. Hoffmann and J. Rossignac. A road map to solid modeling. IEEE Trans. Visualization and Comp. Graphics, 2:3–10, 1996.
Christoph M. Hoffmann, Andrew Lomonosov, and Meera Sitharam. Finding solvable subsets of constraint graphs. In Constraint Programming’ 97, pages 463–477, Linz, Austria, 1997.
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.
Christoph M. Hoffmann and Pamela J. Vermeer. Geometric constraint solving in R 2 and R 3. In D. Z. Du and F. Hwang, editors, Computing in Euclidean Geometry, pages 266–298. World Scientific Publishing, 1994. second edition.
Christoph M. Hoffmann and Pamela J. Vermeer. A spatial constraint problem. In Workshop on Computational Kinematics, pages 83–92, France, 1995. INRIA Sophia-Antipolis.
Ching-Yao Hsu. Graph-based approach for solving geometric constraint problems. PhD thesis, University of Utah, Dept. of Comp. Sci., 1996.
G. Kramer. Solving Geometric Constraint Systems. MIT Press, 1992.
R. Latham and A. Middleditch. Connectivity analysis: a tool for processing geometric constraints. Computer Aided Design, 28:917–928, 1996.
M. Nagl. A tutorial and bibliographical survey on graph grammars. In Lect. Notes in CS, Vol 73, pages 70–126. Springer-Verlag, 1979.
J. Owen. Algebraic solution for geometry from dimensional constraints. In ACM Symp. Found. of Solid Modeling, pages 397–407, Austin, Tex, 1991.
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.
J.A. Pabon. Modeling method for sorting dependencies among geometric entities. In US States Patent 5,251,290, Oct 1993.
Detlev Ruland. Edm—a data model for electronic cad/cam-applications. In Gottfried Tinhofer and Gnther Schmidt, editors, Graph-theoretic concepts in computer science, volume 246, pages 290–305. Lecture Notes in Computer Science, Springer-Verlag, 1986.
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.
D. Serrano. Managing constraints in concurrent design: first steps. In Proc. Computers in Engineering, pages 159–164, Boston, MA, 1990.
D. Serrano and D.C. Gossard. Combining mathematical models with geometric models in cae systems. In Proc. Computers in Engineering, pages 903–909, Chicago, IL, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoffmann, C.M., Lomonosov, A., Sitharam, M. (2000). Planning Geometric Constraint Decomposition via Optimal Graph Transformations. In: Nagl, M., Schürr, A., Münch, M. (eds) Applications of Graph Transformations with Industrial Relevance. AGTIVE 1999. Lecture Notes in Computer Science, vol 1779. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45104-8_25
Download citation
DOI: https://doi.org/10.1007/3-540-45104-8_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67658-4
Online ISBN: 978-3-540-45104-4
eBook Packages: Springer Book Archive