Approximating the maximum overlap of polygons under translation (Q527417): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133896404 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1406.5778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overlap of convex polytopes under rigid motion / 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: Maximizing the overlap of two planar convex sets under rigid motions / 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: Q4945503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions / 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: Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Geometric Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shape matching under rigid motion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a guard that sees most and a shop that sells most / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / 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: Taking a Walk in a Planar Arrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3010463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Maximum Overlap of Polygons under Translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal polygon containment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric optimization and sums of algebraic functions / rank
 
Normal rank

Latest revision as of 19:40, 13 July 2024

scientific article
Language Label Description Also known as
English
Approximating the maximum overlap of polygons under translation
scientific article

    Statements

    Approximating the maximum overlap of polygons under translation (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2017
    0 references
    0 references
    approximation algorithms
    0 references
    computational geometry
    0 references
    polygon overlap
    0 references
    0 references
    0 references