Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
DOI10.1007/S00224-013-9493-9zbMATH Open1303.68143OpenAlexW2093151180MaRDI QIDQ489760FDOQ489760
Authors: Helmut Alt, Esther M. Arkin, Alon Efrat, Ferran Hurtado, Irina Kostitsyna, Alexander Kröller, Joseph S. B. Mitchell, Valentin Polishchuk, George W. Hart 
Publication date: 21 January 2015
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-013-9493-9
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Computational geometry. Algorithms and applications.
- Geometric Knapsack problems
- On the Minimum Volume Covering Ellipsoid of Ellipsoids
- Disk packing for the estimation of the size of a wire bundle
- Approximating extent measures of points.
- Translational packing of arbitrary polytopes
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- Finding the upper envelope of n line segments in O(n log n) time
- Finding Extremal Polygons
- Dense packings of congruent circles in a circle
- ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS
- Finding minimal enclosing boxes
- On the minimum perimeter triangle enclosing a convex polygon
- Minimum-perimeter enclosures
- Title not available (Why is that?)
- Computing the maximum overlap of two convex polygons under translations
- Maximum overlap of convex polytopes under translation
- Maximum overlap and minimum convex hull of two convex polyhedra under translations
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- Maximizing the overlap of two planar convex sets under rigid motions
- A polynomial solution for the Potato-peeling problem
- Title not available (Why is that?)
- Rotational polygon containment and minimum enclosure using only robust 2D constructions
- More optimal packings of equal circles in a square
- Approximating largest convex hulls for imprecise points
- Aligning two convex figures to minimize area or perimeter
- A generalization of the convex Kakeya problem
- Computing closely matching upper and lower bounds on textile nesting problems
- Multiple translational containment. I: An approximate algorithm
- Matching convex shapes with respect to the symmetric difference
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Packing a cake into a box
- Title not available (Why is that?)
- Maximizing the area of overlap of two unions of disks under rigid motion
- Polygon containment under translation
- Enclosing a Set of Objects by Two Minimum Area Rectangles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing and Combinatorics
- POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD
- Polynomial time algorithms for maximizing the intersection volume of polytopes
- Algorithms and Computation
Cited In (1)
This page was built for publication: Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489760)
