Skip to main content

Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points

  • Conference paper
  • First Online:
SOFSEM 2020: Theory and Practice of Computer Science (SOFSEM 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12011))

Abstract

Emanation graphs of grade k, introduced by Hamedmohseni, Rahmati, and Mondal, are plane spanners made by shooting \(2^{k+1}\) rays from each given point, where the shorter rays stop the longer ones upon collision. The collision points are the Steiner points of the spanner.

We introduce a method of simplification for emanation graphs of grade \(k=2\), which makes it a competent spanner for many possible use cases such as network visualization and geometric routing. In particular, the simplification reduces the number of Steiner points by half and also significantly decreases the total number of edges, without increasing the spanning ratio. Exact methods of simplification is provided along with comparisons of simplified emanation graphs against Shewchuk’s constrained Delaunay triangulations on both synthetic and real-life datasets. Our experimental results reveal that the simplified emanation graphs outperform constrained Delaunay triangulations in common quality measures.

The full version of this paper can be found in arXiv [8].

Work of D. Mondal is supported in part by NSERC.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Gephi sample data sets: Us airlines (2019). https://github.com/gephi/gephi/wiki/Datasets. Accessed 6 June 2019

  2. Bose, P., Smid, M.H.M.: On plane geometric spanners: a survey and open problems. Comput. Geom. 46(7), 818–830 (2013)

    Article  MathSciNet  Google Scholar 

  3. Eppstein, D., Goodrich, M.T., Kim, E., Tamstorf, R.: Motorcycle graphs: canonical quad mesh partitioning. Comput. Graph. Forum 27(5), 1477–1486 (2008)

    Article  Google Scholar 

  4. Hachul, S., JĂĽnger, M.: Large-graph layout with the fast multipole multilevel method. University of Cologne, Computer Science Department, Technical report. Cologne (2005)

    Google Scholar 

  5. Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using networkx. In: Proceedings of the 7th Python in Science Conference (SciPy) (2008)

    Google Scholar 

  6. Hamedmohseni, B., Rahmati, Z., Mondal, D.: Emanation graph: a new \(t\)-spanner. In: Proceedings of the 30th Canadian Conference on Computational Geometry (CCCG), pp. 311–317 (2018)

    Google Scholar 

  7. Hamedmohseni, B., Rahmati, Z., Mondal, D.: Simplified emanation graph - implementations and tests (2019). https://github.com/sneyes/SEG/tree/master. Accessed 6 June 2019

  8. Hamedmohseni, B., Rahmati, Z., Mondal, D.: Simplified emanation graphs: A sparse plane spanner with steiner points. https://arxiv.org/abs/1910.10376 (2019)

  9. Mondal, D., Nachmanson, L.: A new approach to GraphMaps, a system browsing large graphs as interactive maps. In: Telea, A., Kerren, A., Braz, J. (eds.) Proceedings of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP), pp. 108–119. SciTePress (2018)

    Google Scholar 

  10. Nachmanson, L., Prutkin, R., Lee, B., Riche, N.H., Holroyd, A.E., Chen, X.: GraphMaps: browsing large graphs as interactive maps. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 3–15. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-27261-0_1

    Chapter  Google Scholar 

  11. Owen, S.J.: A survey of unstructured mesh generation technology. In: Proceedings of the 7th International Meshing Roundtable (IMR), pp. 239–267 (1998)

    Google Scholar 

  12. Shewchuk, J.R.: Triangle: engineering a 2D quality mesh generator and delaunay triangulator. In: Lin, M.C., Manocha, D. (eds.) WACG 1996. LNCS, vol. 1148, pp. 203–222. Springer, Heidelberg (1996). https://doi.org/10.1007/BFb0014497

    Chapter  Google Scholar 

  13. Triangle: A two-dimensional quality mesh generator and delaunay triangulator (2013). https://www.cs.cmu.edu/~quake/triangle.html. Accessed 6 June 2019

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zahed Rahmati .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hamedmohseni, B., Rahmati, Z., Mondal, D. (2020). Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points. In: Chatzigeorgiou, A., et al. SOFSEM 2020: Theory and Practice of Computer Science. SOFSEM 2020. Lecture Notes in Computer Science(), vol 12011. Springer, Cham. https://doi.org/10.1007/978-3-030-38919-2_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-38919-2_50

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-38918-5

  • Online ISBN: 978-3-030-38919-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics