{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:08:39Z","timestamp":1761487719555},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"05n06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p> In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in such a way that the new constraint problem G is well-constrained and the set of equations to be solved simultaneously in order to solve G has the smallest size. We propose a polynomial time algorithm which gives a partial solution to the above problem. <\/jats:p>","DOI":"10.1142\/s0218195906002142","type":"journal-article","created":{"date-parts":[[2006,11,3]],"date-time":"2006-11-03T06:57:15Z","timestamp":1162537035000},"page":"461-478","source":"Crossref","is-referenced-by-count":7,"title":["WELL-CONSTRAINED COMPLETION AND DECOMPOSITION FOR UNDER-CONSTRAINED GEOMETRIC CONSTRAINT PROBLEMS"],"prefix":"10.1142","volume":"16","author":[{"given":"GUI-FANG","family":"ZHANG","sequence":"first","affiliation":[{"name":"School of Sciences, Beijing Forestry University, Beijing 100083, China"},{"name":"KLMM, ISS, AMMS, Academia Sinica, Beijing 100080, China"}]},{"given":"XIAO-SHAN","family":"GAO","sequence":"additional","affiliation":[{"name":"KLMM, Institute of Systems Science, AMSS, Academia Sinica, Beijing 100080, China"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4485(96)00023-1"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1145\/248210.248223"},{"key":"rf4","first-page":"305","volume":"6","author":"Yuan B.","journal-title":"Chinese J. Adv. Soft. Res."},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0965-9978(02)00108-4"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2005.03.002"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0010-4485(97)00055-9"},{"key":"rf10","volume-title":"Graphs and Algorithms","author":"Gondran M.","year":"1984"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58898-3_12"},{"key":"rf13","first-page":"141","volume":"21","author":"Gao X. S.","journal-title":"IEEE Trans. Robot."},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00070-2"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195906002142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:22:03Z","timestamp":1565176923000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195906002142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":10,"journal-issue":{"issue":"05n06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1142\/S0218195906002142"],"URL":"https:\/\/doi.org\/10.1142\/s0218195906002142","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}