Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: George W. Hart / rank
Normal rank
 
Property / author
 
Property / author: George W. Hart / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-013-9493-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093151180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimal enclosing boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating extent measures of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the convex Kakeya problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum overlap and minimum convex hull of two convex polyhedra under translations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum overlap of convex polytopes under translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aligning two convex figures to minimize area or perimeter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the overlap of two planar convex sets under rigid motions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching convex shapes with respect to the symmetric difference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygon containment under translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enclosing a Set of Objects by Two Minimum Area Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete and Computational Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Extremal Polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster core-set constructions and data-stream algorithms in fixed dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing a Cake into a Box / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial solution for the Potato-peeling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple translational containment. I: An approximate algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the maximum overlap of two convex polygons under translations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translational packing of arbitrary polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the minimum-area encasing rectangle for an arbitrary closed curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense packings of congruent circles in a circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing closely matching upper and lower bounds on textile nesting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the upper envelope of n line segments in O(n log n) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest bounding box, smallest diameter, and related problems on imprecise points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3204078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimum Volume Covering Ellipsoid of Ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotational polygon containment and minimum enclosure using only robust 2D constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-perimeter enclosures / rank
 
Normal rank
Property / cites work
 
Property / cites work: More optimal packings of equal circles in a square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating largest convex hulls for imprecise points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disk packing for the estimation of the size of a wire bundle / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 12:41, 9 July 2024

scientific article
Language Label Description Also known as
English
Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
scientific article

    Statements

    Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 January 2015
    0 references
    computational geometry
    0 references
    enclosure
    0 references
    packing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers