A necessary condition for a graph to be the visibility graph of a simple polygon (Q1605320): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISTANCE VISIBILITY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing visibility graphs of spiral polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recognizing and characterizing visibility graphs of simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTATIONAL GEOMETRY COLUMN 18 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two segment classes with Hamiltonian visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on minimal visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new necessary condition for the vertex visibility graphs of simple polygons / rank
 
Normal rank

Revision as of 11:55, 4 June 2024

scientific article
Language Label Description Also known as
English
A necessary condition for a graph to be the visibility graph of a simple polygon
scientific article

    Statements

    A necessary condition for a graph to be the visibility graph of a simple polygon (English)
    0 references
    0 references
    15 July 2002
    0 references
    0 references
    computational geometry
    0 references
    visibility problem
    0 references
    visibility graph
    0 references
    polygon
    0 references