Sciweavers

Share
SOFSEM
2016
Springer

Orthogonal Layout with Optimal Face Complexity

3 years 12 days ago
Orthogonal Layout with Optimal Face Complexity
Given a biconnected plane graph G and a nonnegative integer k, we examine the problem of deciding whether G admits a strict-orthogonal drawing (i.e., an orthogonal drawing without bends) such that the reflex face complexity (the maximum number of reflex angles in any face) is at most k. We introduce
Muhammad Jawaherul Alam, Stephen G. Kobourov, Deba
Added 10 Apr 2016
Updated 10 Apr 2016
Type Journal
Year 2016
Where SOFSEM
Authors Muhammad Jawaherul Alam, Stephen G. Kobourov, Debajyoti Mondal
Comments (0)
books