Log In Sign Up

An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model

by   Jonas Cleve, et al.

We perform an experimental evaluation of algorithms for finding geodesic shortest paths between two points inside a simple polygon in the constant-workspace model. In this model, the input resides in a read-only array that can be accessed at random. In addition, the algorithm may use a constant number of words for reading and for writing. The constant-workspace model has been studied extensively in recent years, and algorithms for geodesic shortest paths have received particular attention. We have implemented three such algorithms in Python, and we compare them to the classic algorithm by Lee and Preparata that uses linear time and linear space. We also clarify a few implementation details that were missing in the original description of the algorithms. Our experiments show that all algorithms perform as advertised in the original works and according to the theoretical guarantees. However, the constant factors in the running times turn out to be rather large for the algorithms to be fully useful in practice.


page 1

page 2

page 3

page 4


How to Compose Shortest Paths

The composition problem for shortest paths asks the following: given sho...

Holiest Minimum-Cost Paths and Flows in Surface Graphs

Let G be an edge-weighted directed graph with n vertices embedded on an ...

Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths

The betweenness centrality (BC) of a node in a network (or graph) is a m...

Negative-Weight Single-Source Shortest Paths in Near-linear Time

We present a randomized algorithm that computes single-source shortest p...

Centralized and Parallel Multi-Source Shortest Paths via Hopsets and Fast Matrix Multiplication

Consider an undirected weighted graph G = (V,E,w). We study the problem ...

A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms

We are given a read-only memory for input and a write-only stream for ou...

Space-efficient, Fast and Exact Routing in Time-dependent Road Networks

We study the problem of computing shortest paths in massive road network...