Animated Stratigraphic Profile

.block

license: mit
height: 600
scrolling: no
border: yes

.eslintrc.json

{
    "env": {
        "browser": true
    },
    "extends": "eslint:recommended",
    "globals": {
        "d3": false,
        "ss": false,
        "topojson": false
    },
    "parserOptions": {
        "ecmaFeatures": {
            "impliedStrict": true
        }
    },
    "rules": {
        "indent": ["warn", 4],
        "no-tabs": "error"
    }
}

README.md

This stratigraphic profile shows the measured depth (MD) and the true vertical depth (TVD) of the rock layers (strata) at four locations.

We can't use d3.stack for this stratigraphic profile because the rock layers are not the same at each location. Instead, we derive top and bottom properties for each element in each stack.* We then create a group for each stack and, within each group, create a rectangle for each element.

*This is necessary because the data have an unusual structure. For each well, rows are in depth order. The first row is the top depth; subsequent rows are offsets from the previous row.

block.js

/* Remember: Use four-space indents.
 * However, use two-space indents for operations that change the selection.
 * For more information, see:
 * https://bost.ocks.org/mike/d3/workshop/#35
 */
var svg = d3.select("svg"),
    margin = {top: 20, right: 20, bottom: 20, left: 40},
    width = +svg.attr("width") - margin.left - margin.right,
    height = +svg.attr("height") - margin.top - margin.bottom;

var g = svg.append("g")
    .attr("transform", translate(margin.left, margin.top));

d3.csv("data.csv", row, function (error, data) {
    var nest = d3.nest()
        .key(function (d) { return d.well; }).sortKeys(d3.ascending)
        .entries(data);

    // We need to derive new data to produce the stratigraphic profile.
    // We could do it in Excel.
    // But if we do it here, then we have a record of what we did.
    nest.forEach(function (entry) {
        // Derive the top depth for each formation.
        entry.values.forEach(function (value, i) {
            value.MD = {};
            value.TVD = {};

            if (i > 0) {
                value.MD.top = entry.values[i - 1].MD.top + value.md;
                value.TVD.top = entry.values[i - 1].TVD.top + value.tvd;
            } else {
                value.MD.top = value.md;
                value.TVD.top = value.tvd;
            }
        });

        // Derive the bottom depth for each formation.
        entry.values.forEach(function (value, i) {
            if (i < entry.values.length - 1) {
                value.MD.bottom = entry.values[i + 1].MD.top;
                value.TVD.bottom = entry.values[i + 1].TVD.top;
            }
        });

        // Pop (delete) the last formation because it won't have a bottom depth.
        entry.values.pop();
    });

    // Create option elements as children of the select element.
    d3.select("select")
        .on("change", update)
      .selectAll("option")
        .data(["MD", "TVD"])
      .enter().append("option")
        .text(function (d) { return d; });

    var x = d3.scaleBand()
        .domain(nest.map(function (d) { return d.key; }))
        .range([0, width])
        .padding(0.5);

    var y = d3.scaleLinear()
        .domain([-1800, 100])
        .range([height, 0]);

    // Create a group for all stacks.
    g.append("g")
        .attr("class", "stacks");

    // Create a group for the x axis.
    g.append("g")
        .attr("class", "x axis")
        .attr("transform", translate(0, height))
        .call(d3.axisBottom(x));

    // Create a group for the y axis.
    g.append("g")
        .attr("class", "y axis")
        .call(d3.axisLeft(y));

    update();

    function update() {
        var depth = this.value ? this.value : "MD";

        // Create a group for each stack.
        var stack = d3.select(".stacks")
            .selectAll(".stack")
            .data(nest);

        stack = stack.enter().append("g")
            .attr("class", "stack")
            .attr("transform", function (d) { return translate(x(d.key), 0); })
          .merge(stack);

        // Create a rectangle for each element.
        var element = stack.selectAll(".element")
            .data(function (d) { return d.values; });

        element = element.enter().append("rect")
            .attr("class", "element")
            .attr("x", 0)
            .attr("y", function (d) { return y(d[depth].top); })
            .attr("width", x.bandwidth())
            .attr("height", function (d) { return Math.abs(y(d[depth].top) - y(d[depth].bottom)); })
          .merge(element).transition()
            .duration(1000)
            .attr("y", function (d) { return y(d[depth].top); })
            .attr("height", function (d) { return Math.abs(y(d[depth].top) - y(d[depth].bottom)); });
    }
});

function translate(x, y) {
    return "translate(" + x + "," + y + ")";
}

function row(d) {
    d.md = +d.md;
    d.tvd = +d.tvd;
    return d;
}

data.csv

index.html

<!DOCTYPE html>
<meta charset="utf-8">
<style>
    .element {
        fill: lightgrey;
        stroke: grey;
        shape-rendering: crispEdges;
    }
</style>
<svg width="960" height="500"></svg>
<select></select>
<script src="https://unpkg.com/d3@4/build/d3.min.js"></script>
<script src="block.js"></script>

LICENSE

MIT License

Copyright (c) 2017 Iain Dillingham

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.

preview.png

thumbnail.png