Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62037452, #quickstatements; #temporary_batch_1710970253704
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Star Unfolding of a Polytope with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating shortest paths on a convex polytope in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing approximate shortest paths on convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus / 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: Fundamentals of Computation Theory / 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: Partitioning planar graphs with costs and weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Shortest Path Queries on Weighted Polyhedral Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar spanners and approximate shortest path queries among obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additivity of the genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Geometric Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON GEOMETRIC PATH QUERY PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Querying approximate shortest paths in anisotropic regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Shortest Paths in Anisotropic Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning planar graphs with vertex costs: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric entropy of some classes of sets with differentiable boundaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A separator theorem for graphs of bounded genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal shortest path queries in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Approximate Shortest Path Maps in Three Dimensions / 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: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted region problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Discrete Geodesic Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2749787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding approximate optimal paths in weighted regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal-time algorithm for shortest paths on a convex polytope in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Shortest Paths in Polyhedral Spaces / rank
 
Normal rank

Latest revision as of 11:27, 3 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for approximate shortest path queries on weighted polyhedral surfaces
scientific article

    Statements

    Algorithms for approximate shortest path queries on weighted polyhedral surfaces (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    shortest path
    0 references
    query algorithm
    0 references
    separator
    0 references
    weighted polyhedral surface
    0 references
    approximation graph
    0 references
    Steiner points
    0 references
    weighted surface partioning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references