On \(d\)-regular schematization of embedded paths (Q390156)
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 6249158
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \(d\)-regular schematization of embedded paths |
scientific article; zbMATH DE number 6249158 |
Statements
On \(d\)-regular schematization of embedded paths (English)
0 references
22 January 2014
0 references
Motivated by drawing route sketches in road networks, the authors study the \(d\)-regular path schematization problem, which has two main goals: To preserve the user's mental map through maintaining the orthogonal order, and to reduce the visual complexity using restricted edge slopes.
0 references
path schematization
0 references
NP-hardness
0 references
mixed integer linear programming
0 references
dynamic programming
0 references
graph drawing
0 references
0.9722331166267396
0 references
0.88770592212677
0 references
0.7811746001243591
0 references
0.778141438961029
0 references
0.7367693781852722
0 references
