54ff519466[stategies][distance] remove strategy::distance::services::strategy_point_point from distance strategies and distance strategy concept
Menelaos Karavelas
2014-05-09 23:02:39 +0300
5c5d42341c[test][distance] move unit test code from test/multi/algorithms/multi_distance.cpp to test/algorithms/distance.cpp; delete test/multi/algorithms/multi_distance.cpp;
Menelaos Karavelas
2014-05-09 22:25:45 +0300
5777fd5b8d[overlay] the specialization of intersection_insert for linestring/box computes the intersection, but pretends as if it works for difference as well; quick fix: further specialize this specialization of intersection insert so that it works only for overlay_intersection; problem and quick fix related to boost trac ticket #10019;
Menelaos Karavelas
2014-05-09 09:33:32 +0300
226dcc4e6c[comparable distance] fix comments so that they make sense wrt to the code they refer to
Menelaos Karavelas
2014-05-09 00:02:17 +0300
47c1cfe9b6[strategies][distance] re-implement the dfeault distance result using the default strategy from detail::distance::default_strategy
Menelaos Karavelas
2014-05-08 23:59:11 +0300
73858fc359[comparable distance] simplify the definition of the default comparable strategy using the class detail::distance::default_strategy
Menelaos Karavelas
2014-05-08 23:56:55 +0300
4598228ea0[distance] re-implement the default strategy type in free function distance(g1, g2); remove inclusion of unused headers;
Menelaos Karavelas
2014-05-08 23:50:28 +0300
cd77588326[strategies] implement default_comparable_distance_result class
Menelaos Karavelas
2014-05-08 23:48:38 +0300
06ebf17a8d[disjoint] add alternative (more robust) implementation of segment-box disjointness test; the alternative implementation does not use any divisions
Menelaos Karavelas
2014-05-08 22:24:01 +0300
1a2ef5c2bc[disjoint] add specializations for linestring/multilinestring, multilinestring/multilinestring; fixed specialization for polygon/multilinestring
Menelaos Karavelas
2014-05-08 16:39:09 +0300
23f8b97fac[index] include comparable_distance algorithm
Menelaos Karavelas
2014-05-08 15:59:15 +0300
8a7a14bc53[index] replace call to comparable_distance_near by bg::comparable_distance
Menelaos Karavelas
2014-05-08 15:52:53 +0300
203aa991ae[index] replace #include <boost/geomerty/geometry.hpp> by the necessary includes
Menelaos Karavelas
2014-05-08 15:46:25 +0300
9ea4b6bf6c[index] Add the support for std::pair<> and boost/std::tuple<> registered as Indexable
Adam Wulkiewicz
2014-05-08 14:42:45 +0200
d289118bd9[strategies] add the point-box and box-box pythagoras strategies in strategies/strategies.hpp
Menelaos Karavelas
2014-05-08 15:26:57 +0300
752de3060a[iterators] add free function has_one_element, that tests whether an iterator range has a unique element (has size 1)
Menelaos Karavelas
2014-05-08 15:15:16 +0300
b1eaf94bfe[strategies][distance] add a template parameter to default distance strategy corresponding to the second geometry of the distance strategy
Menelaos Karavelas
2014-05-08 15:12:59 +0300
55f63b77df[distance] update distance.hpp: primary dispatch is under algorithms/dispatch/, details are under algorithms/detail/distance/
Menelaos Karavelas
2014-05-08 15:10:24 +0300
0600a3419f[strategies][distance] add tags for point-box and box-box strategies
Menelaos Karavelas
2014-05-08 15:08:09 +0300
cfc4e7a3c9[multi][distance] move multi/algorithms distance code under algorithms/ keep the file as a placeholder and include algorithms/distance.hpp
Menelaos Karavelas
2014-05-08 15:06:19 +0300
ddc5ddf0ff[comparable distance] add free function for comparable distance that takes a strategy
Menelaos Karavelas
2014-05-08 15:04:23 +0300
8a23c01061[test][distance] add common code for distance unit tests
Menelaos Karavelas
2014-05-08 15:02:49 +0300
e783d7ca2e[distance] dispatches for various geometry combinations with the point-point strategy; the point-point strategy is not the natural distance strategy for these geometry pairs; the dispatches have been added for backward compatibility;
Menelaos Karavelas
2014-05-08 15:01:03 +0300
ab6588f9b2[distance] implementation for distance(multi-point,range)
Menelaos Karavelas
2014-05-08 15:00:07 +0300
8553124d37[distance] base cose for distance computations using the R-Tree
Menelaos Karavelas
2014-05-08 14:58:05 +0300
22142c9040[distance] add distance code for multi-to-multi geometry combinations and dispatch specializations; some of the code in this file originated from multi/algorithms/distance.hpp
Menelaos Karavelas
2014-05-08 14:52:13 +0300
6bac8b43a1[distance] add distance code for single-to-multi geometry combinations and dispatch specializations; some of the code in this file originated from multi/algorithms/distance.hpp
Menelaos Karavelas
2014-05-08 14:49:27 +0300
17d3f0e78e[strategies][distance] add class to convert a distance result from comparable to regular distance result if needed; add implementation of this for cartesian coordinates (applies sqrt);
Menelaos Karavelas
2014-05-08 14:47:19 +0300
f9825be6bf[distance] add implementation of distance(point, geometry); most of the origina code was in algorithms/distance.hpp; the point-box combination was added; point_to_range takes only one strategy now; all intermediate distance computations done with comaprable distances (conversion happens at the end);
Menelaos Karavelas
2014-05-08 14:43:38 +0300
02bc0d908d[doc] updated the implementation_status tool to support centroid/envelope better and added some relation status. clang is now default
Barend Gehrels
2014-05-07 20:53:37 +0200
26038367b3[doc] Added implementation_status for crosses, intersects. Updated status for disjoint, overlaps, intersects
Barend Gehrels
2014-05-07 20:52:33 +0200
1aecbae980[doc] updated within/covered_by status status
Barend Gehrels
2014-05-07 15:42:16 +0200
a8b4f324ac[doc] Changes in implementation_status tool. For debug have full caseid and save the cpp file. Added clang (for speed) with pre-compiled headers. Do not surpress empty rows automatically (it was not the case in current docs) Swap row/column (it was already the case for within) Bugfix in box WKT, runtime
Barend Gehrels
2014-05-07 15:35:13 +0200
899c94b148Merge branch 'develop' of github.com:boostorg/geometry into develop
Barend Gehrels
2014-05-07 13:15:22 +0200
e0d71fbc5e[doc] Moved status files to reference/status instead of generated. They are generated but not from Doxygen, and are committed to git
Barend Gehrels
2014-05-07 13:13:56 +0200
6407199617Merge pull request #21 from mkaravel/feature/point_iterator
Adam Wulkiewicz
2014-05-07 11:57:20 +0200
22f3c65b5d[doc] Added doc for parameters Doxygen was missing
Barend Gehrels
2014-05-07 11:40:57 +0200
51c601bb49[point_iterator_type] replace #include of type traits by the specific one used (is_const)
Menelaos Karavelas
2014-05-06 22:02:26 +0300
50f975cd89[test][iterators] replace #include of type traits by the specific one used (is_const)
Menelaos Karavelas
2014-05-06 22:00:05 +0300
793a6321c6[copy segments] replace generic #include of type traits by the specific one used (integral_constant)
Menelaos Karavelas
2014-05-06 21:51:15 +0300
8eefe4d3ba[equals] Add missing copyright info
Adam Wulkiewicz
2014-05-06 19:00:28 +0200
321d12c56a[test][set ops L/L] add two more test cases with spikes (examples sent by Adam on the BG mailing list)
Menelaos Karavelas
2014-05-05 14:45:26 +0300
826045c3a1[set ops L/L] remove commented code in assign_policy; add template parameter to control the behavior of intersection wrt whether isolated points are followed or not;
Menelaos Karavelas
2014-05-05 12:10:20 +0300
606295db4a[test][set ops L/L] add more test cases for difference and intersection of linear geometries; the geometries in these test cases have spikes
Menelaos Karavelas
2014-05-05 12:08:36 +0300
cd1d490d2e[point_iterator] add free functions points_front and points_back that return the first and last point of a geometry
Menelaos Karavelas
2014-05-05 09:50:04 +0300
454ece176a[test][point iterator] re-factor test code; add tests for points_front, points_back, points_reverse_iterator; test point_iterator as bidirectional iterator
Menelaos Karavelas
2014-05-05 09:48:49 +0300
5a5d916985[test][iterators] re-factor test code for flatten and concatenate iterators
Menelaos Karavelas
2014-05-05 09:47:28 +0300
aea578c602[get_turns] Fix turn operation is_collinear values for L/L and L/A.
Adam Wulkiewicz
2014-05-04 22:31:13 +0200
e6ef0b0328[get_turns] Use RobustPolicy in a unified way in all three get_turn_info* policies (A/A, L/A, and L/L).
Adam Wulkiewicz
2014-05-04 01:26:12 +0200
7b2a4cb589[intersection] fix segments_intersection_ratios adding the new one_degenerate method
Barend Gehrels
2014-05-03 14:41:33 +0200
47d581304e[relate][test] Enable tests for 2-Point degenerated Linestrings
Adam Wulkiewicz
2014-05-03 13:57:08 +0200
8775e65b20[get_turns] Add tests for t-spikes vs collinear internal pt for L/L
Adam Wulkiewicz
2014-05-03 04:11:22 +0200
7192e6cbf6[get_turns] Add more tests for t-spikes for L/L
Adam Wulkiewicz
2014-05-03 04:02:44 +0200
6abe245eb7[get_turns] Fix invalid condition get_turn_info_la
Adam Wulkiewicz
2014-05-03 02:47:58 +0200
d4d7bf9657[get_turns] Fix the generation of some special cases of touch-spike-turns for L/L and L/A
Adam Wulkiewicz
2014-05-03 02:40:21 +0200
6fd158cf90[concatenate iterator] re-factor unit test; add tests for bidirectional iterators;
Menelaos Karavelas
2014-05-02 13:29:06 +0300
93c5c4a329Merge branch 'develop' of github.com:boostorg/geometry into develop
Adam Wulkiewicz
2014-05-01 12:38:07 +0200
288c7e6980[get_turns] Fix for L/L spike vs. endpoint for the same direction segments. Add failing test cases for spikes touching internal point
Adam Wulkiewicz
2014-05-01 12:37:54 +0200
5a2993d30f[concatenate_iterator] make the iterator bidirectional
Menelaos Karavelas
2014-05-01 01:37:35 +0300
7d2d0d9169[is_valid] remove code for rings (moved to detail/is_valid/ring.hpp
Menelaos Karavelas
2014-04-30 22:26:44 +0300
6e384c3c5e[is_valid] file for is_valid ring implementation (on-going)
Menelaos Karavelas
2014-04-30 22:25:32 +0300
a61be76a19[is_valid] file for polygon is_valid implementation (no code yet)
Menelaos Karavelas
2014-04-30 22:25:10 +0300
178696d511[is_valid] rename {not_}equal_point to {not_}equal_to and use point as the outer template parameter object instead of iterator
Menelaos Karavelas
2014-04-30 22:22:01 +0300
Menelaos Karavelas