Author:
de Berg Mark,Mumford Elena,Speckmann Bettina
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Bhasker, J., Sahni, S.: A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph. Networks 7, 307–317 (1987)
2. Biedl, T., Genc, B.: Complexity of octagonal and rectangular cartograms. In: Proceedings of the 17th Canadian Conference on Computational Geometry, pp. 117–120 (2005)
3. d’Amore, F., Franciosa, P.G.: On the optimal binary plane partition for sets of isothetic rectangles. Information Processing Letters 44(5), 255–259 (1992)
4. Dent, B.: Cartography - thematic map design, 5th edn. McGraw-Hill, New York (1999)
5. Dougenik, J.A., Chrisman, N.R., Niemeyer, D.R.: An algorithm to construct continous area cartograms. Professional Geographer 37, 75–81 (1985)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献