scientific article; zbMATH DE number 1142297

MaRDI QIDQ4385513zbMATH OpenFDO

Authors Micha Sharir, Jacob T. Schwartz

Publication date 4 May 1998

zbMATH Keywords

geometrical obstaclessingle point motion

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Cited in

(8)

• Compaction and separation algorithms for non-convex polygons and their applications
• Flexible high-order discretization of geometric data for global motion planning
• Piecewise linear paths among convex obstacles
• The geometry of Minkowski spaces -- a survey. II.
• Reachability by paths of bounded curvature in a convex polygon
• Robot motion planning
• A unified scheme for detecting fundamental curves in binary edge images
• Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385513)