Spiraling and folding: the word view

DOI10.1007/s00453-009-9362-8zbMath1218.68186OpenAlexW1992965611MaRDI QIDQ548656

Eric Sedgwick, Marcus Schaefer, Daniel Štefanković

Publication date: 30 June 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9362-8

zbMATH Keywords

spiralssquare-free wordsfoldstrain trackscurves on toriThue word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Computing the Fréchet Distance Between Polygons with Holes, Tracing compressed curves in triangulated surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• String graphs requiring exponential representations
• How many squares must a binary sequence contain?
• On nonrepetitive sequences
• Three distance theorems and combinatorics on words
• Recognizing string graphs is decidable
• Decidability of string graphs
• Recognizing string graphs in NP