Break circular dependency get_turns->disjoint->covered_by->within->get_turns
Added resolve_strategy stage for simplify.
Added resolve_strategy stage for simplify_insert.
Made simplify variant-aware
Fixed how resolve_strategy::simplify_insert is called from the public functions
Merge branch 'feature/variants' into develop
[geometry] added tests for intersects(Ls,Ls) for linestrings with colinear segments
Made touches (2 params version) variant aware.
Made touches (1 param version) variant aware.
Merge branch 'feature/variants' into develop
Added strategy resolution stage to transform algorithm.
Fixed test issue - the test was comparing out1 with itself rather than out2, and started failing when corrected because inappropriately implemented for CS transformations.
Split test_transform_linestring into test/check (in preparation to testing variants).
Change test_transform_point() to use check_transform().
Made transform variant-aware.
added new implementation for disjoint for the segment/linestring, segment/ring and segment/polygon combinations
implementation of the distance function for various geometry combinations
implementation of comprable distance that takes a strategy
commit of some of the files mentioned in the previous commit
Prototype implementation of a variation of Rabin's algorithm for closest pairs of points;
the implemented algorithm computes distances of two multi-points.
Run-time analysis not formally done, but the running time should be O((N+M)log(N+M)) expected,
where N and M are the sizes of the two multi-points.
Should be able to improve it to O(N+M) expected by using hashing.
commit of the main file related to the previous commit