Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
type: Item
instance of: scholarly article
title: Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
zbMATH Open document ID: 1502.90180
author: Tameem Choudhury
author: Rajasekhar Inkulu
published in: Journal of Combinatorial Optimization
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7595907
zbMATH Keywords: computational geometry
zbMATH Keywords: shortest paths
zbMATH Keywords: splinegon obstacles
MaRDI profile type: Publication
full work available at URL: s10878-020-00524-0
OpenAlex ID: W3000110732
cites work: Q4633835
cites work: Planar spanners and approximate shortest path queries among obstacles in the plane
cites work: On parallel rectilinear obstacle-avoiding paths
cites work: TRIANGULATING DISJOINT JORDAN CHAINS
cites work: Rectilinear short path queries among rectangular obstacles
cites work: A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane
cites work: Computing Shortest Paths among Curved Obstacles in the Plane
cites work: Two-point L1 shortest path queries in the plane
cites work: Q5452284
cites work: Rectilinear shortest paths in the presence of rectangular barriers
cites work: Computational geometry in a curved world
cites work: Decomposition and intersection of simple splinegons
cites work: ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES
cites work: Visibility Algorithms in the Plane
cites work: An Output-Sensitive Algorithm for Computing Visibility Graphs
cites work: Optimal shortest path queries in a simple polygon
cites work: A new data structure for shortest path queries in a simple polygon
cites work: Computing minimum length paths of a given homotopy class
cites work: An Optimal Algorithm for Euclidean Shortest Paths in the Plane
cites work: A near-optimal algorithm for shortest paths among curved obstacles in the plane
cites work: Planar rectilinear shortest path computation using corridors
cites work: Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
cites work: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
cites work: Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
cites work: \(L_ 1\) shortest paths among polygonal obstacles in the plane
cites work: SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
cites work: Efficient approximate shortest-path queries among isothetic rectangular obstacles
cites work: Shortest paths in the plane with convex polygonal obstacles
cites work: Shortest paths in the plane with polygonal obstacles
DOI: 10.1007/S10878-020-00524-0
description: scientific article; zbMATH DE number 7595907