d3.geoBaker() d3.geoBakerRaw The Baker Dinomic projection.

d3.timeTuesday d3.utcTuesday Tuesday-based weeks (e.g., February 7, 2012 at 12:00 AM).

interval.every(step) Returns a filtered view of this interval representing every stepth date. The meaning of step is dependent on this interval’s parent interval as defined by the field function. For example, timeMinute.every(15) returns an interval representing every fifteen minutes, starting on the hour: :00, :15, :30, :45, etc. Note that for some intervals, the resulting dates may not be uniformly-spaced; timeDay’s parent interval is timeMonth, and thus the interval number resets at the s

d3.polygonArea(polygon) <> Returns the signed area of the specified polygon. If the vertices of the polygon are in counterclockwise order (assuming a coordinate system where the origin ⟨0,0⟩ is in the top-left corner), the returned area is positive; otherwise it is negative, or zero.

interval.offset(date[, step]) Returns a new date equal to date plus step intervals. If step is not specified it defaults to 1. If step is negative, then the returned date will be before the specified date; if step is zero, then a copy of the specified date is returned; if step is not an integer, it is floored. This method does not round the specified date to the interval. For example, if date is today at 5:34 PM, then timeDay.offset(date, 1) returns 5:34 PM tomorrow (even if daylight saving

d3.timeWeeks(start, stop[, step]) d3.utcWeeks(start, stop[, step]) Aliases for timeWeek.range and utcWeek.range.

d3.dispatch(types…) Creates a new dispatch for the specified event types. Each type is a string, such as "start" or "end".

d3.geoAugust() d3.geoAugustRaw August’s epicycloidal conformal projection.

d3.geoGingery() d3.geoGingeryRaw(rho, lobes) The U.S.-centric Gingery world projection, as inspired by Cram’s Air Age. Note: requires clipping to the sphere.

d3.polygonHull(points) <> Returns the convex hull of the specified points using Andrew’s monotone chain algorithm. The returned hull is represented as an array containing a subset of the input points arranged in counterclockwise order. Returns null if points has fewer than three elements.