Gray codes for non-crossing partitions and dissections of a convex polygon

Authors:
Clemens Huemer;Ferran Hurtado;Marc Noy;Elsa Omaña-Pulido
Affiliations:
Departament de Matemítica Aplicada II, Universitat Politècnica de Catalunya (UPC), Jordi Girona,1-3, 08034 Barcelona, Spain;Departament de Matemítica Aplicada II, Universitat Politècnica de Catalunya (UPC), Jordi Girona,1-3, 08034 Barcelona, Spain;Departament de Matemítica Aplicada II, Universitat Politècnica de Catalunya (UPC), Jordi Girona,1-3, 08034 Barcelona, Spain;Universidad Autónoma Metropolitana, México D.F., Mexico
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 12
Cited 0

The rotation graph of binary trees is hamiltonian

Journal of Algorithms
A Survey of Combinatorial Gray Codes

SIAM Review
Geometric tree graphs of points in convex position

Discrete Applied Mathematics - Special issue on the 13th European workshop on computational geometry CG '97
Analytic combinatorics of non-crossing configurations

Discrete Mathematics - Special issue on selected papers in honor of Henry W. Gould
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Journal of the ACM (JACM)
Graph of triangulations of a convex polygon and tree of triangulations

Computational Geometry: Theory and Applications
Mental imagery in program design and visual programming

International Journal of Human-Computer Studies - Best of empirical studies of programmers 7
Noncrossing partitions

Discrete Mathematics
Graphs induced by Gray codes

Discrete Mathematics - Kleitman and combinatorics: a celebration
Gray code for derangements

Discrete Applied Mathematics
Minimal change list for Lucas strings and some graph theoretic consequences

Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Generating combinations by prefix shifts

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper we develop Gray codes for two families of geometric objects: non-crossing partitions and dissections of a convex polygon by means of non-crossing diagonals.