{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T04:32:53Z","timestamp":1726201973951},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":5411,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0004-3702(98)00076-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:24:09Z","timestamp":1027643049000},"page":"139-159","source":"Crossref","is-referenced-by-count":6,"title":["Detecting geometric infeasibility"],"prefix":"10.1016","volume":"105","author":[{"given":"Achim","family":"Schweikard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Schwarzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(98)00076-9_BIB1","series-title":"Proceedings 7th ACM-SIAM Symp. Discrete Algorithms (SODA)","first-page":"122","article-title":"Efficient generation of k-directional assembly sequences","author":"Agarwal","year":"1996"},{"key":"10.1016\/S0004-3702(98)00076-9_BIB2","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/S0004-3702(98)00076-9_BIB3","series-title":"Proceedings 11th International Colloquium on Automata, Languages, and Programming","first-page":"119","article-title":"The complexity and decidability of SEPARATION","volume":"Vol. 172","author":"Chazelle","year":"1984"},{"key":"10.1016\/S0004-3702(98)00076-9_BIB4","doi-asserted-by":"crossref","unstructured":"L. Guibas, D. Halperin, H. Hirukawa et al., Polyhedral assembly partitioning using maximally covered cells in arrangements of convex polytopes, Internat. J. Comput. Geometry and Applications (to appear).","DOI":"10.1142\/S0218195998000102"},{"key":"10.1016\/S0004-3702(98)00076-9_BIB5","doi-asserted-by":"crossref","DOI":"10.21236\/ADA204234","article-title":"Automatic generation of mechanical assembly sequences","author":"de Mello","year":"1988"},{"issue":"3","key":"10.1016\/S0004-3702(98)00076-9_BIB6","doi-asserted-by":"crossref","DOI":"10.1177\/027836499601500301","article-title":"Interference-free insertion of a solid body into a cavity: an algorithm and a medical application","volume":"15","author":"Joskowicz","year":"1996","journal-title":"Internat. J. Robotics Research"},{"key":"10.1016\/S0004-3702(98)00076-9_BIB7","series-title":"Robot Motion Planning","author":"Latombe","year":"1991"},{"issue":"2","key":"10.1016\/S0004-3702(98)00076-9_BIB8","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TC.1983.1676196","article-title":"Spatial planning: a configuration space approach","volume":"C-32","author":"Lozano-P\u00e9rez","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0004-3702(98)00076-9_BIB9","series-title":"LEDA: A Platform for Combinatorial and Geometric Computing","author":"Mehlhorn","year":"1995"},{"key":"10.1016\/S0004-3702(98)00076-9_BIB10","article-title":"Optimization software guide","volume":"14","author":"More'","year":"1993","journal-title":"SIAM J. Frontiers in Appl. Math."},{"key":"10.1016\/S0004-3702(98)00076-9_BIB11","series-title":"Computational Geometry","author":"O'Rourke","year":"1994"},{"key":"10.1016\/S0004-3702(98)00076-9_BIB12","series-title":"Computational Geometry","article-title":"Movable separability of sets","author":"Toussaint","year":"1985"},{"key":"10.1016\/S0004-3702(98)00076-9_BIB13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02187902","article-title":"Separating two simple polygons by a sequence of translations","volume":"3","author":"Pollack","year":"1988","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0004-3702(98)00076-9_BIB14","article-title":"Efficiently testing for unboundedness and m-handed assembly","author":"Schwarzer","year":"1997"},{"issue":"6","key":"10.1016\/S0004-3702(98)00076-9_BIB15","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/BF01189068","article-title":"Assembly sequences for polyhedra","volume":"13","author":"Schweikard","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0004-3702(98)00076-9_BIB16","article-title":"On the automatic Generation of Plans for Mechanical Assembly","author":"Wolter","year":"1988"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298000769?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298000769?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T06:50:38Z","timestamp":1555051838000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370298000769"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0004370298000769"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(98)00076-9","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}