Well, as it turns out, I did my first sketch of a 'hexaglyph'...downwardsfromzero said:Thanks for the link! I would like to use something similar to generate a continuous stream or flowing sheet of random glyphs instead of the hexagonal mazes. This will help develop the animation end of the idea. The glyphs could easily be made to fit an isometric grid which would mean the hexagonal grid would still be useful.ShadedSelf said:There are simple algos to tile an infinite plane with infinite closed loops, reminds me a bit to this.
In this case I guess you could just bruteforce it, there are 6^36 possibilities.
Recursion might be a better angle, since you skip any possibility where cells dont connect, kinda like HT suggests, you just keep going until a closed loop happens or cant continue, if the closed loop is exactly 36 cells long its a winner.
Thanks, it was just a rapid sketch. Next I'll try some higher res stuff, improve accuracy, devise templates etc.Homo Trypens said:Whoa, that thing looks awesome though!
Thanks for the reply - I'm so pleased you like it!Muskogee Herbman said:I love this thread awesome work. my work often combines the mathematics of drawings so I relate to your journey a lot![]()
Thanks - that's like a generalisation of the special case of what I'll now call circuit glyphs. I'm pretty sure @Hyper Turtle pointed out that they constitute Hamiltonian cycles.Another interesting one.
I thought they were exactly the same. Is there any hamiltonian cycle in a rectangular, solid grid graph that wouldn't constitute a circuit glyph? If so, I don't fully understand what constitutes a circuit glyph.that's like a generalisation of the special case of what I'll now call circuit glyphs
While I was looking into this topic, I came across the concept of reconfiguration (I hadn't heard about it before), which seems to be the technical name for the idea you mention:One particular thing that still needs doing for the further development of this project as I see it is defining the ruleset for legitimate stepwise conversion of one glyph into another
Reconfiguration problems arise from exploring the solution space of some particular problem. For example, a solution space of the Hamiltonian cycle problem for a specific graph G would contain all possible solutions of the problem, i.e., all possible Hamiltonian cycles in G. Reconfiguration of the Hamiltonian cycles of G asks the following question: can we transform one Hamiltonian cycle of G to another Hamiltonian cycle of G using some operations such that the intermediate steps are also Hamiltonian cycles of G?
Question 3. Can we define operations to reconfigure Hamiltonian cycles and paths in grid graphs using properties of grid graphs such as limited degree and the fact that the graph is embedded ? When do the operations preserve Hamiltonicity?
It's a nice idea. I may look into that. Do you have any preferred format for output? I saw @Hyper Turtle was emitting SVG as output, I think that's a good idea.The relationships in the graph would then, ideally, be used to define transformations between glyphs, finally moving towards the ultimate goal of morphing dancing glyph animations.
I would also envisage a colour channel for the boundaries and pathway of the generalised glyph which could also be algorithmically steered through a function of the form of the specific glyph instance and some aspect of an audio input.
I was looking into implementing this algorithm, but it's very informally specified and I couldn't come yet with a reasonable way of implementing the constraints. If I figure out a good way to do it I'll generate some cycles and post them here.Another interesting one.