MINIMUM-LINK C-ORIENTED PATHS: SINGLE-SOURCE QUERIES-Reference-Cited by-同舟云学术

MINIMUM-LINK C-ORIENTED PATHS: SINGLE-SOURCE QUERIES

Published:1994-03 Issue:01 Volume:04 Page:39-51
ISSN:0218-1959
Container-title:International Journal of Computational Geometry & Applications
language:en
Short-container-title:Int. J. Comput. Geom. Appl.

Author:

ADEGEEST JOHN¹,OVERMARS MARK¹,SNOEYINK JACK²

Affiliation:

1. Dept. of Computer Science, Utrecht Univ., 3508 TB Utrecht, Netherlands

2. Dept. of Computer Science, UBC, Vancouver, B.C., Canada V6T 1Z2, Canada

Abstract

We consider paths composed of a minimum number of line segments parallel to a fixed set of c orientations that avoid a set of obstacles in the plane. We preprocess n line segment obstacles with disjoint interiors and a starting point A into a data structure using O(cn) space. With this data structure, we can determine the minimum number of line segments l of a path from A to a query point B in O(c log n) time and construct a path in additional O(l) time. Preprocessing takes O(c2n log n) time and space or O(c2n log 2 n) time and O(c2n) space. Usually c is a constant — as an example, c = 2 for rectilinear paths.

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218195994000045

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Shortcut hulls: Vertex-restricted outer simplifications of polygons;Computational Geometry;2023-06

2. An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains;Algorithmica;2018-05-04

3. Minimum-link paths revisited;Computational Geometry;2014-08

4. Link Distance Problems;Handbook of Computational Geometry;2000

5. Line Simplification with Restricted Orientations;Lecture Notes in Computer Science;1999