Existence and hardness of conveyor belts

DOI10.37236/9782zbMath1451.52013arXiv1908.07668OpenAlexW2969685751MaRDI QIDQ2209897

Sean Griffin, Molly Baird, Graham Gordon, Martin L. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Erik D. Demaine, David Eppstein, Joshua P. Swanson, Sara C. Billey

Publication date: 5 November 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

NP-completeconveyor belt

Mathematics Subject Classification ID

Circle packings and discrete conformal geometry (52C26)

Cites Work

• A polynomial time circle packing algorithm
• Another efficient algorithm for convex hulls in two dimensions
• A circle packing algorithm
• Fun with fonts: algorithmic typography
• Shortness exponents of families of graphs
• The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Power Diagrams: Properties, Algorithms and Applications
• String-Wrapped Rotating Disks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Existence and hardness of conveyor belts