scientific article; zbMATH DE number 742973
From MaRDI portal
Publication:4763413
zbMATH Open0829.68120MaRDI QIDQ4763413FDOQ4763413
Authors: Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri 
Publication date: 11 April 1995
Title of this publication is not available (Why is that?)
Recommendations
- Optimal shortest path queries in a simple polygon
- LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
- Shortest Path Queries in Polygonal Domains
- AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
- Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle
- \(L_{1}\) shortest path queries in simple polygons
- A new data structure for shortest path queries in a simple polygon
- Algorithms and Computation
- Query-points visibility constraint minimum link paths in simple polygons
- scientific article; zbMATH DE number 1256695
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (8)
- Optimal shortest path queries in a simple polygon
- LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
- Link Distance and Shortest Path Problems in the Plane
- Query-points visibility constraint minimum link paths in simple polygons
- Link distance and shortest path problems in the plane
- Optimal parallel algorithms for rectilinear link-distance problems
- Efficient piecewise-linear function approximation using the uniform metric
- Efficient algorithms for shortest distance queries on special classes of polygons
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763413)
