About the domino problem in the hyperbolic plane from an algorithmic
point of view

Maurice Margenstern

The search session has expired. Please query the service again.

Displaying similar documents to “About the domino problem in the hyperbolic plane from an algorithmic point of view”

Plane trivalent trees and their patterns

Charles Delorme (2010)

Open Mathematics

Similarity:

The aim of this paper is to characterize the patterns of successive distances of leaves in plane trivalent trees, and give a very short characterization of their parity pattern. Besides, we count how many trees satisfy some given sequences of patterns.

Divisible tilings in the hyperbolic plane.

Broughton, S.Allen, Haney, Dawn M., McKeough, Lori T., Smith Mayfield, Brandy (2000)

The New York Journal of Mathematics [electronic only]

Similarity:

Straight-line drawings of binary trees with linear area and arbitrary aspect ratio.

Garg, Ashim, Rusu, Adrian (2004)

Journal of Graph Algorithms and Applications

Similarity:

Bijective counting of tree-rooted maps and shuffles of parenthesis systems.

Bernardi, Olivier (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Rectilinear spanning trees versus bounding boxes.

Rautenbach, D. (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees.

Schaeffer, Gilles (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Efficient drawing of RNA secondary structure.

Auber, David, Delest, Maylis, Domenger, Jean-Philippe, Dulucq, Serge (2006)

Journal of Graph Algorithms and Applications

Similarity:

Hyperbolization of Euclidean ornaments.

von Gagern, Martin, Richter-Gebert, Jürgen (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On Sequences $G_{n}$ satisfying $G_{n} = (d + 2) G_{n - 1} - G_{n - 2}$ .

Chen, Ricky X.F., Shapiro, Louis W. (2007)

Journal of Integer Sequences [electronic only]

Similarity:

Properties of triangulations obtained by the longest-edge bisection

Francisco Perdomo, Ángel Plaza (2014)

Open Mathematics

Similarity:

The Longest-Edge (LE) bisection of a triangle is obtained by joining the midpoint of its longest edge with the opposite vertex. Here two properties of the longest-edge bisection scheme for triangles are proved. For any triangle, the number of distinct triangles (up to similarity) generated by longest-edge bisection is finite. In addition, if LE-bisection is iteratively applied to an initial triangle, then minimum angle of the resulting triangles is greater or equal than a half of the...

Minimum-area drawings of plane 3-trees.

Mondal, Debajyoti, Nishat, Rahnuma Islam, Rahman, Md.Saidur, Alam, Muhammad Jawaherul (2011)

Journal of Graph Algorithms and Applications

Similarity:

The triangles method to build $X$ -trees from incomplete distance matrices

Alain Guénoche, Bruno Leclerc (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A method to infer $X$ -trees (valued trees having $X$ as set of leaves) from incomplete distance arrays (where some entries are uncertain or unknown) is described. It allows us to build an unrooted tree using only 2 $n$ -3 distance values between the $n$ elements of $X$ , if they fulfill some explicit conditions. This construction is based on the mapping between $X$ -tree and a weighted generalized 2-tree spanning $X$ .

On the area of a polygon in the hyperbolic plane.

Kántor, Sándor (1998)

Beiträge zur Algebra und Geometrie

Similarity: