Cheap and reliable Node.js hosting starts at $3/month, and $1/month static HTML hosting

Created with love in Canada, visit hostnodejs.com today

Feel like to post an Ad? Learn Details

All Projects → pbeshai → Vis Utils

pbeshai / Vis Utils

Licence: mit

A collection of utility functions for helping with data visualization

Programming Languages

javascript

184084 projects - #8 most used programming language

vis-utils

A collection of utility functions for helping with data visualization.

Development

Run tests

npm run test

Build the package

npm run build

Installing

If you use NPM, npm install vis-utils. Otherwise, download the latest release.

# extentLimited(array, valueAccessor, minPercentile, maxPercentile)

Compute the extent (min and max) of an array, limiting the min and the max by the specified percentiles. Percentiles are values between 0 and 1.

Parameters

array (Array) The array to iterate over
[valueAccessor] (Function) How to read a value in the array (defaults to identity)
[minPercentile] (Number) If provided, limits the min to this percentile value (between 0 and 1). If provided, the data is sorted by taking the difference of the valueAccessor results.
[maxPercentile] (Number) If provided, limits the max to this percentile value (between 0 and 1). If provided, the data is sorted by taking the difference of the valueAccessor results.

Returns

(Array) The extent, limited by the min/max percentiles ([min, max])

# extentMulti(outerArray, valueAccessor, arrayAccessor, minPercentile, maxPercentile)

Compute the extent (min and max) across an array of arrays/objects

For example:

extentMulti([[4, 3], [1, 2]], d => d);
> [1, 4]

extentMulti([{ results: [{ x: 4 }, { x: 3 }] }, { results: [{ x: 1 }, { x: 2 }] }],
  d => d.x, array => array.results);
> [1, 4]

Parameters

outerArray (Array) An array of arrays or objects
[valueAccessor] (Function) How to read a value in the array (defaults to identity)
[arrayAccessor] (Function) How to read an inner array (defaults to identity)
[minPercentile] (Number) If provided, limits the min to this percentile value (between 0 and 1). If provided, the data is sorted by taking the difference of the valueAccessor results.
[maxPercentile] (Number) If provided, limits the max to this percentile value (between 0 and 1). If provided, the data is sorted by taking the difference of the valueAccessor results.

Returns

(Array) The min and max across the arrays ([min, max])

# filterInRect(array, rect, x, y)

Filters the elements in the passed in array to those that are contained within the specified rectangle.

Parameters

array (Array) The input array to filter
rect (Number[][]) The rectangle, a pair of two points [[x, y], [x, y]]
x (Function) Function that maps a point in the array to its x value (defaults to d => d[0])
y (Function) Function that maps a point in the array to its y value (defaults to d => d[1])

Returns

(Array) The subset of the input array that is contained within the rectangle

# filterInRectFromQuadtree(array, rect, x, y)

Filters the elements in the passed in quadtree to those that are contained within the specified rectangle.

Parameters

quadtree (Object) The input data as a d3-quadtree to filter
rect (Number) The rectangle, a pair of two points [[x, y], [x, y]]
x (Function) Function that maps a point in the array to its x value (defaults to d => d[0])
y (Function) Function that maps a point in the array to its y value (defaults to d => d[1])

Returns

(Array) The subset of the input data that is contained within the rectangle

# findClosestSorted(array, value, accessor)

Helper function to compute distance and find the closest item Since it assumes the data is sorted, it does a binary search O(log n)

Parameters

array (Array) the input array to search
value (Number) the value to match against (typically pixels)
[accessor] (Function) applied to each item in the array to get equivalent value to compare against (defaults to identity)

Returns

(Any) The item in the array that is closest to value

# findClosestUnsorted(array, value, accessor)

Helper function to compute distance and find the closest item Since it assumes the data is unsorted, it does a linear scan O(n).

Parameters

array (Array) the input array to search
value (Number) the value to match against (typically pixels)
[accessor] (Function) applied to each item in the array to get equivalent value to compare against (defaults to identity)

Returns

(Any) The item in the array that is closest to value

# findEqualSorted(array, value, accessor)

Helper function to find the item that matches this value. Since it assumes the data is sorted, it does a binary search O(log n)

Parameters

