Difference between revisions of "Example nodal structures"
(add loop example) |
m |
||
| Line 5: | Line 5: | ||
==== Nodal loops ==== | ==== Nodal loops ==== | ||
| − | This is example shows a complete [[loop]] of six [[node]]s made from [[nodeNEXT|NEXT]] and [[nodePREV]] nodal [[ | + | This is example shows a complete [[loop]] of six [[node]]s made from [[nodeNEXT|NEXT]] and [[nodePREV]] nodal [[association]]s. The ''NEXT'' and ''PREV'' are the first two [[binary traversal|traversable]] node indexes which translate to the two single-bit paths. |
| − | [[Image: | + | [[Image:loop.png]] |
This example shows how a single path of two successive 1's (called TEST in this example) doesn't conflict with two successive [[nodeNEXT|NEXT]] (1) [[binary traversal|traversals]]. It's because traversal is a [[list space]] operation, but [[loop]]s are formed from [[association]]s in [[node space]]. | This example shows how a single path of two successive 1's (called TEST in this example) doesn't conflict with two successive [[nodeNEXT|NEXT]] (1) [[binary traversal|traversals]]. It's because traversal is a [[list space]] operation, but [[loop]]s are formed from [[association]]s in [[node space]]. | ||
[[Image:Nodal-loop-example1.png]] | [[Image:Nodal-loop-example1.png]] | ||
Revision as of 05:03, 8 November 2006
|
This is an article for discussing and displaying various nodal structures and examples. These diagrams are being made online with Gliffy, login with email address aran@organicdesign.co.nz and password project to modify or create new nodal diagrams. After you've made a new diagram, save it in gliffy so you can keep working on it later, and export as a PNG to upload into Organic Design. I prefer to crop them and give them a transparent background before uploading, you can do this in photoshop by creating a selection from one of the R,G or B channels, invert the selection, delete the background layer, create a new layer fill the selection black. Then save for web as a 24-bit PNG with transparency. |
Nodal loops
This is example shows a complete loop of six nodes made from NEXT and nodePREV nodal associations. The NEXT and PREV are the first two traversable node indexes which translate to the two single-bit paths.
This example shows how a single path of two successive 1's (called TEST in this example) doesn't conflict with two successive NEXT (1) traversals. It's because traversal is a list space operation, but loops are formed from associations in node space.
