메뉴 건너뛰기




Volumn 38, Issue 4, 2006, Pages 284-299

Geometric constraint solving: The witness configuration method

Author keywords

Constraints dependences; Decomposition and solving; Geometric constraints; Rigidity theory; The numerical probabilistic method

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER AIDED MANUFACTURING; GRAPHIC METHODS; NUMERICAL ANALYSIS; THEOREM PROVING;

EID: 33645868296     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cad.2006.01.005     Document Type: Article
Times cited : (38)

References (43)
  • 2
    • 33645883378 scopus 로고    scopus 로고
    • Lamure H, Michelucci D. Qualitative study of geometric constraints. In: Geometric constraint solving and applications. Springer; 1998.
  • 3
    • 0026821495 scopus 로고
    • Conditions for unique graph realizations
    • Hendrickson B.A. Conditions for unique graph realizations. SIAM J Comput 21 1 (1992) 65-84
    • (1992) SIAM J Comput , vol.21 , Issue.1 , pp. 65-84
    • Hendrickson, B.A.1
  • 4
    • 30944456120 scopus 로고    scopus 로고
    • Foufou S, Michelucci D, Jurzak J.-P. Numerical decomposition of geometric constraints. In: ACM symposium on solid and physical modelling. MIT, Boston, USA: ACM Press; 2005. p. 143-51.
  • 6
    • 50949128713 scopus 로고
    • A paradigm for the robust design of algorithms for geometric modeling
    • Agrawal A., and Requicha A. A paradigm for the robust design of algorithms for geometric modeling. Comput Graph Forum EUROGRAPHICS'94 13 3 (1994) C33-C44
    • (1994) Comput Graph Forum EUROGRAPHICS'94 , vol.13 , Issue.3
    • Agrawal, A.1    Requicha, A.2
  • 7
    • 0015142707 scopus 로고
    • Determining the equivalence of algebraic expressions by hash coding
    • Martin W. Determining the equivalence of algebraic expressions by hash coding. J ACM 18 4 (1971) 549-558
    • (1971) J ACM , vol.18 , Issue.4 , pp. 549-558
    • Martin, W.1
  • 8
    • 84976779342 scopus 로고
    • Fast probabilistic algorithms for verification of polynomial identities
    • Schwartz J. Fast probabilistic algorithms for verification of polynomial identities. J ACM 4 27 (1980) 701-717
    • (1980) J ACM , vol.4 , Issue.27 , pp. 701-717
    • Schwartz, J.1
  • 9
    • 33749601838 scopus 로고    scopus 로고
    • Monagan M, Gonnet G. Signature functions for algebraic numbers. In: ISSAC '94: Proceedings of the international symposium on symbolic and algebraic computation. ACM Press; 1994. p. 291-96.
  • 10
    • 0027152681 scopus 로고    scopus 로고
    • Benouamer M, Jaillon P, Michelucci D, Moreau J.-M. A lazy arithmetic library. In: Proceedings of the IEEE 11th symposium on computer arithmetic, Windsor, Ontario; 1993. p. 242-69.
  • 12
    • 0022886857 scopus 로고    scopus 로고
    • Hong J. Proving by example and gap theorem. In: 27th symposium on foundations of computer science. Toronto, Ontario: ICS Press; 1986. p. 107-16.
  • 13
    • 0001782882 scopus 로고    scopus 로고
    • Emiris I, Rege A. Monomial bases and polynomial system solving (extended abstract). In: ISSAC '94: Proceedings of the international symposium on symbolic and algebraic computation; 1994. p. 114-22.
  • 14
    • 30944452190 scopus 로고    scopus 로고
    • Rege A. A complete and practical algorithm for geometric theorem proving. In: SCG '95: Proceedings of the eleventh annual symposium on computational geometry. ACM Press; 1995. p. 277-86.
  • 15
    • 33645885154 scopus 로고    scopus 로고
    • Bouhineau D. Constructions automatiques de figures géométriques et programmation logique avec contraintes. PhD Thesis. Université Joseph Fourier, Grenoble; 1997.
  • 16
    • 84949510783 scopus 로고    scopus 로고
    • Tulone D, Yap C-K, Li C. Randomized zero testing of radical expressions and elementary geometry theorem proving. In: ADG '00: revised papers from the third international workshop on automated deduction in geometry. London, UK: Springer; 2001. p. 58-82.
  • 17
    • 0001114105 scopus 로고
    • Springer, Berlin p. 225-39 [Ch. Almost all simply connected closed surfaces are rigid]
    • Gluck H. Geometric topology (1975), Springer, Berlin p. 225-39 [Ch. Almost all simply connected closed surfaces are rigid]
    • (1975) Geometric topology
    • Gluck, H.1
  • 18
    • 0011306552 scopus 로고
    • Some examples of the use of distances as coordinates for euclidean geometry
    • Havel T.F. Some examples of the use of distances as coordinates for euclidean geometry. J Symb Comput 11 (1991) 579-593
    • (1991) J Symb Comput , vol.11 , pp. 579-593
    • Havel, T.F.1
  • 20
    • 33645845258 scopus 로고    scopus 로고
    • Laurent M. Matrix completion problems. The encyclopedia of optimization 3 (Interior-M); 2001. p. 221-29.
  • 21
    • 33645879950 scopus 로고    scopus 로고
    • Hendrickson BA. The molecule problem: determining conformation from pairwise distances. PhD Thesis. Cornell University, Ithaca, NY, USA; 1991.
  • 22
    • 0013558430 scopus 로고
    • The molecule problem: exploiting structure in global optimization
    • Hendrickson B.A. The molecule problem: exploiting structure in global optimization. SIAM J Optimiz 5 (1995) 835-857
    • (1995) SIAM J Optimiz , vol.5 , pp. 835-857
    • Hendrickson, B.A.1
  • 25
    • 33645864777 scopus 로고    scopus 로고
    • Serré P. Cohérence de la spécification d'un objet de l'espace euclidien à n dimensions. PhD Thesis. Ecole Centrale de Paris; 2000.
  • 27
  • 29
    • 21644483350 scopus 로고    scopus 로고
    • Michelucci D, Foufou S. Using Cayley-Menger determinants for geometric constraint solving. In: ACM symposium on solid modeling. Genova, Italy: ACM Press; 2004. p. 285-90.
  • 30
    • 0038041420 scopus 로고    scopus 로고
    • Gao X-S, Zhang G. Geometric constraint solving via c-tree decomposition. In: ACM solid modelling. New York: ACM Press; 2003. p. 45-55.
  • 31
    • 33645846429 scopus 로고    scopus 로고
    • Macé P, Michelucci D, Untersteller L.-P. Solving space orthogonality constraints in a 2d drawing. In: Fifth international workshop on automated deduction in geometry. Florida, USA: University of Florida in Gainesville; 2004.
  • 32
    • 0036038082 scopus 로고    scopus 로고
    • Joan-Arinyo R, Soto-Riera A, Vila-Marta S, Vilaplana-Pasto J. Revisiting decomposition analysis of geometric constraints graphs. In: Proceedings of the ACM SM02. ACM Press; 2002. p. 105-15.
  • 33
    • 0038041414 scopus 로고    scopus 로고
    • Joan-Arinyo R, Soto-Riera A, Vila-Marta S, Vilaplana-Pasto J. Transforming an under-constrained geometric constraint problem into a well-constrained one. In: Proceedings of the ACM SM03. ACM Press; 2003. p. 33-44.
  • 34
    • 33645847976 scopus 로고    scopus 로고
    • Joan-Arinyo R, Soto-Riera A, Vila-Marta S. Tools to deal with under-constrained geometric constraints graphs. In: Workshop on geometric constraints solving, Beijing, China; 2003.
  • 35
    • 33645879359 scopus 로고    scopus 로고
    • Gao X-S, Zhang G. Geometric constraint solving based on connectivity of graphs. Technical report MMRC, AMSS, Academia Sinica, Beijing, 22, MM research preprints; 2003.
  • 36
    • 0345414526 scopus 로고    scopus 로고
    • Wilczkowiak M, Trombettoni G, Jermann C, Sturm P, Boyer E. Scene modelling based on constraint system decomposition techniques. In: Proceedings of the international conference on computer vision; 2003. p. 1004-10.
  • 37
    • 0027795823 scopus 로고    scopus 로고
    • Taubin G. An accurate algorithm for Rasterizing algebraic curves. In: Second symposium on solid modeling and applications. ACM/IEEE; 1993. p. 221-30.
  • 38
    • 33645887070 scopus 로고    scopus 로고
    • de Figueiredo L, Stolfi J. Adaptive enumeration of implicit surfaces with affine arithmetic. In: Proceedings of the eurographics workshop on implicit surfaces. INRIA; 1995. p. 161-70.
  • 39
    • 84872743869 scopus 로고    scopus 로고
    • Michelucci D, Foufou S, Lamarque L, Ménégaux D. Bernstein based arithmetic featuring de Casteljau. In: Canadian conference on computational geometry. Canada: University of Windsor; 2005. p. 212-15.
  • 40
    • 33645843183 scopus 로고    scopus 로고
    • COPRIN, ALIAS-C++: A C++ algorithms library of interval analysis for equation systems, version 2.3. Technical report, INRIA Sophia-Antipolis; 2004.
  • 41
    • 0036039571 scopus 로고    scopus 로고
    • Gao X-S, Hoffmann CM, Yang W-Q. Solving spatial basic geometric constraint configurations with locus intersection. In: SMA '02: Proceedings of the seventh ACM symposium on solid modeling and applications. New York, NY, USA: ACM Press; 2002. p. 95-104.
  • 42
    • 33645841196 scopus 로고    scopus 로고
    • Bonin J.E. Introduction to matroid theory. Technical report, The George Washington University; 2002. Available from: http://home.gwu.edu/jbonin/survey.ps


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.