Compaction and separation algorithms for non-convex polygons and their applications
- 1 August 1995
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 84 (3) , 539-561
- https://doi.org/10.1016/0377-2217(95)00021-h
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Robust polygon modellingComputer-Aided Design, 1993
- Cutting and Packing Problems: A Categorized, Application-Orientated Research BibliographyJournal of the Operational Research Society, 1992
- A typology of cutting and packing problemsEuropean Journal of Operational Research, 1990
- Finding the upper envelope of n line segments in O(n log n) timeInformation Processing Letters, 1989
- Verifiable implementations of geometric algorithms using finite precision arithmeticArtificial Intelligence, 1988
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem"The International Journal of Robotics Research, 1984
- On the solution of inequality systems relevant to IC-layoutJournal of Algorithms, 1984
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979