Showing papers by "Central Economics and Mathematics Institute published in 1986"
01 Jan 1986
1 citations
01 Jan 1986
TL;DR: The algorithm for constructing the equivalent network with running-time O(n 2logn), where nis the number of nodes in the network, is presented.
Abstract: This paper focuses on the problem of finding the shortest paths on a plane when the obstacle is a finite set of segments. The problem is reduced to finding the shortest paths in an equivalent network. The algorithm for constructing the equivalent network with running-time O(n 2logn), where nis the number of nodes in the network, is presented.