Rotational polygon overlap minimization and compaction
Open Access
- 31 July 1998
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 10 (4) , 305-318
- https://doi.org/10.1016/s0925-7721(98)00012-1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Multiple Translational Containment Part II: Exact AlgorithmsAlgorithmica, 1997
- Two-Stage Approach for Nesting in Two-Dimensional Cutting Problems Using Neural Network and Simulated AnnealingProceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 1996
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problemEuropean Journal of Operational Research, 1996
- Solution approaches to irregular nesting problemsEuropean Journal of Operational Research, 1995
- Compaction and separation algorithms for non-convex polygons and their applicationsEuropean Journal of Operational Research, 1995
- A sliding algorithm for optimal nesting of arbitrarily shaped sheet metal blanksInternational Journal of Production Research, 1995
- Computing the intersection-depth of polyhedraAlgorithmica, 1993
- Optimal Blank Nesting Using Simulated AnnealingJournal of Mechanical Design, 1992
- A polynomial solution for the potato-peeling problemDiscrete & Computational Geometry, 1986