The vertex-edge visibility graph of a polygon (Q1388137): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Latest revision as of 12:51, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The vertex-edge visibility graph of a polygon |
scientific article |
Statements
The vertex-edge visibility graph of a polygon (English)
0 references
1 October 1998
0 references
vertex visibility graph
0 references
0 references
