skip to main content
10.1145/3347146.3359347acmconferencesArticle/Chapter ViewAbstractPublication PagesgisConference Proceedingsconference-collections
research-article

Practical Topologically Safe Rounding of Geographic Networks

Published: 05 November 2019 Publication History

Abstract

We consider the problem of accurately representing geographic networks at reduced coordinate precision. We require that vertices are placed on a grid and the network topology is retained, that is, we are not allowed to introduce intersections or collapse faces. Minimizing the "rounding error" in this setting is known to be NP-hard and no practical methods, even heuristic, are known. We demonstrate a two-stage simulated annealing algorithm that focuses on finding a feasible solution first, then switches to optimizing the rounding error; a straightforward annealing approach without stage one has difficulty finding any feasible solution at all. We discuss various feasibility procedures and evaluate their applicability on geographic networks. Datasets and an implementation in C++ are available at: https://github.com/tcvdijk/armstrong.

References

[1]
Bentley and Ottmann. 1979. Algorithms for Reporting and Counting Geometric Intersections. IEEE Trans. Comput. C-28, 9 (sep 1979), 643--647. https://doi.org/10.1109/tc.1979.1675432
[2]
Mark de Berg, Dan Halperin, and Mark Overmars. 2007. An intersection-sensitive algorithm for snap rounding. Computational Geometry 36, 3 (apr 2007), 159--165. https://doi.org/10.1016/j.comgeo.2006.03.002
[3]
Olivier Devillers and Pierre-Marie Gandoin. 2002. Rounding Voronoi diagram. Theoretical Computer Science 283, 1 (jun 2002), 203--221. https://doi.org/10.1016/s0304-3975(01)00076-7
[4]
Olivier Devillers, Sylvain Lazard, and William J. Lenhart. 2018. 3D Snap Rounding. (2018). https://doi.org/10.4230/lipics.socg.2018.30
[5]
Michael B. Dillencourt. 1987. A non-Hamiltonian, nondegenerate Delaunay Triangulation. Inform. Process. Lett. 25, 3 (may 1987), 149--151. https://doi.org/10.1016/0020-0190(87)90124-4
[6]
P. Eades. 1984. A heuristic for graph drawing. Congressus Numerantium 42 (1984), 149--160.
[7]
David Goldberg. 1991. What every computer scientist should know about floatingpoint arithmetic. Comput. Surveys 23, 1 (mar 1991), 5--48. https://doi.org/10.1145/103162.103163
[8]
Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, and Paul J. Tanen-baum. 1997. Snap rounding line segments efficiently in two and three dimensions.
[9]
Daniel H. Greene and F. Frances Yao. 1986. Finite-resolution computational geometry. In 27th Annual Symposium on Foundations of Computer Science. IEEE, 143--152. https://doi.org/10.1109/sfcs.1986.19
[10]
Gaël Guennebaud, Benoît Jacob, et al. 2010. Eigen v3. http://eigen.tuxfamily.org. (2010).
[11]
Leonidas J. Guibas, Donald E. Knuth, and Micha Sharir. 1992. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica 7, 1-6 (jun 1992), 381--413. https://doi.org/10.1007/bf01758770
[12]
Leonidas J. Guibas and David H. Marimont. 1998. Rounding Arrangements Dynamically. International Journal of Computational Geometry & Applications 8, 02 (1998), 157--178. https://doi.org/10.1142/s0218195998000096
[13]
Dan Halperin and Eli Packer. 2002. Iterated snap rounding. Computational Geometry 23, 2 (2002), 209--225. https://doi.org/10.1016/s0925-7721(01)00064-5
[14]
D. Harel and M. Sardas. 1998. An Algorithm for Straight-Line Drawing of Planar Graphs. Algorithmica 20, 2 (feb 1998), 119--135. https://doi.org/10.1007/pl00009189
[15]
John Hershberger. 2013. Stable snap rounding. Computational Geometry 46, 4 (2013), 403--416. https://doi.org/10.1016/j.comgeo.2012.02.011
[16]
John D. Hobby. 1999. Practical segment intersection with finite precision output. Computational Geometry 13, 4 (1999), 199--214. https://doi.org/10.1016/s0925-7721(99)00021-8
[17]
Amruta Khot, Abdeltawab Hendawi, Anderson Nascimento, Raj Katti, Ankur Teredesai, and Mohamed Ali. 2014. Road network compression techniques in spatiotemporal embedded systems. In Proceedings of the 5th ACM SIGSPATIAL International Workshop on GeoStreaming - IWGS '14. ACM Press. https://doi.org/10.1145/2676552.2676645
[18]
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. 1983. Optimization by Simulated Annealing. Science 220, 4598 (may 1983), 671--680. https://doi.org/10.1126/science.220.4598.671
[19]
Karl Kraus. 2011. Photogrammetry: geometry from images and laser scans. Walter de Gruyter.
[20]
Andre Löffler, Thomas van Dijk, and Alexander Wolff. 2016. Snapping Graph Drawings to the Grid Optimally. In Proceedings of the 26th International Symposium on Graph Drawing. Springer, 144--151. https://doi.org/10.1007/978-3-319-50106-2_12
[21]
Victor J Milenkovic. 1990. Rounding face lattices in d dimensions. In Proc. 2nd Canad. Conf. Comput. Geom. Citeseer, 40--45.
[22]
Victor J Milenkovic. 1995. Practical methods for set operations on polygons using exact arithmetic. In CCCG. Citeseer, 55--60.
[23]
Victor J Milenkovic and Lee R Nackman. 1990. Finding compact coordinate representations for polygons and polyhedra. IBM Journal of Research and Development 34, 5 (1990), 753--769.
[24]
Eli Packer. 2006. Iterated snap rounding with bounded drift. In Proceedings of the 22nd Annual Symposium on Computational Geometry. ACM, 367--376. https://doi.org/10.1145/1137856.1137910
[25]
Eli Packer. 2019. 2D Snap Rounding. In CGAL User and Reference Manual (4.14 ed.). CGAL Editorial Board. https://doc.cgal.org/4.14/Manual/packages.html#PkgSnapRounding2
[26]
Dongliang Peng and Alexander Wolff. 2014. Watch Your Data Structures!. In Proc. 22nd Annual Conference of the GIS Research UK.
[27]
Micheal Ian Shamos. 1978. Computational Geometry. Yale University.
[28]
Shashi Shekhar, Yan Huang, Judy Djugash, and Changqing Zhou. 2002. Vector map compression. In Proceedings of the tenth ACM International Symposium on Advances in Geographic Information Systems - GIS '02. ACM Press. https://doi.org/10.1145/585147.585164
[29]
Thomas van Dijk, Arthur van Goethem, Jan-Henrik Haunert, Wouter Meulemans, and Bettina Speckmann. 2013. Accentuating focus maps via partial schematization. In Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - SIGSPATIAL'13. ACM Press.https://doi.org/10.1145/2525314.2525452
[30]
Thomas C. van Dijk and Jan-Henrik Haunert. 2014. Interactive focus maps using least-squares optimization. International Journal of Geographical Information Science 28, 10 (mar 2014), 2052--2075. https://doi.org/10.1080/13658816.2014.887718
[31]
Thomas C. van Dijk and Dieter Lutz. 2018. Realtime linear cartograms and metro maps. In Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - SIGSPATIAL '18. ACM Press. https://doi.org/10.1145/3274895.3274959
[32]
Peter J. M. van Laarhoven and Emile H. L. Aarts. 1987. Simulated Annealing: Theory and Applications. Springer Netherlands. https://doi.org/10.1007/978-94-015-7744-1
[33]
Frank Wilcoxon. 1945. Individual Comparisons by Ranking Methods. Biometrics Bulletin 1, 6 (dec 1945), 80. https://doi.org/10.2307/3001968
[34]
Mariette Yvinec. 2019. 2D Triangulation. In CGAL User and Reference Manual (4.14 ed.). CGAL Editorial Board. https://doc.cgal.org/4.14/Manual/packages.html#PkgTriangulation2.
[35]
Baruch Zukerman, Ron Wein, and Efi Fogel. 2019. 2D Intersection of Curves. In CGAL User and Reference Manual (4.14 ed.). CGAL Editorial Board. https://doc.cgal.org/4.14/Manual/packages.html#PkgSurfaceSweep2.

Cited By

View all
  • (2021)Visualizing and Interacting with Geospatial Networks: A Survey and Design SpaceComputer Graphics Forum10.1111/cgf.1419840:6(5-33)Online publication date: 9-Apr-2021

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGSPATIAL '19: Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
November 2019
648 pages
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 November 2019

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. graph algorithms
  2. optimisation
  3. simulated annealing

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Funding Sources

Conference

SIGSPATIAL '19
Sponsor:

Acceptance Rates

SIGSPATIAL '19 Paper Acceptance Rate 34 of 161 submissions, 21%;
Overall Acceptance Rate 257 of 1,238 submissions, 21%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)0
Reflects downloads up to 23 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Visualizing and Interacting with Geospatial Networks: A Survey and Design SpaceComputer Graphics Forum10.1111/cgf.1419840:6(5-33)Online publication date: 9-Apr-2021

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media