scientific article; zbMATH DE number 1305410
From MaRDI portal
Publication:4252291
zbMATH Open0938.68132MaRDI QIDQ4252291FDOQ4252291
Authors: Yi-Jen Chiang, Joseph S. B. Mitchell 
Publication date: 17 June 1999
Title of this publication is not available (Why is that?)
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph theory (05C99)
Cited In (22)
- Shortest rectilinear path queries to rectangles in a rectangular domain
- Planar spanners and approximate shortest path queries among obstacles in the plane
- Title not available (Why is that?)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- Routing among convex polygonal obstacles in the plane
- Approximate Euclidean shortest paths amid convex obstacles
- Title not available (Why is that?)
- Computing the geodesic centers of a polygonal domain
- ON GEOMETRIC PATH QUERY PROBLEMS
- Link Distance and Shortest Path Problems in the Plane
- Approximate distance oracles for graphs with dense clusters
- Shortest Path Problems on a Polyhedral Surface
- Shortest Path Queries in Polygonal Domains
- Shortest path problems on a polyhedral surface
- Routing among convex polygonal obstacles in the plane
- Shortest path planning for a tethered robot
- Link distance and shortest path problems in the plane
- The geodesic diameter of polygonal domains
- Querying two boundary points for shortest paths in a polygonal domain
- Maximal distortion of geodesic diameters in polygonal domains
- Querying two boundary points for shortest paths in a polygonal domain (extended abstract)
- On geometric path query problems
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 Q4252291)
