
Related items loading ...
Section 1: Publication
Publication Type
Journal Article
Authorship
Hamedmohseni, B., Rahmati, Z., & Mondal, D.
Title
Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points
Year
2020
Publication Outlet
In the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), pp 607-616
DOI
ISBN
ISSN
Citation
Hamedmohseni, B., Rahmati, Z., & Mondal, D. (2020, January). Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points. In the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), pp 607-616.
https://doi.org/10.1007/978-3-030-38919-2_50.
Abstract
Emanation graphs of grade k, introduced by Hamedmohseni, Rahmati, and Mondal, are plane spanners made by shooting 2k+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.
Plain Language Summary