Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance (Q3183457): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4250172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic degree of geometric optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete and Computational Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2704992 / 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: On the Continuous Fermat-Weber Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Planar Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hausdorff approximation of convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for finding minimal enclosing triangles / rank
 
Normal rank

Latest revision as of 02:25, 2 July 2024

scientific article
Language Label Description Also known as
English
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
scientific article

    Statements

    Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 October 2009
    0 references
    0 references
    0 references