{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T15:40:50Z","timestamp":1720280450197},"reference-count":47,"publisher":"Elsevier BV","content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer-Aided Design"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1016\/j.cad.2014.02.006","type":"journal-article","created":{"date-parts":[[2014,2,24]],"date-time":"2014-02-24T15:34:39Z","timestamp":1393256079000},"page":"1-16","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Decomposition of geometric constraint graphs based on computing fundamental circuits. Correctness and complexity"],"prefix":"10.1016","volume":"52","author":[{"given":"R.","family":"Joan-Arinyo","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4473-6947","authenticated-orcid":false,"given":"M.","family":"Tarr\u00e9s-Puertas","sequence":"additional","affiliation":[]},{"given":"S.","family":"Vila-Marta","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cad.2014.02.006_br000005","unstructured":"Thierry SEB. D\u00e9composition et param\u00e9trisation de syst\u00e8mes de contraites g\u00e9om\u00e9triques sous-constraints. Ph.D. thesis. Universit\u00e9 de Strasbourg; 2010."},{"key":"10.1016\/j.cad.2014.02.006_br000010","series-title":"Proceedings of solid modeling","article-title":"Solving spatial basic geometric constraint configurations with locus intersection","author":"Gao","year":"2002"},{"key":"10.1016\/j.cad.2014.02.006_br000015","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\/j.cad.2014.02.006_br000020","first-page":"291","article-title":"Using geometric rewrite rules for solving geometric problems symbolically","volume":"116","author":"Br\u00fcderlin","year":"1993"},{"issue":"6","key":"10.1016\/j.cad.2014.02.006_br000025","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/0010-4485(94)00013-4","article-title":"Geometric constraint solver","volume":"27","author":"Bouma","year":"1995","journal-title":"Comput Aided Design"},{"key":"10.1016\/j.cad.2014.02.006_br000030","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0004-3702(97)00070-2","article-title":"Geometric construction by assembling solved subfigures","volume":"99","author":"Dufourd","year":"1998","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/j.cad.2014.02.006_br000035","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 Graphics"},{"issue":"1","key":"10.1016\/j.cad.2014.02.006_br000040","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cad.2005.03.002","article-title":"A C-tree decomposition algorithm for 2D and 3D geometric constraint solving","volume":"38","author":"Gao","year":"2006","journal-title":"Comput-Aided Design"},{"key":"10.1016\/j.cad.2014.02.006_br000045","unstructured":"Jermann C. R\u00e9solution de constraintes g\u00e9om\u00e9triques par rigidification r\u00e9cursive et propagation d\u2019intervalles. Ph.D. thesis, Universit\u00e9 de Nice-Sophia Antipolis; 2002. [in French]."},{"issue":"5","key":"10.1016\/j.cad.2014.02.006_br000050","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 Graphics"},{"key":"10.1016\/j.cad.2014.02.006_br000055","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.cad.2006.01.005","article-title":"Geometric constraint solving: the witness configuration method","volume":"38","author":"Michelucci","year":"2006","journal-title":"Comput-Aided Design"},{"key":"10.1016\/j.cad.2014.02.006_br000060","series-title":"Symposium on solid modeling foundations and CAD\/CAM applications","first-page":"397","article-title":"Algebraic solution for geometry from dimensional constraints","author":"Owen","year":"1991"},{"issue":"4","key":"10.1016\/j.cad.2014.02.006_br000065","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1142\/S0218195996000265","article-title":"Constraints on simple geometry in two and three dimensions","volume":"6","author":"Owen","year":"1996","journal-title":"Int J Comput Geom Appl"},{"key":"10.1016\/j.cad.2014.02.006_br000070","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/S0010-4485(01)00133-6","article-title":"A new constructive approach to constraint-based geometric design","volume":"34","author":"Podgorelec","year":"2002","journal-title":"Comput-Aided Design"},{"issue":"5","key":"10.1016\/j.cad.2014.02.006_br000075","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.cad.2006.01.002","article-title":"Using invariance under the similarity group to solve geometric constraint systems","volume":"38","author":"Schreck","year":"2006","journal-title":"Comput-Aided Design"},{"issue":"10","key":"10.1016\/j.cad.2014.02.006_br000080","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/0010-4485(92)90040-H","article-title":"Rule-oriented method for parameterized computer-aided design","volume":"24","author":"Verroust","year":"1992","journal-title":"Comput Aided Design"},{"key":"10.1016\/j.cad.2014.02.006_br000085","series-title":"Compugraphic","first-page":"83","article-title":"Reduction of constraint systems","author":"Ait-Auodia","year":"1993"},{"key":"10.1016\/j.cad.2014.02.006_br000090","series-title":"IJCAI 2003","first-page":"233","article-title":"Algorithms for identifying rigid subsystems in geometric constraint systems","author":"Jermann","year":"2003"},{"issue":"1\u20133","key":"10.1016\/j.cad.2014.02.006_br000095","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0004-3702(92)90012-M","article-title":"A geometric constraint engine","volume":"58","author":"Kramer","year":"1992","journal-title":"Artificial Intelligence"},{"issue":"11","key":"10.1016\/j.cad.2014.02.006_br000100","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1016\/0010-4485(96)00023-1","article-title":"Connectivity analysis: a tool for processing geometric constraints","volume":"28","author":"Latham","year":"1996","journal-title":"Comput Aided Design"},{"key":"10.1016\/j.cad.2014.02.006_br000105","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\/j.cad.2014.02.006_br000110","doi-asserted-by":"crossref","unstructured":"Hoffmann CM, Lomonosov A, Sitharam M. Finding solvable subsets of constraint graphs. In: Principles and practice of constraint programming, p.\u00a0463\u201377; 1977.","DOI":"10.1007\/BFb0017460"},{"key":"10.1016\/j.cad.2014.02.006_br000115","unstructured":"Lomonosov A. Graph and combinatorial algorithms for geometric constraint solving. Ph.D. thesis. University of Florida; 2004."},{"key":"10.1016\/j.cad.2014.02.006_br000120","unstructured":"Zhou Y. Combinatorial decomposition, generic independence and algebraic complexity of geometric constraint systems. Applications in biology and engineering. Ph.D. thesis. University of Florida; 2006."},{"issue":"2","key":"10.1016\/j.cad.2014.02.006_br000125","article-title":"Geometric constraint solving in parametric CAD","volume":"11","author":"Bettig","year":"2011","journal-title":"JCISE J Comput Inf Sci Eng"},{"issue":"5\u20136","key":"10.1016\/j.cad.2014.02.006_br000130","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1142\/S0218195906002105","article-title":"Decomposition of geometric constraint systems: a survey","volume":"16","author":"Jerman","year":"2006","journal-title":"Int J Comput Geom Appl"},{"key":"10.1016\/j.cad.2014.02.006_br000135","series-title":"Geometric and algorithmic aspects of computer-aided design and manufacturing","first-page":"117","article-title":"Combinatorial approaches to geometric constraint solving: problems, progress and directions","volume":"vol 67","author":"Sitharam","year":"2005"},{"issue":"4","key":"10.1016\/j.cad.2014.02.006_br000140","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 Eng Math"},{"key":"10.1016\/j.cad.2014.02.006_br000145","series-title":"2009 SIAM\/ACM joint conference on geometric and physical modeling","first-page":"113","article-title":"Treedecomposition of geometric constraint graphs based on computing graph circuits","author":"Joan-Arinyo","year":"2009"},{"key":"10.1016\/j.cad.2014.02.006_br000150","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\/j.cad.2014.02.006_br000155","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0010-4485(03)00057-5","article-title":"Revisiting decomposition analysis of geometric constraint graphs","volume":"36","author":"Joan-Arinyo","year":"2004","journal-title":"Comput-Aided Design"},{"key":"10.1016\/j.cad.2014.02.006_br000160","series-title":"Graph algorithms","author":"Even","year":"1979"},{"key":"10.1016\/j.cad.2014.02.006_br000165","series-title":"Graphs: theory and algorithms","author":"Thulasiraman","year":"1992"},{"issue":"5","key":"10.1016\/j.cad.2014.02.006_br000170","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1080\/16864360.2005.10738330","article-title":"A brief on constraint solving","volume":"2","author":"Hoffmann","year":"2005","journal-title":"Comput-Aided Design Appl"},{"key":"10.1016\/j.cad.2014.02.006_br000175","volume":"vol 12","author":"Nishizeki","year":"2004"},{"key":"10.1016\/j.cad.2014.02.006_br000180","series-title":"Planar graphs: theory and algorithms","author":"Nishizeki","year":"2008"},{"issue":"2","key":"10.1016\/j.cad.2014.02.006_br000185","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"},{"key":"10.1016\/j.cad.2014.02.006_br000190","series-title":"Data structures and algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/j.cad.2014.02.006_br000195","series-title":"19th annual symposium on theory of computing","first-page":"335","article-title":"A new graph triconnectivity algorithm and its parallelization","author":"Miller","year":"1987"},{"key":"10.1016\/j.cad.2014.02.006_br000200","series-title":"6th annual international conference on computing and combinatorics","first-page":"95","article-title":"Computing optimal embeddings for planar graphs","volume":"vol 1858","author":"Mutzel","year":"2000"},{"key":"10.1016\/j.cad.2014.02.006_br000205","series-title":"Differential geometry of curves and surfaces","author":"Do Carmo","year":"1976"},{"issue":"4","key":"10.1016\/j.cad.2014.02.006_br000210","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 Geom Appl"},{"key":"10.1016\/j.cad.2014.02.006_br000215","unstructured":"Savage JE. Models of computation: exploring the power of computing. Creative Commons, http:\/\/cs.brown.edu\/~jes\/book\/home.html; 2008."},{"issue":"5","key":"10.1016\/j.cad.2014.02.006_br000220","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(85)90024-9","article-title":"Depth-first search is inherently sequential","volume":"20","author":"Reif","year":"1985","journal-title":"Inform Process Lett"},{"key":"10.1016\/j.cad.2014.02.006_br000225","series-title":"Introduction to algorithms","author":"Cormen","year":"1990"},{"issue":"2","key":"10.1016\/j.cad.2014.02.006_br000230","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1023\/A:1018373005182","article-title":"On the solution of linear recurrence equations","volume":"10","author":"Akra","year":"1998","journal-title":"Comput Optim Appl"},{"issue":"359","key":"10.1016\/j.cad.2014.02.006_br000235","doi-asserted-by":"crossref","first-page":"2269","DOI":"10.1090\/S0002-9947-06-04049-9","article-title":"The nonsolvability by radicals of generic 3-connected planar graphs","volume":"5","author":"Owen","year":"2006","journal-title":"Trans Amer Math Soc"}],"container-title":["Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001044851400030X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001044851400030X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,8,15]],"date-time":"2020-08-15T18:08:15Z","timestamp":1597514895000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S001044851400030X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":47,"alternative-id":["S001044851400030X"],"URL":"https:\/\/doi.org\/10.1016\/j.cad.2014.02.006","relation":{},"ISSN":["0010-4485"],"issn-type":[{"value":"0010-4485","type":"print"}],"subject":[],"published":{"date-parts":[[2014,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Decomposition of geometric constraint graphs based on computing fundamental circuits. Correctness and complexity","name":"articletitle","label":"Article Title"},{"value":"Computer-Aided Design","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cad.2014.02.006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}