mirror of
https://github.com/boostorg/geometry.git
synced 2026-02-13 12:32:09 +00:00
1033 lines
83 KiB
HTML
1033 lines
83 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
||
<html>
|
||
<head>
|
||
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
|
||
<title>Boost.Geometry (aka GGL, Generic Geometry Library)</title>
|
||
<link href="doxygen.css" rel="stylesheet" type="text/css">
|
||
<link href="tabs.css" rel="stylesheet" type="text/css">
|
||
</head>
|
||
|
||
<table cellpadding="2" width="100%">
|
||
<tbody>
|
||
<tr>
|
||
<td valign="top">
|
||
<img alt="Boost.Geometry" src="images/ggl-logo-big.png" height="80" width="200">
|
||
|
||
</td>
|
||
<td valign="top" align="right">
|
||
<a href="http://www.boost.org">
|
||
<img alt="Boost C++ Libraries" src="images/accepted_by_boost.png" height="80" width="230" border="0">
|
||
</a>
|
||
</td>
|
||
</tr>
|
||
</tbody>
|
||
</table>
|
||
<!-- Generated by Doxygen 1.5.9 -->
|
||
<div class="navigation" id="top">
|
||
<div class="tabs">
|
||
<ul>
|
||
<li><a href="index.html"><span>Main Page</span></a></li>
|
||
<li><a href="pages.html"><span>Related Pages</span></a></li>
|
||
<li><a href="modules.html"><span>Modules</span></a></li>
|
||
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
||
<li><a href="annotated.html"><span>Classes</span></a></li>
|
||
<li class="current"><a href="files.html"><span>Files</span></a></li>
|
||
<li><a href="examples.html"><span>Examples</span></a></li>
|
||
</ul>
|
||
</div>
|
||
<div class="tabs">
|
||
<ul>
|
||
<li><a href="files.html"><span>File List</span></a></li>
|
||
<li><a href="globals.html"><span>File Members</span></a></li>
|
||
</ul>
|
||
</div>
|
||
<h1>boost/geometry/algorithms/overlay/get_intersection_points.hpp</h1><a href="get__intersection__points_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// Boost.Geometry (aka GGL, Generic Geometry Library)</span>
|
||
<a name="l00002"></a>00002 <span class="comment">//</span>
|
||
<a name="l00003"></a>00003 <span class="comment">// Copyright Barend Gehrels 2007-2009, Geodan, Amsterdam, the Netherlands.</span>
|
||
<a name="l00004"></a>00004 <span class="comment">// Copyright Bruno Lalande 2008, 2009</span>
|
||
<a name="l00005"></a>00005 <span class="comment">// Use, modification and distribution is subject to the Boost Software License,</span>
|
||
<a name="l00006"></a>00006 <span class="comment">// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at</span>
|
||
<a name="l00007"></a>00007 <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span>
|
||
<a name="l00008"></a>00008
|
||
<a name="l00009"></a>00009 <span class="preprocessor">#ifndef BOOST_GEOMETRY_ALGORITHMS_OVERLAY_GET_INTERSECTION_POINTS_HPP</span>
|
||
<a name="l00010"></a>00010 <span class="preprocessor"></span><span class="preprocessor">#define BOOST_GEOMETRY_ALGORITHMS_OVERLAY_GET_INTERSECTION_POINTS_HPP</span>
|
||
<a name="l00011"></a>00011 <span class="preprocessor"></span>
|
||
<a name="l00017"></a>00017 <span class="preprocessor">#include <cstddef></span>
|
||
<a name="l00018"></a>00018 <span class="preprocessor">#include <map></span>
|
||
<a name="l00019"></a>00019
|
||
<a name="l00020"></a>00020 <span class="preprocessor">#include <boost/mpl/if.hpp></span>
|
||
<a name="l00021"></a>00021 <span class="preprocessor">#include <boost/range/functions.hpp></span>
|
||
<a name="l00022"></a>00022 <span class="preprocessor">#include <boost/range/metafunctions.hpp></span>
|
||
<a name="l00023"></a>00023 <span class="preprocessor">#include <boost/tuple/tuple.hpp></span>
|
||
<a name="l00024"></a>00024 <span class="preprocessor">#include <boost/type_traits/remove_const.hpp></span>
|
||
<a name="l00025"></a>00025
|
||
<a name="l00026"></a>00026 <span class="preprocessor">#include <<a class="code" href="access_8hpp.html">boost/geometry/core/access.hpp</a>></span>
|
||
<a name="l00027"></a>00027 <span class="preprocessor">#include <<a class="code" href="coordinate__dimension_8hpp.html">boost/geometry/core/coordinate_dimension.hpp</a>></span>
|
||
<a name="l00028"></a>00028 <span class="preprocessor">#include <<a class="code" href="core_2is__multi_8hpp.html">boost/geometry/core/is_multi.hpp</a>></span>
|
||
<a name="l00029"></a>00029 <span class="preprocessor">#include <<a class="code" href="reverse__dispatch_8hpp.html">boost/geometry/core/reverse_dispatch.hpp</a>></span>
|
||
<a name="l00030"></a>00030
|
||
<a name="l00031"></a>00031 <span class="preprocessor">#include <<a class="code" href="exterior__ring_8hpp.html">boost/geometry/core/exterior_ring.hpp</a>></span>
|
||
<a name="l00032"></a>00032 <span class="preprocessor">#include <<a class="code" href="interior__rings_8hpp.html">boost/geometry/core/interior_rings.hpp</a>></span>
|
||
<a name="l00033"></a>00033 <span class="preprocessor">#include <<a class="code" href="core_2ring__type_8hpp.html">boost/geometry/core/ring_type.hpp</a>></span>
|
||
<a name="l00034"></a>00034
|
||
<a name="l00035"></a>00035 <span class="preprocessor">#include <<a class="code" href="geometries_2concepts_2check_8hpp.html">boost/geometry/geometries/concepts/check.hpp</a>></span>
|
||
<a name="l00036"></a>00036
|
||
<a name="l00037"></a>00037 <span class="preprocessor">#include <<a class="code" href="math_8hpp.html">boost/geometry/util/math.hpp</a>></span>
|
||
<a name="l00038"></a>00038
|
||
<a name="l00039"></a>00039 <span class="preprocessor">#include <<a class="code" href="box_8hpp.html">boost/geometry/geometries/box.hpp</a>></span>
|
||
<a name="l00040"></a>00040
|
||
<a name="l00041"></a>00041 <span class="preprocessor">#include <<a class="code" href="iterators_2range__type_8hpp.html">boost/geometry/iterators/range_type.hpp</a>></span>
|
||
<a name="l00042"></a>00042
|
||
<a name="l00043"></a>00043 <span class="preprocessor">#include <boost/geometry/strategies/cartesian/cart_intersect.hpp></span>
|
||
<a name="l00044"></a>00044 <span class="preprocessor">#include <<a class="code" href="strategies_2intersection_8hpp.html">boost/geometry/strategies/intersection.hpp</a>></span>
|
||
<a name="l00045"></a>00045 <span class="preprocessor">#include <<a class="code" href="intersection__result_8hpp.html">boost/geometry/strategies/intersection_result.hpp</a>></span>
|
||
<a name="l00046"></a>00046
|
||
<a name="l00047"></a>00047
|
||
<a name="l00048"></a>00048 <span class="preprocessor">#include <<a class="code" href="intersection__point_8hpp.html">boost/geometry/algorithms/overlay/intersection_point.hpp</a>></span>
|
||
<a name="l00049"></a>00049
|
||
<a name="l00050"></a>00050 <span class="preprocessor">#include <<a class="code" href="detail_2disjoint_8hpp.html">boost/geometry/algorithms/detail/disjoint.hpp</a>></span>
|
||
<a name="l00051"></a>00051
|
||
<a name="l00052"></a>00052 <span class="preprocessor">#include <<a class="code" href="combine_8hpp.html">boost/geometry/algorithms/combine.hpp</a>></span>
|
||
<a name="l00053"></a>00053 <span class="preprocessor">#include <<a class="code" href="algorithms_2distance_8hpp.html">boost/geometry/algorithms/distance.hpp</a>></span>
|
||
<a name="l00054"></a>00054 <span class="preprocessor">#include <<a class="code" href="algorithms_2sectionalize_8hpp.html">boost/geometry/algorithms/sectionalize.hpp</a>></span>
|
||
<a name="l00055"></a>00055 <span class="preprocessor">#include <<a class="code" href="algorithms_2get__section_8hpp.html">boost/geometry/algorithms/get_section.hpp</a>></span>
|
||
<a name="l00056"></a>00056 <span class="preprocessor">#include <<a class="code" href="algorithms_2within_8hpp.html">boost/geometry/algorithms/within.hpp</a>></span>
|
||
<a name="l00057"></a>00057
|
||
<a name="l00058"></a>00058 <span class="preprocessor">#ifdef BOOST_GEOMETRY_DEBUG_INTERSECTION</span>
|
||
<a name="l00059"></a>00059 <span class="preprocessor"></span><span class="preprocessor"># include <sstream></span>
|
||
<a name="l00060"></a>00060 <span class="preprocessor"># include <<a class="code" href="write__dsv_8hpp.html">boost/geometry/util/write_dsv.hpp</a>></span>
|
||
<a name="l00061"></a>00061 <span class="preprocessor">#endif</span>
|
||
<a name="l00062"></a>00062 <span class="preprocessor"></span>
|
||
<a name="l00063"></a>00063
|
||
<a name="l00064"></a>00064 <span class="keyword">namespace </span>boost { <span class="keyword">namespace </span>geometry
|
||
<a name="l00065"></a>00065 {
|
||
<a name="l00066"></a>00066
|
||
<a name="l00067"></a>00067
|
||
<a name="l00068"></a>00068 <span class="preprocessor">#ifndef DOXYGEN_NO_DETAIL</span>
|
||
<a name="l00069"></a>00069 <span class="preprocessor"></span><span class="keyword">namespace </span>detail { <span class="keyword">namespace </span><a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">get_intersection_points</a> {
|
||
<a name="l00070"></a>00070
|
||
<a name="l00071"></a>00071
|
||
<a name="l00072"></a>00072 <span class="keyword">template</span>
|
||
<a name="l00073"></a>00073 <
|
||
<a name="l00074"></a>00074 <span class="keyword">typename</span> Segment1,
|
||
<a name="l00075"></a>00075 <span class="keyword">typename</span> Segment2,
|
||
<a name="l00076"></a>00076 <span class="keyword">typename</span> IntersectionPoints,
|
||
<a name="l00077"></a>00077 <span class="keyword">typename</span> IntersectionStrategy
|
||
<a name="l00078"></a>00078 >
|
||
<a name="l00079"></a>00079 <span class="keyword">struct </span>relate
|
||
<a name="l00080"></a>00080 {
|
||
<a name="l00081"></a>00081 <span class="keyword">private</span> :
|
||
<a name="l00082"></a>00082 <span class="keyword">template</span> <<span class="keyword">typename</span> Segment, <span class="keyword">typename</span> Po<span class="keywordtype">int</span>>
|
||
<a name="l00083"></a>00083 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> copy_point(<span class="keywordtype">int</span> how, Segment <span class="keyword">const</span>& segment, Point& point)
|
||
<a name="l00084"></a>00084 {
|
||
<a name="l00085"></a>00085 <span class="keywordflow">if</span> (how == 1)
|
||
<a name="l00086"></a>00086 {
|
||
<a name="l00087"></a>00087 <span class="comment">// Arrival</span>
|
||
<a name="l00088"></a>00088 <a class="code" href="namespaceboost_1_1geometry.html#ff15abe2a4412c1913d5c4d5875f45f7" title="Copies coordinates from source to destination point.">geometry::copy_coordinates</a>(segment.first, point);
|
||
<a name="l00089"></a>00089 }
|
||
<a name="l00090"></a>00090 <span class="keywordflow">else</span>
|
||
<a name="l00091"></a>00091 {
|
||
<a name="l00092"></a>00092 <span class="comment">// Departure</span>
|
||
<a name="l00093"></a>00093 <a class="code" href="namespaceboost_1_1geometry.html#ff15abe2a4412c1913d5c4d5875f45f7" title="Copies coordinates from source to destination point.">geometry::copy_coordinates</a>(segment.second, point);
|
||
<a name="l00094"></a>00094 }
|
||
<a name="l00095"></a>00095 }
|
||
<a name="l00096"></a>00096
|
||
<a name="l00097"></a>00097 <span class="keyword">template</span> <<span class="keyword">typename</span> Info, <span class="keyword">typename</span> IntersectionPo<span class="keywordtype">int</span>, <span class="keyword">typename</span> Direction, <span class="keyword">typename</span> Segment>
|
||
<a name="l00098"></a>00098 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> process_one(
|
||
<a name="l00099"></a>00099 Info& info,
|
||
<a name="l00100"></a>00100 IntersectionPoint <span class="keyword">const</span>& ipoint,
|
||
<a name="l00101"></a>00101 Segment <span class="keyword">const</span>& segment,
|
||
<a name="l00102"></a>00102 segment_identifier <span class="keyword">const</span>& seg_id_first,
|
||
<a name="l00103"></a>00103 segment_identifier <span class="keyword">const</span>& seg_id_second,
|
||
<a name="l00104"></a>00104 Direction <span class="keyword">const</span>& dir, <span class="keywordtype">int</span> arrival, <span class="keywordtype">int</span> direction, <span class="keywordtype">bool</span> reverse)
|
||
<a name="l00105"></a>00105 {
|
||
<a name="l00106"></a>00106 info.how = dir.how;
|
||
<a name="l00107"></a>00107 info.opposite = dir.opposite;
|
||
<a name="l00108"></a>00108
|
||
<a name="l00109"></a>00109 info.seg_id = seg_id_first;
|
||
<a name="l00110"></a>00110 info.other_id = seg_id_second;
|
||
<a name="l00111"></a>00111 copy_point(arrival, segment, info.other_point);
|
||
<a name="l00112"></a>00112
|
||
<a name="l00113"></a>00113 info.distance = <a class="code" href="group__distance.html#g8fb8022d64a75b24c80a64ba46ec4738" title="Calculate distance between two geometries with a specified strategy.">geometry::distance</a>(ipoint, segment.first);
|
||
<a name="l00114"></a>00114
|
||
<a name="l00115"></a>00115 info.arrival = arrival;
|
||
<a name="l00116"></a>00116 info.direction = direction;
|
||
<a name="l00117"></a>00117 info.sides = dir.sides;
|
||
<a name="l00118"></a>00118
|
||
<a name="l00119"></a>00119 <span class="comment">// Seen from B, the first one is B, the second one is A</span>
|
||
<a name="l00120"></a>00120 <span class="keywordflow">if</span> (reverse)
|
||
<a name="l00121"></a>00121 {
|
||
<a name="l00122"></a>00122 info.sides.reverse();
|
||
<a name="l00123"></a>00123 }
|
||
<a name="l00124"></a>00124 }
|
||
<a name="l00125"></a>00125
|
||
<a name="l00126"></a>00126
|
||
<a name="l00127"></a>00127 <span class="keyword">template</span> <<span class="keyword">typename</span> IntersectionPo<span class="keywordtype">int</span>, <span class="keyword">typename</span> Direction>
|
||
<a name="l00128"></a>00128 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> process(IntersectionPoint& ipoint,
|
||
<a name="l00129"></a>00129 Direction <span class="keyword">const</span>& dir,
|
||
<a name="l00130"></a>00130 Segment1 <span class="keyword">const</span>& s1, Segment2 <span class="keyword">const</span>& s2,
|
||
<a name="l00131"></a>00131 segment_identifier <span class="keyword">const</span>& seg_id1,
|
||
<a name="l00132"></a>00132 segment_identifier <span class="keyword">const</span>& seg_id2,
|
||
<a name="l00133"></a>00133 IntersectionPoints& out, <span class="keywordtype">bool</span>& trivial)
|
||
<a name="l00134"></a>00134 {
|
||
<a name="l00135"></a>00135 <span class="keyword">typedef</span> <span class="keyword">typename</span> boost::range_value
|
||
<a name="l00136"></a>00136 <
|
||
<a name="l00137"></a>00137 IntersectionPoints
|
||
<a name="l00138"></a>00138 >::type intersection_point;
|
||
<a name="l00139"></a>00139
|
||
<a name="l00140"></a>00140 <span class="keyword">typename</span> intersection_point::traversal_type info;
|
||
<a name="l00141"></a>00141
|
||
<a name="l00142"></a>00142 ipoint.info.resize(ipoint.info.size() + 1);
|
||
<a name="l00143"></a>00143 process_one(ipoint.info.back(), ipoint,
|
||
<a name="l00144"></a>00144 s1, seg_id1, seg_id2,
|
||
<a name="l00145"></a>00145 dir, dir.how_a, dir.dir_a, <span class="keyword">false</span>);
|
||
<a name="l00146"></a>00146
|
||
<a name="l00147"></a>00147 ipoint.info.resize(ipoint.info.size() + 1);
|
||
<a name="l00148"></a>00148 process_one(ipoint.info.back(), ipoint,
|
||
<a name="l00149"></a>00149 s2, seg_id2, seg_id1,
|
||
<a name="l00150"></a>00150 dir, dir.how_b, dir.dir_b, <span class="keyword">true</span>);
|
||
<a name="l00151"></a>00151
|
||
<a name="l00152"></a>00152
|
||
<a name="l00153"></a>00153 <span class="keywordflow">if</span> (dir.how != <span class="charliteral">'i'</span>)
|
||
<a name="l00154"></a>00154 {
|
||
<a name="l00155"></a>00155 trivial = <span class="keyword">false</span>;
|
||
<a name="l00156"></a>00156 ipoint.trivial = <span class="keyword">false</span>;
|
||
<a name="l00157"></a>00157 }
|
||
<a name="l00158"></a>00158
|
||
<a name="l00159"></a>00159 out.push_back(ipoint);
|
||
<a name="l00160"></a>00160 }
|
||
<a name="l00161"></a>00161
|
||
<a name="l00162"></a>00162
|
||
<a name="l00163"></a>00163
|
||
<a name="l00164"></a>00164 <span class="keyword">public</span> :
|
||
<a name="l00165"></a>00165 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> apply(Segment1 <span class="keyword">const</span>& s1, Segment2 <span class="keyword">const</span>& s2,
|
||
<a name="l00166"></a>00166 segment_identifier <span class="keyword">const</span>& seg_id1,
|
||
<a name="l00167"></a>00167 segment_identifier <span class="keyword">const</span>& seg_id2,
|
||
<a name="l00168"></a>00168 IntersectionPoints& out, <span class="keywordtype">bool</span>& trivial)
|
||
<a name="l00169"></a>00169 {
|
||
<a name="l00170"></a>00170 <span class="keyword">typename</span> IntersectionStrategy::return_type result
|
||
<a name="l00171"></a>00171 = IntersectionStrategy::apply(s1, s2);
|
||
<a name="l00172"></a>00172
|
||
<a name="l00173"></a>00173 <span class="keywordflow">for</span> (std::size_t i = 0; i < result.get<0>().count; i++)
|
||
<a name="l00174"></a>00174 {
|
||
<a name="l00175"></a>00175 process(
|
||
<a name="l00176"></a>00176 <span class="comment">// Process the tupled result value</span>
|
||
<a name="l00177"></a>00177 result.get<0>().intersections[i],
|
||
<a name="l00178"></a>00178 result.get<1>(),
|
||
<a name="l00179"></a>00179 s1, s2, seg_id1, seg_id2,
|
||
<a name="l00180"></a>00180 out, trivial);
|
||
<a name="l00181"></a>00181 }
|
||
<a name="l00182"></a>00182 <span class="keywordflow">return</span> result.get<0>().count > 0;
|
||
<a name="l00183"></a>00183 }
|
||
<a name="l00184"></a>00184 };
|
||
<a name="l00185"></a>00185
|
||
<a name="l00186"></a>00186 <span class="keyword">template</span>
|
||
<a name="l00187"></a>00187 <
|
||
<a name="l00188"></a>00188 <span class="keyword">typename</span> Geometry1, <span class="keyword">typename</span> Geometry2,
|
||
<a name="l00189"></a>00189 <span class="keyword">typename</span> Section1, <span class="keyword">typename</span> Section2,
|
||
<a name="l00190"></a>00190 <span class="keyword">typename</span> IntersectionPoints,
|
||
<a name="l00191"></a>00191 <span class="keyword">typename</span> IntersectionStrategy
|
||
<a name="l00192"></a>00192 >
|
||
<a name="l00193"></a>00193 <span class="keyword">class </span>get_ips_in_sections
|
||
<a name="l00194"></a>00194 {
|
||
<a name="l00195"></a>00195 <span class="keyword">public</span> :
|
||
<a name="l00196"></a>00196 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(
|
||
<a name="l00197"></a>00197 std::size_t source_id1, Geometry1 <span class="keyword">const</span>& geometry1,
|
||
<a name="l00198"></a>00198 Section1 <span class="keyword">const</span>& sec1,
|
||
<a name="l00199"></a>00199 std::size_t source_id2, Geometry2 <span class="keyword">const</span>& geometry2,
|
||
<a name="l00200"></a>00200 Section2 <span class="keyword">const</span>& sec2,
|
||
<a name="l00201"></a>00201 <span class="keywordtype">bool</span> return_if_found,
|
||
<a name="l00202"></a>00202 IntersectionPoints& intersection_points,
|
||
<a name="l00203"></a>00203 <span class="keywordtype">bool</span>& trivial)
|
||
<a name="l00204"></a>00204 {
|
||
<a name="l00205"></a>00205
|
||
<a name="l00206"></a>00206 <span class="keyword">typedef</span> <span class="keyword">typename</span> boost::range_const_iterator
|
||
<a name="l00207"></a>00207 <
|
||
<a name="l00208"></a>00208 <span class="keyword">typename</span> geometry::range_type<Geometry1>::type
|
||
<a name="l00209"></a>00209 >::type range1_iterator;
|
||
<a name="l00210"></a>00210 <span class="keyword">typedef</span> <span class="keyword">typename</span> boost::range_const_iterator
|
||
<a name="l00211"></a>00211 <
|
||
<a name="l00212"></a>00212 <span class="keyword">typename</span> geometry::range_type<Geometry2>::type
|
||
<a name="l00213"></a>00213 >::type range2_iterator;
|
||
<a name="l00214"></a>00214
|
||
<a name="l00215"></a>00215 <span class="keywordtype">int</span> <span class="keyword">const</span> dir1 = sec1.directions[0];
|
||
<a name="l00216"></a>00216 <span class="keywordtype">int</span> <span class="keyword">const</span> dir2 = sec2.directions[0];
|
||
<a name="l00217"></a>00217 <span class="keywordtype">int</span> index1 = sec1.begin_index;
|
||
<a name="l00218"></a>00218 <span class="keywordtype">int</span> ndi1 = sec1.non_duplicate_index;
|
||
<a name="l00219"></a>00219
|
||
<a name="l00220"></a>00220 <span class="keywordtype">bool</span> <span class="keyword">const</span> same_source =
|
||
<a name="l00221"></a>00221 source_id1 == source_id2
|
||
<a name="l00222"></a>00222 && sec1.multi_index == sec2.multi_index
|
||
<a name="l00223"></a>00223 && sec1.ring_index == sec2.ring_index;
|
||
<a name="l00224"></a>00224
|
||
<a name="l00225"></a>00225 <span class="comment">// Note that it is NOT possible to have section-iterators here</span>
|
||
<a name="l00226"></a>00226 <span class="comment">// because of the logistics of "index" (the section-iterator automatically</span>
|
||
<a name="l00227"></a>00227 <span class="comment">// skips to the begin-point, we loose the index or have to recalculate it)</span>
|
||
<a name="l00228"></a>00228 <span class="comment">// So we mimic it here</span>
|
||
<a name="l00229"></a>00229 range1_iterator it1, end1;
|
||
<a name="l00230"></a>00230 <a class="code" href="group__sectionalize.html#g52c60c1ff168e4e37ec1357a45d2cfa2" title="Get iterators for a specified section.">get_section</a>(geometry1, sec1, it1, end1);
|
||
<a name="l00231"></a>00231
|
||
<a name="l00232"></a>00232 <span class="comment">// Mimic 1: Skip to point such that section interects other box</span>
|
||
<a name="l00233"></a>00233 range1_iterator prev1 = it1++;
|
||
<a name="l00234"></a>00234 <span class="keywordflow">for</span>(; it1 != end1 && preceding<0>(dir1, *it1, sec2.bounding_box);
|
||
<a name="l00235"></a>00235 prev1 = it1++, index1++, ndi1++)
|
||
<a name="l00236"></a>00236 {
|
||
<a name="l00237"></a>00237 }
|
||
<a name="l00238"></a>00238 <span class="comment">// Go back one step because we want to start completely preceding</span>
|
||
<a name="l00239"></a>00239 it1 = prev1;
|
||
<a name="l00240"></a>00240
|
||
<a name="l00241"></a>00241 <span class="comment">// Walk through section and stop if we exceed the other box</span>
|
||
<a name="l00242"></a>00242 <span class="keywordflow">for</span> (prev1 = it1++;
|
||
<a name="l00243"></a>00243 it1 != end1 && ! exceeding<0>(dir1, *prev1, sec2.bounding_box);
|
||
<a name="l00244"></a>00244 prev1 = it1++, index1++, ndi1++)
|
||
<a name="l00245"></a>00245 {
|
||
<a name="l00246"></a>00246 segment1_type s1(*prev1, *it1);
|
||
<a name="l00247"></a>00247
|
||
<a name="l00248"></a>00248 <span class="keywordtype">int</span> index2 = sec2.begin_index;
|
||
<a name="l00249"></a>00249 <span class="keywordtype">int</span> ndi2 = sec2.non_duplicate_index;
|
||
<a name="l00250"></a>00250
|
||
<a name="l00251"></a>00251 range2_iterator it2, end2;
|
||
<a name="l00252"></a>00252 <a class="code" href="group__sectionalize.html#g52c60c1ff168e4e37ec1357a45d2cfa2" title="Get iterators for a specified section.">get_section</a>(geometry2, sec2, it2, end2);
|
||
<a name="l00253"></a>00253
|
||
<a name="l00254"></a>00254 range2_iterator prev2 = it2++;
|
||
<a name="l00255"></a>00255
|
||
<a name="l00256"></a>00256 <span class="comment">// Mimic 2:</span>
|
||
<a name="l00257"></a>00257 <span class="keywordflow">for</span>(; it2 != end2 && preceding<0>(dir2, *it2, sec1.bounding_box);
|
||
<a name="l00258"></a>00258 prev2 = it2++, index2++, ndi2++)
|
||
<a name="l00259"></a>00259 {
|
||
<a name="l00260"></a>00260 }
|
||
<a name="l00261"></a>00261 it2 = prev2;
|
||
<a name="l00262"></a>00262
|
||
<a name="l00263"></a>00263 <span class="keywordflow">for</span> (prev2 = it2++;
|
||
<a name="l00264"></a>00264 it2 != end2 && ! exceeding<0>(dir2, *prev2, sec1.bounding_box);
|
||
<a name="l00265"></a>00265 prev2 = it2++, index2++, ndi2++)
|
||
<a name="l00266"></a>00266 {
|
||
<a name="l00267"></a>00267 <span class="keywordtype">bool</span> skip = same_source;
|
||
<a name="l00268"></a>00268 <span class="keywordflow">if</span> (skip)
|
||
<a name="l00269"></a>00269 {
|
||
<a name="l00270"></a>00270 <span class="comment">// If sources are the same (possibly self-intersecting):</span>
|
||
<a name="l00271"></a>00271 <span class="comment">// check if it is a neighbouring sement.</span>
|
||
<a name="l00272"></a>00272 <span class="comment">// (including first-last segment</span>
|
||
<a name="l00273"></a>00273 <span class="comment">// and two segments with one or more degenerate/duplicate</span>
|
||
<a name="l00274"></a>00274 <span class="comment">// (zero-length) segments in between)</span>
|
||
<a name="l00275"></a>00275
|
||
<a name="l00276"></a>00276 <span class="comment">// Also skip if index1 < index2 to avoid getting all</span>
|
||
<a name="l00277"></a>00277 <span class="comment">// intersections twice (only do this on same source!)</span>
|
||
<a name="l00278"></a>00278
|
||
<a name="l00279"></a>00279 <span class="comment">// About n-2:</span>
|
||
<a name="l00280"></a>00280 <span class="comment">// (square: range_count=5, indices 0,1,2,3</span>
|
||
<a name="l00281"></a>00281 <span class="comment">// -> 0-3 are adjacent)</span>
|
||
<a name="l00282"></a>00282 skip = index2 >= index1
|
||
<a name="l00283"></a>00283 || ndi1 == ndi2 + 1
|
||
<a name="l00284"></a>00284 || (index2 == 0 && index1 >= int(sec1.range_count) - 2)
|
||
<a name="l00285"></a>00285 ;
|
||
<a name="l00286"></a>00286 }
|
||
<a name="l00287"></a>00287
|
||
<a name="l00288"></a>00288 <span class="keywordflow">if</span> (! skip)
|
||
<a name="l00289"></a>00289 {
|
||
<a name="l00290"></a>00290 <span class="keywordflow">if</span> (relate<segment1_type, segment2_type, IntersectionPoints, IntersectionStrategy>
|
||
<a name="l00291"></a>00291 ::apply(s1, segment2_type(*prev2, *it2),
|
||
<a name="l00292"></a>00292 segment_identifier(source_id1,
|
||
<a name="l00293"></a>00293 sec1.multi_index, sec1.ring_index, index1),
|
||
<a name="l00294"></a>00294 segment_identifier(source_id2,
|
||
<a name="l00295"></a>00295 sec2.multi_index, sec2.ring_index, index2),
|
||
<a name="l00296"></a>00296 intersection_points, trivial)
|
||
<a name="l00297"></a>00297 && return_if_found)
|
||
<a name="l00298"></a>00298 {
|
||
<a name="l00299"></a>00299 <span class="keywordflow">return</span>;
|
||
<a name="l00300"></a>00300 }
|
||
<a name="l00301"></a>00301 }
|
||
<a name="l00302"></a>00302 }
|
||
<a name="l00303"></a>00303 }
|
||
<a name="l00304"></a>00304 }
|
||
<a name="l00305"></a>00305
|
||
<a name="l00306"></a>00306
|
||
<a name="l00307"></a>00307 <span class="keyword">private</span> :
|
||
<a name="l00308"></a>00308 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::point_type<Geometry1>::type point1_type;
|
||
<a name="l00309"></a>00309 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::point_type<Geometry2>::type point2_type;
|
||
<a name="l00310"></a>00310 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::segment<const point1_type> segment1_type;
|
||
<a name="l00311"></a>00311 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::segment<const point2_type> segment2_type;
|
||
<a name="l00312"></a>00312
|
||
<a name="l00313"></a>00313
|
||
<a name="l00314"></a>00314 <span class="keyword">template</span> <<span class="keywordtype">size_t</span> Dim, <span class="keyword">typename</span> Po<span class="keywordtype">int</span>, <span class="keyword">typename</span> Box>
|
||
<a name="l00315"></a>00315 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="namespaceboost_1_1geometry_1_1detail.html#cafc8f4ed09a5ac6f870fc52fd706625">preceding</a>(<span class="keywordtype">int</span> dir, Point <span class="keyword">const</span>& point, Box <span class="keyword">const</span>& box)
|
||
<a name="l00316"></a>00316 {
|
||
<a name="l00317"></a>00317 <span class="keywordflow">return</span> (dir == 1 && get<Dim>(point) < get<min_corner, Dim>(box))
|
||
<a name="l00318"></a>00318 || (dir == -1 && get<Dim>(point) > get<max_corner, Dim>(box));
|
||
<a name="l00319"></a>00319 }
|
||
<a name="l00320"></a>00320
|
||
<a name="l00321"></a>00321 <span class="keyword">template</span> <<span class="keywordtype">size_t</span> Dim, <span class="keyword">typename</span> Po<span class="keywordtype">int</span>, <span class="keyword">typename</span> Box>
|
||
<a name="l00322"></a>00322 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="namespaceboost_1_1geometry_1_1detail.html#5aa1ce446061b9a5655eddbdef75bfd4">exceeding</a>(<span class="keywordtype">int</span> dir, Point <span class="keyword">const</span>& point, Box <span class="keyword">const</span>& box)
|
||
<a name="l00323"></a>00323 {
|
||
<a name="l00324"></a>00324 <span class="keywordflow">return</span> (dir == 1 && get<Dim>(point) > get<max_corner, Dim>(box))
|
||
<a name="l00325"></a>00325 || (dir == -1 && get<Dim>(point) < get<min_corner, Dim>(box));
|
||
<a name="l00326"></a>00326 }
|
||
<a name="l00327"></a>00327
|
||
<a name="l00328"></a>00328
|
||
<a name="l00329"></a>00329 };
|
||
<a name="l00330"></a>00330
|
||
<a name="l00331"></a>00331
|
||
<a name="l00332"></a>00332 <span class="keyword">template</span>
|
||
<a name="l00333"></a>00333 <
|
||
<a name="l00334"></a>00334 <span class="keyword">typename</span> Ring, <span class="keyword">typename</span> Box,
|
||
<a name="l00335"></a>00335 <span class="keyword">typename</span> Section1, <span class="keyword">typename</span> Section2,
|
||
<a name="l00336"></a>00336 <span class="keyword">typename</span> IntersectionPoints,
|
||
<a name="l00337"></a>00337 <span class="keyword">typename</span> IntersectionStrategy
|
||
<a name="l00338"></a>00338 >
|
||
<a name="l00339"></a>00339 <span class="keyword">class </span>get_ips_range_box
|
||
<a name="l00340"></a>00340 {
|
||
<a name="l00341"></a>00341 <span class="keyword">public</span> :
|
||
<a name="l00342"></a>00342 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(
|
||
<a name="l00343"></a>00343 std::size_t source_id1, Ring <span class="keyword">const</span>& ring,
|
||
<a name="l00344"></a>00344 std::size_t source_id2, Box <span class="keyword">const</span>& box,
|
||
<a name="l00345"></a>00345 Section1 <span class="keyword">const</span>& sec1, Section2 <span class="keyword">const</span>& sec2,
|
||
<a name="l00346"></a>00346 IntersectionPoints& intersection_points, <span class="keywordtype">bool</span>& trivial)
|
||
<a name="l00347"></a>00347 {
|
||
<a name="l00348"></a>00348 get_ips_in_sections<Ring, Box, Section1, Section2, IntersectionPoints, IntersectionStrategy>
|
||
<a name="l00349"></a>00349 ::apply(
|
||
<a name="l00350"></a>00350 source_id1, ring, sec1,
|
||
<a name="l00351"></a>00351 source_id2, box, sec2,
|
||
<a name="l00352"></a>00352 <span class="keyword">false</span>,
|
||
<a name="l00353"></a>00353 intersection_points, trivial);
|
||
<a name="l00354"></a>00354 }
|
||
<a name="l00355"></a>00355 };
|
||
<a name="l00356"></a>00356
|
||
<a name="l00357"></a>00357 <span class="keyword">template</span> <<span class="keyword">typename</span> Section, <span class="keywordtype">int</span> Dimension, <span class="keywordtype">int</span> Index>
|
||
<a name="l00358"></a>00358 <span class="keyword">struct </span>compare_section
|
||
<a name="l00359"></a>00359 {
|
||
<a name="l00360"></a>00360 <span class="keyword">inline</span> <span class="keywordtype">bool</span> operator()(Section <span class="keyword">const</span>& left, Section <span class="keyword">const</span>& right)<span class="keyword"> const</span>
|
||
<a name="l00361"></a>00361 <span class="keyword"> </span>{
|
||
<a name="l00362"></a>00362 <span class="keywordflow">return</span>
|
||
<a name="l00363"></a>00363 geometry::get<Index, Dimension>(left.bounding_box)
|
||
<a name="l00364"></a>00364 < geometry::get<Index, Dimension>(right.bounding_box);
|
||
<a name="l00365"></a>00365 }
|
||
<a name="l00366"></a>00366 };
|
||
<a name="l00367"></a>00367
|
||
<a name="l00368"></a>00368
|
||
<a name="l00369"></a>00369
|
||
<a name="l00370"></a>00370 <span class="keyword">template</span>
|
||
<a name="l00371"></a>00371 <
|
||
<a name="l00372"></a>00372 <span class="keyword">typename</span> Geometry1,
|
||
<a name="l00373"></a>00373 <span class="keyword">typename</span> Geometry2,
|
||
<a name="l00374"></a>00374 <span class="keyword">typename</span> IntersectionPoints,
|
||
<a name="l00375"></a>00375 <span class="keyword">typename</span> IntersectionStrategy
|
||
<a name="l00376"></a>00376 >
|
||
<a name="l00377"></a>00377 <span class="keyword">class </span>get_ips_generic
|
||
<a name="l00378"></a>00378 {
|
||
<a name="l00379"></a>00379 <span class="keyword">template</span> <<span class="keyword">typename</span> Box, <span class="keyword">typename</span> Sections>
|
||
<a name="l00380"></a>00380 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> add_sections(Box& box, Sections <span class="keyword">const</span>& sections)
|
||
<a name="l00381"></a>00381 {
|
||
<a name="l00382"></a>00382 <span class="keywordflow">for</span> (<span class="keyword">typename</span> boost::range_iterator<const Sections>::type
|
||
<a name="l00383"></a>00383 it = sections.begin();
|
||
<a name="l00384"></a>00384 it != sections.end();
|
||
<a name="l00385"></a>00385 ++it)
|
||
<a name="l00386"></a>00386 {
|
||
<a name="l00387"></a>00387 <a class="code" href="group__combine.html#g7757b2934a94453246217e5d95a78a07" title="Combines a box with another geometry (box, point).">geometry::combine</a>(box, it->bounding_box);
|
||
<a name="l00388"></a>00388 }
|
||
<a name="l00389"></a>00389 }
|
||
<a name="l00390"></a>00390
|
||
<a name="l00391"></a>00391 <span class="keyword">template</span> <<span class="keyword">typename</span> Sections, <span class="keyword">typename</span> Box>
|
||
<a name="l00392"></a>00392 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> get_sections(Sections <span class="keyword">const</span>& sections,
|
||
<a name="l00393"></a>00393 Box <span class="keyword">const</span>& box, Sections& selection)
|
||
<a name="l00394"></a>00394 {
|
||
<a name="l00395"></a>00395 <span class="keywordflow">for</span> (<span class="keyword">typename</span> boost::range_iterator<const Sections>::type
|
||
<a name="l00396"></a>00396 it = sections.begin();
|
||
<a name="l00397"></a>00397 it != sections.end();
|
||
<a name="l00398"></a>00398 ++it)
|
||
<a name="l00399"></a>00399 {
|
||
<a name="l00400"></a>00400 <span class="keywordflow">if</span> (! geometry::detail::disjoint::disjoint_box_box(box, it->bounding_box))
|
||
<a name="l00401"></a>00401 {
|
||
<a name="l00402"></a>00402 selection.push_back(*it);
|
||
<a name="l00403"></a>00403 }
|
||
<a name="l00404"></a>00404 }
|
||
<a name="l00405"></a>00405 }
|
||
<a name="l00406"></a>00406
|
||
<a name="l00407"></a>00407 <span class="keyword">template</span> <<span class="keyword">typename</span> Sections1, <span class="keyword">typename</span> Sections2, <span class="keyword">typename</span> Map>
|
||
<a name="l00408"></a>00408 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> intersect(
|
||
<a name="l00409"></a>00409 std::size_t source_id1, Geometry1 <span class="keyword">const</span>& geometry1,
|
||
<a name="l00410"></a>00410 std::size_t source_id2, Geometry2 <span class="keyword">const</span>& geometry2,
|
||
<a name="l00411"></a>00411 IntersectionPoints& intersection_points,
|
||
<a name="l00412"></a>00412 Sections1 <span class="keyword">const</span>& sec1, Sections2 <span class="keyword">const</span>& sec2,
|
||
<a name="l00413"></a>00413 Map& map,
|
||
<a name="l00414"></a>00414 <span class="keywordtype">bool</span> &trivial)
|
||
<a name="l00415"></a>00415 {
|
||
<a name="l00416"></a>00416 <span class="keywordflow">for</span> (<span class="keyword">typename</span> boost::range_const_iterator<Sections1>::type
|
||
<a name="l00417"></a>00417 it1 = sec1.begin();
|
||
<a name="l00418"></a>00418 it1 != sec1.end();
|
||
<a name="l00419"></a>00419 ++it1)
|
||
<a name="l00420"></a>00420 {
|
||
<a name="l00421"></a>00421 <span class="keywordflow">for</span> (<span class="keyword">typename</span> boost::range_const_iterator<Sections2>::type
|
||
<a name="l00422"></a>00422 it2 = sec2.begin();
|
||
<a name="l00423"></a>00423 it2 != sec2.end();
|
||
<a name="l00424"></a>00424 ++it2)
|
||
<a name="l00425"></a>00425 {
|
||
<a name="l00426"></a>00426 std::pair<int, int> p = std::make_pair(it1->id, it2->id);
|
||
<a name="l00427"></a>00427 <span class="keywordtype">bool</span> processed = map[p];
|
||
<a name="l00428"></a>00428 <span class="keywordflow">if</span> (! processed)
|
||
<a name="l00429"></a>00429 {
|
||
<a name="l00430"></a>00430 map[p] = <span class="keyword">true</span>;
|
||
<a name="l00431"></a>00431 <span class="keywordflow">if</span> (! geometry::detail::disjoint::disjoint_box_box(
|
||
<a name="l00432"></a>00432 it1->bounding_box, it2->bounding_box))
|
||
<a name="l00433"></a>00433 {
|
||
<a name="l00434"></a>00434 get_ips_in_sections
|
||
<a name="l00435"></a>00435 <
|
||
<a name="l00436"></a>00436 Geometry1,
|
||
<a name="l00437"></a>00437 Geometry2,
|
||
<a name="l00438"></a>00438 <span class="keyword">typename</span> boost::range_value<Sections1>::type,
|
||
<a name="l00439"></a>00439 <span class="keyword">typename</span> boost::range_value<Sections2>::type,
|
||
<a name="l00440"></a>00440 IntersectionPoints,
|
||
<a name="l00441"></a>00441 IntersectionStrategy
|
||
<a name="l00442"></a>00442 >::apply(
|
||
<a name="l00443"></a>00443 source_id1, geometry1, *it1,
|
||
<a name="l00444"></a>00444 source_id2, geometry2, *it2,
|
||
<a name="l00445"></a>00445 <span class="keyword">false</span>,
|
||
<a name="l00446"></a>00446 intersection_points, trivial);
|
||
<a name="l00447"></a>00447 }
|
||
<a name="l00448"></a>00448 }
|
||
<a name="l00449"></a>00449 }
|
||
<a name="l00450"></a>00450 }
|
||
<a name="l00451"></a>00451 }
|
||
<a name="l00452"></a>00452
|
||
<a name="l00453"></a>00453
|
||
<a name="l00454"></a>00454 <span class="comment">// Divide and conquer (suggested by Luke during GGL Formal Review)</span>
|
||
<a name="l00455"></a>00455 <span class="keyword">template</span>
|
||
<a name="l00456"></a>00456 <
|
||
<a name="l00457"></a>00457 std::size_t Dimension,
|
||
<a name="l00458"></a>00458 <span class="keyword">typename</span> Box,
|
||
<a name="l00459"></a>00459 <span class="keyword">typename</span> Sections1, <span class="keyword">typename</span> Sections2,
|
||
<a name="l00460"></a>00460 <span class="keyword">typename</span> Map
|
||
<a name="l00461"></a>00461 >
|
||
<a name="l00462"></a>00462 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> divide_and_conquer(
|
||
<a name="l00463"></a>00463 std::size_t source_id1, Geometry1 <span class="keyword">const</span>& geometry1,
|
||
<a name="l00464"></a>00464 std::size_t source_id2, Geometry2 <span class="keyword">const</span>& geometry2,
|
||
<a name="l00465"></a>00465 IntersectionPoints& intersection_points,
|
||
<a name="l00466"></a>00466
|
||
<a name="l00467"></a>00467 Box <span class="keyword">const</span>& box,
|
||
<a name="l00468"></a>00468 Sections1 <span class="keyword">const</span>& sec1, Sections2 <span class="keyword">const</span>& sec2,
|
||
<a name="l00469"></a>00469 Map& map,
|
||
<a name="l00470"></a>00470 <span class="keywordtype">bool</span> &trivial,
|
||
<a name="l00471"></a>00471 std::size_t iteration = 0, std::size_t previous_count = 0)
|
||
<a name="l00472"></a>00472 {
|
||
<a name="l00473"></a>00473 <span class="comment">// To stop the iteration, fallback to (quadratic) behaviour below certain limits,</span>
|
||
<a name="l00474"></a>00474 <span class="comment">// or if dividing does not give any profit.</span>
|
||
<a name="l00475"></a>00475 std::size_t n = sec1.size() + sec2.size();
|
||
<a name="l00476"></a>00476 <span class="keywordflow">if</span> (sec1.size() < 5
|
||
<a name="l00477"></a>00477 || sec2.size() < 5
|
||
<a name="l00478"></a>00478 || n == previous_count
|
||
<a name="l00479"></a>00479 || iteration > 100)
|
||
<a name="l00480"></a>00480 {
|
||
<a name="l00481"></a>00481 intersect(source_id1, geometry1, source_id2, geometry2,
|
||
<a name="l00482"></a>00482 intersection_points, sec1, sec2, map, trivial);
|
||
<a name="l00483"></a>00483 <span class="keywordflow">return</span>;
|
||
<a name="l00484"></a>00484 }
|
||
<a name="l00485"></a>00485
|
||
<a name="l00486"></a>00486 <span class="comment">// Divide the complete box in two (alternating) halves</span>
|
||
<a name="l00487"></a>00487 Box lower = box, upper = box;
|
||
<a name="l00488"></a>00488 <span class="keyword">typename</span> geometry::coordinate_type<Box>::type two = 2.0;
|
||
<a name="l00489"></a>00489 <span class="keyword">typename</span> geometry::coordinate_type<Box>::type mid
|
||
<a name="l00490"></a>00490 = (geometry::get<min_corner, Dimension>(box)
|
||
<a name="l00491"></a>00491 + geometry::get<max_corner, Dimension>(box)) / two;
|
||
<a name="l00492"></a>00492
|
||
<a name="l00493"></a>00493 geometry::set<max_corner, Dimension>(lower, mid);
|
||
<a name="l00494"></a>00494 geometry::set<min_corner, Dimension>(upper, mid);
|
||
<a name="l00495"></a>00495
|
||
<a name="l00496"></a>00496 Sections1 lower1, upper1;
|
||
<a name="l00497"></a>00497 Sections2 lower2, upper2;
|
||
<a name="l00498"></a>00498 get_sections(sec1, lower, lower1);
|
||
<a name="l00499"></a>00499 get_sections(sec2, lower, lower2);
|
||
<a name="l00500"></a>00500 get_sections(sec1, upper, upper1);
|
||
<a name="l00501"></a>00501 get_sections(sec2, upper, upper2);
|
||
<a name="l00502"></a>00502
|
||
<a name="l00503"></a>00503 <span class="preprocessor">#ifdef BOOST_GEOMETRY_DEBUG_INTERSECTION_DIVIDE_AND_CONQUER</span>
|
||
<a name="l00504"></a>00504 <span class="preprocessor"></span> std::cout
|
||
<a name="l00505"></a>00505 << <span class="stringliteral">"Get IP's, iteration: "</span> << iteration
|
||
<a name="l00506"></a>00506 << <span class="stringliteral">" box: "</span> << <a class="code" href="group__utility.html#g62cc5db4d3bb1147591298b3500f8f1a" title="Main DSV-streaming function.">geometry::dsv</a>(box)
|
||
<a name="l00507"></a>00507 << <span class="stringliteral">" n: "</span> << n
|
||
<a name="l00508"></a>00508 << <span class="stringliteral">" lower: "</span> << lower1.size() << <span class="stringliteral">" , "</span> << lower2.size()
|
||
<a name="l00509"></a>00509 << <span class="stringliteral">" upper: "</span> << upper1.size() << <span class="stringliteral">" , "</span> << upper2.size()
|
||
<a name="l00510"></a>00510 << std::endl;
|
||
<a name="l00511"></a>00511 <span class="preprocessor">#endif</span>
|
||
<a name="l00512"></a>00512 <span class="preprocessor"></span>
|
||
<a name="l00513"></a>00513 <span class="comment">// Recursively handle lower and upper half, dividing in other dimension</span>
|
||
<a name="l00514"></a>00514 divide_and_conquer<1 - Dimension>(source_id1, geometry1,
|
||
<a name="l00515"></a>00515 source_id2, geometry2, intersection_points,
|
||
<a name="l00516"></a>00516 lower, lower1, lower2, map, trivial, iteration + 1, n);
|
||
<a name="l00517"></a>00517
|
||
<a name="l00518"></a>00518 divide_and_conquer<1 - Dimension>(source_id1, geometry1,
|
||
<a name="l00519"></a>00519 source_id2, geometry2, intersection_points,
|
||
<a name="l00520"></a>00520 upper, upper1, upper2, map, trivial, iteration + 1, n);
|
||
<a name="l00521"></a>00521 }
|
||
<a name="l00522"></a>00522
|
||
<a name="l00523"></a>00523 <span class="keyword">public</span>:
|
||
<a name="l00524"></a>00524 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> apply(
|
||
<a name="l00525"></a>00525 std::size_t source_id1, Geometry1 <span class="keyword">const</span>& geometry1,
|
||
<a name="l00526"></a>00526 std::size_t source_id2, Geometry2 <span class="keyword">const</span>& geometry2,
|
||
<a name="l00527"></a>00527 IntersectionPoints& intersection_points)
|
||
<a name="l00528"></a>00528 {
|
||
<a name="l00529"></a>00529 <span class="comment">// Create monotonic sections in ONE direction</span>
|
||
<a name="l00530"></a>00530 <span class="comment">// - in most cases ONE direction is faster (e.g. ~1% faster for the NLP4 testset)</span>
|
||
<a name="l00531"></a>00531 <span class="comment">// - the sections now have a limit (default 10) so will not be too large</span>
|
||
<a name="l00532"></a>00532
|
||
<a name="l00533"></a>00533 <span class="comment">// Note that the sections contain boxes, are dynamic, and therefore</span>
|
||
<a name="l00534"></a>00534 <span class="comment">// are specified using output/intersection-point-type</span>
|
||
<a name="l00535"></a>00535 <span class="comment">// (to enable input-pointer-point-types)</span>
|
||
<a name="l00536"></a>00536 <span class="keyword">typedef</span> <span class="keyword">typename</span> boost::range_value<IntersectionPoints>::type ip_type;
|
||
<a name="l00537"></a>00537 <span class="keyword">typedef</span> <span class="keyword">typename</span> ip_type::point_type point_type;
|
||
<a name="l00538"></a>00538 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::sections<geometry::box<point_type>, 1> sections1_type;
|
||
<a name="l00539"></a>00539 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::sections<geometry::box<point_type>, 1> sections2_type;
|
||
<a name="l00540"></a>00540
|
||
<a name="l00541"></a>00541 sections1_type sec1;
|
||
<a name="l00542"></a>00542 sections2_type sec2;
|
||
<a name="l00543"></a>00543
|
||
<a name="l00544"></a>00544 <a class="code" href="group__sectionalize.html#g5f4d5b585d242d644a1b0b60c805b930" title="Split a geometry into monotonic sections.">geometry::sectionalize</a>(geometry1, sec1);
|
||
<a name="l00545"></a>00545 <a class="code" href="group__sectionalize.html#g5f4d5b585d242d644a1b0b60c805b930" title="Split a geometry into monotonic sections.">geometry::sectionalize</a>(geometry2, sec2);
|
||
<a name="l00546"></a>00546
|
||
<a name="l00547"></a>00547 <span class="comment">// Divide and conquer</span>
|
||
<a name="l00548"></a>00548 geometry::box<point_type> box;
|
||
<a name="l00549"></a>00549 <a class="code" href="group__access.html#g214bc5c2c841a98c58f4d1baca423f86" title="assign to a box inverse infinite">geometry::assign_inverse</a>(box);
|
||
<a name="l00550"></a>00550 add_sections(box, sec1);
|
||
<a name="l00551"></a>00551 add_sections(box, sec2);
|
||
<a name="l00552"></a>00552
|
||
<a name="l00553"></a>00553 <span class="comment">// House-keeping map, to avoid section-pairs being compared twice</span>
|
||
<a name="l00554"></a>00554 std::map<std::pair<int, int>, <span class="keywordtype">bool</span>> map;
|
||
<a name="l00555"></a>00555
|
||
<a name="l00556"></a>00556 <span class="keywordtype">bool</span> trivial = <span class="keyword">true</span>;
|
||
<a name="l00557"></a>00557 divide_and_conquer<1>(source_id1, geometry1, source_id2, geometry2,
|
||
<a name="l00558"></a>00558 intersection_points, box, sec1, sec2, map, trivial);
|
||
<a name="l00559"></a>00559 <span class="keywordflow">return</span> trivial;
|
||
<a name="l00560"></a>00560 }
|
||
<a name="l00561"></a>00561 };
|
||
<a name="l00562"></a>00562
|
||
<a name="l00563"></a>00563
|
||
<a name="l00564"></a>00564
|
||
<a name="l00565"></a>00565 <span class="keyword">template</span>
|
||
<a name="l00566"></a>00566 <
|
||
<a name="l00567"></a>00567 <span class="keyword">typename</span> Range,
|
||
<a name="l00568"></a>00568 <span class="keyword">typename</span> Box,
|
||
<a name="l00569"></a>00569 <span class="keyword">typename</span> IntersectionPoints,
|
||
<a name="l00570"></a>00570 <span class="keyword">typename</span> IntersectionStrategy
|
||
<a name="l00571"></a>00571 >
|
||
<a name="l00572"></a>00572 <span class="keyword">struct </span>get_ips_cs
|
||
<a name="l00573"></a>00573 {
|
||
<a name="l00574"></a>00574 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(std::size_t source_id1, Range <span class="keyword">const</span>& range,
|
||
<a name="l00575"></a>00575 <span class="keywordtype">int</span> multi_index, <span class="keywordtype">int</span> ring_index,
|
||
<a name="l00576"></a>00576 std::size_t source_id2, Box <span class="keyword">const</span>& box,
|
||
<a name="l00577"></a>00577 IntersectionPoints& intersection_points,
|
||
<a name="l00578"></a>00578 <span class="keywordtype">bool</span>& trivial)
|
||
<a name="l00579"></a>00579 {
|
||
<a name="l00580"></a>00580 <span class="keywordflow">if</span> (boost::size(range) <= 1)
|
||
<a name="l00581"></a>00581 {
|
||
<a name="l00582"></a>00582 <span class="keywordflow">return</span>;
|
||
<a name="l00583"></a>00583 }
|
||
<a name="l00584"></a>00584
|
||
<a name="l00585"></a>00585
|
||
<a name="l00586"></a>00586 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::point_type<Box>::type box_point_type;
|
||
<a name="l00587"></a>00587 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::point_type<Range>::type point_type;
|
||
<a name="l00588"></a>00588
|
||
<a name="l00589"></a>00589 <span class="keyword">typedef</span> segment<const box_point_type> box_segment_type;
|
||
<a name="l00590"></a>00590 <span class="keyword">typedef</span> segment<const point_type> segment_type;
|
||
<a name="l00591"></a>00591
|
||
<a name="l00592"></a>00592 point_type lower_left, upper_left, lower_right, upper_right;
|
||
<a name="l00593"></a>00593 <a class="code" href="group__access.html#gf0c9c98fa6adc702d43606c33cca5652" title="Assign the 4 points of a 2D box.">assign_box_corners</a>(box, lower_left, lower_right, upper_left, upper_right);
|
||
<a name="l00594"></a>00594
|
||
<a name="l00595"></a>00595 box_segment_type left(lower_left, upper_left);
|
||
<a name="l00596"></a>00596 box_segment_type top(upper_left, upper_right);
|
||
<a name="l00597"></a>00597 box_segment_type right(upper_right, lower_right);
|
||
<a name="l00598"></a>00598 box_segment_type bottom(lower_right, lower_left);
|
||
<a name="l00599"></a>00599
|
||
<a name="l00600"></a>00600
|
||
<a name="l00601"></a>00601 <span class="keyword">typedef</span> <span class="keyword">typename</span> boost::range_const_iterator<Range>::type iterator_type;
|
||
<a name="l00602"></a>00602 iterator_type it = boost::begin(range);
|
||
<a name="l00603"></a>00603
|
||
<a name="l00604"></a>00604 <span class="keywordtype">bool</span> first = <span class="keyword">true</span>;
|
||
<a name="l00605"></a>00605
|
||
<a name="l00606"></a>00606 <span class="keywordtype">char</span> previous_side[2] = {0, 0};
|
||
<a name="l00607"></a>00607
|
||
<a name="l00608"></a>00608 <span class="keywordtype">int</span> index = 0;
|
||
<a name="l00609"></a>00609
|
||
<a name="l00610"></a>00610 <span class="keywordflow">for</span> (iterator_type prev = it++;
|
||
<a name="l00611"></a>00611 it != boost::end(range);
|
||
<a name="l00612"></a>00612 prev = it++, index++)
|
||
<a name="l00613"></a>00613 {
|
||
<a name="l00614"></a>00614 segment_type segment(*prev, *it);
|
||
<a name="l00615"></a>00615
|
||
<a name="l00616"></a>00616 <span class="keywordflow">if</span> (first)
|
||
<a name="l00617"></a>00617 {
|
||
<a name="l00618"></a>00618 previous_side[0] = get_side<0>(box, *prev);
|
||
<a name="l00619"></a>00619 previous_side[1] = get_side<1>(box, *prev);
|
||
<a name="l00620"></a>00620 }
|
||
<a name="l00621"></a>00621
|
||
<a name="l00622"></a>00622 <span class="keywordtype">char</span> current_side[2];
|
||
<a name="l00623"></a>00623 current_side[0] = get_side<0>(box, *it);
|
||
<a name="l00624"></a>00624 current_side[1] = get_side<1>(box, *it);
|
||
<a name="l00625"></a>00625
|
||
<a name="l00626"></a>00626 <span class="comment">// There can NOT be intersections if</span>
|
||
<a name="l00627"></a>00627 <span class="comment">// 1) EITHER the two points are lying on one side of the box (! 0 && the same)</span>
|
||
<a name="l00628"></a>00628 <span class="comment">// 2) OR same in Y-direction</span>
|
||
<a name="l00629"></a>00629 <span class="comment">// 3) OR all points are inside the box (0)</span>
|
||
<a name="l00630"></a>00630 <span class="comment">/*if (! (</span>
|
||
<a name="l00631"></a>00631 <span class="comment"> (current_side[0] != 0 && current_side[0] == previous_side[0])</span>
|
||
<a name="l00632"></a>00632 <span class="comment"> || (current_side[1] != 0 && current_side[1] == previous_side[1])</span>
|
||
<a name="l00633"></a>00633 <span class="comment"> || (current_side[0] == 0</span>
|
||
<a name="l00634"></a>00634 <span class="comment"> && current_side[1] == 0</span>
|
||
<a name="l00635"></a>00635 <span class="comment"> && previous_side[0] == 0</span>
|
||
<a name="l00636"></a>00636 <span class="comment"> && previous_side[1] == 0)</span>
|
||
<a name="l00637"></a>00637 <span class="comment"> )</span>
|
||
<a name="l00638"></a>00638 <span class="comment"> )*/</span>
|
||
<a name="l00639"></a>00639 <span class="keywordflow">if</span> (<span class="keyword">true</span>)
|
||
<a name="l00640"></a>00640 {
|
||
<a name="l00641"></a>00641 segment_identifier seg_id(source_id1,
|
||
<a name="l00642"></a>00642 multi_index, ring_index, index);
|
||
<a name="l00643"></a>00643
|
||
<a name="l00644"></a>00644 <span class="keyword">typedef</span> relate
|
||
<a name="l00645"></a>00645 <
|
||
<a name="l00646"></a>00646 segment_type,
|
||
<a name="l00647"></a>00647 box_segment_type,
|
||
<a name="l00648"></a>00648 IntersectionPoints,
|
||
<a name="l00649"></a>00649 IntersectionStrategy
|
||
<a name="l00650"></a>00650 > relater;
|
||
<a name="l00651"></a>00651
|
||
<a name="l00652"></a>00652 <span class="comment">// Depending on code some relations can be left out</span>
|
||
<a name="l00653"></a>00653 relater::apply(segment, left, seg_id,
|
||
<a name="l00654"></a>00654 segment_identifier(source_id2, -1, -1, 0),
|
||
<a name="l00655"></a>00655 intersection_points, trivial);
|
||
<a name="l00656"></a>00656 relater::apply(segment, top, seg_id,
|
||
<a name="l00657"></a>00657 segment_identifier(source_id2, -1, -1, 1),
|
||
<a name="l00658"></a>00658 intersection_points, trivial);
|
||
<a name="l00659"></a>00659 relater::apply(segment, right, seg_id,
|
||
<a name="l00660"></a>00660 segment_identifier(source_id2, -1, -1, 2),
|
||
<a name="l00661"></a>00661 intersection_points, trivial);
|
||
<a name="l00662"></a>00662 relater::apply(segment, bottom, seg_id,
|
||
<a name="l00663"></a>00663 segment_identifier(source_id2, -1, -1, 3),
|
||
<a name="l00664"></a>00664 intersection_points, trivial);
|
||
<a name="l00665"></a>00665
|
||
<a name="l00666"></a>00666 }
|
||
<a name="l00667"></a>00667 }
|
||
<a name="l00668"></a>00668 }
|
||
<a name="l00669"></a>00669
|
||
<a name="l00670"></a>00670 <span class="keyword">private</span>:
|
||
<a name="l00671"></a>00671 <span class="keyword">template</span><std::<span class="keywordtype">size_t</span> Index, <span class="keyword">typename</span> Po<span class="keywordtype">int</span>>
|
||
<a name="l00672"></a>00672 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> get_side(Box <span class="keyword">const</span>& box, Point <span class="keyword">const</span>& point)
|
||
<a name="l00673"></a>00673 {
|
||
<a name="l00674"></a>00674 <span class="comment">// Inside -> 0</span>
|
||
<a name="l00675"></a>00675 <span class="comment">// Outside -> -1 (left/below) or 1 (right/above)</span>
|
||
<a name="l00676"></a>00676 <span class="comment">// On border -> -2 (left/lower) or 2 (right/upper)</span>
|
||
<a name="l00677"></a>00677 <span class="comment">// The only purpose of the value is to not be the same,</span>
|
||
<a name="l00678"></a>00678 <span class="comment">// and to denote if it is inside (0)</span>
|
||
<a name="l00679"></a>00679
|
||
<a name="l00680"></a>00680 <span class="keyword">typename</span> coordinate_type<Point>::type <span class="keyword">const</span>& c = get<Index>(point);
|
||
<a name="l00681"></a>00681 <span class="keyword">typename</span> coordinate_type<Box>::type <span class="keyword">const</span>& left = get<min_corner, Index>(box);
|
||
<a name="l00682"></a>00682 <span class="keyword">typename</span> coordinate_type<Box>::type <span class="keyword">const</span>& right = get<max_corner, Index>(box);
|
||
<a name="l00683"></a>00683
|
||
<a name="l00684"></a>00684 <span class="keywordflow">if</span> (<a class="code" href="group__utility.html#g8d2104edb28c2cecaa93e0a7e6308b77" title="returns true if both arguments are equal.">geometry::math::equals</a>(c, left)) <span class="keywordflow">return</span> -2;
|
||
<a name="l00685"></a>00685 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="group__utility.html#g8d2104edb28c2cecaa93e0a7e6308b77" title="returns true if both arguments are equal.">geometry::math::equals</a>(c, right)) <span class="keywordflow">return</span> 2;
|
||
<a name="l00686"></a>00686 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c < left) <span class="keywordflow">return</span> -1;
|
||
<a name="l00687"></a>00687 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c > right) <span class="keywordflow">return</span> 1;
|
||
<a name="l00688"></a>00688 <span class="keywordflow">else</span> <span class="keywordflow">return</span> 0;
|
||
<a name="l00689"></a>00689 }
|
||
<a name="l00690"></a>00690
|
||
<a name="l00691"></a>00691
|
||
<a name="l00692"></a>00692 };
|
||
<a name="l00693"></a>00693
|
||
<a name="l00694"></a>00694
|
||
<a name="l00695"></a>00695 }} <span class="comment">// namespace detail::get_intersection_points</span>
|
||
<a name="l00696"></a>00696 <span class="preprocessor">#endif // DOXYGEN_NO_DETAIL</span>
|
||
<a name="l00697"></a>00697 <span class="preprocessor"></span>
|
||
<a name="l00698"></a>00698
|
||
<a name="l00699"></a>00699 <span class="preprocessor">#ifndef DOXYGEN_NO_DISPATCH</span>
|
||
<a name="l00700"></a>00700 <span class="preprocessor"></span><span class="keyword">namespace </span>dispatch
|
||
<a name="l00701"></a>00701 {
|
||
<a name="l00702"></a>00702
|
||
<a name="l00703"></a>00703 <span class="keyword">template</span>
|
||
<a name="l00704"></a>00704 <
|
||
<a name="l00705"></a>00705 <span class="keyword">typename</span> GeometryTag1, <span class="keyword">typename</span> GeometryTag2,
|
||
<a name="l00706"></a>00706 <span class="keywordtype">bool</span> IsMulti1, <span class="keywordtype">bool</span> IsMulti2,
|
||
<a name="l00707"></a>00707 <span class="keyword">typename</span> Geometry1, <span class="keyword">typename</span> Geometry2,
|
||
<a name="l00708"></a>00708 <span class="keyword">typename</span> IntersectionPoints,
|
||
<a name="l00709"></a>00709 <span class="keyword">typename</span> IntersectionStrategy
|
||
<a name="l00710"></a>00710 >
|
||
<a name="l00711"></a>00711 <span class="keyword">struct </span><a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">get_intersection_points</a>
|
||
<a name="l00712"></a>00712 {
|
||
<a name="l00713"></a>00713 };
|
||
<a name="l00714"></a>00714
|
||
<a name="l00715"></a>00715
|
||
<a name="l00716"></a>00716 <span class="keyword">template</span><<span class="keyword">typename</span> Polygon, <span class="keyword">typename</span> Box, <span class="keyword">typename</span> IntersectionPo<span class="keywordtype">int</span>s, <span class="keyword">typename</span> IntersectionStrategy>
|
||
<a name="l00717"></a>00717 <span class="keyword">struct </span><a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">get_intersection_points</a>
|
||
<a name="l00718"></a>00718 <
|
||
<a name="l00719"></a>00719 polygon_tag, box_tag, false, false,
|
||
<a name="l00720"></a>00720 Polygon, Box,
|
||
<a name="l00721"></a>00721 IntersectionPoints,
|
||
<a name="l00722"></a>00722 IntersectionStrategy
|
||
<a name="l00723"></a>00723 >
|
||
<a name="l00724"></a>00724 {
|
||
<a name="l00725"></a>00725
|
||
<a name="l00726"></a>00726 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> apply(
|
||
<a name="l00727"></a>00727 std::size_t source_id1, Polygon <span class="keyword">const</span>& polygon,
|
||
<a name="l00728"></a>00728 std::size_t source_id2, Box <span class="keyword">const</span>& box,
|
||
<a name="l00729"></a>00729 IntersectionPoints& intersection_points)
|
||
<a name="l00730"></a>00730 {
|
||
<a name="l00731"></a>00731 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::ring_type<Polygon>::type ring_type;
|
||
<a name="l00732"></a>00732
|
||
<a name="l00733"></a>00733 <span class="keyword">typedef</span> <span class="keyword">typename</span> boost::range_const_iterator
|
||
<a name="l00734"></a>00734 <
|
||
<a name="l00735"></a>00735 <span class="keyword">typename</span> interior_type<Polygon>::type
|
||
<a name="l00736"></a>00736 >::type iterator_type;
|
||
<a name="l00737"></a>00737
|
||
<a name="l00738"></a>00738
|
||
<a name="l00739"></a>00739 <span class="keyword">typedef</span> detail::get_intersection_points::get_ips_cs
|
||
<a name="l00740"></a>00740 <
|
||
<a name="l00741"></a>00741 ring_type,
|
||
<a name="l00742"></a>00742 Box,
|
||
<a name="l00743"></a>00743 IntersectionPoints,
|
||
<a name="l00744"></a>00744 IntersectionStrategy
|
||
<a name="l00745"></a>00745 > intersector_type;
|
||
<a name="l00746"></a>00746
|
||
<a name="l00747"></a>00747 <span class="keywordtype">bool</span> trivial = <span class="keyword">true</span>;
|
||
<a name="l00748"></a>00748 intersector_type::apply(
|
||
<a name="l00749"></a>00749 source_id1, <a class="code" href="group__access.html#gd96ba07cd3c6c3216bd5ab69adc9ccb5" title="Function to get the exterior_ring ring of a polygon.">geometry::exterior_ring</a>(polygon), -1, -1,
|
||
<a name="l00750"></a>00750 source_id2, box,
|
||
<a name="l00751"></a>00751 intersection_points, trivial);
|
||
<a name="l00752"></a>00752
|
||
<a name="l00753"></a>00753 <span class="keywordtype">int</span> i = 0;
|
||
<a name="l00754"></a>00754 <span class="keywordflow">for</span> (iterator_type it = boost::begin(<a class="code" href="group__access.html#g5af585b056bb80bf3dfe7c07ad30d84a" title="Function to get the interior rings of a polygon (non const version).">interior_rings</a>(polygon));
|
||
<a name="l00755"></a>00755 it != boost::end(<a class="code" href="group__access.html#g5af585b056bb80bf3dfe7c07ad30d84a" title="Function to get the interior rings of a polygon (non const version).">interior_rings</a>(polygon));
|
||
<a name="l00756"></a>00756 ++it, ++i)
|
||
<a name="l00757"></a>00757 {
|
||
<a name="l00758"></a>00758 intersector_type::apply(
|
||
<a name="l00759"></a>00759 source_id1, *it, -1, i,
|
||
<a name="l00760"></a>00760 source_id2, box, intersection_points, trivial);
|
||
<a name="l00761"></a>00761 }
|
||
<a name="l00762"></a>00762
|
||
<a name="l00763"></a>00763 <span class="keywordflow">return</span> trivial;
|
||
<a name="l00764"></a>00764 }
|
||
<a name="l00765"></a>00765 };
|
||
<a name="l00766"></a>00766
|
||
<a name="l00767"></a>00767
|
||
<a name="l00768"></a>00768 <span class="keyword">template</span><<span class="keyword">typename</span> Ring, <span class="keyword">typename</span> Box, <span class="keyword">typename</span> IntersectionPo<span class="keywordtype">int</span>s, <span class="keyword">typename</span> IntersectionStrategy>
|
||
<a name="l00769"></a>00769 <span class="keyword">struct </span><a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">get_intersection_points</a>
|
||
<a name="l00770"></a>00770 <
|
||
<a name="l00771"></a>00771 ring_tag, box_tag, false, false,
|
||
<a name="l00772"></a>00772 Ring, Box,
|
||
<a name="l00773"></a>00773 IntersectionPoints, IntersectionStrategy
|
||
<a name="l00774"></a>00774 >
|
||
<a name="l00775"></a>00775 {
|
||
<a name="l00776"></a>00776 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> apply(
|
||
<a name="l00777"></a>00777 std::size_t source_id1, Ring <span class="keyword">const</span>& ring,
|
||
<a name="l00778"></a>00778 std::size_t source_id2, Box <span class="keyword">const</span>& box,
|
||
<a name="l00779"></a>00779 IntersectionPoints& intersection_points)
|
||
<a name="l00780"></a>00780 {
|
||
<a name="l00781"></a>00781 <span class="keyword">typedef</span> <span class="keyword">typename</span> boost::range_const_iterator
|
||
<a name="l00782"></a>00782 <
|
||
<a name="l00783"></a>00783 Ring
|
||
<a name="l00784"></a>00784 >::type iterator_type;
|
||
<a name="l00785"></a>00785
|
||
<a name="l00786"></a>00786 <span class="keyword">typedef</span> detail::get_intersection_points::get_ips_cs
|
||
<a name="l00787"></a>00787 <Ring, Box, IntersectionPoints, IntersectionStrategy> intersector_type;
|
||
<a name="l00788"></a>00788
|
||
<a name="l00789"></a>00789 <span class="keywordtype">bool</span> trivial = <span class="keyword">true</span>;
|
||
<a name="l00790"></a>00790 intersector_type::apply(
|
||
<a name="l00791"></a>00791 source_id1, ring, -1, -1,
|
||
<a name="l00792"></a>00792 source_id2, box,
|
||
<a name="l00793"></a>00793 intersection_points, trivial);
|
||
<a name="l00794"></a>00794
|
||
<a name="l00795"></a>00795 <span class="keywordflow">return</span> trivial;
|
||
<a name="l00796"></a>00796 }
|
||
<a name="l00797"></a>00797 };
|
||
<a name="l00798"></a>00798
|
||
<a name="l00799"></a>00799
|
||
<a name="l00800"></a>00800 <span class="keyword">template</span>
|
||
<a name="l00801"></a>00801 <
|
||
<a name="l00802"></a>00802 <span class="keyword">typename</span> Ring1,
|
||
<a name="l00803"></a>00803 <span class="keyword">typename</span> Ring2,
|
||
<a name="l00804"></a>00804 <span class="keyword">typename</span> IntersectionPoints,
|
||
<a name="l00805"></a>00805 <span class="keyword">typename</span> IntersectionStrategy
|
||
<a name="l00806"></a>00806 >
|
||
<a name="l00807"></a>00807 <span class="keyword">struct </span><a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">get_intersection_points</a>
|
||
<a name="l00808"></a>00808 <
|
||
<a name="l00809"></a>00809 ring_tag, ring_tag, false, false,
|
||
<a name="l00810"></a>00810 Ring1, Ring2,
|
||
<a name="l00811"></a>00811 IntersectionPoints, IntersectionStrategy
|
||
<a name="l00812"></a>00812 >
|
||
<a name="l00813"></a>00813 : detail::<a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">get_intersection_points</a>::get_ips_generic
|
||
<a name="l00814"></a>00814 <
|
||
<a name="l00815"></a>00815 Ring1,
|
||
<a name="l00816"></a>00816 Ring2,
|
||
<a name="l00817"></a>00817 IntersectionPoints,
|
||
<a name="l00818"></a>00818 IntersectionStrategy
|
||
<a name="l00819"></a>00819 >
|
||
<a name="l00820"></a>00820 {};
|
||
<a name="l00821"></a>00821
|
||
<a name="l00822"></a>00822
|
||
<a name="l00823"></a>00823 <span class="keyword">template</span>
|
||
<a name="l00824"></a>00824 <
|
||
<a name="l00825"></a>00825 <span class="keyword">typename</span> Polygon1,
|
||
<a name="l00826"></a>00826 <span class="keyword">typename</span> Polygon2,
|
||
<a name="l00827"></a>00827 <span class="keyword">typename</span> IntersectionPoints,
|
||
<a name="l00828"></a>00828 <span class="keyword">typename</span> IntersectionStrategy
|
||
<a name="l00829"></a>00829 >
|
||
<a name="l00830"></a>00830 <span class="keyword">struct </span><a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">get_intersection_points</a>
|
||
<a name="l00831"></a>00831 <
|
||
<a name="l00832"></a>00832 polygon_tag, polygon_tag, false, false,
|
||
<a name="l00833"></a>00833 Polygon1, Polygon2,
|
||
<a name="l00834"></a>00834 IntersectionPoints, IntersectionStrategy
|
||
<a name="l00835"></a>00835 >
|
||
<a name="l00836"></a>00836 : detail::<a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">get_intersection_points</a>::get_ips_generic
|
||
<a name="l00837"></a>00837 <
|
||
<a name="l00838"></a>00838 Polygon1,
|
||
<a name="l00839"></a>00839 Polygon2,
|
||
<a name="l00840"></a>00840 IntersectionPoints,
|
||
<a name="l00841"></a>00841 IntersectionStrategy
|
||
<a name="l00842"></a>00842 >
|
||
<a name="l00843"></a>00843 {};
|
||
<a name="l00844"></a>00844
|
||
<a name="l00845"></a>00845 <span class="keyword">template</span>
|
||
<a name="l00846"></a>00846 <
|
||
<a name="l00847"></a>00847 <span class="keyword">typename</span> Polygon,
|
||
<a name="l00848"></a>00848 <span class="keyword">typename</span> Ring,
|
||
<a name="l00849"></a>00849 <span class="keyword">typename</span> IntersectionPoints,
|
||
<a name="l00850"></a>00850 <span class="keyword">typename</span> IntersectionStrategy
|
||
<a name="l00851"></a>00851 >
|
||
<a name="l00852"></a>00852 <span class="keyword">struct </span><a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">get_intersection_points</a>
|
||
<a name="l00853"></a>00853 <
|
||
<a name="l00854"></a>00854 polygon_tag, ring_tag, false, false,
|
||
<a name="l00855"></a>00855 Polygon, Ring,
|
||
<a name="l00856"></a>00856 IntersectionPoints, IntersectionStrategy
|
||
<a name="l00857"></a>00857 >
|
||
<a name="l00858"></a>00858 : detail::<a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">get_intersection_points</a>::get_ips_generic
|
||
<a name="l00859"></a>00859 <
|
||
<a name="l00860"></a>00860 Polygon,
|
||
<a name="l00861"></a>00861 Ring,
|
||
<a name="l00862"></a>00862 IntersectionPoints,
|
||
<a name="l00863"></a>00863 IntersectionStrategy
|
||
<a name="l00864"></a>00864 >
|
||
<a name="l00865"></a>00865 {};
|
||
<a name="l00866"></a>00866
|
||
<a name="l00867"></a>00867 <span class="keyword">template</span>
|
||
<a name="l00868"></a>00868 <
|
||
<a name="l00869"></a>00869 <span class="keyword">typename</span> LineString1,
|
||
<a name="l00870"></a>00870 <span class="keyword">typename</span> LineString2,
|
||
<a name="l00871"></a>00871 <span class="keyword">typename</span> IntersectionPoints,
|
||
<a name="l00872"></a>00872 <span class="keyword">typename</span> IntersectionStrategy
|
||
<a name="l00873"></a>00873 >
|
||
<a name="l00874"></a>00874 <span class="keyword">struct </span><a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">get_intersection_points</a>
|
||
<a name="l00875"></a>00875 <
|
||
<a name="l00876"></a>00876 linestring_tag, linestring_tag, false, false,
|
||
<a name="l00877"></a>00877 LineString1, LineString2,
|
||
<a name="l00878"></a>00878 IntersectionPoints, IntersectionStrategy
|
||
<a name="l00879"></a>00879 >
|
||
<a name="l00880"></a>00880 : detail::<a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">get_intersection_points</a>::get_ips_generic
|
||
<a name="l00881"></a>00881 <
|
||
<a name="l00882"></a>00882 LineString1,
|
||
<a name="l00883"></a>00883 LineString2,
|
||
<a name="l00884"></a>00884 IntersectionPoints,
|
||
<a name="l00885"></a>00885 IntersectionStrategy
|
||
<a name="l00886"></a>00886 >
|
||
<a name="l00887"></a>00887 {};
|
||
<a name="l00888"></a>00888
|
||
<a name="l00889"></a>00889 <span class="keyword">template</span>
|
||
<a name="l00890"></a>00890 <
|
||
<a name="l00891"></a>00891 <span class="keyword">typename</span> GeometryTag1, <span class="keyword">typename</span> GeometryTag2,
|
||
<a name="l00892"></a>00892 <span class="keywordtype">bool</span> IsMulti1, <span class="keywordtype">bool</span> IsMulti2,
|
||
<a name="l00893"></a>00893 <span class="keyword">typename</span> Geometry1, <span class="keyword">typename</span> Geometry2,
|
||
<a name="l00894"></a>00894 <span class="keyword">typename</span> IntersectionPoints,
|
||
<a name="l00895"></a>00895 <span class="keyword">typename</span> IntersectionStrategy
|
||
<a name="l00896"></a>00896 >
|
||
<a name="l00897"></a>00897 <span class="keyword">struct </span>get_intersection_points_reversed
|
||
<a name="l00898"></a>00898 {
|
||
<a name="l00899"></a>00899 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> apply(
|
||
<a name="l00900"></a>00900 std::size_t source_id1, Geometry1 <span class="keyword">const</span>& g1,
|
||
<a name="l00901"></a>00901 std::size_t source_id2, Geometry2 <span class="keyword">const</span>& g2,
|
||
<a name="l00902"></a>00902 IntersectionPoints& intersection_points)
|
||
<a name="l00903"></a>00903 {
|
||
<a name="l00904"></a>00904 <span class="keywordflow">return</span> <a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">get_intersection_points</a>
|
||
<a name="l00905"></a>00905 <
|
||
<a name="l00906"></a>00906 GeometryTag2, GeometryTag1,
|
||
<a name="l00907"></a>00907 IsMulti2, IsMulti1,
|
||
<a name="l00908"></a>00908 Geometry2, Geometry1,
|
||
<a name="l00909"></a>00909 IntersectionPoints, IntersectionStrategy
|
||
<a name="l00910"></a>00910 >::apply(source_id2, g2, source_id1, g1, intersection_points);
|
||
<a name="l00911"></a>00911 }
|
||
<a name="l00912"></a>00912 };
|
||
<a name="l00913"></a>00913
|
||
<a name="l00914"></a>00914
|
||
<a name="l00915"></a>00915 } <span class="comment">// namespace dispatch</span>
|
||
<a name="l00916"></a>00916 <span class="preprocessor">#endif // DOXYGEN_NO_DISPATCH</span>
|
||
<a name="l00917"></a>00917 <span class="preprocessor"></span>
|
||
<a name="l00918"></a>00918
|
||
<a name="l00919"></a>00919
|
||
<a name="l00930"></a>00930 <span class="keyword">template</span> <<span class="keyword">typename</span> Geometry1, <span class="keyword">typename</span> Geometry2, <span class="keyword">typename</span> IntersectionPo<span class="keywordtype">int</span>s>
|
||
<a name="l00931"></a><a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a">00931</a> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">get_intersection_points</a>(Geometry1 <span class="keyword">const</span>& geometry1,
|
||
<a name="l00932"></a>00932 Geometry2 <span class="keyword">const</span>& geometry2, IntersectionPoints& intersection_points)
|
||
<a name="l00933"></a>00933 {
|
||
<a name="l00934"></a>00934 concept::check_concepts_and_equal_dimensions<const Geometry1, const Geometry2>();
|
||
<a name="l00935"></a>00935
|
||
<a name="l00936"></a>00936 <span class="keyword">typedef</span> <span class="keyword">typename</span> boost::remove_const<Geometry1>::type ncg1_type;
|
||
<a name="l00937"></a>00937 <span class="keyword">typedef</span> <span class="keyword">typename</span> boost::remove_const<Geometry2>::type ncg2_type;
|
||
<a name="l00938"></a>00938
|
||
<a name="l00939"></a>00939 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="structboost_1_1geometry_1_1strategy__intersection.html">strategy_intersection</a>
|
||
<a name="l00940"></a>00940 <
|
||
<a name="l00941"></a>00941 <span class="keyword">typename</span> <a class="code" href="structboost_1_1geometry_1_1cs__tag.html" title="Meta-function returning coordinate system tag (cs family) of any geometry.">cs_tag<Geometry1>::type</a>,
|
||
<a name="l00942"></a>00942 Geometry1,
|
||
<a name="l00943"></a>00943 Geometry2,
|
||
<a name="l00944"></a>00944 <span class="keyword">typename</span> boost::range_value<IntersectionPoints>::type
|
||
<a name="l00945"></a>00945 >::segment_intersection_strategy_type segment_intersection_strategy_type;
|
||
<a name="l00946"></a>00946
|
||
<a name="l00947"></a>00947 boost::mpl::if_c
|
||
<a name="l00948"></a>00948 <
|
||
<a name="l00949"></a>00949 <a class="code" href="structboost_1_1geometry_1_1reverse__dispatch.html">reverse_dispatch<Geometry1, Geometry2>::type::value</a>,
|
||
<a name="l00950"></a>00950 dispatch::get_intersection_points_reversed
|
||
<a name="l00951"></a>00951 <
|
||
<a name="l00952"></a>00952 <span class="keyword">typename</span> <a class="code" href="structboost_1_1geometry_1_1geometry__not__recognized__tag.html" title="&quot;default&quot; tag">tag<Geometry1>::type</a>,
|
||
<a name="l00953"></a>00953 <span class="keyword">typename</span> <a class="code" href="structboost_1_1geometry_1_1geometry__not__recognized__tag.html" title="&quot;default&quot; tag">tag<Geometry2>::type</a>,
|
||
<a name="l00954"></a>00954 <a class="code" href="structboost_1_1geometry_1_1is__multi.html" title="Meta-function defining &quot;true&quot; for multi geometries (multi_point, etc).">is_multi<Geometry1>::type::value</a>,
|
||
<a name="l00955"></a>00955 <a class="code" href="structboost_1_1geometry_1_1is__multi.html" title="Meta-function defining &quot;true&quot; for multi geometries (multi_point, etc).">is_multi<Geometry2>::type::value</a>,
|
||
<a name="l00956"></a>00956 ncg1_type,
|
||
<a name="l00957"></a>00957 ncg2_type,
|
||
<a name="l00958"></a>00958 IntersectionPoints,
|
||
<a name="l00959"></a>00959 segment_intersection_strategy_type
|
||
<a name="l00960"></a>00960 >,
|
||
<a name="l00961"></a>00961 <a class="code" href="group__overlay.html#g5ca19485a71af4c4ccba3de2bb08680a" title="Calculate intersection points of two geometries.">dispatch::get_intersection_points</a>
|
||
<a name="l00962"></a>00962 <
|
||
<a name="l00963"></a>00963 <span class="keyword">typename</span> tag<Geometry1>::type,
|
||
<a name="l00964"></a>00964 <span class="keyword">typename</span> tag<Geometry2>::type,
|
||
<a name="l00965"></a>00965 is_multi<Geometry1>::type::value,
|
||
<a name="l00966"></a>00966 is_multi<Geometry2>::type::value,
|
||
<a name="l00967"></a>00967 ncg1_type,
|
||
<a name="l00968"></a>00968 ncg2_type,
|
||
<a name="l00969"></a>00969 IntersectionPoints,
|
||
<a name="l00970"></a>00970 segment_intersection_strategy_type
|
||
<a name="l00971"></a>00971 >
|
||
<a name="l00972"></a>00972 >::type::apply(
|
||
<a name="l00973"></a>00973 0, geometry1,
|
||
<a name="l00974"></a>00974 1, geometry2,
|
||
<a name="l00975"></a>00975 intersection_points);
|
||
<a name="l00976"></a>00976 }
|
||
<a name="l00977"></a>00977
|
||
<a name="l00978"></a>00978
|
||
<a name="l00979"></a>00979 }} <span class="comment">// namespace boost::geometry</span>
|
||
<a name="l00980"></a>00980
|
||
<a name="l00981"></a>00981 <span class="preprocessor">#endif // BOOST_GEOMETRY_ALGORITHMS_OVERLAY_GET_INTERSECTION_POINTS_HPP</span>
|
||
</pre></div></div>
|
||
<hr size="1">
|
||
<table width="100%">
|
||
<tbody>
|
||
<tr>
|
||
<td align="left"><small>
|
||
<p>December 1, 2009</p>
|
||
</small></td>
|
||
<td align="right">
|
||
<small>Copyright <20> 1995-2009 Barend Gehrels, Geodan, Amsterdam<br>
|
||
Copyright <20> 2008-2009 Bruno Lalande, Paris<br>
|
||
Copyright <20> 2009 Mateusz Loskot, Cadcorp, London<br>
|
||
</small>
|
||
</td>
|
||
</tr>
|
||
</tbody>
|
||
</table>
|
||
|
||
<address style="text-align: right;"><small>
|
||
Documentation is generated by <a href="http://www.doxygen.org/index.html">Doxygen</a>
|
||
</small></address>
|
||
</body>
|
||
</html>
|