Succinct Greedy Geometric Routing in the Euclidean Plane

DOI10.1007/978-3-642-10631-6_79zbMath1273.68392OpenAlexW1572848511MaRDI QIDQ3652264

Darren Strash, Michael T. Goodrich

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_79

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (22)

On the plane angle-monotone graphs ⋮ Angle-monotonicity of Delaunay triangulation ⋮ On \(k\)-greedy routing algorithms ⋮ Succinct greedy drawings do not always exist ⋮ (Weakly) self-approaching geometric graphs and spanners ⋮ Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles ⋮ A generalized greedy routing algorithm for 2-connected graphs ⋮ Euclidean greedy drawings of trees ⋮ Category-based routing in social networks: membership dimension and the small-world phenomenon ⋮ Greedy routing via embedding graphs onto semi-metric spaces ⋮ A simple routing algorithm based on Schnyder coordinates ⋮ An optimal greedy routing algorithm for triangulated polygons ⋮ Shifting strategy for geometric graphs without geometry ⋮ Succinct strictly convex greedy drawing of 3-connected plane graphs ⋮ On succinct greedy drawings of plane triangulations and 3-connected plane graphs ⋮ Greedy Routing via Embedding Graphs onto Semi-metric Spaces ⋮ On the area requirements of planar greedy drawings of triconnected planar graphs ⋮ Greedy rectilinear drawings ⋮ On planar greedy drawings of 3-connected planar graphs ⋮ Greedy rectilinear drawings ⋮ Every Schnyder drawing is a greedy embedding ⋮ Unnamed Item

This page was built for publication: Succinct Greedy Geometric Routing in the Euclidean Plane