Simple wriggling is hard unless you are a fat hippo

DOI10.1007/s00224-011-9337-4zbMath1253.68155arXiv1005.5413OpenAlexW2176503837MaRDI QIDQ692941

Irina Kostitsyna, Valentin Polishchuk

Publication date: 6 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.5413

zbMATH Keywords

shortest pathsmotion planningVLSIcomputational geometry

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

The complexity of Snake and undirected NCL variants

Cites Work

• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
• A near-linear algorithm for the planar segment-center problem
• Visiting a Sequence of Points with a Bevel-Tip Needle
• Planar Formulae and Their Uses
• Theoretical Foundations of VLSI Design
• Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
• Forbidden patterns and unit distances
• Curvature-bounded traversals of narrow corridors
• THE ANCHORED VORONOI DIAGRAM: STATIC, DYNAMIC VERSIONS AND APPLICATIONS
• Planning Algorithms
• Maximum thick paths in static and dynamic environments

This page was built for publication: Simple wriggling is hard unless you are a fat hippo