Shortest Non-Crossing Rectilinear Paths in Plane Regions
From MaRDI portal
Publication:4365025
DOI10.1142/S0218195997000259zbMath1114.68562MaRDI QIDQ4365025
Junya Takahashi, Hitoshi Suzuki, Takao Nishizeki
Publication date: 2 February 1998
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195997000259
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON, Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time, Non-crossing shortest paths in undirected unweighted planar graphs in linear time