Skip to content

Instantly share code, notes, and snippets.

Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
name address
Kita Langenfelde Langenfelde 19, 24159 Kiel, Germany
Kita Buschblick Buschblick 103, 24159 Kiel, Germany
Kita Timmerberg Timmerberg 37, 24106 Kiel, Germany
Kita Woltersweg Woltersweg 1, 24106 Kiel, Germany
Kita Holtenauer Straße Holtenauer Straße 257, 24106 Kiel, Germany
Kita Seeblick Quinckestraße 30, 24106 Kiel, Germany
Kita Amrumring Amrumring 15, 24107 Kiel, Germany
Kita Beselerallee Beselerallee 55, 24105 Kiel, Germany
Kita Knooper Weg Knooper Weg 145, 24118 Kiel, Germany
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
.c3-ygrid-line line {
stroke-dasharray: 3;
fill: #242424;
}
.c3-ygrid-line text {
fill: #2c2c2c;
}
(function(){d3.geom = {};
/**
* Computes a contour for a given input grid function using the <a
* href="http://en.wikipedia.org/wiki/Marching_squares">marching
* squares</a> algorithm. Returns the contour polygon as an array of points.
*
* @param grid a two-input function(x, y) that returns true for values
* inside the contour and false for values outside the contour.
* @param start an optional starting point [x, y] on the grid.
* @returns polygon [[x1, y1], [x2, y2], …]
@alsino
alsino / d3.js
Created September 5, 2019 08:55
(function(){if (!Date.now) Date.now = function() {
return +new Date;
};
try {
document.createElement("div").style.setProperty("opacity", 0, "");
} catch (error) {
var d3_style_prototype = CSSStyleDeclaration.prototype,
d3_style_setProperty = d3_style_prototype.setProperty;
d3_style_prototype.setProperty = function(name, value, priority) {
d3_style_setProperty.call(this, name, value + "", priority);
(function(){d3.layout = {};
// Implements hierarchical edge bundling using Holten's algorithm. For each
// input link, a path is computed that travels through the tree, up the parent
// hierarchy to the least common ancestor, and then back down to the destination
// node. Each path is simply an array of nodes.
d3.layout.bundle = function() {
return function(links) {
var paths = [],
i = -1,
n = links.length;
(function(){d3.layout = {};
// Implements hierarchical edge bundling using Holten's algorithm. For each
// input link, a path is computed that travels through the tree, up the parent
// hierarchy to the least common ancestor, and then back down to the destination
// node. Each path is simply an array of nodes.
d3.layout.bundle = function() {
return function(links) {
var paths = [],
i = -1,
n = links.length;
{
"nodes": [{
"name": "Sebastian Meschenmoser",
"discipline": 3,
"gender": "male",
"birthYear": 1980,
"studio": "second home"
},
{
"name": "Pedro Lopes",
{
"nodes": [{
"name": "Sebastian Meschenmoser",
"discipline": 3,
"gender": "male",
"birthYear": 1980,
"studio": "second home"
},
{
"name": "Pedro Lopes",