Matching points with squares (Q1006403): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Matching Points with Circles and Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2006: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding rectangular art galleries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-Hamiltonian, nondegenerate Delaunay triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hamiltonian cycles in Delaunay triangulations is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Theory of Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank

Latest revision as of 05:07, 29 June 2024

scientific article
Language Label Description Also known as
English
Matching points with squares
scientific article

    Statements

    Matching points with squares (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete geometry
    0 references
    perfect matching
    0 references
    Delaunay triangulations
    0 references
    Hamiltonian path
    0 references
    0 references