{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T15:15:54Z","timestamp":1760368554580},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1987,9,1]],"date-time":"1987-09-01T00:00:00Z","timestamp":557452800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1987,9]]},"DOI":"10.1007\/bf02187883","type":"journal-article","created":{"date-parts":[[2005,10,29]],"date-time":"2005-10-29T08:51:54Z","timestamp":1130575914000},"page":"255-270","source":"Crossref","is-referenced-by-count":36,"title":["On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space"],"prefix":"10.1007","volume":"2","author":[{"given":"Daniel","family":"Leven","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha","family":"Sharir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1987,9,1]]},"reference":[{"key":"BF02187883_CR1","doi-asserted-by":"crossref","unstructured":"M. Atallah, Dynamic computational geometry,Proceedings of the 24th Symposium on Foundations of Computer Science, 92\u201399, 1983.","DOI":"10.1109\/SFCS.1983.13"},{"key":"BF02187883_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02579170","volume":"6","author":"S. Hart","year":"1986","unstructured":"S. Hart and M. Sharir, Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes,Combinatorica 6 (1986), 175\u2013201.","journal-title":"Combinatorica"},{"key":"BF02187883_CR3","unstructured":"K. Kedem and M. Sharir, An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space, Technical Report 253, Computer Science Department, Courant Institute, 1986."},{"key":"BF02187883_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 Comput. Geom. 1 (1986), 59\u201371.","journal-title":"Discrete Comput. Geom."},{"key":"BF02187883_CR5","doi-asserted-by":"crossref","unstructured":"D. Leven and M. Sharir, An efficient and simple motion-planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers,Proceedings of the ACM Symposium on Computational Geometry, 221\u2013227, 1985 (also to appear inJ. Algorithms).","DOI":"10.1145\/323233.323262"},{"key":"BF02187883_CR6","unstructured":"D. Leven and M. Sharir, Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams, Technical Report 34\/85, The Eskenasy Institute of Computer Science, Tel Aviv University, 1985 (also to appear inDiscrete Comput. Geom.)."},{"key":"BF02187883_CR7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/cpa.3160360305","volume":"36","author":"J. T. Schwartz","year":"1983","unstructured":"J. T. Schwartz and M. Sharir, On the piano movers' problem: I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers,Comm. Pure Appl. Math. 36 (1983), 345\u2013398.","journal-title":"Comm. Pure Appl. Math."},{"key":"BF02187883_CR8","doi-asserted-by":"crossref","unstructured":"M. Sharir, Almost Linear Upper Bounds on the Length of Generalized Davenport-Schinzel Sequences, Technical Report 29\/85, The Eskenasy Institure of Computer Science, Tel-Aviv University, 1985 (also to appear inCombinatorica 7 (1987).)","DOI":"10.1007\/BF02579209"},{"key":"BF02187883_CR9","unstructured":"M. Sharir, Improved Lower Bounds on the Length of Davenport-Schinzel Sequences, Technical Report 204, Computer Science Department, Courant Institute, 1986."},{"key":"BF02187883_CR10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.4064\/aa-25-2-213-224","volume":"25","author":"E. Szemeredi","year":"1974","unstructured":"E. Szemeredi, On a problem by Davenport and Schinzel,Acta Arith. 25 (1974), 213\u2013224.","journal-title":"Acta Arith."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187883.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187883\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T15:22:03Z","timestamp":1586532123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,9]]}},"alternative-id":["BF02187883"],"URL":"https:\/\/doi.org\/10.1007\/bf02187883","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}