GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA (Q3373056): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59411183, #quickstatements; #temporary_batch_1710289860281
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Filling polyhedral molds. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of \(O(n^ 2)\) problems in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster shortest-path algorithms for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE TWO GUARDS PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Walking an unknown street with bounded detour / rank
 
Normal rank
Property / cites work
 
Property / cites work: Morse Theory. (AM-51) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moldable and castable polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936005 / rank
 
Normal rank

Latest revision as of 11:58, 24 June 2024

scientific article
Language Label Description Also known as
English
GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA
scientific article

    Statements

    GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA (English)
    0 references
    0 references
    0 references
    13 March 2006
    0 references
    0 references
    polyhedra
    0 references
    polygon
    0 references
    plane sweep
    0 references
    duality
    0 references
    monotonicity
    0 references
    recognition algorithm
    0 references
    0 references