On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
Open Access
- 1 September 1987
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 2 (3), 255-270
- https://doi.org/10.1007/bf02187883
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Almost linear upper bounds on the length of general davenport—schinzel sequencesCombinatorica, 1987
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstaclesDiscrete & Computational Geometry, 1986
- An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- Dynamic computational geometryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriersCommunications on Pure and Applied Mathematics, 1983
- On a problem of Davenport and SchinzelActa Arithmetica, 1973