scientific article; zbMATH DE number 1305410
From MaRDI portal
Publication:4252291
zbMath0938.68132MaRDI QIDQ4252291
Joseph S. B. Mitchell, Yi-Jen Chiang
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph theory (05C99)
Related Items (16)
Computing the geodesic centers of a polygonal domain ⋮ Shortest Path Problems on a Polyhedral Surface ⋮ Routing among convex polygonal obstacles in the plane ⋮ The geodesic diameter of polygonal domains ⋮ Algorithms for approximate shortest path queries on weighted polyhedral surfaces ⋮ Approximate distance oracles for graphs with dense clusters ⋮ Querying two boundary points for shortest paths in a polygonal domain ⋮ Shortest Path Queries in Polygonal Domains ⋮ Maximal distortion of geodesic diameters in polygonal domains ⋮ Shortest path planning for a tethered robot ⋮ Link distance and shortest path problems in the plane ⋮ Shortest path problems on a polyhedral surface ⋮ Shortest rectilinear path queries to rectangles in a rectangular domain ⋮ Unnamed Item ⋮ Recognizing the tractability in big data computing ⋮ Link Distance and Shortest Path Problems in the Plane
This page was built for publication:
