Efficiently approximating polygonal paths in three and higher dimensions
type: Item
instance of: scholarly article
title: Efficiently approximating polygonal paths in three and higher dimensions
zbMATH Open document ID: 0994.68048
published in: Algorithmica
publication date: 2002-06-17T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 1756779
zbMATH Keywords: min-\# problem
author: Gill Barequet
author: Danny Z. Chen
author: Ovidiu Daescu
author: Michael T. Goodrich
author: Jack Snoeyink
MaRDI profile type: Publication
OpenAlex ID: W1981507524
DOI: 10.1007/S00453-001-0096-5
Recommended article: Distance-preserving approximations of polygonal paths
Recommended article: Algorithms and Computation
Recommended article: Area-preserving approximations of polygonal paths
Recommended article: Approximating Polygonal Curves in Two and Three Dimensions
Recommended article: Q5875571
Recommended article: An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles
Recommended article: EFFICIENT APPROXIMATION OF CONVEX POLYGONS
Recommended article: Approximating shortest paths on a convex polytope in three dimensions
Recommended article: Approximate shortest path on a polyhedral surface and its applications
description: scientific article; zbMATH DE number 1756779