{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T13:43:29Z","timestamp":1693143809147},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer-Aided Design"],"published-print":{"date-parts":[[2004,2]]},"DOI":"10.1016\/s0010-4485(03)00057-5","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T22:53:11Z","timestamp":1051224791000},"page":"123-140","source":"Crossref","is-referenced-by-count":19,"title":["Revisiting decomposition analysis of geometric constraint graphs"],"prefix":"10.1016","volume":"36","author":[{"given":"R.","family":"Joan-Arinyo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Soto-Riera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Vila-Marta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Vilaplana-Past\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0010-4485(03)00057-5_BIB1","series-title":"The design and analysis of computer algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0010-4485(03)00057-5_BIB2","series-title":"Graphs and digraphs","author":"Chartrand","year":"1996"},{"key":"10.1016\/S0010-4485(03)00057-5_BIB3","series-title":"Mathematical models","author":"Cundy","year":"1961"},{"key":"10.1016\/S0010-4485(03)00057-5_BIB4","unstructured":"Durand C. Symbolic and numerical techniques for constraint solving. PhD thesis, Computer Science, Purdue University; December 1998."},{"key":"10.1016\/S0010-4485(03)00057-5_BIB5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0004-3702(00)00061-8","article-title":"Skecth-based pruning of a solution space within a formal geometric constraint solver","volume":"124","author":"Essert-Villard","year":"2000","journal-title":"Artif Intell"},{"key":"10.1016\/S0010-4485(03)00057-5_BIB6","unstructured":"Fudos I. Editable representations for 2D geometric design. Master's thesis, Purdue University, Department of Computer Sciences; 1993."},{"key":"10.1016\/S0010-4485(03)00057-5_BIB7","unstructured":"Fudos I. Constraint solving for computer aided design. PhD thesis, Purdue University, Department of Computer Sciences; 1995."},{"issue":"4","key":"10.1016\/S0010-4485(03)00057-5_BIB8","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1142\/S0218195996000253","article-title":"Correctness proof of a geometric constraint solver","volume":"6","author":"Fudos","year":"1996","journal-title":"Int J Comput Geometry Appl"},{"issue":"2","key":"10.1016\/S0010-4485(03)00057-5_BIB9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/248210.248223","article-title":"A graph-constructive approach to solving systems of geometric constraints","volume":"16","author":"Fudos","year":"1997","journal-title":"ACM Trans Graph"},{"key":"10.1016\/S0010-4485(03)00057-5_BIB10","series-title":"Handbook of computer aided geometric design, chapter parametric modeling","author":"Hoffmann","year":"2002"},{"key":"10.1016\/S0010-4485(03)00057-5_BIB11","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1006\/jsco.2000.0403","article-title":"Decompostion plans for geometric constraint problems, Part II: new algorithms","volume":"31","author":"Hoffmann","year":"2001","journal-title":"J Symbolic Comput"},{"key":"10.1016\/S0010-4485(03)00057-5_BIB12","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1006\/jsco.2000.0402","article-title":"Decompostion plans for geometric constraint systems, Part I: performance measurements for CAD","volume":"31","author":"Hoffmann","year":"2001","journal-title":"J Symbolic Comput"},{"key":"10.1016\/S0010-4485(03)00057-5_BIB13","unstructured":"Hopcroft JE, Tarjan RE. Dividing a graph into triconnected components. Technical Report, Computer Science Department. Cornell University, Ithaca, NY, USA; February 1974."},{"key":"10.1016\/S0010-4485(03)00057-5_BIB14","series-title":"Parallel problem solving from nature\u2014PPSN VII, LNCS 2439","first-page":"759","article-title":"Constructive geometric constraint solving: a new application of genetic algorithms","author":"Joan-Arinyo","year":"2002"},{"issue":"5","key":"10.1016\/S0010-4485(03)00057-5_BIB15","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/S0097-8493(97)00038-1","article-title":"A correct rule-based geometric constraint solver","volume":"21","author":"Joan-Arinyo","year":"1997","journal-title":"Comput Graph"},{"issue":"1","key":"10.1016\/S0010-4485(03)00057-5_BIB16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/300776.300780","article-title":"Combining constructive and equational geometric constraint solving techniques","volume":"18","author":"Joan-Arinyo","year":"1999","journal-title":"ACM Trans Graph"},{"key":"10.1016\/S0010-4485(03)00057-5_BIB17","first-page":"49","article-title":"On the domain of constructive geometric constraint solving techniques","author":"Joan-Arinyo","year":"2001"},{"key":"10.1016\/S0010-4485(03)00057-5_BIB18","first-page":"63","article-title":"Declarative characterization of a general architecture for constructive geometric constraint solvers","author":"Joan-Arinyo","year":"2002"},{"issue":"4","key":"10.1016\/S0010-4485(03)00057-5_BIB19","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01534980","article-title":"On graphs and rigidity of plane skeletal structures","volume":"4","author":"Laman","year":"1970","journal-title":"J Engng Math"},{"key":"10.1016\/S0010-4485(03)00057-5_BIB20","series-title":"The deductive foundations of computer programming","author":"Manna","year":"1993"},{"key":"10.1016\/S0010-4485(03)00057-5_BIB21","unstructured":"Mata N. Solving incidence and tangency constraints in 2D. Technical Report LSI-97-3R, Department LiSI, Universitat Polit\u00e8cnica de Catalunya; 1997."},{"key":"10.1016\/S0010-4485(03)00057-5_BIB22","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01191205","article-title":"A new graph triconnectivity algorithm and its parallelization","volume":"12","author":"Miller","year":"1992","journal-title":"Combinatorica"},{"key":"10.1016\/S0010-4485(03)00057-5_BIB23","first-page":"397","article-title":"Algebraic solution for geometry from dimensional constraints","author":"Owen","year":"1991"},{"issue":"2","key":"10.1016\/S0010-4485(03)00057-5_BIB24","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0402022","article-title":"A k-tree generalization that characterizes consistency of dimensioned engineering drawings","volume":"2","author":"Todd","year":"1989","journal-title":"SIAM J Disc Math"}],"container-title":["Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448503000575?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448503000575?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T22:20:58Z","timestamp":1553206858000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0010448503000575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0010448503000575"],"URL":"https:\/\/doi.org\/10.1016\/s0010-4485(03)00057-5","relation":{},"ISSN":["0010-4485"],"issn-type":[{"value":"0010-4485","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}