array (Array) the input array to search
value (Number) the value to match against (typically pixels)
[accessor] (Function) applied to each item in the array to get equivalent value to compare against (defaults to identity)

Returns

(Any) The item in the array that has this value or null if not found

# findEqualUnsorted(array, value, accessor)

Helper function to find the item that matches this value. Since it assumes the data is unsorted, it does a linear scan O(n).

Parameters

array (Array) the input array to search
value (Number) the value to match against (typically pixels)
[accessor] (Function) applied to each item in the array to get equivalent value to compare against (defaults to identity)

Returns

(Any) The item in the array that has this value or null if not found

# interpolateCubicBezier(start, control1, control2, end)

Given the definition of a cubic bezier: a start point, two control points, and end point, return a function that interpolates between the start point and end point following the curve.

Parameters

start (Number[]) The start point ([x, y])
control1 (Number[]) The first control point ([x, y])
control2 (Number[]) The second control point ([x, y])
end (Number[]) The end point ([x, y])

Returns (Function) the interpolating function that maps from 0 <= t <= 1 to a point on the curve.

# interpolateCubicBezierAngle(start, control1, control2, end)

Given the definition of a cubic bezier: a start point, two control points, and end point, return a function that interpolates the angle on the curve. For example, at t = 0, the interpolator returns the angle at the start point, at t = 0.5, it returns the angle midway through the curve and at t = 1 it returns the angle at the end of the curve (useful for things like arrowheads). The angles are in degrees.

Parameters

start (Number[]) The start point ([x, y])
control1 (Number[]) The first control point ([x, y])
control2 (Number[]) The second control point ([x, y])
end (Number[]) The end point ([x, y])

Returns (Function) the interpolating function that maps from 0 <= t <= 1 to an angle in degrees along the curve.

# interpolateQuadraticBezier(start, control, end)

Given the definition of a quadratic bezier: a start point, control point, and end point, return a function that interpolates between the start point and end point following the curve.

Parameters

start (Number[]) The start point ([x, y])
control (Number[]) The control point ([x, y])
end (Number[]) The end point ([x, y])

Returns (Function) the interpolating function that maps from 0 <= t <= 1 to a point on the curve.

# interpolateQuadraticBezierAngle(start, control, end)

Given the definition of a quadratic bezier: a start point, control point, and end point, return a function that interpolates the angle on the curve. For example, at t = 0, the interpolator returns the angle at the start point, at t = 0.5, it returns the angle midway through the curve and at t = 1 it returns the angle at the end of the curve (useful for things like arrowheads). The angles are in degrees.

Parameters

start (Number[]) The start point ([x, y])
control (Number[]) The control point ([x, y])
end (Number[]) The end point ([x, y])

Returns (Function) the interpolating function that maps from 0 <= t <= 1 to an angle in degrees along the curve.

# rectContains(rect, point)

Determines if a point is inside a rectangle. The rectangle is defined by two points [[rx1, ry1], [rx2, ry2]].

the upper left corner (rx1, ry1)
the bottom right corner (rx2, ry2)

Note that it is assumed that the top Y value is less than the bottom Y value.

Parameters

rect (Number[][]) The rectangle, a pair of two points [[x, y], [x, y]]
point (Number[]) The point ([x, y])

Returns

(Boolean) true if the point is inside the rectangle, false otherwise

# rectIntersects(rect1, rect2)

Determines if two rectangles intersect. Here a rectangle is defined by its upper left and lower right corners.

Note that it is assumed that the top Y value is less than the bottom Y value.

Parameters

rect1 (Number[][]) The first rectangle, a pair of two points [[x, y], [x, y]]
rect2 (Number[][]) The second rectangle, a pair of two points [[x, y], [x, y]]

Returns

(Boolean) true if the rectangles intersect, false otherwise

# rotate(point, thetaRadians, origin)

Rotate a point ([x, y]) around an origin ([x, y]) by theta radians

Parameters

point (Number[]) The point to rotate [x, y]
thetaRadians (Number) How many radians to rotate the point around origin
[origin] (Number[]) The origin to rotate around [x, y] (defaults to [0, 0])

Returns

(Number[]) The rotated point [x, y]

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].

Stars: ✭ 40

Visit Git Page 🔗Visit User Page 🔗Visit Issues Page (3) 🔗