scientific article; zbMATH DE number 2145225

MaRDI QIDQ4657574zbMATH OpenFDO

Authors Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides

Publication date 14 March 2005

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• The complexity of (un)folding
• Reconfiguring closed polygonal chains in Euclidean \(d\)-space
• Movement Problems for 2-Dimensional Linkages
• On reconfiguring radial trees
• A note on reconfiguring tree linkages: Trees can lock

Cited in

(16)

• Reconfiguring closed polygonal chains in Euclidean \(d\)-space
• A note on reconfiguring tree linkages: Trees can lock
• Difficult configurations -- on the complexity of LTrL
• On the complexity of optimal matching reconfiguration
• The four bars problem
• Minimal Locked Trees
• On the Chain Pair Simplification Problem
• Movement Problems for 2-Dimensional Linkages
• Introducing a new NP-hard problem regarding an open chain linkage using an new greedy method
• Mathematical Foundations of Computer Science 2004
• The complexity of (un)folding
• On reconfiguring radial trees
• Geometric and computational aspects of polymer reconfiguration
• Locked and unlocked chains of planar shapes
• On the reconfiguration of chains
• Minimum cost open chain reconfiguration

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 Q4657574)