scientific article; zbMATH DE number 7559259

DOI10.4230/LIPIcs.SoCG.2019.59MaRDI QIDQ5088992

Haitao Wang

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

shortest pathspolygonal domains\(L_1\) metrictwo-point queries

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Shortest rectilinear path queries to rectangles in a rectangular domain

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planar rectilinear shortest path computation using corridors
• Geometric applications of a matrix-searching algorithm
• Triangulating a simple polygon in linear time
• A new data structure for shortest path queries in a simple polygon
• \(L_ 1\) shortest paths among polygonal obstacles in the plane
• Computing minimum length paths of a given homotopy class
• Optimal shortest path queries in a simple polygon
• Computing \(L_1\) shortest paths among polygonal obstacles in the plane
• Planar graphs, negative weight edges, shortest paths, and near linear time
• Two-point L1 shortest path queries in the plane
• An Almost Linear Time Algorithm for Generalized Matrix Searching
• Shortest path queries in planar graphs
• Shortest Path Queries in Polygonal Domains
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES
• TRIANGULATING DISJOINT JORDAN CHAINS
• ON GEOMETRIC PATH QUERY PROBLEMS
• Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane

This page was built for publication: