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
Schematisation of tree drawings
GD'06 Proceedings of the 14th international conference on Graph drawing
Path simplification for metro map layout
GD'06 Proceedings of the 14th international conference on Graph drawing
Auto-generation of geographic cognitive maps for browsing personal multimedia
VISUAL'07 Proceedings of the 9th international conference on Advances in visual information systems
Area-preserving subdivision schematization
GIScience'10 Proceedings of the 6th international conference on Geographic information science
Homotopic rectilinear routing with few links and thick edges
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
COPERNICUS: context-preserving engine for route navigation with interactive user-modifiable scaling
EuroVis'08 Proceedings of the 10th Joint Eurographics / IEEE - VGTC conference on Visualization
GD'12 Proceedings of the 20th international conference on Graph Drawing
| 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(nlogn) time, and experimental results showing the quality of the output are given.