Routing in Polygonal Domains (Q5136225): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Routing in Polygonal Domains
Property / arXiv ID
 
Property / arXiv ID: 1703.09533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximate Distance Labels and Routing Schemes with Affine Stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility of disjoint polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved routing strategies with succinct tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: TRIANGULATING DISJOINT JORDAN CHAINS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Local Routing with Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact routing schemes with improved stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Routing with Minimum Stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact routing schemes with low stretch factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Euclidean Shortest Paths in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrections to Lee's visibility polygon algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing in unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for shortest paths among obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: SHORTEST PATHS AMONG OBSTACLES IN THE PLANE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trade-off between space and efficiency for routing tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Routing Techniques and their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Close to linear space routing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling and Implicit Routing in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Shortest Paths in Polyhedral Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in the plane with polygonal obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact oracles for reachability and approximate distances in planar digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact and low delay routing labeling scheme for unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2783321216 / rank
 
Normal rank
Property / title
 
Routing in Polygonal Domains (English)
Property / title: Routing in Polygonal Domains (English) / rank
 
Normal rank

Latest revision as of 11:07, 30 July 2024

scientific article; zbMATH DE number 7278015
Language Label Description Also known as
English
Routing in Polygonal Domains
scientific article; zbMATH DE number 7278015

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 November 2020
    0 references
    polygonal domains
    0 references
    routing scheme
    0 references
    small stretch
    0 references
    Yao graph
    0 references
    0 references
    Routing in Polygonal Domains (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references