|
7716
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
1541
|
Computational Geometry: An Introduction
– Preparata, Shamos
- 1985
|
|
805
|
Combinatorial Optimization: Algorithms and Complexity
– Papadimitriou, Steiglitz
- 1998
|
|
611
|
Algorithms in combinatorial geometry
– Edelsbrunner
- 1987
|
|
245
|
A sweepline algorithm for Voronoi diagrams
– Fortune
- 1987
|
|
240
|
Applying parallel computation algorithms in the design of serial algorithms
– Megiddo
- 1983
|
|
227
|
Combinatorial Optimization: Networks and
– Lawler
- 1976
|
|
221
|
Optimal search in planar subdivisions
– Kirkpatrick
- 1983
|
|
140
|
Image analysis and Mathematical morphology, volume 2 of Theoretical Advances
– Serra
- 1988
|
|
92
|
A kinetic framework for computational geometry
– Guibas, Ramshaw, et al.
- 1983
|
|
90
|
A Polynomial Algorithm in Linear Programming
– Khachian
- 1979
|
|
83
|
Approximate Algorithms for Bin Packing - An Updated Survey
– Coffman, Garey, et al.
- 1985
|
|
74
|
A typology of cutting and packing problems
– Dyckhoff
- 1990
|
|
71
|
Approximate matching of polygonal shapes
– Alt, Behrends, et al.
- 1995
|
|
53
|
Probabilistic Analysis of Packing and Partitioning Algorithms, Wiley--Interscience Series
– Coffman
- 1991
|
|
51
|
A Linear Algorithm for Computing the Visibility Polygon from a Point
– ElGindy, Avis
- 1981
|
|
43
|
New optimization heuristics - the great deluge algorithm and the record-to-record travel
– Dueck
- 1993
|
|
39
|
Packing Problems
– DOWSLAND, DOWSLAND
- 1992
|
|
38
|
The polygon containment problem
– Chazelle
- 1983
|
|
37
|
Visibility of a simple polygon
– Lee
- 1983
|
|
36
|
Boissonnat: Polygon placement under translation and rotation. RAIRO Informatique Théorique et Applications
– Avnaim, D
- 1989
|
|
35
|
A compaction algorithm for non-convex polygons and its application
– Li
- 1994
|
|
33
|
Multistage Cutting Stock Problems of Two and More Dimensions
– Gilmore, Gomory
- 1965
|
|
31
|
Optimal allocation of twodimensional irregular shapes using heuristic search methods
– Albano, Sapuppo
- 1980
|
|
29
|
Compaction and Separation Algorithms for Non-Convex Polygons and Their Applications
– Li, Milenkovic
- 1995
|
|
28
|
Cutting and Packing Problems: A Categorized, Application-Oriented Research Bibliography
– Sweeney, Paternoster
- 1992
|
|
24
|
Corrections to Lee’s Visibility Polygon Algorithm
– Joe, Simpson
- 1987
|
|
23
|
Placement and compaction of nonconvex polygons for clothing manufacture
– Milenkovic, Daniels, et al.
- 1992
|
|
23
|
Finding compact coordinate representations for polygons and polyhedra
– Milenkovic, Nackman
- 1990
|
|
23
|
Finding minimal enclosing boxes
– O'Rourke
- 1985
|
|
23
|
Gallery Theorems and Algorithms
– Art
- 1987
|
|
22
|
Nesting two-dimensional shapes in rectangular modules
– Adamovicz, Albano
- 1976
|
|
20
|
Translational Polygon Containment and Minimal Enclosure using
– MILENKOVIC, DANIELS
- 1999
|
|
20
|
Volumen und Oberfläche
– Minkowski
|
|
19
|
Simultaneous containment of several polygons
– Avnaim, Boissonnat
- 1987
|
|
18
|
A fast algorithm for polygon containment by translation
– Fortune
- 1985
|
|
17
|
Solution Approaches to Irregular Nesting Problems
– DOWSLAND, DOWSLAND
- 1995
|
|
16
|
Multiple Translational Containment, Part I: An Approximate Algorithm
– Daniels, Milenkovic
- 1997
|
|
16
|
Two-dimensional Voronoi diagrams in the L p -metric
– Lee
- 1980
|
|
16
|
Robust polygon modeling
– Milenkovic
- 1993
|
|
15
|
Multiple translational containment: Approximate and exact algorithms
– Daniels, Milenkovic
- 1995
|
|
15
|
Multiple containment methods
– Daniels, Milenkovic, et al.
- 1994
|
|
14
|
Placement et d'eplacement de formes rigides ou articul'ees
– Avnaim
- 1989
|
|
14
|
Polygon containment under translation
– Baker, Fortune, et al.
- 1986
|
|
14
|
Automatic marker making
– Milenkovic, Daniels, et al.
- 1991
|
|
13
|
Using tabu search approach for solving the two-dimensional irregular cutting problem in tabu search
– B̷la˙zewicz, Hawryluk, et al.
- 1993
|
|
13
|
Limited gaps
– Daniels, Milenkovic
- 1994
|
|
12
|
Placing the largest similar copy of a convex polygon among polygonal obstacles
– Chew, Kedem
- 1989
|
|
12
|
Algorithms for nesting problems
– Oliveira, Ferreira
|
|
11
|
The complexity of the compaction problem
– Li, Milenkovic
- 1993
|
