Parallel rectilinear shortest paths with rectangular obstacles
type: Item
instance of: scholarly article
title: Parallel rectilinear shortest paths with rectangular obstacles
zbMATH Open document ID: 0764.68167
DOI: 10.1016/0925-7721(91)90002-V
author: Mikhail J. Atallah
author: Danny Z. Chen
published in: Computational Geometry
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 52B05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 57270
zbMATH Keywords: shortest rectilinear obstacle-avoiding paths
zbMATH Keywords: CREW-PRAM
MaRDI profile type: Publication
cites work: Q4773298
cites work: Efficient Parallel Algorithms for String Editing and Related Problems
cites work: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
cites work: Finding level-ancestors in trees
cites work: The Parallel Evaluation of General Arithmetic Expressions
cites work: Parallel Merge Sort
cites work: Rectilinear shortest paths in the presence of rectangular barriers
cites work: Parallel algorithms for shortest path problems in polygons
cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
cites work: Parallel Prefix Computation
cites work: Finding minimum rectilinear distance paths in the presence of barriers
cites work: Q3985348
cites work: Euclidean shortest paths in the presence of rectilinear barriers
cites work: The Discrete Geodesic Problem
cites work: On the X-Y convex hull of a set of X-Y polygons
cites work: Q3992847
cites work: Q3798232
cites work: On Shortest Paths in Polyhedral Spaces
cites work: Finding the maximum, merging, and sorting in a parallel computation model
cites work: An Efficient Parallel Biconnectivity Algorithm
cites work: On Some Distance Problems in Fixed Orientations
full work available at URL: 0925-7721(91)90002-v
OpenAlex ID: W1975595599
description: scientific article; zbMATH DE number 57270