{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:08Z","timestamp":1725663788943},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_281","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:07:08Z","timestamp":1330240028000},"page":"577-588","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Combinatorial complexity of signed discs"],"prefix":"10.1007","author":[{"given":"Diane L.","family":"Souvaine","sequence":"first","affiliation":[]},{"given":"Chee-Keng","family":"Yap","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"53_CR1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02187784","volume":"5","author":"H. Edelsbrunner","year":"1990","unstructured":"H. Edelsbrunner, L. Guibas, and M. Sharir. The complexity and construction of many faces in arrangments of lines and of segments. Discrete and Computational Geometry, 5:161\u2013196, 1990.","journal-title":"Discrete and Computational Geometry"},{"key":"53_CR2","unstructured":"M. T. Goodrich and D. Kravets. Point set pattern matching, 1992. Preprint."},{"key":"53_CR3","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/BF02187744","volume":"4","author":"L. J. Guibas","year":"1989","unstructured":"L. J. Guibas, M. Sharir, and S. Sifrony. On the general motion-planning problem with 2 degrees of freedom. Discrete and Computational Geometry, 4:491\u2013521, 1989.","journal-title":"Discrete and Computational Geometry"},{"key":"53_CR4","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02187683","volume":"1","author":"K. Kedem","year":"1986","unstructured":"K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete and Computational Geometry, 1:59\u201371, 1986.","journal-title":"Discrete and Computational Geometry"},{"key":"53_CR5","volume-title":"DIMACS Technical Report 92-54","author":"D. Souvaine","year":"1992","unstructured":"Diane Souvaine and Chee Yap. Combinatorial complexity of signed discs. DIMACS Technical Report 92-54, Center for Discrete Mathematics and Theoretical Computer Science, New Jersey, December 1992."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:19:24Z","timestamp":1578518364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_281"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_281","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"9 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}