mirror of
https://github.com/FoggedLens/iD.git
synced 2026-05-24 17:14:04 +02:00
Refactor geometric math functions from geo.js to geom.js
This commit is contained in:
Bryan Housel
@@ -74,6 +74,7 @@
|
||||
|
||||
<script src='spec/geo/extent.js'></script>
|
||||
<script src='spec/geo/geo.js'></script>
|
||||
<script src='spec/geo/geom.js'></script>
|
||||
<script src='spec/geo/vector.js'></script>
|
||||
|
||||
<script src='spec/lib/d3.combobox.js'></script>
|
||||
|
||||
+1
-295
@@ -1,4 +1,4 @@
|
||||
describe('iD.geo', function() {
|
||||
describe('iD.geo - geography', function() {
|
||||
|
||||
describe('geoLatToMeters', function() {
|
||||
it('0 degrees latitude is 0 meters', function() {
|
||||
@@ -144,298 +144,4 @@ describe('iD.geo', function() {
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoEdgeEqual', function() {
|
||||
it('returns false for inequal edges', function() {
|
||||
expect(iD.geoEdgeEqual(['a', 'b'], ['a', 'c'])).to.be.false;
|
||||
});
|
||||
|
||||
it('returns true for equal edges along same direction', function() {
|
||||
expect(iD.geoEdgeEqual(['a', 'b'], ['a', 'b'])).to.be.true;
|
||||
});
|
||||
|
||||
it('returns true for equal edges along opposite direction', function() {
|
||||
expect(iD.geoEdgeEqual(['a', 'b'], ['b', 'a'])).to.be.true;
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoAngle', function() {
|
||||
it('returns angle between a and b', function() {
|
||||
var projection = function (_) { return _; };
|
||||
expect(iD.geoAngle({loc:[0, 0]}, {loc:[1, 0]}, projection)).to.be.closeTo(0, 1e-6);
|
||||
expect(iD.geoAngle({loc:[0, 0]}, {loc:[0, 1]}, projection)).to.be.closeTo(Math.PI / 2, 1e-6);
|
||||
expect(iD.geoAngle({loc:[0, 0]}, {loc:[-1, 0]}, projection)).to.be.closeTo(Math.PI, 1e-6);
|
||||
expect(iD.geoAngle({loc:[0, 0]}, {loc:[0, -1]}, projection)).to.be.closeTo(-Math.PI / 2, 1e-6);
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoRotate', function() {
|
||||
it('rotates points around [0, 0]', function() {
|
||||
var points = [[5, 0], [5, 1]];
|
||||
var angle = Math.PI;
|
||||
var around = [0, 0];
|
||||
var result = iD.geoRotate(points, angle, around);
|
||||
expect(result[0][0]).to.be.closeTo(-5, 1e-6);
|
||||
expect(result[0][1]).to.be.closeTo(0, 1e-6);
|
||||
expect(result[1][0]).to.be.closeTo(-5, 1e-6);
|
||||
expect(result[1][1]).to.be.closeTo(-1, 1e-6);
|
||||
});
|
||||
|
||||
it('rotates points around [3, 0]', function() {
|
||||
var points = [[5, 0], [5, 1]];
|
||||
var angle = Math.PI;
|
||||
var around = [3, 0];
|
||||
var result = iD.geoRotate(points, angle, around);
|
||||
expect(result[0][0]).to.be.closeTo(1, 1e-6);
|
||||
expect(result[0][1]).to.be.closeTo(0, 1e-6);
|
||||
expect(result[1][0]).to.be.closeTo(1, 1e-6);
|
||||
expect(result[1][1]).to.be.closeTo(-1, 1e-6);
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoChooseEdge', function() {
|
||||
var projection = function (l) { return l; };
|
||||
projection.invert = projection;
|
||||
|
||||
it('returns null for a degenerate way (no nodes)', function() {
|
||||
expect(iD.geoChooseEdge([], [0, 0], projection)).to.be.null;
|
||||
});
|
||||
|
||||
it('returns null for a degenerate way (single node)', function() {
|
||||
expect(iD.geoChooseEdge([iD.osmNode({loc: [0, 0]})], [0, 0], projection)).to.be.null;
|
||||
});
|
||||
|
||||
it('calculates the orthogonal projection of a point onto a segment', function() {
|
||||
// a --*--- b
|
||||
// |
|
||||
// c
|
||||
//
|
||||
// * = [2, 0]
|
||||
var a = [0, 0];
|
||||
var b = [5, 0];
|
||||
var c = [2, 1];
|
||||
var nodes = [ iD.osmNode({loc: a}), iD.osmNode({loc: b}) ];
|
||||
var choice = iD.geoChooseEdge(nodes, c, projection);
|
||||
expect(choice.index).to.eql(1);
|
||||
expect(choice.distance).to.eql(1);
|
||||
expect(choice.loc).to.eql([2, 0]);
|
||||
});
|
||||
|
||||
it('returns the starting vertex when the orthogonal projection is < 0', function() {
|
||||
var a = [0, 0];
|
||||
var b = [5, 0];
|
||||
var c = [-3, 4];
|
||||
var nodes = [ iD.osmNode({loc: a}), iD.osmNode({loc: b}) ];
|
||||
var choice = iD.geoChooseEdge(nodes, c, projection);
|
||||
expect(choice.index).to.eql(1);
|
||||
expect(choice.distance).to.eql(5);
|
||||
expect(choice.loc).to.eql([0, 0]);
|
||||
});
|
||||
|
||||
it('returns the ending vertex when the orthogonal projection is > 1', function() {
|
||||
var a = [0, 0];
|
||||
var b = [5, 0];
|
||||
var c = [8, 4];
|
||||
var nodes = [ iD.osmNode({loc: a}), iD.osmNode({loc: b}) ];
|
||||
var choice = iD.geoChooseEdge(nodes, c, projection);
|
||||
expect(choice.index).to.eql(1);
|
||||
expect(choice.distance).to.eql(5);
|
||||
expect(choice.loc).to.eql([5, 0]);
|
||||
});
|
||||
|
||||
it('skips the given nodeID at end of way', function() {
|
||||
//
|
||||
// a --*-- b
|
||||
// e |
|
||||
// | |
|
||||
// d - c
|
||||
//
|
||||
// * = [2, 0]
|
||||
var a = [0, 0];
|
||||
var b = [5, 0];
|
||||
var c = [5, 5];
|
||||
var d = [2, 5];
|
||||
var e = [2, 0.1]; // e.g. user is dragging e onto ab
|
||||
var nodes = [
|
||||
iD.osmNode({id: 'a', loc: a}),
|
||||
iD.osmNode({id: 'b', loc: b}),
|
||||
iD.osmNode({id: 'c', loc: c}),
|
||||
iD.osmNode({id: 'd', loc: d}),
|
||||
iD.osmNode({id: 'e', loc: e})
|
||||
];
|
||||
var choice = iD.geoChooseEdge(nodes, e, projection, 'e');
|
||||
expect(choice.index).to.eql(1);
|
||||
expect(choice.distance).to.eql(0.1);
|
||||
expect(choice.loc).to.eql([2, 0]);
|
||||
});
|
||||
|
||||
it('skips the given nodeID in middle of way', function() {
|
||||
//
|
||||
// a --*-- b
|
||||
// d |
|
||||
// / \ |
|
||||
// e c
|
||||
//
|
||||
// * = [2, 0]
|
||||
var a = [0, 0];
|
||||
var b = [5, 0];
|
||||
var c = [5, 5];
|
||||
var d = [2, 0.1]; // e.g. user is dragging d onto ab
|
||||
var e = [0, 5];
|
||||
var nodes = [
|
||||
iD.osmNode({id: 'a', loc: a}),
|
||||
iD.osmNode({id: 'b', loc: b}),
|
||||
iD.osmNode({id: 'c', loc: c}),
|
||||
iD.osmNode({id: 'd', loc: d}),
|
||||
iD.osmNode({id: 'e', loc: e})
|
||||
];
|
||||
var choice = iD.geoChooseEdge(nodes, d, projection, 'd');
|
||||
expect(choice.index).to.eql(1);
|
||||
expect(choice.distance).to.eql(0.1);
|
||||
expect(choice.loc).to.eql([2, 0]);
|
||||
});
|
||||
|
||||
it('returns null if all nodes are skipped', function() {
|
||||
var nodes = [
|
||||
iD.osmNode({id: 'a', loc: [0, 0]}),
|
||||
iD.osmNode({id: 'b', loc: [5, 0]}),
|
||||
];
|
||||
var choice = iD.geoChooseEdge(nodes, [2, 2], projection, 'a');
|
||||
expect(choice).to.be.null;
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoLineIntersection', function() {
|
||||
it('returns null if lines are colinear with overlap', function() {
|
||||
var a = [[0, 0], [10, 0]];
|
||||
var b = [[-5, 0], [5, 0]];
|
||||
expect(iD.geoLineIntersection(a, b)).to.be.null;
|
||||
});
|
||||
it('returns null if lines are colinear but disjoint', function() {
|
||||
var a = [[5, 0], [10, 0]];
|
||||
var b = [[-10, 0], [-5, 0]];
|
||||
expect(iD.geoLineIntersection(a, b)).to.be.null;
|
||||
});
|
||||
it('returns null if lines are parallel', function() {
|
||||
var a = [[0, 0], [10, 0]];
|
||||
var b = [[0, 5], [10, 5]];
|
||||
expect(iD.geoLineIntersection(a, b)).to.be.null;
|
||||
});
|
||||
it('returns the intersection point between 2 lines', function() {
|
||||
var a = [[0, 0], [10, 0]];
|
||||
var b = [[5, 10], [5, -10]];
|
||||
expect(iD.geoLineIntersection(a, b)).to.eql([5, 0]);
|
||||
});
|
||||
it('returns null if lines are not parallel but not intersecting', function() {
|
||||
var a = [[0, 0], [10, 0]];
|
||||
var b = [[-5, 10], [-5, -10]];
|
||||
expect(iD.geoLineIntersection(a, b)).to.be.null;
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoPointInPolygon', function() {
|
||||
it('says a point in a polygon is on a polygon', function() {
|
||||
var poly = [[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]];
|
||||
var point = [0.5, 0.5];
|
||||
expect(iD.geoPointInPolygon(point, poly)).to.be.true;
|
||||
});
|
||||
it('says a point outside of a polygon is outside', function() {
|
||||
var poly = [[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]];
|
||||
var point = [0.5, 1.5];
|
||||
expect(iD.geoPointInPolygon(point, poly)).to.be.false;
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoPolygonContainsPolygon', function() {
|
||||
it('says a polygon in a polygon is in', function() {
|
||||
var outer = [[0, 0], [0, 3], [3, 3], [3, 0], [0, 0]];
|
||||
var inner = [[1, 1], [1, 2], [2, 2], [2, 1], [1, 1]];
|
||||
expect(iD.geoPolygonContainsPolygon(outer, inner)).to.be.true;
|
||||
});
|
||||
it('says a polygon outside of a polygon is out', function() {
|
||||
var outer = [[0, 0], [0, 3], [3, 3], [3, 0], [0, 0]];
|
||||
var inner = [[1, 1], [1, 9], [2, 2], [2, 1], [1, 1]];
|
||||
expect(iD.geoPolygonContainsPolygon(outer, inner)).to.be.false;
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoPolygonIntersectsPolygon', function() {
|
||||
it('returns true when outer polygon fully contains inner', function() {
|
||||
var outer = [[0, 0], [0, 3], [3, 3], [3, 0], [0, 0]];
|
||||
var inner = [[1, 1], [1, 2], [2, 2], [2, 1], [1, 1]];
|
||||
expect(iD.geoPolygonIntersectsPolygon(outer, inner)).to.be.true;
|
||||
});
|
||||
|
||||
it('returns true when outer polygon partially contains inner (some vertices contained)', function() {
|
||||
var outer = [[0, 0], [0, 3], [3, 3], [3, 0], [0, 0]];
|
||||
var inner = [[-1, -1], [1, 2], [2, 2], [2, 1], [1, 1]];
|
||||
expect(iD.geoPolygonIntersectsPolygon(outer, inner)).to.be.true;
|
||||
});
|
||||
|
||||
it('returns false when outer polygon partially contains inner (no vertices contained - lax test)', function() {
|
||||
var outer = [[0, 0], [0, 3], [3, 3], [3, 0], [0, 0]];
|
||||
var inner = [[1, -1], [1, 4], [2, 4], [2, -1], [1, -1]];
|
||||
expect(iD.geoPolygonIntersectsPolygon(outer, inner)).to.be.false;
|
||||
});
|
||||
|
||||
it('returns true when outer polygon partially contains inner (no vertices contained - strict test)', function() {
|
||||
var outer = [[0, 0], [0, 3], [3, 3], [3, 0], [0, 0]];
|
||||
var inner = [[1, -1], [1, 4], [2, 4], [2, -1], [1, -1]];
|
||||
expect(iD.geoPolygonIntersectsPolygon(outer, inner, true)).to.be.true;
|
||||
});
|
||||
|
||||
it('returns false when outer and inner are fully disjoint', function() {
|
||||
var outer = [[0, 0], [0, 3], [3, 3], [3, 0], [0, 0]];
|
||||
var inner = [[-1, -1], [-1, -2], [-2, -2], [-2, -1], [-1, -1]];
|
||||
expect(iD.geoPolygonIntersectsPolygon(outer, inner)).to.be.false;
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoPathLength', function() {
|
||||
it('calculates a simple path length', function() {
|
||||
var path = [[0, 0], [0, 1], [3, 5]];
|
||||
expect(iD.geoPathLength(path)).to.eql(6);
|
||||
});
|
||||
|
||||
it('does not fail on single-point path', function() {
|
||||
var path = [[0, 0]];
|
||||
expect(iD.geoPathLength(path)).to.eql(0);
|
||||
});
|
||||
|
||||
it('estimates zero-length edges', function() {
|
||||
var path = [[0, 0], [0, 0]];
|
||||
expect(iD.geoPathLength(path)).to.eql(0);
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoViewportEdge', function() {
|
||||
var dimensions = [1000, 1000];
|
||||
it('returns null if the point is not at the edge', function() {
|
||||
expect(iD.geoViewportEdge([500, 500], dimensions)).to.be.null;
|
||||
});
|
||||
it('nudges top edge', function() {
|
||||
expect(iD.geoViewportEdge([500, 5], dimensions)).to.eql([0, 10]);
|
||||
});
|
||||
it('nudges top-right corner', function() {
|
||||
expect(iD.geoViewportEdge([995, 5], dimensions)).to.eql([-10, 10]);
|
||||
});
|
||||
it('nudges right edge', function() {
|
||||
expect(iD.geoViewportEdge([995, 500], dimensions)).to.eql([-10, 0]);
|
||||
});
|
||||
it('nudges bottom-right corner', function() {
|
||||
expect(iD.geoViewportEdge([995, 995], dimensions)).to.eql([-10, -10]);
|
||||
});
|
||||
it('nudges bottom edge', function() {
|
||||
expect(iD.geoViewportEdge([500, 995], dimensions)).to.eql([0, -10]);
|
||||
});
|
||||
it('nudges bottom-left corner', function() {
|
||||
expect(iD.geoViewportEdge([5, 995], dimensions)).to.eql([10, -10]);
|
||||
});
|
||||
it('nudges left edge', function() {
|
||||
expect(iD.geoViewportEdge([5, 500], dimensions)).to.eql([10, 0]);
|
||||
});
|
||||
it('nudges top-left corner', function() {
|
||||
expect(iD.geoViewportEdge([5, 5], dimensions)).to.eql([10, 10]);
|
||||
});
|
||||
});
|
||||
|
||||
});
|
||||
|
||||
@@ -0,0 +1,297 @@
|
||||
describe('iD.geo - geometry', function() {
|
||||
|
||||
describe('geoAngle', function() {
|
||||
it('returns angle between a and b', function() {
|
||||
var projection = function (_) { return _; };
|
||||
expect(iD.geoAngle({loc:[0, 0]}, {loc:[1, 0]}, projection)).to.be.closeTo(0, 1e-6);
|
||||
expect(iD.geoAngle({loc:[0, 0]}, {loc:[0, 1]}, projection)).to.be.closeTo(Math.PI / 2, 1e-6);
|
||||
expect(iD.geoAngle({loc:[0, 0]}, {loc:[-1, 0]}, projection)).to.be.closeTo(Math.PI, 1e-6);
|
||||
expect(iD.geoAngle({loc:[0, 0]}, {loc:[0, -1]}, projection)).to.be.closeTo(-Math.PI / 2, 1e-6);
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoEdgeEqual', function() {
|
||||
it('returns false for inequal edges', function() {
|
||||
expect(iD.geoEdgeEqual(['a', 'b'], ['a', 'c'])).to.be.false;
|
||||
});
|
||||
|
||||
it('returns true for equal edges along same direction', function() {
|
||||
expect(iD.geoEdgeEqual(['a', 'b'], ['a', 'b'])).to.be.true;
|
||||
});
|
||||
|
||||
it('returns true for equal edges along opposite direction', function() {
|
||||
expect(iD.geoEdgeEqual(['a', 'b'], ['b', 'a'])).to.be.true;
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoRotate', function() {
|
||||
it('rotates points around [0, 0]', function() {
|
||||
var points = [[5, 0], [5, 1]];
|
||||
var angle = Math.PI;
|
||||
var around = [0, 0];
|
||||
var result = iD.geoRotate(points, angle, around);
|
||||
expect(result[0][0]).to.be.closeTo(-5, 1e-6);
|
||||
expect(result[0][1]).to.be.closeTo(0, 1e-6);
|
||||
expect(result[1][0]).to.be.closeTo(-5, 1e-6);
|
||||
expect(result[1][1]).to.be.closeTo(-1, 1e-6);
|
||||
});
|
||||
|
||||
it('rotates points around [3, 0]', function() {
|
||||
var points = [[5, 0], [5, 1]];
|
||||
var angle = Math.PI;
|
||||
var around = [3, 0];
|
||||
var result = iD.geoRotate(points, angle, around);
|
||||
expect(result[0][0]).to.be.closeTo(1, 1e-6);
|
||||
expect(result[0][1]).to.be.closeTo(0, 1e-6);
|
||||
expect(result[1][0]).to.be.closeTo(1, 1e-6);
|
||||
expect(result[1][1]).to.be.closeTo(-1, 1e-6);
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoChooseEdge', function() {
|
||||
var projection = function (l) { return l; };
|
||||
projection.invert = projection;
|
||||
|
||||
it('returns null for a degenerate way (no nodes)', function() {
|
||||
expect(iD.geoChooseEdge([], [0, 0], projection)).to.be.null;
|
||||
});
|
||||
|
||||
it('returns null for a degenerate way (single node)', function() {
|
||||
expect(iD.geoChooseEdge([iD.osmNode({loc: [0, 0]})], [0, 0], projection)).to.be.null;
|
||||
});
|
||||
|
||||
it('calculates the orthogonal projection of a point onto a segment', function() {
|
||||
// a --*--- b
|
||||
// |
|
||||
// c
|
||||
//
|
||||
// * = [2, 0]
|
||||
var a = [0, 0];
|
||||
var b = [5, 0];
|
||||
var c = [2, 1];
|
||||
var nodes = [ iD.osmNode({loc: a}), iD.osmNode({loc: b}) ];
|
||||
var choice = iD.geoChooseEdge(nodes, c, projection);
|
||||
expect(choice.index).to.eql(1);
|
||||
expect(choice.distance).to.eql(1);
|
||||
expect(choice.loc).to.eql([2, 0]);
|
||||
});
|
||||
|
||||
it('returns the starting vertex when the orthogonal projection is < 0', function() {
|
||||
var a = [0, 0];
|
||||
var b = [5, 0];
|
||||
var c = [-3, 4];
|
||||
var nodes = [ iD.osmNode({loc: a}), iD.osmNode({loc: b}) ];
|
||||
var choice = iD.geoChooseEdge(nodes, c, projection);
|
||||
expect(choice.index).to.eql(1);
|
||||
expect(choice.distance).to.eql(5);
|
||||
expect(choice.loc).to.eql([0, 0]);
|
||||
});
|
||||
|
||||
it('returns the ending vertex when the orthogonal projection is > 1', function() {
|
||||
var a = [0, 0];
|
||||
var b = [5, 0];
|
||||
var c = [8, 4];
|
||||
var nodes = [ iD.osmNode({loc: a}), iD.osmNode({loc: b}) ];
|
||||
var choice = iD.geoChooseEdge(nodes, c, projection);
|
||||
expect(choice.index).to.eql(1);
|
||||
expect(choice.distance).to.eql(5);
|
||||
expect(choice.loc).to.eql([5, 0]);
|
||||
});
|
||||
|
||||
it('skips the given nodeID at end of way', function() {
|
||||
//
|
||||
// a --*-- b
|
||||
// e |
|
||||
// | |
|
||||
// d - c
|
||||
//
|
||||
// * = [2, 0]
|
||||
var a = [0, 0];
|
||||
var b = [5, 0];
|
||||
var c = [5, 5];
|
||||
var d = [2, 5];
|
||||
var e = [2, 0.1]; // e.g. user is dragging e onto ab
|
||||
var nodes = [
|
||||
iD.osmNode({id: 'a', loc: a}),
|
||||
iD.osmNode({id: 'b', loc: b}),
|
||||
iD.osmNode({id: 'c', loc: c}),
|
||||
iD.osmNode({id: 'd', loc: d}),
|
||||
iD.osmNode({id: 'e', loc: e})
|
||||
];
|
||||
var choice = iD.geoChooseEdge(nodes, e, projection, 'e');
|
||||
expect(choice.index).to.eql(1);
|
||||
expect(choice.distance).to.eql(0.1);
|
||||
expect(choice.loc).to.eql([2, 0]);
|
||||
});
|
||||
|
||||
it('skips the given nodeID in middle of way', function() {
|
||||
//
|
||||
// a --*-- b
|
||||
// d |
|
||||
// / \ |
|
||||
// e c
|
||||
//
|
||||
// * = [2, 0]
|
||||
var a = [0, 0];
|
||||
var b = [5, 0];
|
||||
var c = [5, 5];
|
||||
var d = [2, 0.1]; // e.g. user is dragging d onto ab
|
||||
var e = [0, 5];
|
||||
var nodes = [
|
||||
iD.osmNode({id: 'a', loc: a}),
|
||||
iD.osmNode({id: 'b', loc: b}),
|
||||
iD.osmNode({id: 'c', loc: c}),
|
||||
iD.osmNode({id: 'd', loc: d}),
|
||||
iD.osmNode({id: 'e', loc: e})
|
||||
];
|
||||
var choice = iD.geoChooseEdge(nodes, d, projection, 'd');
|
||||
expect(choice.index).to.eql(1);
|
||||
expect(choice.distance).to.eql(0.1);
|
||||
expect(choice.loc).to.eql([2, 0]);
|
||||
});
|
||||
|
||||
it('returns null if all nodes are skipped', function() {
|
||||
var nodes = [
|
||||
iD.osmNode({id: 'a', loc: [0, 0]}),
|
||||
iD.osmNode({id: 'b', loc: [5, 0]}),
|
||||
];
|
||||
var choice = iD.geoChooseEdge(nodes, [2, 2], projection, 'a');
|
||||
expect(choice).to.be.null;
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoLineIntersection', function() {
|
||||
it('returns null if lines are colinear with overlap', function() {
|
||||
var a = [[0, 0], [10, 0]];
|
||||
var b = [[-5, 0], [5, 0]];
|
||||
expect(iD.geoLineIntersection(a, b)).to.be.null;
|
||||
});
|
||||
it('returns null if lines are colinear but disjoint', function() {
|
||||
var a = [[5, 0], [10, 0]];
|
||||
var b = [[-10, 0], [-5, 0]];
|
||||
expect(iD.geoLineIntersection(a, b)).to.be.null;
|
||||
});
|
||||
it('returns null if lines are parallel', function() {
|
||||
var a = [[0, 0], [10, 0]];
|
||||
var b = [[0, 5], [10, 5]];
|
||||
expect(iD.geoLineIntersection(a, b)).to.be.null;
|
||||
});
|
||||
it('returns the intersection point between 2 lines', function() {
|
||||
var a = [[0, 0], [10, 0]];
|
||||
var b = [[5, 10], [5, -10]];
|
||||
expect(iD.geoLineIntersection(a, b)).to.eql([5, 0]);
|
||||
});
|
||||
it('returns null if lines are not parallel but not intersecting', function() {
|
||||
var a = [[0, 0], [10, 0]];
|
||||
var b = [[-5, 10], [-5, -10]];
|
||||
expect(iD.geoLineIntersection(a, b)).to.be.null;
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoPointInPolygon', function() {
|
||||
it('says a point in a polygon is on a polygon', function() {
|
||||
var poly = [[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]];
|
||||
var point = [0.5, 0.5];
|
||||
expect(iD.geoPointInPolygon(point, poly)).to.be.true;
|
||||
});
|
||||
it('says a point outside of a polygon is outside', function() {
|
||||
var poly = [[0, 0], [0, 1], [1, 1], [1, 0], [0, 0]];
|
||||
var point = [0.5, 1.5];
|
||||
expect(iD.geoPointInPolygon(point, poly)).to.be.false;
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoPolygonContainsPolygon', function() {
|
||||
it('says a polygon in a polygon is in', function() {
|
||||
var outer = [[0, 0], [0, 3], [3, 3], [3, 0], [0, 0]];
|
||||
var inner = [[1, 1], [1, 2], [2, 2], [2, 1], [1, 1]];
|
||||
expect(iD.geoPolygonContainsPolygon(outer, inner)).to.be.true;
|
||||
});
|
||||
it('says a polygon outside of a polygon is out', function() {
|
||||
var outer = [[0, 0], [0, 3], [3, 3], [3, 0], [0, 0]];
|
||||
var inner = [[1, 1], [1, 9], [2, 2], [2, 1], [1, 1]];
|
||||
expect(iD.geoPolygonContainsPolygon(outer, inner)).to.be.false;
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoPolygonIntersectsPolygon', function() {
|
||||
it('returns true when outer polygon fully contains inner', function() {
|
||||
var outer = [[0, 0], [0, 3], [3, 3], [3, 0], [0, 0]];
|
||||
var inner = [[1, 1], [1, 2], [2, 2], [2, 1], [1, 1]];
|
||||
expect(iD.geoPolygonIntersectsPolygon(outer, inner)).to.be.true;
|
||||
});
|
||||
|
||||
it('returns true when outer polygon partially contains inner (some vertices contained)', function() {
|
||||
var outer = [[0, 0], [0, 3], [3, 3], [3, 0], [0, 0]];
|
||||
var inner = [[-1, -1], [1, 2], [2, 2], [2, 1], [1, 1]];
|
||||
expect(iD.geoPolygonIntersectsPolygon(outer, inner)).to.be.true;
|
||||
});
|
||||
|
||||
it('returns false when outer polygon partially contains inner (no vertices contained - lax test)', function() {
|
||||
var outer = [[0, 0], [0, 3], [3, 3], [3, 0], [0, 0]];
|
||||
var inner = [[1, -1], [1, 4], [2, 4], [2, -1], [1, -1]];
|
||||
expect(iD.geoPolygonIntersectsPolygon(outer, inner)).to.be.false;
|
||||
});
|
||||
|
||||
it('returns true when outer polygon partially contains inner (no vertices contained - strict test)', function() {
|
||||
var outer = [[0, 0], [0, 3], [3, 3], [3, 0], [0, 0]];
|
||||
var inner = [[1, -1], [1, 4], [2, 4], [2, -1], [1, -1]];
|
||||
expect(iD.geoPolygonIntersectsPolygon(outer, inner, true)).to.be.true;
|
||||
});
|
||||
|
||||
it('returns false when outer and inner are fully disjoint', function() {
|
||||
var outer = [[0, 0], [0, 3], [3, 3], [3, 0], [0, 0]];
|
||||
var inner = [[-1, -1], [-1, -2], [-2, -2], [-2, -1], [-1, -1]];
|
||||
expect(iD.geoPolygonIntersectsPolygon(outer, inner)).to.be.false;
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoPathLength', function() {
|
||||
it('calculates a simple path length', function() {
|
||||
var path = [[0, 0], [0, 1], [3, 5]];
|
||||
expect(iD.geoPathLength(path)).to.eql(6);
|
||||
});
|
||||
|
||||
it('does not fail on single-point path', function() {
|
||||
var path = [[0, 0]];
|
||||
expect(iD.geoPathLength(path)).to.eql(0);
|
||||
});
|
||||
|
||||
it('estimates zero-length edges', function() {
|
||||
var path = [[0, 0], [0, 0]];
|
||||
expect(iD.geoPathLength(path)).to.eql(0);
|
||||
});
|
||||
});
|
||||
|
||||
describe('geoViewportEdge', function() {
|
||||
var dimensions = [1000, 1000];
|
||||
it('returns null if the point is not at the edge', function() {
|
||||
expect(iD.geoViewportEdge([500, 500], dimensions)).to.be.null;
|
||||
});
|
||||
it('nudges top edge', function() {
|
||||
expect(iD.geoViewportEdge([500, 5], dimensions)).to.eql([0, 10]);
|
||||
});
|
||||
it('nudges top-right corner', function() {
|
||||
expect(iD.geoViewportEdge([995, 5], dimensions)).to.eql([-10, 10]);
|
||||
});
|
||||
it('nudges right edge', function() {
|
||||
expect(iD.geoViewportEdge([995, 500], dimensions)).to.eql([-10, 0]);
|
||||
});
|
||||
it('nudges bottom-right corner', function() {
|
||||
expect(iD.geoViewportEdge([995, 995], dimensions)).to.eql([-10, -10]);
|
||||
});
|
||||
it('nudges bottom edge', function() {
|
||||
expect(iD.geoViewportEdge([500, 995], dimensions)).to.eql([0, -10]);
|
||||
});
|
||||
it('nudges bottom-left corner', function() {
|
||||
expect(iD.geoViewportEdge([5, 995], dimensions)).to.eql([10, -10]);
|
||||
});
|
||||
it('nudges left edge', function() {
|
||||
expect(iD.geoViewportEdge([5, 500], dimensions)).to.eql([10, 0]);
|
||||
});
|
||||
it('nudges top-left corner', function() {
|
||||
expect(iD.geoViewportEdge([5, 5], dimensions)).to.eql([10, 10]);
|
||||
});
|
||||
});
|
||||
|
||||
});
|
||||
@@ -1,4 +1,4 @@
|
||||
describe('iD.geo vector', function() {
|
||||
describe('iD.geo - vector', function() {
|
||||
|
||||
describe('geoVecEqual', function() {
|
||||
it('tests vectors for equality', function() {
|
||||
|
||||
Reference in New Issue
Block a user