Moving coins

DOI10.1016/J.COMGEO.2005.06.005zbMATH Open1098.65022OpenAlexW2914514102MaRDI QIDQ2489547FDOQ2489547

Authors: Manuel Abellanas, Sergey Bereg, Alfredo García Olaverri, David Rappaport, Ferran Hurtado, Javier Tejel 

Publication date: 28 April 2006

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2005.06.005

Recommendations

• scientific article; zbMATH DE number 1944413
• Coins and cones
• Versatile Coins
• Coins with Arbitrary Weights
• Turning a coin over instead of tossing it
• The game of flipping coins
• The game of flipping coins

zbMATH Keywords

computational complexitydirected graphconfigurationHamilton pathcombinatorial boundscollision free translationsmoving coins

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Other designs, configurations (05B30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• The earth mover's distance as a metric for image retrieval
• Title not available (Why is that?)
• Title not available (Why is that?)
• The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
• Title not available (Why is that?)
• Reducing Multiple Object Motion Planning to Graph Searching
• Efficient algorithms for line and curve segment intersection using restricted predicates

Cited In (13)

• Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
• Realizability of Graphs as Triangle Cover Contact Graphs
• Title not available (Why is that?)
• More on the one-dimensional sliding-coin puzzle
• SLIDING DISKS IN THE PLANE
• Convex blocking and partial orders on the plane
• Space-aware reconfiguration
• Space-aware reconfiguration
• On Reconfiguration of Disks in the Plane and Related Problems
• Coins and cones
• On triangle cover contact graphs
• Realizability of graphs as triangle cover contact graphs
• Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch

Uses Software

• EMD

This page was built for publication: Moving coins

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