#hyperbolicgeometry — Public Fediverse posts

The Nielsen-Thurston Classification, discovered by Jakob Nielsen, is a classification of all people named Thurston. Nielsen proved that all Thurstons are isotopic to one of three kinds of Thurstons:

a) William
b) Dylan
c) Not a hyperbolic geometer

Note that not all geometer Thurstons are actually William or Dylan: most of them are just isotopic to William or Dylan.

#NielsenThurstonClassification #Thurston #WilliamThurston #DylanThurston #MappingClassGroups #HyperbolicGeometry

Ported Seuphorica (Scrabble solitaire deckbuilder) to RogueViz for a more intuitive and powerful interface!

(1) Infinite square grid, with standard Seuphorica special powers. Letters E and R (inverse colors close to the gigantic EE top left) are "reversing", hence "RE" is accepted and "EE" is accepted multiple times. Note the word GEESE which uses a portal to get a multiplier for gigantic 'E' two times in a single word. "PETER" uses a mirror.

But since this is RogueViz, let us make the board geometry abstract, to have even more fun with geometry and topology!

(2) Usually, words can only go "right" and "down". In hyperbolic geometry, we have holonomy, so "right" and "down" are not globally defined. So we have to accept both directions. (Or, optionally, only accept words if they are valid both ways.)

(3) In this one, "right" and "down" are not globally defined either, but "horizontal" and "vertical" are (in a somewhat twisted way), so Seuphorica "horizontal" and "vertical" multiplier powers can work.

Although the hexagons somehow turn a horizontal word into a vertical one...

#RogueViz #NonEuclideanGeometry #mathart #noneuclidean #HyperbolicGeometry #Seuphorica #scrabble

(to be continued...)

Developer's intention: A beautiful visualization feature!

What the users share: A chaotic art generator! BREAK THE LIMITS! 🎨🔥

#HyperRogue #RogueViz #HyperbolicGeometry #NonEuclideanGeometry #NonEuclidean

Developer's intention: A beautiful visualization feature!

What the users share: A chaotic art generator! BREAK THE LIMITS! 🎨🔥

#HyperRogue #RogueViz #HyperbolicGeometry #NonEuclideanGeometry #NonEuclidean

Developer's intention: A beautiful visualization feature!

What the users share: A chaotic art generator! BREAK THE LIMITS! 🎨🔥

#HyperRogue #RogueViz #HyperbolicGeometry #NonEuclideanGeometry #NonEuclidean

Developer's intention: A beautiful visualization feature!

What the users share: A chaotic art generator! BREAK THE LIMITS! 🎨🔥

#HyperRogue #RogueViz #HyperbolicGeometry #NonEuclideanGeometry #NonEuclidean

Developer's intention: A beautiful visualization feature!

What the users share: A chaotic art generator! BREAK THE LIMITS! 🎨🔥

#HyperRogue #RogueViz #HyperbolicGeometry #NonEuclideanGeometry #NonEuclidean

Every tile in a hyperbolic tiling is randomly colored red or blue. How far should we move to find a specific pattern (a shape constructed out of tiles, with specific colors)?

The distance is usually proportional to \(n\), the number of tiles in the pattern -- this is because at a given location the pattern appears with probability \( 1/2^n \), and there are \(\Theta(c^d)\) possible locations in distance d.

So, for example, HyperRogue normally displays 582 tiles, and for every specific coloring of these 582 tiles, it should be somewhere in about 742 steps (and all of them in about 753 steps). If we used symbols (26 letters + space) instead of colors and were looking for a specific message of 1000 characters, it should appear in radius 6000.

Problem: however, it is not clear how to find such a pattern (and whether it would be still true for a given pseudorandom generator). What it the most elegant coloring algorithm with similar properties but where requested patterns can be found by following some procedure? (If you do not know how hyperbolic geometry works, might be easier to think about binary trees)

#NonEuclideanGeometry #NonEuclidean #HyperbolicGeometry #HyperRogue #roguelike #procgen

Every tile in a hyperbolic tiling is randomly colored red or blue. How far should we move to find a specific pattern (a shape constructed out of tiles, with specific colors)?

The distance is usually proportional to \(n\), the number of tiles in the pattern -- this is because at a given location the pattern appears with probability \( 1/2^n \), and there are \(\Theta(c^d)\) possible locations in distance d.

So, for example, HyperRogue normally displays 582 tiles, and for every specific coloring of these 582 tiles, it should be somewhere in about 742 steps (and all of them in about 753 steps). If we used symbols (26 letters + space) instead of colors and were looking for a specific message of 1000 characters, it should appear in radius 6000.

