scientific article; zbMATH DE number 1256695
From MaRDI portal
Publication:4228431
zbMath0977.68875MaRDI QIDQ4228431
Christine D. Piatko, Joseph S. B. Mitchell, Esther M. Arkin
Publication date: 16 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Mathematical problems of computer architecture (68M07)
Related Items
Computing minimum length paths of a given homotopy class, Structured discrete shape approximation: theoretical complexity and practical algorithm, Efficient piecewise-linear function approximation using the uniform metric, Self-approaching paths in simple polygons, An Experimental Study of Weighted k-Link Shortest Path Algorithms, Minimum-perimeter enclosures, An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions, Rectilinear paths among rectilinear obstacles, Approximation algorithms for lawn mowing and milling
