On the shortest paths between two convex polyhedra
type: Item
instance of: scholarly article
title: On the shortest paths between two convex polyhedra
zbMATH Open document ID: 0652.68043
DOI: 10.1145/42282.214094
author: Avikam Baltsan
author: Micha Sharir
published in: Journal of the ACM
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 52A15
Mathematics Subject Classification ID: 68R99
zbMATH DE Number: 4064474
zbMATH Keywords: computational geometry
zbMATH Keywords: Davenport-Schinzel sequences
zbMATH Keywords: Euclidean shortest path
zbMATH Keywords: convex polyhedral
zbMATH Keywords: inverse of Ackermann's function
zbMATH Keywords: Voronoi diagram
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1145/42282.214094
OpenAlex ID: W2067305605
Recommended article: On Shortest Paths Amidst Convex Polyhedra
Recommended article: On Shortest Paths in Polyhedral Spaces
Recommended article: Q4219245
Recommended article: Computing approximate shortest paths on convex polytopes
Recommended article: Approximating shortest paths on a nonconvex polyhedron
Recommended article: Approximate Shortest Paths in Simple Polyhedra
Recommended article: Shortest paths in the plane with convex polygonal obstacles
Recommended article: Shortest Path Problems on a Polyhedral Surface
Recommended article: Shortest path problems on a polyhedral surface
Recommended article: Q3685218
description: scientific article