A fast algorithm to generate open meandric systems and meanders

DOI10.1145/1721837.1721858MaRDI QIDQ2930322zbMATH OpenOpenAlexFDO

Authors Bruce Bobier, Joe Sawada, Bruce Bobier

Publication date 18 November 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1721837.1721858

zbMATH Keywords

CAT algorithmmeanderopen meandric system

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• Stamp foldings, semi-meanders, and open meanders: fast generation algorithms
• A constructive enumeration of meanders
• Compression of meanders
• A transfer matrix approach to the enumeration of plane meanders
• On meandric colliers

Cited in

(9)

• Enumerating meandric systems with large number of loops
• Meanders, knots, labyrinths and mazes
• Stamp foldings, semi-meanders, and open meanders: fast generation algorithms
• On the maximum number of crossings in star-simple drawings of \(K_n\) with no empty lens
• Generating cyclic rotation Gray codes for stamp foldings and semi-meanders
• Meanders: a personal perspective to the memory of Pierre Rosenstiehl
• Recursive and iterative approaches to generate rotation Gray codes for stamp foldings and semi-meanders
• Prime factorization of meanders
• Gray codes for reflectable languages

This page was built for publication: A fast algorithm to generate open meandric systems and meanders

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