Special subgraphs of weighted visibility graphs (Q1199937)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 96277
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Special subgraphs of weighted visibility graphs |
scientific article; zbMATH DE number 96277 |
Statements
Special subgraphs of weighted visibility graphs (English)
0 references
17 January 1993
0 references
We are interested in finding a subgraph of a weighted visibility graph \(G\) with a small number of edges such that any arbitrary shortet path on \(G\) is almost entirely covered by the subgraph.
0 references
weighted visibility graph
0 references
polygon
0 references
Euclidean distance
0 references
0 references
0 references
0 references
0 references
0.87320983
0 references
0 references
0.8578533
0 references
0.85533607
0 references
0.85428804
0 references
0.85281146
0 references
