Decomposition Plans for Geometric Constraint Systems, Part I: Performance Measures for CAD

Journal of Symbolic Computation

Volumn 31, Issue 4, 2001, Pages 367-408

  Hoffman, 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

EID: 0005660653     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.2000.0402     Document Type: Article

References (66)

1. Ait-Aoudia S., Jegou R., Michelucci D. Reduction of constraint systems. Compugraphics. 1993;. p. 83-92.
2. Blum L., Shub M., Smale S. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Am. Math. Soc. 21:1989;1-46.
3. Bouma W., Fudos I., Hoffmann C., Cai J., Paige R. A geometric constraint solver. Comput. Aided Des. 27:1995;487-501.
4. Bronsvoort W. F., Jansen F. W. Multiview feature modeling for design and assembly. Shah J., Mantyla M., Nau D. S. Advances in Feature Based Modeling. 1994;315-330 Amsterdam, Elsevier Science.
5. Canny J. Improved algorithms for sign determination and existential quantifier elimination. Comput. J. 36:1993;409-418.
6. J. Canny, I. Emiris, Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms, and Error Correcting Codes, Cohen, G.Mora, T.Moreno, O. 1993, Berlin, Springer-Verlag, 89, 104.
7. S. C. Chou, X. S. Gao, J. Z. Zhang, Wichita State University, Department of Computer Science, 1996.
8. G. Collins, 1975, Berlin, Springer-Verlag, 134, 183.
9. Cox D., Little J., O'Shea D. Using Algebraic Geometry. 1998;New York, Springer-Verlag.
10. Crippen G., Havel T. Distance Geometry and Molecular Conformation. 1988;New York, John Wiley & Sons.
11. C. Durand, 1998.
12. S. Fang, 1992.
13. I. Fudos, 1995.
14. Fudos I., Hoffmann C. M. Constraint-based parametric conics for CAD. Comput. Aided Des. 28:1996a;91-100.
15. Fudos I., Hoffmann C. M. Correctness proof of a geometric constraint solver. Int. J. Comput. Geom. Appl. 6:1996b;405-420.
16. Fudos I., Hoffmann C. M. A Graph-Constructive Approach to Solving Systems of Geometric Constraints. ACM Trans. Graph. 16:1997;179-216.
17. H. Gabow, H. Westermann, Proceedings of the Twentieth Annual ACM Symposium on the Theory of Computing, Chicago, Illinois, U.S.A, 2-4 May 1998, 1988, New York, ACM Press, 407, 421.
18. Gao X. S., Chou S. C. Solving geometric constraint systems. I. A global propagation approach. Comput. Aided Des. 30:1998a;47-54.
19. Gao X. S., Chou S. C. Solving geometric constraint systems. II. A symbolic approach and decision of RC-constructibility. Comput. Aided Des. 30:1998b;115-122.
20. Graver J., Servatius B., Servatius H. Combinatorial Rigidity, Graduate Studies in Mathematics. 1993.
21. Grigor'ev D. Y., Vorobjov N. N. Solving systems of polynomial inequalities in subexponential time. J. Symb. Comput. 5:1988;37-64.
22. J. Hastad, Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996, Burlington, IEEE press, 627, 636.
23. Havel T. Some examples of the use of distances as coordinates for Euclidean geometry. J. Symb. Comput. 11:1991;579-594.
24. Hendrickson B. Conditions for unique graph realizations. SIAM J. Comput. 21:1992;65-84.
25. Hoffmann C. M. Solid modeling. Goodman J. E., O'Rourke J. CRC Handbook on Discrete and Computational Geometry. 1997;CRC Press, Boca Raton, FL.
26. Hoffmann C. M., Joan-Arinyo R. CAD and the product master model. Comput. Aided Des. 30:1998;905-919.
27. Hoffmann C. M., Lomonosov A., Sitharam M. Finding solvable subsets of constraint graphs. Proceedings of Principles and Practice of Constraint Programming '97, Linz, Austria, LNCS 1330. 1997;Berlin, Springer-Verlag. p. 463-477.
28. Hoffmann C. M., Lomonosov A., Sitharam M. Geometric constraint decomposition. Bruderlin, Roller. Geometric Constraint Solving. 1998;Berlin, Springer-Verlag.
29. Hoffmann C. M., Peters J. Geometric constraints for CAGD. Daehlen M., Lyche T., Schumaker L. Mathematical Methods for Curves and Surfaces. 1995;237-254 Vanderbilt University Press.
30. Hoffmann C. M., Rossignac J. A road map to solid modeling. IEEE Trans. Vis. Comput. Graphics. 2:1996;3-10.
31. 3. Du D. Z., Hwang F. Computing in Euclidean Geometry. 1994;World Scientific Publishing, Singapore.
32. Hoffmann C. M., Vermeer P. J. A spatial constraint problem. Workshop on Computational Kinematics, France. 1995;INRIA, Sophia-Antipolis.
33. Hopcroft J. E., Tarjan R. E. Dividing a graph into triconnected components. SIAM J. Comput. 2:1973;135-158.
34. C. Hsu, 1996.
35. Imai H. On combinatorial structures of line drawings of polyhedra. Discrete Appl. Math. 10:1985;79-92.
36. Itai A., Rodeh M. Finding a minimum circuit in a graph. SIAM J. Comput. 4:1978;413-423.
37. Khovanskii A. G. Newton polyhedra and the genus of complete intersections. Funktsional'nyi Analiz i Ego Prilozheniya. 12:1978;51-61.
38. Klein R. Geometry and feature representation for an integration with knowledge based systems. Geometric Modeling and CAD. 1996;Florida, U.S.A., Chapman-Hall.
39. Klein R. The role of constraints in geometric modeling. Bruderlin, Roller. Geometric Constraint Solving and Applications. 1998;Berlin, Springer-Verlag.
40. Kraker K. J., Dohmen M., Bronsvoort W. F. Maintaining multiple views in feature modeling. ACM/SIGGRAPH Symposium on Solid Modeling Foundations and CAD/CAM Applications. 1997;New York, ACM press. p. 123-130.
41. Kramer G. Solving Geometric Constraint Systems. 1992;Cambridge, MA, U.S.A., MIT Press.
42. Laman G. On graphs and rigidity of plane skeletal structures. J. Eng. Math. 4:1970;331-340.
43. Latham R., Middleditch A. Connectivity analysis: a tool for processing geometric constraints. Comput. Aided Des. 28:1996;917-928.
44. Lazard D. Résolution des systèmes d'équations algébriques. Theor. Comput. Sci. 15:1981;77-110.
45. Lazard D. A new method for solving algebraic systems of positive dimension. Discrete Appl. Math. 33:1991;147-160.
46. Mantyla M., Opas J., Puhakka J. Generative process planning of prismatic parts by feature relaxation. Advances in Design Automation, Computer Aided and Computational Design. 1989;Sacramento, CA, U.S.A., ASME. p. 49-60.
47. Middleditch A., Reade C. A kernel for geometric features. ACM/SIGGRAPH Symposium on Solid Modeling Foundations and CAD/CAM Applications. 1997;New York, ACM press.
48. Newell M. E., Evans D. C. Modeling by computer. IFIP Working Conference on CAD Systems, Austin, TX. 1976;North-Holland, Amsterdam. p. 291-297.
49. Owen J. Algebraic solution for geometry from dimensional constraints. ACM Symposium Found. of Solid Modeling, Austin, TX. 1991;ACM. p. 397-407.
50. Owen J. Constraints on simple geometry in two and three dimensions. Int. J. Comput. Geom. Appl. 6:1996;421-434.
51. Pabon J. A. Modeling method for sorting dependencies among geometric entities. United States Patent 5,251,290. 1993.
52. Renegar J. On the computational complexity and the first order theory of the reals, Part I. J. Symb. Comput. 13:1992;255-299.
53. Ruiz O. E., Ferreira P. M. Algebraic geometry and group theory in geometric constraint satisfaction for computer-aided design and assembly planning. IIE Trans. Des. Manuf. 28:1996;281-294.
54. Saliola F., Whiteley W. Constraint configurations in CAD: circles, lines and angles in the plane. Preprint, York University. 1999.
55. O. I. Semenkov, 3rd International IFIP/IFAC Conference on Programming Languages for Machine Tools, Stirling, Scotland, 1976, North-Holland, Amsterdam, 397, 403.
56. D. Serrano, Proceedings of Computers in Engineering, Boston, MA, 1990, 1990, 159, 164.
57. Serrano D., Gossard D. C. Combining mathematical models with geometric models in CAE systems. Computers in Engineering, Chicago, IL. ASME. 1:1986;277-284.
58. Sridhar N., Aggarwal R., Kinzel G. L. Active occurence matrix based approach to design decomposition. Comput. Aided Des. 25:1993;500-512.
59. Sridhar N., Aggarwal R., Kinzel G. L. Algorithms for the structural diagnosis and decomposition of sparse, underconstrained, systems. Comput. Aided Des. 28:1996;237-249.
60. B. Sturmfels, Proceedings of the Computational Algebraic Geometry and Commutative Algebra, 1993, Cambridge, Cambridge University Press, 377, 396.
61. Sugihara K. Detection of structural inconsistency in systems of equations with degrees of freedom and its applications. Discrete Appl. Math. 10:1985;297-312.
62. Tay T. On the generic rigidity of bar frameworks. Adv. Appl. Math. 23:1999;14-28.
63. Tay T., Whiteley W. Generating isostatic frameworks. Topologie Structurale. 11:1985;21-69.
64. Wang D. An elimination method for polynomial systems. J. Symb. Comput. 16:1993;83-114.
65. Whiteley W. Matroids and rigid structures. Matroid Applications, volume 40 of Encyclopedia Math. Appl. 1992;Cambridge, Cambridge University Press. p. 1-53.
66. Whiteley W. Rigidity and scene analysis. Handbook of Discrete and Computational Geometry. 1997;Florida, U.S.A., CRC Press. p. 893-916.