An O(n log n) Manhattan path algorithm
type: Item
instance of: scholarly article
title: An O(n log n) Manhattan path algorithm
zbMATH Open document ID: 0542.68052
DOI: 10.1016/0020-0190(84)90105-4
author: Witold jun. Lipski
published in: Information Processing Letters
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 3862457
zbMATH Keywords: computational geometry
zbMATH Keywords: shortest paths
zbMATH Keywords: segments on the plane
zbMATH Keywords: Manhattan path
MaRDI profile type: Publication
full work available at URL: 0020-0190(84)90105-4
OpenAlex ID: W2004369220
cites work: On the complexity of computing the measure of ∪[a i ,b i ]
cites work: Q3885184
cites work: Finding a manhattan path and related problems
cites work: Rectilinear line segment intersection, layered segment trees, and dynamization
description: scientific article; zbMATH DE number 3862457