Emanation Graph: A Plane Geometric Spanner with Steiner Points
Bardia Hamedmohseni, Zahed Rahmati, Debajyoti Mondal

TL;DR
This paper introduces emanation graphs as plane geometric spanners with Steiner points, improves their spanning ratio bounds, and demonstrates their advantages over traditional triangulations in network visualization.
Contribution
It provides a tighter bound on the spanning ratio of emanation graphs, introduces a heuristic for simplification, and empirically compares their performance to constrained Delaunay triangulations.
Findings
Improved upper bound on spanning ratio to √10, which is tight.
Emanation graphs of fixed grade are constant spanners.
Simplified emanation graphs outperform constrained Delaunay triangulations in key quality metrics.
Abstract
An emanation graph of grade on a set of points is a plane spanner made by shooting equally spaced rays from each point, where the shorter rays stop the longer ones upon collision. The collision points are the Steiner points of the spanner. Emanation graphs of grade one were studied by Mondal and Nachmanson in the context of network visualization. They proved that the spanning ratio of such a graph is bounded by . We improve this upper bound to and show this to be tight, i.e., there exist emanation graphs with spanning ratio . We show that for every fixed , the emanation graphs of grade are constant spanners, where the constant factor depends on . An emanation graph of grade two may have twice the number of edges compared to grade one graphs. Hence we introduce a heuristic method for simplifying…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Visualization and Analytics · Topological and Geometric Data Analysis · Remote Sensing and LiDAR Applications
