(Weakly) self-approaching geometric graphs and spanners

DOI10.1016/j.comgeo.2018.10.002zbMath1457.05069OpenAlexW2902016576WikidataQ129080036 ScholiaQ129080036MaRDI QIDQ1631774

Davood Bakhshesh, Mohammad Farshi

Publication date: 7 December 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2018.10.002

zbMATH Keywords

spannerincreasing-chord graphself-approaching graph

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

On the plane angle-monotone graphs ⋮ Angle-monotonicity of Delaunay triangulation

Cites Work

• Unnamed Item
• Unnamed Item
• Some results on greedy embeddings in metric spaces
• On a conjecture related to geometric routing
• On self-approaching and increasing-chord drawings of 3-connected planar graphs
• Geometric Spanner Networks
• Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles
• Succinct Greedy Geometric Routing in the Euclidean Plane
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Self-approaching curves
• Curves with increasing chords
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• On planar greedy drawings of 3-connected planar graphs
• Self-approaching Graphs
• An Algorithm to Construct Greedy Drawings of Triangulations
• Increasing-Chord Graphs On Point Sets

This page was built for publication: (Weakly) self-approaching geometric graphs and spanners