TRIANGULATING DISJOINT JORDAN CHAINS
From MaRDI portal
Publication:4327391
DOI10.1142/S0218195994000252zbMath0829.68124OpenAlexW2171580054MaRDI QIDQ4327391
Reuven Bar Yehuda, Bernard Chazelle
Publication date: 6 April 1995
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195994000252
Related Items
Visibility queries in a polygonal region ⋮ Planar rectilinear shortest path computation using corridors ⋮ Routing among convex polygonal obstacles in the plane ⋮ Separation and approximation of polyhedral objects ⋮ Routing in polygonal domains ⋮ Computing \(L_1\) shortest paths among polygonal obstacles in the plane ⋮ OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS ⋮ Shortcut hulls: vertex-restricted outer simplifications of polygons ⋮ Computing homotopic shortest paths efficiently ⋮ Three problems about simple polygons ⋮ An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains ⋮ Computing the \(L_1\) geodesic diameter and center of a polygonal domain ⋮ Computing hereditary convex structures ⋮ Visibility and ray shooting queries in polygonal domains ⋮ Unnamed Item ⋮ Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures ⋮ Quickest visibility queries in polygonal domains ⋮ Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane ⋮ Computing an \(L_1\) shortest path among splinegonal obstacles in the plane ⋮ Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane ⋮ Routing in Polygonal Domains
