scientific article; zbMATH DE number 1142297
From MaRDI portal
Publication:4385513
zbMath0900.68248MaRDI QIDQ4385513
Publication date: 4 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (8)
Piecewise linear paths among convex obstacles ⋮ Flexible high-order discretization of geometric data for global motion planning ⋮ Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon ⋮ Compaction and separation algorithms for non-convex polygons and their applications ⋮ Reachability by paths of bounded curvature in a convex polygon ⋮ Robot motion planning ⋮ A unified scheme for detecting fundamental curves in binary edge images ⋮ The geometry of Minkowski spaces -- a survey. II.
This page was built for publication:
