Document Open Access Logo

Polygonally Anchored Graph Drawing (Poster Abstract)

Authors Alvin Chiu , Ahmed Eldawy , Michael T. Goodrich

PDF

File

Thumbnail PDF
PDF
LIPIcs.GD.2024.52.pdf
  • Filesize: 0.51 MB
  • 3 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • polygonal anchors
  • force-directed

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We investigate force-directed graph drawing techniques under the constraint that some nodes must be anchored to stay within a given polygonal region associated with it (i.e. some positional information is known). The low energy layouts produced by such algorithms may reveal geographic information about nodes with no such knowledge a priori. Some applications of graph drawing with partial positional information include location-based social networks and rail networks, where the geographical locations need not be precise.

Cite As Get BibTex

Alvin Chiu, Ahmed Eldawy, and Michael T. Goodrich. Polygonally Anchored Graph Drawing (Poster Abstract). In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 52:1-52:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.GD.2024.52

Author Details

Alvin Chiu
  • University of California, Irvine, CA, USA
Ahmed Eldawy
  • University of California, Riverside, CA, USA
Michael T. Goodrich
  • University of California, Irvine, CA, USA

Funding

  • Eldawy, Ahmed: Supported by NSF fund IIS-2046236.
  • Goodrich, Michael T.: Supported by NSF grant 2212129.

References

  1. Zack W. Almquist and Carter T. Butts. Predicting regional self-identification from spatial network models. Geographical Analysis, 47(1):50-72, 2015. URL: https://doi.org/10.1111/gean.12045.
  2. Ulrik Brandes and Dorothea Wagner. Using graph layout to visualize train interconnection data. In Sue H. Whitesides, editor, Graph Drawing, pages 44-56, Berlin, Heidelberg, 1998. Springer Berlin Heidelberg. URL: https://doi.org/10.1007/3-540-37623-2_4.
  3. Giordano Da Lozzo, Marco Di Bartolomeo, Maurizio Patrignani, Giuseppe Di Battista, Davide Cannone, and Sergio Tortora. Drawing georeferenced graphs - combining graph drawing and geographic data. In IVAPP 2015 - Proceedings of the 6th International Conference on Information Visualization Theory and Applications, Berlin, Germany, 11-14 March, 2015, pages 109-116. SciTePress, 2015. URL: https://doi.org/10.5220/0005266601090116.
  4. Thomas M. J. Fruchterman and Edward M. Reingold. Graph drawing by force-directed placement. Software: Practice and Experience, 21(11):1129-1164, 1991. URL: https://doi.org/10.1002/spe.4380211102.
  5. Stephen G Kobourov. Spring embedders and force directed graph drawing algorithms. arXiv preprint arXiv:1201.3011, 2012. URL: https://arxiv.org/abs/1201.3011.
  6. Kelly Lyons, Henk Meijer, and David Rappaport. Algorithms for cluster busting in anchored graph drawing. Journal of Graph Algorithms and Applications, 2(1):1-24, 1998. URL: https://doi.org/10.7155/JGAA.00004.
  7. Alex Wolff. Drawing subway maps: A survey. Informatik Forsch. Entw, 22:23-44, 2007. URL: https://doi.org/10.1007/s00450-007-0036-y.
  8. Hsiang-Yun Wu, Martin Nöllenburg, and Ivan Viola. Multi-level area balancing of clustered graphs. IEEE Transactions on Visualization and Computer Graphics, 28(7):2682-2696, 2022. URL: https://doi.org/10.1109/TVCG.2020.3038154.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact