This experiment extends the previous one using a more compact representation of the instances. Instead of using a matrix, instances are placed along the Gosper curve (See [this]Linked Data Maps approach for details).
This extension adds to the Linked Data Maps approach, an additional criteria of proximity between instances. In fact, so far, the only criteria for which instances were close to each other was the membership to the same ontological class. This experiment introduces a new one based on the description of the instances in term of RDF predicates.
Modified http://d3js.org/d3.v3.min.js to a secure url
Modified http://cdnjs.cloudflare.com/ajax/libs/lodash.js/2.4.1/lodash.min.js to a secure url
https://d3js.org/d3.v3.min.js
https://cdnjs.cloudflare.com/ajax/libs/lodash.js/2.4.1/lodash.min.js
https://wafi.iit.cnr.it/webvis/tmp/clusterfck.js
https://wafi.iit.cnr.it/webvis/libs/jigmaps/zip.js
https://wafi.iit.cnr.it/webvis/libs/jigmaps/tree_utils.js
https://wafi.iit.cnr.it/webvis/libs/jigmaps/sfc_layout.js
https://wafi.iit.cnr.it/webvis/libs/jigmaps/jigsaw.js