An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q62037428 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BUSHWHACK / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00454-013-9486-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1798872925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633835 / 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: Algorithms for approximate shortest path queries on weighted polyhedral surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo approximation algorithms with applications to optimal motion planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic degree of geometric optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Euclidean Shortest Paths in 3-Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precision-Sensitive Euclidean Shortest Path in 3-Space / 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: Concrete and abstract Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Voronoi diagrams revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating shortest paths on weighted polyhedral surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Voronoi diagram in 3-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted region problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on shortest paths in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for shortest-path motion in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Movement planning in the presence of flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding approximate optimal paths in weighted regions / rank
 
Normal rank

Latest revision as of 18:00, 6 July 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for computing shortest paths in weighted 3-d domains
scientific article

    Statements

    An approximation algorithm for computing shortest paths in weighted 3-d domains (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 August 2013
    0 references
    0 references
    shortest path problems
    0 references
    weighted paths
    0 references
    weighted 3-d domains
    0 references
    approximation algorithms
    0 references
    Voronoi diagrams
    0 references
    0 references
    0 references