Hyperbolic tree, the Glossary

Table of Contents

1. 12 relations: Beltrami–Klein model, Binary tiling, Data and information visualization, Graph drawing, Hyperbolic geometry, Möbius transformation, Poincaré disk model, Radial tree, Tree (data structure), Tree (graph theory), Tree of life, Visualization (graphics).

2. Graph drawing

Beltrami–Klein model

In geometry, the Beltrami–Klein model, also called the projective model, Klein disk model, and the Cayley–Klein model, is a model of hyperbolic geometry in which points are represented by the points in the interior of the unit disk (or n-dimensional unit ball) and lines are represented by the chords, straight line segments with ideal endpoints on the boundary sphere. Hyperbolic tree and Beltrami–Klein model are hyperbolic geometry.

See Hyperbolic tree and Beltrami–Klein model

Binary tiling

In geometry, the binary tiling (sometimes called the Böröczky tiling) is a tiling of the hyperbolic plane, resembling a quadtree over the Poincaré half-plane model of the hyperbolic plane.

See Hyperbolic tree and Binary tiling

Data and information visualization

Data and information visualization (data viz/vis or info viz/vis) is the practice of designing and creating easy-to-communicate and easy-to-understand graphic or visual representations of a large amount of complex quantitative and qualitative data and information with the help of static, dynamic or interactive visual items.

See Hyperbolic tree and Data and information visualization

Graph drawing

Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional depictions of graphs arising from applications such as social network analysis, cartography, linguistics, and bioinformatics.

See Hyperbolic tree and Graph drawing

Hyperbolic geometry

In mathematics, hyperbolic geometry (also called Lobachevskian geometry or Bolyai–Lobachevskian geometry) is a non-Euclidean geometry.

See Hyperbolic tree and Hyperbolic geometry

Möbius transformation

In geometry and complex analysis, a Möbius transformation of the complex plane is a rational function of the form f(z).

See Hyperbolic tree and Möbius transformation

Poincaré disk model

In geometry, the Poincaré disk model, also called the conformal disk model, is a model of 2-dimensional hyperbolic geometry in which all points are inside the unit disk, and straight lines are either circular arcs contained within the disk that are orthogonal to the unit circle or diameters of the unit circle. Hyperbolic tree and Poincaré disk model are hyperbolic geometry.

See Hyperbolic tree and Poincaré disk model

Radial tree

A radial tree, or radial map, is a method of displaying a tree structure (e.g., a tree data structure) in a way that expands outwards, radially. Hyperbolic tree and radial tree are graph drawing and trees (data structures).

See Hyperbolic tree and Radial tree

Tree (data structure)

In computer science, a tree is a widely used abstract data type that represents a hierarchical tree structure with a set of connected nodes. Hyperbolic tree and tree (data structure) are trees (data structures).

See Hyperbolic tree and Tree (data structure)

Tree (graph theory)

In graph theory, a tree is an undirected graph in which any two vertices are connected by path, or equivalently a connected acyclic undirected graph.

See Hyperbolic tree and Tree (graph theory)

Tree of life

The tree of life is a fundamental archetype in many of the world's mythological, religious, and philosophical traditions.

See Hyperbolic tree and Tree of life

Visualization (graphics)

Visualization (or visualisation (see spelling differences)), also known as Graphics Visualization, is any technique for creating images, diagrams, or animations to communicate a message.

See Hyperbolic tree and Visualization (graphics)

See also

Graph drawing

• Angular resolution (graph drawing)
• Arc diagram
• Area (graph drawing)
• Automatic layout
• Bend minimization
• Circular layout
• Clustered planarity
• Coffman–Graham algorithm
• Concept map
• Convex drawing
• Crossing Numbers of Graphs
• Crossing number (graph theory)
• Crossing number inequality
• DOT (graph description language)
• Data-flow diagram
• Dendrogram
• Dominance drawing
• Force-directed graph drawing
• Graph drawing
• Graph drawing software
• Hanani–Tutte theorem
• Hasse diagram
• Hyperbolic tree
• International Symposium on Graph Drawing
• Journal of Graph Algorithms and Applications
• Layered graph drawing
• Parallel redrawing
• Planar graphs
• RAC drawing
• Radial tree
• Simultaneous embedding
• Slope number
• Sociogram
• Spectral layout
• State diagram
• Stress majorization
• Turán's brick factory problem
• Tutte embedding

References

[1] https://en.wikipedia.org/wiki/Hyperbolic_tree

Also known as HyperbolicTree.