{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:32:31Z","timestamp":1750307551761,"version":"3.41.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2010,3]]},"abstract":"<jats:p>\n            An open meandric system is a planar configuration of acyclic curves crossing an infinite horizontal line in the plane such that the curves may extend in both horizontal directions. We present a fast, recursive algorithm to exhaustively generate open meandric systems with\n            <jats:italic>n<\/jats:italic>\n            crossings. We then illustrate how to modify the algorithm to generate unidirectional open meandric systems (the curves extend only to the right) and nonisomorphic open meandric systems where equivalence is taken under horizontal reflection. Each algorithm can be modified to generate systems with exactly\n            <jats:italic>k<\/jats:italic>\n            curves. In the unidirectional case when\n            <jats:italic>k<\/jats:italic>\n            = 1, we can apply a minor modification along with some additional optimization steps to yield the first fast and simple algorithm to generate open meanders.\n          <\/jats:p>","DOI":"10.1145\/1721837.1721858","type":"journal-article","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T02:56:32Z","timestamp":1270608992000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A fast algorithm to generate open meandric systems and meanders"],"prefix":"10.1145","volume":"6","author":[{"given":"Bruce","family":"Bobier","sequence":"first","affiliation":[{"name":"University of Waterloo, Ont., Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Sawada","sequence":"additional","affiliation":[{"name":"University of Guelph, Guleph, Ont., Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,4,6]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1016\/j.jcta.2005.02.006"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1007\/BF00970265"},{"unstructured":"Bacher R. 1999. Meander algebras. http:\/\/www-fourier.uif-gremble.fr\/PUBLIS\/publications\/ReF_478.pdf.  Bacher R. 1999. Meander algebras. http:\/\/www-fourier.uif-gremble.fr\/PUBLIS\/publications\/ReF_478.pdf.","key":"e_1_2_1_3_1"},{"volume-title":"Approaches to the enumerative theory of meanders. Master's Essay","author":"Croix M. L.","unstructured":"Croix , M. L. 2003. Approaches to the enumerative theory of meanders. Master's Essay , University of Waterloo , Canada. Croix, M. L. 2003. Approaches to the enumerative theory of meanders. Master's Essay, University of Waterloo, Canada.","key":"e_1_2_1_4_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_5_1","DOI":"10.1007\/11561071_11"},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_1","DOI":"10.1016\/S0550-3213(96)00505-6"},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_1","DOI":"10.1016\/S0895-7177(97)00202-1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_8_1","DOI":"10.1007\/s00026-002-8026-z"},{"doi-asserted-by":"publisher","key":"e_1_2_1_9_1","DOI":"10.1088\/0305-4470\/33\/34\/301"},{"doi-asserted-by":"publisher","key":"e_1_2_1_10_1","DOI":"10.1016\/S0021-9800(68)80048-1"},{"key":"e_1_2_1_11_1","first-page":"117","article-title":"Meanders","volume":"11","author":"Lando S. K.","year":"1992","unstructured":"Lando , S. K. , and Zvonkin , A. K. 1992 . Meanders . Selecta Mathematica Sovietica 11 , 2, 117 -- 144 . Lando, S. K., and Zvonkin, A. K. 1992. Meanders. Selecta Mathematica Sovietica 11, 2, 117--144.","journal-title":"Selecta Mathematica Sovietica"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1016\/0304-3975(93)90316-L"},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_1","DOI":"10.1090\/S0025-5718-1968-0221957-8"},{"key":"e_1_2_1_14_1","first-page":"57","article-title":"Simple alternating transit mazes. Preprint. Abridged version appeared as \u201cLa topologia dei labirinti","volume":"1989","author":"Phillips A.","year":"1989","unstructured":"Phillips , A. 1989 . Simple alternating transit mazes. Preprint. Abridged version appeared as \u201cLa topologia dei labirinti \u201d, in M. Emmer, editor, L'Occio di Horus: Itinerari nell'Imaginario Matematico. Istituto della Enciclopeida Italia, Rome , 1989 , pp. 57 - 67 . Phillips, A. 1989. Simple alternating transit mazes. Preprint. Abridged version appeared as \u201cLa topologia dei labirinti\u201d, in M. Emmer, editor, L'Occio di Horus: Itinerari nell'Imaginario Matematico. Istituto della Enciclopeida Italia, Rome, 1989, pp. 57-67.","journal-title":"M. Emmer, editor, L'Occio di Horus: Itinerari nell'Imaginario Matematico. Istituto della Enciclopeida Italia, Rome"},{"doi-asserted-by":"crossref","unstructured":"Poincar\u00e9 H. 1912. Sur un th\u00e9or\u00e8me de g\u00e9om\u00e9trie. Rend. Circ. Mat. Palermo 33.  Poincar\u00e9 H. 1912. Sur un th\u00e9or\u00e8me de g\u00e9om\u00e9trie. Rend. Circ. Mat. Palermo 33.","key":"e_1_2_1_15_1","DOI":"10.1007\/BF03015314"},{"unstructured":"Reeds J. and Shepp L. 1999. An upper bound on the meander constant. http:\/\/www.dtc.umn.edu\/~reeds.  Reeds J. and Shepp L. 1999. An upper bound on the meander constant. http:\/\/www.dtc.umn.edu\/~reeds.","key":"e_1_2_1_16_1"},{"unstructured":"Sloane N. 2007. http:\/\/www.research.att.com\/~njas\/sequences\/. The online encyclopedia of integer sequences.  Sloane N. 2007. http:\/\/www.research.att.com\/~njas\/sequences\/. The online encyclopedia of integer sequences.","key":"e_1_2_1_17_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_18_1","DOI":"10.4153\/CJM-1950-035-6"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1721837.1721858","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1721837.1721858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:38Z","timestamp":1750249418000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1721837.1721858"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["10.1145\/1721837.1721858"],"URL":"https:\/\/doi.org\/10.1145\/1721837.1721858","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"type":"print","value":"1549-6325"},{"type":"electronic","value":"1549-6333"}],"subject":[],"published":{"date-parts":[[2010,3]]},"assertion":[{"value":"2007-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-04-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}