Live briefing
Everything about Geometric spanner
Type of weighted geometric graph
A geometric spanner or a t-spanner graph or a t-spanner was initially introduced as a weighted graph over a set of points as its vertices for which there is a t-path between any pair of vertices for a fixed parameter t. A t-path is defined as a path through the graph with weight at most t times the spatial distance between its endpoints. The parameter t is called the stretch factor or dilation factor of the spanner. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Geometric spannerA 5-minute orientation
- Pick up a classic book: Geometric spanner networksThe most-reprinted book on the subject
- Read the landmark paper: Geometric spanner gamesCited 1 times
- Go sideways: Greedy geometric spannerA closely related topic
- Go sideways: Euclidean minimum spanning treeA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
📚 Books worth reading
Geometric spanner networksGiri Narasimhan · 2003
Geometric Spanner NetworksGiri Narasimhan · 2007
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Greedy geometric spanner In computational geometry, a greedy geometric spanner is an undirected graph whose distances approximate the Euclidean distances among a finite set of…
- Euclidean minimum spanning tree A Euclidean minimum spanning tree of a finite set of points in the Euclidean plane or higher-dimensional Euclidean space connects the points by a system…
- Theta graph In computational geometry, the Theta graph, or Θ {\displaystyle \Theta } -graph, is a type of geometric spanner similar to a Yao graph. The basic method…
- Delaunay triangulation In computational geometry, a Delaunay triangulation or Delone triangulation of a set of points in the plane subdivides their convex hull into triangles…
- Minimum-weight triangulation In computational geometry and computer science, the minimum-weight triangulation problem is the problem of finding a triangulation of minimal total edge…
- Constrained Delaunay triangulation In computational geometry, a constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required segments…
- Point-set triangulation A triangulation of a set of points 𝒫 in the Euclidean space ℝd is a simplicial complex that covers the convex hull of 𝒫, and whose vertices belong to…
- Beta skeleton In computational geometry and geometric graph theory, a β-skeleton or beta skeleton is an undirected graph defined from a set of points in the Euclidean…