On d-Regular Schematization of Embedded Paths-Reference-Cited by-同舟云学术

On d-Regular Schematization of Embedded Paths

Published:2011 Issue: Volume: Page:260-271
ISSN:0302-9743
Container-title:SOFSEM 2011: Theory and Practice of Computer Science
language:
Short-container-title:

Author:

Gemsa Andreas,Nöllenburg Martin,Pajor Thomas,Rutter Ignaz

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-18381-2_22

Reference17 articles.

1. Agrawala, M., Stolte, C.: Rendering effective route maps: Improving usability through generalization. In: Proc. 28th Ann. Conf. Computer Graphics and Interactive Techniques (SIGGRAPH 2001), pp. 241–249. ACM, New York (2001)

2. de Berg, M., Khosravi, A.: Finding perfect auto-partitions is NP-hard. In: Proc. 25th European Workshop Comput. Geom (EuroCG 2008), pp. 255–258 (2008)

3. Lecture Notes in Computer Science;U. Brandes,2002

4. Lecture Notes in Computer Science;U. Brandes,2009

5. Lecture Notes in Computer Science;J. Branke,2001

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Revealing Schematic Map Designs with Preservation of Relativity in Node Position and Segment Length in Existing Official Maps;ISPRS International Journal of Geo-Information;2023-07-28

2. Area-Preserving Simplification and Schematization of Polygonal Subdivisions;ACM Transactions on Spatial Algorithms and Systems;2016-04-08

3. SimpliFly: A Methodology for Simplification and Thematic Enhancement of Trajectories;IEEE Transactions on Visualization and Computer Graphics;2015-01-01

4. On d -regular schematization of embedded paths;Computational Geometry;2014-04

5. Map Schematization with Circular Arcs;Geographic Information Science;2014