On approximating shortest paths in weighted triangular tessellations (Q6161478): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2023.103898 / rank
Normal rank
 
Property / cites work
 
Property / cites work: An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for geometric shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining approximate shortest paths on weighted polyhedral surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-length analysis for grid-based path planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting Weakly Simple Polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulation Refinement and Approximate Shortest Paths in Weighted Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudolinearity and efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the unsolvability of the weighted region shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Planning in 0/1/∞ Weighted Regions with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Any-Angle Pathfinding In Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise symmetry reasoning for multi-agent path finding search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic approach to some problems in terrain navigation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted region problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pseudolinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinated motion planning for two independent robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast optimal and bounded suboptimal Euclidean pathfinding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdimensional expansion for multirobot path planning / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2023.103898 / rank
 
Normal rank

Latest revision as of 19:01, 30 December 2024

scientific article; zbMATH DE number 7702937
Language Label Description Also known as
English
On approximating shortest paths in weighted triangular tessellations
scientific article; zbMATH DE number 7702937

    Statements

    On approximating shortest paths in weighted triangular tessellations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 June 2023
    0 references
    shortest path
    0 references
    any-angle path planning
    0 references
    tessellation
    0 references
    weighted region problem
    0 references

    Identifiers