A new algorithm for the minimal-area convex enclosure problem
Authors:
- 1 August 1995
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 84 (3) , 522-538
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Marker-making using automatic placement of irregular shapes for the garment industryComputers & Graphics, 1990
- Intelligent nesting system on 2-D highly irregular resources1990
- Determining in Linear Time the Minimum Area Convex Hull of Two PolygonsIIE Transactions, 1988
- Circumscribing a convex polygon by a polygon of fewer sides with minimal area additionComputer Vision, Graphics, and Image Processing, 1983
- Nesting two-dimensional shapes in rectangular modulesComputer-Aided Design, 1976
- Determining the minimum-area encasing rectangle for an arbitrary closed curveCommunications of the ACM, 1975