The vertex-edge visibility graph of a polygon (Q1388137): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: An Output-Sensitive Algorithm for Computing Visibility Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semispaces of configurations, cell complexes of arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal visibility graph algorithm for triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTATIONAL GEOMETRY COLUMN 18 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE VISIBILITY COMPLEX / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0925-7721(97)00011-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987507273 / rank
 
Normal rank

Latest revision as of 09:55, 30 July 2024

scientific article
Language Label Description Also known as
English
The vertex-edge visibility graph of a polygon
scientific article

    Statements