Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles (Q3451755): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963197342 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1409.6397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm to Construct Greedy Drawings of Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: New and improved spanning ratios for Yao graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane Spanners of Maximum Degree Six / rank
 
Normal rank
Property / cites work
 
Property / cites work: ONLINE ROUTING IN CONVEX SUBDIVISIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards tight bounds on theta-graphs: more is not always better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Routing in Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Spanning Ratio of Theta-Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are planar graphs almost as good as the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy drawings of triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability of Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Greedy Geometric Routing in the Euclidean Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple routing algorithm based on Schnyder coordinates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On succinct greedy drawings of plane triangulations and 3-connected plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of graphs which approximate the complete Euclidean graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on greedy embeddings in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guide to wireless mesh networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture related to geometric routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey on Oblivious Routing Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank

Latest revision as of 02:58, 11 July 2024

scientific article
Language Label Description Also known as
English
Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles
scientific article

    Statements

    Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 November 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    online routing
    0 references
    local routing
    0 references
    competitive routing
    0 references
    geometric spanner
    0 references
    theta-graph
    0 references
    0 references
    0 references