Euclid's Networks #3
by 0x473
Project
Each node randomly generated by the code and each node connected to the nearest one.
Distances between each nodes are calculated by using Euclidean Distances Formula (d =√[(x2 – x1)2 + (y2 – y1)2]).
Each Euclid's Networks number of nodes between 30 to 300. There are 43 color sets in total.
KEYS:
s: save 2000x2000 PNG
a: save 4000x4000 PNG
d: save 8000x8000 PNG
Copyright (c) 2022 0x473.
Licensed under CC BY-NC-SA 4.0
Price history
| Date | Event | Price | Market |
|---|---|---|---|
| 2022-11-19 | Mint | 1 tez | fxhash issuer v2 |
Last completed sales index sync
- fx(params) mint tickets
- Block 15319609
- fxhash issuer v1 (first)
- Block 15319609
- fxhash issuer v1
- Block 15319609
- fxhash issuer v2
- Block 15319609
- fxhash issuer fx(params)
- Block 15319609
- fxhash marketplace v2
- Block 15319609
- fxhash marketplace v1
- Block 15319609
- objkt.com marketplace v1
- Block 15319609
- objkt.com English auctions v2
- Block 15319609
- objkt.com marketplace v2
- Block 15319609
- objkt.com English auctions v1
- Block 15319609
- objkt.com marketplace v3.2
- Block 15319609
- objkt.com collection offers
- Block 15319609
- objkt.com English auctions v3
- Block 15319609
- objkt.com marketplace v3.1
- Block 15319609
- objkt.com Dutch auctions v1
- Block 15319609
Traits
- Node Number
- 2782 of 64 indexed editions · 3%
- Color Set Number
- 131 of 64 indexed editions · 2%
- Color Set HEX
- #F2BBBF,#6F83BF,#F26A4B,#D99D55,#E9F0F21 of 64 indexed editions · 2%