Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Rajasekhar Inkulu / rank
Normal rank
 
Property / author
 
Property / author: Rajasekhar Inkulu / 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/s10878-020-00524-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3000110732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633835 / 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: On parallel rectilinear obstacle-avoiding paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: TRIANGULATING DISJOINT JORDAN CHAINS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear short path queries among rectangular obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Shortest Paths among Curved Obstacles in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-point L1 shortest path queries in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear shortest paths in the presence of rectangular barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational geometry in a curved world / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and intersection of simple splinegons / rank
 
Normal rank
Property / cites work
 
Property / cites work: ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility Algorithms in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Output-Sensitive Algorithm for Computing Visibility Graphs / 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: A new data structure for shortest path queries in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing minimum length paths of a given homotopy class / 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 near-optimal algorithm for shortest paths among curved obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar rectilinear shortest path computation using corridors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles / 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: Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L_ 1\) shortest paths among polygonal 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: Efficient approximate shortest-path queries among isothetic rectangular obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in the plane with convex polygonal obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in the plane with polygonal obstacles / rank
 
Normal rank

Latest revision as of 07:38, 30 July 2024

scientific article
Language Label Description Also known as
English
Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
scientific article

    Statements

    Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (English)
    0 references
    0 references
    0 references
    4 October 2022
    0 references
    computational geometry
    0 references
    shortest paths
    0 references
    splinegon obstacles
    0 references
    0 references
    0 references

    Identifiers