Problem: however, it is not clear how to find such a pattern (and whether it would be still true for a given pseudorandom generator). What it the most elegant coloring algorithm with similar properties but where requested patterns can be found by following some procedure? (If you do not know how hyperbolic geometry works, might be easier to think about binary trees)

#NonEuclideanGeometry #NonEuclidean #HyperbolicGeometry #HyperRogue #roguelike #procgen

Every tile in a hyperbolic tiling is randomly colored red or blue. How far should we move to find a specific pattern (a shape constructed out of tiles, with specific colors)?

The distance is usually proportional to \(n\), the number of tiles in the pattern -- this is because at a given location the pattern appears with probability \( 1/2^n \), and there are \(\Theta(c^d)\) possible locations in distance d.

So, for example, HyperRogue normally displays 582 tiles, and for every specific coloring of these 582 tiles, it should be somewhere in about 742 steps (and all of them in about 753 steps). If we used symbols (26 letters + space) instead of colors and were looking for a specific message of 1000 characters, it should appear in radius 6000.

Problem: however, it is not clear how to find such a pattern (and whether it would be still true for a given pseudorandom generator). What it the most elegant coloring algorithm with similar properties but where requested patterns can be found by following some procedure? (If you do not know how hyperbolic geometry works, might be easier to think about binary trees)

#NonEuclideanGeometry #NonEuclidean #HyperbolicGeometry #HyperRogue #roguelike #procgen

Every tile in a hyperbolic tiling is randomly colored red or blue. How far should we move to find a specific pattern (a shape constructed out of tiles, with specific colors)?

The distance is usually proportional to \(n\), the number of tiles in the pattern -- this is because at a given location the pattern appears with probability \( 1/2^n \), and there are \(\Theta(c^d)\) possible locations in distance d.

So, for example, HyperRogue normally displays 582 tiles, and for every specific coloring of these 582 tiles, it should be somewhere in about 742 steps (and all of them in about 753 steps). If we used symbols (26 letters + space) instead of colors and were looking for a specific message of 1000 characters, it should appear in radius 6000.

Problem: however, it is not clear how to find such a pattern (and whether it would be still true for a given pseudorandom generator). What it the most elegant coloring algorithm with similar properties but where requested patterns can be found by following some procedure? (If you do not know how hyperbolic geometry works, might be easier to think about binary trees)

#NonEuclideanGeometry #NonEuclidean #HyperbolicGeometry #HyperRogue #roguelike #procgen

Every tile in a hyperbolic tiling is randomly colored red or blue. How far should we move to find a specific pattern (a shape constructed out of tiles, with specific colors)?

The distance is usually proportional to \(n\), the number of tiles in the pattern -- this is because at a given location the pattern appears with probability \( 1/2^n \), and there are \(\Theta(c^d)\) possible locations in distance d.

So, for example, HyperRogue normally displays 582 tiles, and for every specific coloring of these 582 tiles, it should be somewhere in about 742 steps (and all of them in about 753 steps). If we used symbols (26 letters + space) instead of colors and were looking for a specific message of 1000 characters, it should appear in radius 6000.

Problem: however, it is not clear how to find such a pattern (and whether it would be still true for a given pseudorandom generator). What it the most elegant coloring algorithm with similar properties but where requested patterns can be found by following some procedure? (If you do not know how hyperbolic geometry works, might be easier to think about binary trees)

#NonEuclideanGeometry #NonEuclidean #HyperbolicGeometry #HyperRogue #roguelike #procgen

Revisiting an old hyperbolic interface idea for visually browsing thousands of images in my personal note taking & media management tool... Made with https://thi.ng/geom & https://thi.ng/webgl

Instancing is used already, next steps: add texture atlas to actually show images and move the circle inversion & LOD filtering to the vertex shader...

#ThingUmbrella #WebGL #HyperbolicGeometry #CircleInversion #UI #DataViz #TypeScript

Two-point equidistant projection of the hyperbolic plane, but one point is in the center, and the other point is in the infinity, and changes its direction during this animation. The frame where horocycles are mapped to straight lines is insighftul. (Basically, a circle of radius 𝑟 around the center of ℍ² is mapped to a cirlce of radius 𝑟 around the center of 𝔼², and concentric horocycles are similarly mapped to straight lines; these two conditions determine where every point is mapped.) Based on an idea by bengineer8u.

By the way, our video "Portals to Non-Euclidean Geometries" https://youtu.be/yqUv2JO2BCs has just passed 1M views!

#NonEuclideanGeometry #rogueviz #youtube #mathart #HyperbolicGeometry #noneuclidean