Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation

Published Online:https://doi.org/10.1287/ijoc.2013.0557

References

  • Cabello S, Haverkort H, van Kreveld M, Speckmann B (2006) Algorithmic aspects of proportional symbol maps. Azar Y, Erlebach T, eds. Proc. 14th Eur. Sympos. Algorithms (ESA), Lecture Notes in Computer Science, Vol. 4168 (Springer-Verlag, Berlin), 720–731.CrossrefGoogle Scholar
  • Cabello S, Haverkort H, van Kreveld M, Speckmann B (2010) Algorithmic aspects of proportional symbol maps. Algorithmica 58:543–565.CrossrefGoogle Scholar
  • Dent B (1999) Cartography—Thematic Map Design, 5th ed. (McGraw-Hill, Boston).Google Scholar
  • Fair Isaac Corporation (2009) Xpress Optimizer Reference Manual. Accessed June 22, 2013, http://www.fico.com/en/FIResourcesLibrary/Xpress-Optimizer-Refernce-Manual.pdf.Google Scholar
  • Garey MR, Johnson DS (1979) Computers and Intractability (Freeman, San Francisco).Google Scholar
  • Griffin T (1990) The importance of visual contrast for graduated circles. Cartography 19:21–30.CrossrefGoogle Scholar
  • Gupta R, Walrand J, Goldschmidt O (2005) Maximal cliques in unit disk graphs: Polynomial approximation. Proc. Second Internat. Network Optim. Conf. (INOC), Lisbon, Portugal. Accessed November 1, 2012, http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.70.1687&rep=rep1&type=pdf.Google Scholar
  • Kunigami G, de Rezende PJ, de Souza CC, Yunes T (2011) Optimizing the layout of proportional symbol maps. Murgante B, Gervasi O, Iglesias A, Taniar D, Apduhan BO, eds. Proc. ICCSA, Part III, 11th Internat. Workshop on Computational Geometry and Appl. (CGA), Lecture Notes Computer Science, Vol. 6784 (Springer-Verlag, Berlin), 1–16.CrossrefGoogle Scholar
  • Müller R (1996) On the partial order polytope of a digraph. Math. Programming 73:31–49.CrossrefGoogle Scholar
  • Nemhauser GL, Sigismondi G (1992) A strong cutting plane/branch-and-bound algorithm for node packing. J. Oper. Res. Soc. 43:443–457.CrossrefGoogle Scholar
  • NOAA Satellite and Information Service (2005) National geophysical data center. Accessed November 1, 2012, http://www.ngdc.noaa.gov.Google Scholar
  • Padberg MW (1973) On the facial structure of set packing polyhedra. Math. Programming 5:199–215.CrossrefGoogle Scholar
  • Slocum TA, McMaster RB, Kessler FC, Howard HH (2003) Thematic Cartography and Geographic Visualization, 2nd ed. (Prentice Hall, Upper Saddle River, NJ).Google Scholar
  • Wein R, Fogel E, Zukerman B, Halperin D (2007) Advanced programming techniques applied to CGAL's arrangement package. Computational Geometry 38:37–63.CrossrefGoogle Scholar
  • West D (2001) Introduction to Graph Theory, 2nd ed. (Prentice Hall, Upper Saddle River, NJ).Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.