Journal of Algorithms
Efficient algorithms for geometric graph search problems
SIAM Journal on Computing
On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Counting and reporting red/blue segment intersections
CVGIP: Graphical Models and Image Processing
Rendering effective route maps: improving usability through generalization
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Testing Homotopy for paths in the plane
Proceedings of the eighteenth annual symposium on Computational geometry
Algorithms for VLSI Design Automation
Algorithms for VLSI Design Automation
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Computing Homotopic Shortest Paths Efficiently
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Increasing the readability of graph drawings with centrality-based scaling
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Hi-index | 0.00 |
We study the problem of computing schematized versions of network maps, like railroad or highway maps. Every path of the schematized map has two or three links with restricted orientations, and the schematized map must be topologically equivalent to the input map. Our approach can handle several types of schematizations, and certain additional constraints can be added, such as a minimum vertical distance between two paths. Our algorithm runs in O(n log n) time, and experimental results showing the quality of the output are given.