Journal of Algorithms
On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Computing and Verifying Depth Orders
SIAM Journal on Computing
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Algorithms for VLSI Design Automation
Algorithms for VLSI Design Automation
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Approximation algorithms for aligning points
Proceedings of the nineteenth annual symposium on Computational geometry
Automated schematization for web service applications
W2GIS'07 Proceedings of the 7th international conference on Web and wireless geographical information systems
Automatic generation of destination maps
ACM SIGGRAPH Asia 2010 papers
On d-regular schematization of embedded paths
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Human-centered visualization environments
Human-centered visualization environments
A mixed-integer program for drawing high-quality metro maps
GD'05 Proceedings of the 13th international conference on Graph Drawing
On d-regular schematization of embedded paths
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We study the problem of computing schematized versions of network maps , like railroad maps. Every path of the schematized map has two or three links with restricted orientations, and topologically, the schematized map must be equivalent to the input map. Our approach applies to several types of schematizations, and certain additional constraints can be added. In the general case our algorithm takes $O(n\log^3n)$ time, and when all paths in the input are monotone in some (not necessarily the same) direction, it runs in $O(n\log n)$ time.