mirror of
https://github.com/boostorg/geometry.git
synced 2025-05-12 14:01:47 +00:00
691 lines
53 KiB
HTML
691 lines
53 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/assemble.hpp</h1><a href="assemble_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_ASSEMBLE_HPP</span>
|
||
<a name="l00010"></a>00010 <span class="preprocessor"></span><span class="preprocessor">#define BOOST_GEOMETRY_ALGORITHMS_OVERLAY_ASSEMBLE_HPP</span>
|
||
<a name="l00011"></a>00011 <span class="preprocessor"></span>
|
||
<a name="l00012"></a>00012
|
||
<a name="l00013"></a>00013 <span class="preprocessor">#include <deque></span>
|
||
<a name="l00014"></a>00014
|
||
<a name="l00015"></a>00015 <span class="preprocessor">#include <boost/geometry/algorithms/detail/overlay/turn_info.hpp></span>
|
||
<a name="l00016"></a>00016 <span class="preprocessor">#include <boost/geometry/algorithms/detail/overlay/enrichment_info.hpp></span>
|
||
<a name="l00017"></a>00017 <span class="preprocessor">#include <boost/geometry/algorithms/detail/overlay/traversal_info.hpp></span>
|
||
<a name="l00018"></a>00018 <span class="preprocessor">#include <boost/geometry/algorithms/detail/overlay/calculate_distance_policy.hpp></span>
|
||
<a name="l00019"></a>00019
|
||
<a name="l00020"></a>00020 <span class="preprocessor">#include <<a class="code" href="get__turns_8hpp.html">boost/geometry/algorithms/overlay/get_turns.hpp</a>></span>
|
||
<a name="l00021"></a>00021 <span class="preprocessor">#include <<a class="code" href="enrich__intersection__points_8hpp.html">boost/geometry/algorithms/overlay/enrich_intersection_points.hpp</a>></span>
|
||
<a name="l00022"></a>00022 <span class="preprocessor">#include <<a class="code" href="traverse_8hpp.html">boost/geometry/algorithms/overlay/traverse.hpp</a>></span>
|
||
<a name="l00023"></a>00023
|
||
<a name="l00024"></a>00024 <span class="preprocessor">#include <<a class="code" href="sort__interior__rings_8hpp.html">boost/geometry/algorithms/overlay/sort_interior_rings.hpp</a>></span>
|
||
<a name="l00025"></a>00025
|
||
<a name="l00026"></a>00026 <span class="preprocessor">#include <<a class="code" href="convert_8hpp.html">boost/geometry/algorithms/convert.hpp</a>></span>
|
||
<a name="l00027"></a>00027 <span class="preprocessor">#include <<a class="code" href="algorithms_2num__points_8hpp.html">boost/geometry/algorithms/num_points.hpp</a>></span>
|
||
<a name="l00028"></a>00028 <span class="preprocessor">#include <<a class="code" href="algorithms_2within_8hpp.html">boost/geometry/algorithms/within.hpp</a>></span>
|
||
<a name="l00029"></a>00029
|
||
<a name="l00030"></a>00030 <span class="preprocessor">#include <<a class="code" href="point__on__border_8hpp.html">boost/geometry/algorithms/detail/point_on_border.hpp</a>></span>
|
||
<a name="l00031"></a>00031
|
||
<a name="l00032"></a>00032 <span class="preprocessor">#include <<a class="code" href="iterators_2range__type_8hpp.html">boost/geometry/iterators/range_type.hpp</a>></span>
|
||
<a name="l00033"></a>00033
|
||
<a name="l00034"></a>00034 <span class="preprocessor">#include <<a class="code" href="strategies_2intersection_8hpp.html">boost/geometry/strategies/intersection.hpp</a>></span>
|
||
<a name="l00035"></a>00035
|
||
<a name="l00036"></a>00036
|
||
<a name="l00037"></a>00037 <span class="keyword">namespace </span>boost { <span class="keyword">namespace </span>geometry
|
||
<a name="l00038"></a>00038 {
|
||
<a name="l00039"></a>00039
|
||
<a name="l00040"></a>00040
|
||
<a name="l00041"></a>00041 <span class="preprocessor">#ifndef DOXYGEN_NO_DETAIL</span>
|
||
<a name="l00042"></a>00042 <span class="preprocessor"></span><span class="keyword">namespace </span>detail { <span class="keyword">namespace </span>overlay {
|
||
<a name="l00043"></a>00043
|
||
<a name="l00044"></a>00044
|
||
<a name="l00045"></a>00045 <span class="comment">// Utility function</span>
|
||
<a name="l00046"></a>00046 <span class="keyword">template</span> <<span class="keyword">typename</span> GeometryOut, <span class="keyword">typename</span> Geometry, <span class="keyword">typename</span> OutputIterator>
|
||
<a name="l00047"></a>00047 <span class="keywordtype">void</span> convert_and_output(Geometry <span class="keyword">const</span>& geometry, OutputIterator& out)
|
||
<a name="l00048"></a>00048 {
|
||
<a name="l00049"></a>00049 <span class="comment">// How can we avoid the double copy here! It is really bad!</span>
|
||
<a name="l00050"></a>00050 <span class="comment">// We have to create a polygon, then copy it to the output iterator.</span>
|
||
<a name="l00051"></a>00051 <span class="comment">// Having an output-vector would have been better: append it to the vector!</span>
|
||
<a name="l00052"></a>00052 <span class="comment">// So output iterators are not that good.</span>
|
||
<a name="l00053"></a>00053
|
||
<a name="l00054"></a>00054 GeometryOut result;
|
||
<a name="l00055"></a>00055 <a class="code" href="group__convert.html#g84623f6ccaeba742bbebcdbc2c24ed05" title="Converts one geometry to another geometry.">geometry::convert</a>(geometry, result);
|
||
<a name="l00056"></a>00056 *out = result;
|
||
<a name="l00057"></a>00057 out++;
|
||
<a name="l00058"></a>00058 }
|
||
<a name="l00059"></a>00059
|
||
<a name="l00060"></a>00060
|
||
<a name="l00061"></a>00061
|
||
<a name="l00062"></a>00062
|
||
<a name="l00063"></a>00063 <span class="keyword">template</span>
|
||
<a name="l00064"></a>00064 <
|
||
<a name="l00065"></a>00065 <span class="keyword">typename</span> Tag1, <span class="keyword">typename</span> Geometry1,
|
||
<a name="l00066"></a>00066 <span class="keyword">typename</span> Tag2, <span class="keyword">typename</span> Geometry2, <span class="keyword">typename</span> GeometryOut,
|
||
<a name="l00067"></a>00067 <span class="keywordtype">int</span> Direction
|
||
<a name="l00068"></a>00068 >
|
||
<a name="l00069"></a>00069 <span class="keyword">struct </span>take_if_1_is_in_2
|
||
<a name="l00070"></a>00070 {};
|
||
<a name="l00071"></a>00071
|
||
<a name="l00072"></a>00072
|
||
<a name="l00073"></a>00073 <span class="keyword">template</span>
|
||
<a name="l00074"></a>00074 <
|
||
<a name="l00075"></a>00075 <span class="keywordtype">int</span> Direction,
|
||
<a name="l00076"></a>00076 <span class="keyword">typename</span> Geometry1, <span class="keyword">typename</span> Geometry2, <span class="keyword">typename</span> GeometryOut
|
||
<a name="l00077"></a>00077 >
|
||
<a name="l00078"></a>00078 <span class="keyword">inline</span> <span class="keywordtype">bool</span> take_one(Geometry1 <span class="keyword">const</span>& geometry1,
|
||
<a name="l00079"></a>00079 Geometry2 <span class="keyword">const</span>& geometry2,
|
||
<a name="l00080"></a>00080 GeometryOut& out
|
||
<a name="l00081"></a>00081 )
|
||
<a name="l00082"></a>00082 {
|
||
<a name="l00083"></a>00083 <span class="keyword">typename</span> geometry::point_type<Geometry1>::type point;
|
||
<a name="l00084"></a>00084 <a class="code" href="group__overlay.html#gae7e0d261c6df61cdba60d82bcd59b16" title="Take point on a border.">geometry::point_on_border</a>(geometry1, point);
|
||
<a name="l00085"></a>00085 <span class="keywordflow">if</span> (<a class="code" href="group__within.html#ge8d7fe4e3391e7e0cadf14cc23b7cec1" title="Within, examine if a geometry is within another geometry.">geometry::within</a>(point, geometry2))
|
||
<a name="l00086"></a>00086 {
|
||
<a name="l00087"></a>00087 take_if_1_is_in_2
|
||
<a name="l00088"></a>00088 <
|
||
<a name="l00089"></a>00089 <span class="keyword">typename</span> tag<Geometry1>::type, Geometry1,
|
||
<a name="l00090"></a>00090 <span class="keyword">typename</span> tag<Geometry2>::type, Geometry2,
|
||
<a name="l00091"></a>00091 GeometryOut, Direction
|
||
<a name="l00092"></a>00092 >::apply(geometry1, geometry2, out);
|
||
<a name="l00093"></a>00093 <span class="keywordflow">return</span> <span class="keyword">true</span>;
|
||
<a name="l00094"></a>00094 }
|
||
<a name="l00095"></a>00095 <span class="keywordflow">return</span> <span class="keyword">false</span>;
|
||
<a name="l00096"></a>00096 }
|
||
<a name="l00097"></a>00097
|
||
<a name="l00098"></a>00098
|
||
<a name="l00099"></a>00099 <span class="keyword">template</span>
|
||
<a name="l00100"></a>00100 <
|
||
<a name="l00101"></a>00101 <span class="keyword">typename</span> TagOut,
|
||
<a name="l00102"></a>00102 <span class="keyword">typename</span> Geometry, <span class="keyword">typename</span> GeometryOut,
|
||
<a name="l00103"></a>00103 <span class="keyword">typename</span> Container,
|
||
<a name="l00104"></a>00104 <span class="keywordtype">int</span> Direction
|
||
<a name="l00105"></a>00105 >
|
||
<a name="l00106"></a>00106 <span class="keyword">struct </span>add_holes
|
||
<a name="l00107"></a>00107 {
|
||
<a name="l00108"></a>00108 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(Geometry <span class="keyword">const</span>&, GeometryOut&, Container <span class="keyword">const</span>& holes)
|
||
<a name="l00109"></a>00109 {}
|
||
<a name="l00110"></a>00110 };
|
||
<a name="l00111"></a>00111
|
||
<a name="l00112"></a>00112
|
||
<a name="l00113"></a>00113
|
||
<a name="l00114"></a>00114 <span class="keyword">template</span>
|
||
<a name="l00115"></a>00115 <
|
||
<a name="l00116"></a>00116 <span class="keyword">typename</span> Geometry1, <span class="keyword">typename</span> Geometry2,
|
||
<a name="l00117"></a>00117 <span class="keyword">typename</span> OutputIterator, <span class="keyword">typename</span> GeometryOut,
|
||
<a name="l00118"></a>00118 <span class="keywordtype">int</span> Direction
|
||
<a name="l00119"></a>00119 >
|
||
<a name="l00120"></a>00120 <span class="keyword">struct </span>take_none_or_both
|
||
<a name="l00121"></a>00121 {
|
||
<a name="l00122"></a>00122 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(Geometry1 <span class="keyword">const</span>& geometry1,
|
||
<a name="l00123"></a>00123 Geometry2 <span class="keyword">const</span>& geometry2,
|
||
<a name="l00124"></a>00124 OutputIterator out
|
||
<a name="l00125"></a>00125 )
|
||
<a name="l00126"></a>00126 {
|
||
<a name="l00127"></a>00127 }
|
||
<a name="l00128"></a>00128
|
||
<a name="l00129"></a>00129 };
|
||
<a name="l00130"></a>00130
|
||
<a name="l00131"></a>00131
|
||
<a name="l00132"></a>00132 <span class="keyword">template</span>
|
||
<a name="l00133"></a>00133 <
|
||
<a name="l00134"></a>00134 <span class="keyword">typename</span> Tag, <span class="keyword">typename</span> GeometryOut,
|
||
<a name="l00135"></a>00135 <span class="keyword">typename</span> Container, <span class="keywordtype">int</span> Direction
|
||
<a name="l00136"></a>00136 >
|
||
<a name="l00137"></a>00137 <span class="keyword">struct </span>assemble_rings
|
||
<a name="l00138"></a>00138 {
|
||
<a name="l00139"></a>00139 <span class="keyword">template</span> <<span class="keyword">typename</span> OutputIterator>
|
||
<a name="l00140"></a>00140 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(Container <span class="keyword">const</span>& rings,
|
||
<a name="l00141"></a>00141 Container <span class="keyword">const</span>& ni_holes,
|
||
<a name="l00142"></a>00142 OutputIterator out)
|
||
<a name="l00143"></a>00143 {}
|
||
<a name="l00144"></a>00144 };
|
||
<a name="l00145"></a>00145
|
||
<a name="l00146"></a>00146
|
||
<a name="l00147"></a>00147 <span class="keyword">template</span>
|
||
<a name="l00148"></a>00148 <
|
||
<a name="l00149"></a>00149 <span class="keyword">typename</span> GeometryOut, <span class="keyword">typename</span> Container, <span class="keywordtype">int</span> Direction
|
||
<a name="l00150"></a>00150 >
|
||
<a name="l00151"></a>00151 <span class="keyword">struct </span>assemble_rings<polygon_tag, GeometryOut, Container, Direction>
|
||
<a name="l00152"></a>00152 {
|
||
<a name="l00153"></a>00153 <span class="keyword">typedef</span> <span class="keyword">typename</span> boost::range_value<Container>::type ring_type;
|
||
<a name="l00154"></a>00154 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::point_type<ring_type>::type point_type;
|
||
<a name="l00155"></a>00155
|
||
<a name="l00156"></a>00156 <span class="keyword">template</span> <<span class="keyword">typename</span> OutputIterator>
|
||
<a name="l00157"></a>00157 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(Container <span class="keyword">const</span>& rings,
|
||
<a name="l00158"></a>00158 Container <span class="keyword">const</span>& ni_holes,
|
||
<a name="l00159"></a>00159 OutputIterator out)
|
||
<a name="l00160"></a>00160 {
|
||
<a name="l00161"></a>00161 std::vector<sortable> sorted_rings;
|
||
<a name="l00162"></a>00162 sort_interior_rings(rings, sorted_rings, 1);
|
||
<a name="l00163"></a>00163
|
||
<a name="l00164"></a>00164 <span class="comment">// Add polygons, and holes</span>
|
||
<a name="l00165"></a>00165 <span class="keywordflow">for</span> (std::vector<sortable>::const_iterator
|
||
<a name="l00166"></a>00166 rit = boost::begin(sorted_rings);
|
||
<a name="l00167"></a>00167 rit != boost::end(sorted_rings);
|
||
<a name="l00168"></a>00168 ++rit)
|
||
<a name="l00169"></a>00169 {
|
||
<a name="l00170"></a>00170 <span class="keywordflow">if</span> (rit->index_of_parent == -1)
|
||
<a name="l00171"></a>00171 {
|
||
<a name="l00172"></a>00172 GeometryOut result;
|
||
<a name="l00173"></a>00173 <a class="code" href="group__convert.html#g84623f6ccaeba742bbebcdbc2c24ed05" title="Converts one geometry to another geometry.">geometry::convert</a>(rings[rit->index], result);
|
||
<a name="l00174"></a>00174
|
||
<a name="l00175"></a>00175 <span class="comment">// Add holes (direction is OK, so no reverse)</span>
|
||
<a name="l00176"></a>00176 std::vector<int> <span class="keyword">const</span>& holes = rit->index_of_holes;
|
||
<a name="l00177"></a>00177 <span class="keywordflow">for</span> (std::vector<int>::const_iterator hit = holes.begin();
|
||
<a name="l00178"></a>00178 hit != holes.end();
|
||
<a name="l00179"></a>00179 ++hit)
|
||
<a name="l00180"></a>00180 {
|
||
<a name="l00181"></a>00181 <span class="comment">//interior_rings(result).push_back(rings[*hit]);</span>
|
||
<a name="l00182"></a>00182 *(std::back_inserter(<a class="code" href="group__access.html#g5af585b056bb80bf3dfe7c07ad30d84a" title="Function to get the interior rings of a polygon (non const version).">interior_rings</a>(result))++) = rings[*hit];
|
||
<a name="l00183"></a>00183 }
|
||
<a name="l00184"></a>00184
|
||
<a name="l00185"></a>00185 <span class="comment">// Add also all non-intersecting-inner-holes</span>
|
||
<a name="l00186"></a>00186 add_holes
|
||
<a name="l00187"></a>00187 <
|
||
<a name="l00188"></a>00188 polygon_tag,
|
||
<a name="l00189"></a>00189 ring_type, GeometryOut, Container,
|
||
<a name="l00190"></a>00190 Direction
|
||
<a name="l00191"></a>00191 >::apply(rings[rit->index], result, ni_holes);
|
||
<a name="l00192"></a>00192
|
||
<a name="l00193"></a>00193 *out = result;
|
||
<a name="l00194"></a>00194 out++;
|
||
<a name="l00195"></a>00195 }
|
||
<a name="l00196"></a>00196 }
|
||
<a name="l00197"></a>00197 }
|
||
<a name="l00198"></a>00198 };
|
||
<a name="l00199"></a>00199
|
||
<a name="l00200"></a>00200
|
||
<a name="l00201"></a>00201 <span class="keyword">template</span>
|
||
<a name="l00202"></a>00202 <
|
||
<a name="l00203"></a>00203 <span class="keyword">typename</span> GeometryOut, <span class="keyword">typename</span> Container, <span class="keywordtype">int</span> Direction
|
||
<a name="l00204"></a>00204 >
|
||
<a name="l00205"></a>00205 <span class="keyword">struct </span>assemble_rings<ring_tag, GeometryOut, Container, Direction>
|
||
<a name="l00206"></a>00206 {
|
||
<a name="l00207"></a>00207 <span class="keyword">typedef</span> <span class="keyword">typename</span> boost::range_value<Container>::type ring_type;
|
||
<a name="l00208"></a>00208 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::point_type<ring_type>::type point_type;
|
||
<a name="l00209"></a>00209
|
||
<a name="l00210"></a>00210 <span class="keyword">template</span> <<span class="keyword">typename</span> OutputIterator>
|
||
<a name="l00211"></a>00211 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(Container <span class="keyword">const</span>& rings,
|
||
<a name="l00212"></a>00212 Container <span class="keyword">const</span>& ni_holes,
|
||
<a name="l00213"></a>00213 OutputIterator out)
|
||
<a name="l00214"></a>00214 {
|
||
<a name="l00215"></a>00215 <span class="comment">// Add positive rings, ignore all holes</span>
|
||
<a name="l00216"></a>00216 <span class="keywordflow">for</span> (<span class="keyword">typename</span> boost::range_const_iterator<Container>::type
|
||
<a name="l00217"></a>00217 it = boost::begin(rings);
|
||
<a name="l00218"></a>00218 it != boost::end(rings);
|
||
<a name="l00219"></a>00219 ++it)
|
||
<a name="l00220"></a>00220 {
|
||
<a name="l00221"></a>00221 <span class="keywordflow">if</span> (<a class="code" href="group__area.html#gd0e9e99685a9d45895162bd1fd96a136" title="Calculate area of a geometry.">geometry::area</a>(*it) > 0)
|
||
<a name="l00222"></a>00222 {
|
||
<a name="l00223"></a>00223 convert_and_output<GeometryOut>(*it, out);
|
||
<a name="l00224"></a>00224 }
|
||
<a name="l00225"></a>00225 }
|
||
<a name="l00226"></a>00226 }
|
||
<a name="l00227"></a>00227 };
|
||
<a name="l00228"></a>00228
|
||
<a name="l00229"></a>00229
|
||
<a name="l00230"></a>00230
|
||
<a name="l00231"></a>00231 <span class="keyword">template</span><<span class="keyword">typename</span> Tag>
|
||
<a name="l00232"></a>00232 <span class="keyword">struct </span>get_disjoint_or_equal_holes
|
||
<a name="l00233"></a>00233 {
|
||
<a name="l00234"></a>00234 <span class="keyword">template</span>
|
||
<a name="l00235"></a>00235 <
|
||
<a name="l00236"></a>00236 <span class="keyword">typename</span> Polygon,
|
||
<a name="l00237"></a>00237 <span class="keyword">typename</span> IntersectMap, <span class="keyword">typename</span> HoleContainer
|
||
<a name="l00238"></a>00238 >
|
||
<a name="l00239"></a>00239 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(<span class="keywordtype">int</span>, Polygon <span class="keyword">const</span>&, <span class="keywordtype">int</span>,
|
||
<a name="l00240"></a>00240 IntersectMap <span class="keyword">const</span>&, HoleContainer&)
|
||
<a name="l00241"></a>00241 {
|
||
<a name="l00242"></a>00242 }
|
||
<a name="l00243"></a>00243 };
|
||
<a name="l00244"></a>00244
|
||
<a name="l00245"></a>00245
|
||
<a name="l00246"></a>00246 <span class="keyword">template</span><>
|
||
<a name="l00247"></a>00247 <span class="keyword">struct </span>get_disjoint_or_equal_holes<polygon_tag>
|
||
<a name="l00248"></a>00248 {
|
||
<a name="l00249"></a>00249 <span class="keyword">template</span>
|
||
<a name="l00250"></a>00250 <
|
||
<a name="l00251"></a>00251 <span class="keyword">typename</span> Polygon,
|
||
<a name="l00252"></a>00252 <span class="keyword">typename</span> IntersectMap, <span class="keyword">typename</span> HoleContainer
|
||
<a name="l00253"></a>00253 >
|
||
<a name="l00254"></a>00254 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(<span class="keywordtype">int</span> direction, Polygon <span class="keyword">const</span>& polygon, <span class="keywordtype">int</span> source_index,
|
||
<a name="l00255"></a>00255 IntersectMap <span class="keyword">const</span>& map, HoleContainer& holes)
|
||
<a name="l00256"></a>00256 {
|
||
<a name="l00257"></a>00257 <span class="keywordtype">int</span> ring_index = 0;
|
||
<a name="l00258"></a>00258 <span class="keywordflow">for</span> (<span class="keyword">typename</span> boost::range_const_iterator
|
||
<a name="l00259"></a>00259 <
|
||
<a name="l00260"></a>00260 <span class="keyword">typename</span> interior_type<Polygon>::type
|
||
<a name="l00261"></a>00261 >::type rit = 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="l00262"></a>00262 rit != 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="l00263"></a>00263 ++rit, ++ring_index)
|
||
<a name="l00264"></a>00264 {
|
||
<a name="l00265"></a>00265 <span class="comment">// If this is from this source</span>
|
||
<a name="l00266"></a>00266 <span class="comment">// not intersecting anymore (equal, 1) and from first source,</span>
|
||
<a name="l00267"></a>00267 <span class="comment">// OR if not found at all (disjoint)</span>
|
||
<a name="l00268"></a>00268 <span class="comment">// this ring can be added.</span>
|
||
<a name="l00269"></a>00269 <span class="comment">// For a UNION, don't add equal holes</span>
|
||
<a name="l00270"></a>00270 <span class="keyword">typename</span> IntersectMap::const_iterator it
|
||
<a name="l00271"></a>00271 = map.find(std::make_pair<int,int>(source_index, ring_index));
|
||
<a name="l00272"></a>00272 <span class="keywordflow">if</span> (it == map.end()
|
||
<a name="l00273"></a>00273 || (it->second == 1 && source_index == 0)
|
||
<a name="l00274"></a>00274 )
|
||
<a name="l00275"></a>00275 {
|
||
<a name="l00276"></a>00276 <span class="comment">// Don't pushback, it might be of different type.</span>
|
||
<a name="l00277"></a>00277 holes.resize(holes.size() + 1);
|
||
<a name="l00278"></a>00278 <a class="code" href="group__convert.html#g84623f6ccaeba742bbebcdbc2c24ed05" title="Converts one geometry to another geometry.">geometry::convert</a>(*rit, holes.back());
|
||
<a name="l00279"></a>00279 }
|
||
<a name="l00280"></a>00280 }
|
||
<a name="l00281"></a>00281 }
|
||
<a name="l00282"></a>00282 };
|
||
<a name="l00283"></a>00283
|
||
<a name="l00284"></a>00284
|
||
<a name="l00285"></a>00285 <span class="keyword">template</span><<span class="keyword">typename</span> Tag>
|
||
<a name="l00286"></a>00286 <span class="keyword">struct </span>get_intersect_codes
|
||
<a name="l00287"></a>00287 {
|
||
<a name="l00288"></a>00288 <span class="keyword">template</span>
|
||
<a name="l00289"></a>00289 <
|
||
<a name="l00290"></a>00290 <span class="keyword">typename</span> Polygon,
|
||
<a name="l00291"></a>00291 <span class="keyword">typename</span> IpContainer, <span class="keyword">typename</span> IntersectMap
|
||
<a name="l00292"></a>00292 >
|
||
<a name="l00293"></a>00293 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(Polygon <span class="keyword">const</span>&, <span class="keywordtype">int</span>,
|
||
<a name="l00294"></a>00294 IpContainer <span class="keyword">const</span>&, IntersectMap&, <span class="keywordtype">int</span>)
|
||
<a name="l00295"></a>00295 {
|
||
<a name="l00296"></a>00296 }
|
||
<a name="l00297"></a>00297 };
|
||
<a name="l00298"></a>00298
|
||
<a name="l00299"></a>00299
|
||
<a name="l00300"></a>00300 <span class="keyword">template</span><>
|
||
<a name="l00301"></a>00301 <span class="keyword">struct </span>get_intersect_codes<polygon_tag>
|
||
<a name="l00302"></a>00302 {
|
||
<a name="l00303"></a>00303 <span class="keyword">template</span>
|
||
<a name="l00304"></a>00304 <
|
||
<a name="l00305"></a>00305 <span class="keyword">typename</span> Polygon,
|
||
<a name="l00306"></a>00306 <span class="keyword">typename</span> IpContainer, <span class="keyword">typename</span> IntersectMap
|
||
<a name="l00307"></a>00307 >
|
||
<a name="l00308"></a>00308 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(Polygon <span class="keyword">const</span>& polygon, <span class="keywordtype">int</span> source_index,
|
||
<a name="l00309"></a>00309 IpContainer <span class="keyword">const</span>& ips,
|
||
<a name="l00310"></a>00310 IntersectMap& intersect_map, <span class="keywordtype">int</span> code)
|
||
<a name="l00311"></a>00311 {
|
||
<a name="l00312"></a>00312 <span class="keyword">typedef</span> <span class="keyword">typename</span> boost::range_value<IpContainer>::type ip_type;
|
||
<a name="l00313"></a>00313 <span class="keyword">typedef</span> <span class="keyword">typename</span> boost::range_const_iterator<IpContainer>::type iterator_type;
|
||
<a name="l00314"></a>00314 <span class="keyword">typedef</span> <span class="keyword">typename</span> ip_type::traversal_vector vector_type;
|
||
<a name="l00315"></a>00315 <span class="keyword">typedef</span> <span class="keyword">typename</span> boost::range_const_iterator<vector_type>::type tvit_type;
|
||
<a name="l00316"></a>00316
|
||
<a name="l00317"></a>00317 <span class="comment">// Check all IP's and set code of corresponding rings</span>
|
||
<a name="l00318"></a>00318 <span class="keywordflow">for</span> (iterator_type it = boost::begin(ips);
|
||
<a name="l00319"></a>00319 it != boost::end(ips);
|
||
<a name="l00320"></a>00320 ++it)
|
||
<a name="l00321"></a>00321 {
|
||
<a name="l00322"></a>00322 <span class="keywordflow">for</span> (tvit_type tvit = boost::begin(it->turns);
|
||
<a name="l00323"></a>00323 tvit != boost::end(it->turns);
|
||
<a name="l00324"></a>00324 ++tvit)
|
||
<a name="l00325"></a>00325 {
|
||
<a name="l00326"></a>00326 <span class="keywordflow">if</span> (tvit->seg_id.source_index == source_index)
|
||
<a name="l00327"></a>00327 {
|
||
<a name="l00328"></a>00328 intersect_map[
|
||
<a name="l00329"></a>00329 std::make_pair<int, int>(
|
||
<a name="l00330"></a>00330 source_index, tvit->seg_id.ring_index)
|
||
<a name="l00331"></a>00331 ] = code;
|
||
<a name="l00332"></a>00332 }
|
||
<a name="l00333"></a>00333 }
|
||
<a name="l00334"></a>00334 }
|
||
<a name="l00335"></a>00335 }
|
||
<a name="l00336"></a>00336 };
|
||
<a name="l00337"></a>00337
|
||
<a name="l00338"></a>00338
|
||
<a name="l00339"></a>00339
|
||
<a name="l00340"></a>00340
|
||
<a name="l00341"></a>00341 <span class="keyword">template</span><<span class="keyword">typename</span> Tag1, <span class="keyword">typename</span> Tag2>
|
||
<a name="l00342"></a>00342 <span class="keyword">struct </span>get_exterior_ring
|
||
<a name="l00343"></a>00343 {
|
||
<a name="l00344"></a>00344 <span class="keyword">template</span>
|
||
<a name="l00345"></a>00345 <
|
||
<a name="l00346"></a>00346 <span class="keyword">typename</span> Polygon1, <span class="keyword">typename</span> Polygon2,
|
||
<a name="l00347"></a>00347 <span class="keyword">typename</span> Map, <span class="keyword">typename</span> RingContainer
|
||
<a name="l00348"></a>00348 >
|
||
<a name="l00349"></a>00349 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(Polygon1 <span class="keyword">const</span>&, Polygon2 <span class="keyword">const</span>& ,
|
||
<a name="l00350"></a>00350 Map <span class="keyword">const</span>& , RingContainer& , <span class="keywordtype">int</span>)
|
||
<a name="l00351"></a>00351 {}
|
||
<a name="l00352"></a>00352 };
|
||
<a name="l00353"></a>00353
|
||
<a name="l00354"></a>00354 <span class="keyword">template</span><>
|
||
<a name="l00355"></a>00355 <span class="keyword">struct </span>get_exterior_ring<ring_tag, ring_tag>
|
||
<a name="l00356"></a>00356 {
|
||
<a name="l00357"></a>00357 <span class="keyword">template</span>
|
||
<a name="l00358"></a>00358 <
|
||
<a name="l00359"></a>00359 <span class="keyword">typename</span> Ring1, <span class="keyword">typename</span> Ring2,
|
||
<a name="l00360"></a>00360 <span class="keyword">typename</span> Map, <span class="keyword">typename</span> RingContainer
|
||
<a name="l00361"></a>00361 >
|
||
<a name="l00362"></a>00362 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(Ring1 <span class="keyword">const</span>& ring1,
|
||
<a name="l00363"></a>00363 Ring2 <span class="keyword">const</span>& ring2, Map <span class="keyword">const</span>& intersect_codes,
|
||
<a name="l00364"></a>00364 RingContainer& output, <span class="keywordtype">int</span> direction)
|
||
<a name="l00365"></a>00365 {
|
||
<a name="l00366"></a>00366 <span class="comment">// If the outer rings are EQUAL (and inners are not), IP's are merged away but</span>
|
||
<a name="l00367"></a>00367 <span class="comment">// one of them should still be included in the output.</span>
|
||
<a name="l00368"></a>00368 <span class="keyword">typename</span> Map::const_iterator it
|
||
<a name="l00369"></a>00369 = intersect_codes.find(std::make_pair<int,int>(0, -1));
|
||
<a name="l00370"></a>00370 <span class="keywordflow">if</span> (it != intersect_codes.end())
|
||
<a name="l00371"></a>00371 {
|
||
<a name="l00372"></a>00372 <span class="keywordflow">if</span> (it->second == 1)
|
||
<a name="l00373"></a>00373 {
|
||
<a name="l00374"></a>00374 <span class="comment">// Add the outer ring of one of them (they are equal)</span>
|
||
<a name="l00375"></a>00375 output.resize(output.size() + 1);
|
||
<a name="l00376"></a>00376 <a class="code" href="group__convert.html#g84623f6ccaeba742bbebcdbc2c24ed05" title="Converts one geometry to another geometry.">geometry::convert</a>(ring1, output.back());
|
||
<a name="l00377"></a>00377 }
|
||
<a name="l00378"></a>00378 }
|
||
<a name="l00379"></a>00379 <span class="keywordflow">else</span>
|
||
<a name="l00380"></a>00380 {
|
||
<a name="l00381"></a>00381 output.resize(output.size() + 1);
|
||
<a name="l00382"></a>00382
|
||
<a name="l00383"></a>00383 <span class="comment">// It was never intersected, but holes are (otherwise we would not be here).</span>
|
||
<a name="l00384"></a>00384 <span class="comment">// Like "take_one" but here only exterior ring</span>
|
||
<a name="l00385"></a>00385
|
||
<a name="l00386"></a>00386 <span class="comment">// TODO: make this area_result</span>
|
||
<a name="l00387"></a>00387 <span class="keywordtype">double</span> area1 = <a class="code" href="group__area.html#gd0e9e99685a9d45895162bd1fd96a136" title="Calculate area of a geometry.">geometry::area</a>(ring1);
|
||
<a name="l00388"></a>00388 <span class="keywordtype">double</span> area2 = <a class="code" href="group__area.html#gd0e9e99685a9d45895162bd1fd96a136" title="Calculate area of a geometry.">geometry::area</a>(ring2);
|
||
<a name="l00389"></a>00389 <span class="keywordflow">if</span> (direction == 1 && area1 > area2)
|
||
<a name="l00390"></a>00390 {
|
||
<a name="l00391"></a>00391 <a class="code" href="group__convert.html#g84623f6ccaeba742bbebcdbc2c24ed05" title="Converts one geometry to another geometry.">geometry::convert</a>(ring1, output.back());
|
||
<a name="l00392"></a>00392 }
|
||
<a name="l00393"></a>00393 <span class="keywordflow">else</span>
|
||
<a name="l00394"></a>00394 {
|
||
<a name="l00395"></a>00395 <a class="code" href="group__convert.html#g84623f6ccaeba742bbebcdbc2c24ed05" title="Converts one geometry to another geometry.">geometry::convert</a>(ring2, output.back());
|
||
<a name="l00396"></a>00396 }
|
||
<a name="l00397"></a>00397 }
|
||
<a name="l00398"></a>00398 }
|
||
<a name="l00399"></a>00399 };
|
||
<a name="l00400"></a>00400
|
||
<a name="l00401"></a>00401
|
||
<a name="l00402"></a>00402 <span class="keyword">template</span><>
|
||
<a name="l00403"></a>00403 <span class="keyword">struct </span>get_exterior_ring<polygon_tag, polygon_tag>
|
||
<a name="l00404"></a>00404 {
|
||
<a name="l00405"></a>00405 <span class="keyword">template</span>
|
||
<a name="l00406"></a>00406 <
|
||
<a name="l00407"></a>00407 <span class="keyword">typename</span> Polygon1, <span class="keyword">typename</span> Polygon2,
|
||
<a name="l00408"></a>00408 <span class="keyword">typename</span> Map, <span class="keyword">typename</span> RingContainer
|
||
<a name="l00409"></a>00409 >
|
||
<a name="l00410"></a>00410 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(Polygon1 <span class="keyword">const</span>& polygon1,
|
||
<a name="l00411"></a>00411 Polygon2 <span class="keyword">const</span>& polygon2, Map <span class="keyword">const</span>& intersect_codes,
|
||
<a name="l00412"></a>00412 RingContainer& output, <span class="keywordtype">int</span> direction)
|
||
<a name="l00413"></a>00413 {
|
||
<a name="l00414"></a>00414 <span class="keywordflow">return</span> get_exterior_ring<ring_tag, ring_tag>
|
||
<a name="l00415"></a>00415 ::apply(<a class="code" href="group__access.html#gd96ba07cd3c6c3216bd5ab69adc9ccb5" title="Function to get the exterior_ring ring of a polygon.">exterior_ring</a>(polygon1), <a class="code" href="group__access.html#gd96ba07cd3c6c3216bd5ab69adc9ccb5" title="Function to get the exterior_ring ring of a polygon.">exterior_ring</a>(polygon2),
|
||
<a name="l00416"></a>00416 intersect_codes, output, direction);
|
||
<a name="l00417"></a>00417 }
|
||
<a name="l00418"></a>00418 };
|
||
<a name="l00419"></a>00419
|
||
<a name="l00420"></a>00420
|
||
<a name="l00421"></a>00421 <span class="keyword">template</span><>
|
||
<a name="l00422"></a>00422 <span class="keyword">struct </span>get_exterior_ring<polygon_tag, ring_tag>
|
||
<a name="l00423"></a>00423 {
|
||
<a name="l00424"></a>00424 <span class="keyword">template</span>
|
||
<a name="l00425"></a>00425 <
|
||
<a name="l00426"></a>00426 <span class="keyword">typename</span> Polygon, <span class="keyword">typename</span> Ring,
|
||
<a name="l00427"></a>00427 <span class="keyword">typename</span> Map, <span class="keyword">typename</span> RingContainer
|
||
<a name="l00428"></a>00428 >
|
||
<a name="l00429"></a>00429 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> apply(Polygon <span class="keyword">const</span>& polygon,
|
||
<a name="l00430"></a>00430 Ring <span class="keyword">const</span>& ring, Map <span class="keyword">const</span>& intersect_codes,
|
||
<a name="l00431"></a>00431 RingContainer& output, <span class="keywordtype">int</span> direction)
|
||
<a name="l00432"></a>00432 {
|
||
<a name="l00433"></a>00433 <span class="keywordflow">return</span> get_exterior_ring<ring_tag, ring_tag>
|
||
<a name="l00434"></a>00434 ::apply(<a class="code" href="group__access.html#gd96ba07cd3c6c3216bd5ab69adc9ccb5" title="Function to get the exterior_ring ring of a polygon.">exterior_ring</a>(polygon), ring,
|
||
<a name="l00435"></a>00435 intersect_codes, output, direction);
|
||
<a name="l00436"></a>00436 }
|
||
<a name="l00437"></a>00437 };
|
||
<a name="l00438"></a>00438
|
||
<a name="l00439"></a>00439
|
||
<a name="l00440"></a>00440
|
||
<a name="l00441"></a>00441 <span class="keyword">template</span>
|
||
<a name="l00442"></a>00442 <
|
||
<a name="l00443"></a>00443 <span class="keyword">typename</span> Geometry1, <span class="keyword">typename</span> Geometry2,
|
||
<a name="l00444"></a>00444 <span class="keyword">typename</span> OutputIterator, <span class="keyword">typename</span> GeometryOut,
|
||
<a name="l00445"></a>00445 <span class="keywordtype">int</span> Direction,
|
||
<a name="l00446"></a>00446 <span class="keyword">typename</span> Strategy
|
||
<a name="l00447"></a>00447 >
|
||
<a name="l00448"></a>00448 <span class="keyword">struct </span>overlay_and_assemble
|
||
<a name="l00449"></a>00449 {
|
||
<a name="l00450"></a>00450 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::tag<Geometry1>::type tag1;
|
||
<a name="l00451"></a>00451 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::tag<Geometry2>::type tag2;
|
||
<a name="l00452"></a>00452 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::tag<GeometryOut>::type tag_out;
|
||
<a name="l00453"></a>00453
|
||
<a name="l00454"></a>00454 <span class="keyword">static</span> <span class="keyword">inline</span> OutputIterator apply(Geometry1 <span class="keyword">const</span>& geometry1,
|
||
<a name="l00455"></a>00455 Geometry2 <span class="keyword">const</span>& geometry2, OutputIterator out,
|
||
<a name="l00456"></a>00456 Strategy <span class="keyword">const</span>& strategy)
|
||
<a name="l00457"></a>00457 {
|
||
<a name="l00458"></a>00458 <span class="keywordflow">if</span> (<a class="code" href="group__access.html#g1895ea653bf59866650b18cdb047eed1" title="get number of points">geometry::num_points</a>(geometry1) == 0
|
||
<a name="l00459"></a>00459 || <a class="code" href="group__access.html#g1895ea653bf59866650b18cdb047eed1" title="get number of points">geometry::num_points</a>(geometry2) == 0)
|
||
<a name="l00460"></a>00460 {
|
||
<a name="l00461"></a>00461 <span class="keywordflow">return</span> out;
|
||
<a name="l00462"></a>00462 }
|
||
<a name="l00463"></a>00463
|
||
<a name="l00464"></a>00464 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::point_type<GeometryOut>::type point_type;
|
||
<a name="l00465"></a>00465
|
||
<a name="l00466"></a>00466
|
||
<a name="l00467"></a>00467 <span class="keyword">typedef</span> detail::overlay::traversal_turn_info<point_type> turn_info;
|
||
<a name="l00468"></a>00468 <span class="keyword">typedef</span> std::deque<turn_info> container_type;
|
||
<a name="l00469"></a>00469
|
||
<a name="l00470"></a>00470 <span class="comment">// "Abuse" rangetype for ringtype: for polygon, it is the type of the</span>
|
||
<a name="l00471"></a>00471 <span class="comment">// exterior ring. For ring, it is the ring itself. That is what is</span>
|
||
<a name="l00472"></a>00472 <span class="comment">// wished here as well.</span>
|
||
<a name="l00473"></a>00473 <span class="keyword">typedef</span> <span class="keyword">typename</span> geometry::range_type<GeometryOut>::type ring_type;
|
||
<a name="l00474"></a>00474 <span class="keyword">typedef</span> std::vector<ring_type> hole_vector_type;
|
||
<a name="l00475"></a>00475
|
||
<a name="l00476"></a>00476 container_type ips; <span class="comment">// intersection points</span>
|
||
<a name="l00477"></a>00477
|
||
<a name="l00478"></a>00478 boost::geometry::get_turns<detail::overlay::CalculateDistancePolicy>(geometry1, geometry2, ips);
|
||
<a name="l00479"></a>00479 <span class="keywordtype">bool</span> had_ips = ips.size() > 0;
|
||
<a name="l00480"></a>00480
|
||
<a name="l00481"></a>00481 <span class="comment">// Gather non-intersecting exterior / interior rings</span>
|
||
<a name="l00482"></a>00482 <span class="comment">// Map from [source_index,ring_index] to code</span>
|
||
<a name="l00483"></a>00483 <span class="comment">// [1=intersecting, 2=intersecting after merging]</span>
|
||
<a name="l00484"></a>00484 <span class="keyword">typedef</span> std::map<std::pair<int, int>, <span class="keywordtype">int</span>> intersect_map;
|
||
<a name="l00485"></a>00485 intersect_map intersect_codes;
|
||
<a name="l00486"></a>00486
|
||
<a name="l00487"></a>00487 <span class="comment">// Get codes (before merging)</span>
|
||
<a name="l00488"></a>00488 get_intersect_codes<tag1>::apply(geometry1, 0, ips, intersect_codes, 1);
|
||
<a name="l00489"></a>00489 get_intersect_codes<tag2>::apply(geometry2, 1, ips, intersect_codes, 1);
|
||
<a name="l00490"></a>00490
|
||
<a name="l00491"></a>00491 <span class="keyword">typename</span> Strategy::side_strategy_type side_strategy;
|
||
<a name="l00492"></a>00492
|
||
<a name="l00493"></a>00493 <span class="comment">// Get new codes (after merging)</span>
|
||
<a name="l00494"></a>00494 get_intersect_codes<tag1>::apply(geometry1, 0, ips, intersect_codes, 2);
|
||
<a name="l00495"></a>00495 get_intersect_codes<tag2>::apply(geometry2, 1, ips, intersect_codes, 2);
|
||
<a name="l00496"></a>00496
|
||
<a name="l00497"></a>00497 <span class="comment">// Doc to be updated and moved to Paper!</span>
|
||
<a name="l00498"></a>00498 <span class="comment">// If there are no IP-s at all, check if one point is in other geometry</span>
|
||
<a name="l00499"></a>00499 <span class="comment">// (both geometries have points, see check above)</span>
|
||
<a name="l00500"></a>00500 <span class="comment">// If yes, take the correct one</span>
|
||
<a name="l00501"></a>00501
|
||
<a name="l00502"></a>00502 <span class="comment">// (which depends on intersection/union)</span>
|
||
<a name="l00503"></a>00503 <span class="comment">// If both are unrelated, take none (intersection) or both (union)</span>
|
||
<a name="l00504"></a>00504
|
||
<a name="l00505"></a>00505 <span class="comment">// If there are disjoint or containing holes:</span>
|
||
<a name="l00506"></a>00506 <span class="comment">// - Hole of A can be within hole of B</span>
|
||
<a name="l00507"></a>00507 <span class="comment">// - for union: take hole of A</span>
|
||
<a name="l00508"></a>00508 <span class="comment">// - for intersection: take hole of B</span>
|
||
<a name="l00509"></a>00509 <span class="comment">// - Hole of A can be disjoint from B</span>
|
||
<a name="l00510"></a>00510 <span class="comment">// - for union: remove those holes</span>
|
||
<a name="l00511"></a>00511 <span class="comment">// - for intersection: take all those holes</span>
|
||
<a name="l00512"></a>00512 <span class="comment">// -> generic procedure</span>
|
||
<a name="l00513"></a>00513 <span class="comment">// - Collect all holes in one vector</span>
|
||
<a name="l00514"></a>00514 <span class="comment">// - Sort them on decreasing area</span>
|
||
<a name="l00515"></a>00515 <span class="comment">// - Check if one is within a larger one,</span>
|
||
<a name="l00516"></a>00516 <span class="comment">// - if yes, take one of them</span>
|
||
<a name="l00517"></a>00517 <span class="comment">// - if no, take all, or none of them</span>
|
||
<a name="l00518"></a>00518
|
||
<a name="l00519"></a>00519 <span class="comment">// END DOC</span>
|
||
<a name="l00520"></a>00520
|
||
<a name="l00521"></a>00521 <span class="comment">// Gather disjoint or equal holes</span>
|
||
<a name="l00522"></a>00522 hole_vector_type ni_holes;
|
||
<a name="l00523"></a>00523 get_disjoint_or_equal_holes<tag1>::apply(Direction, geometry1, 0, intersect_codes, ni_holes);
|
||
<a name="l00524"></a>00524 get_disjoint_or_equal_holes<tag2>::apply(Direction, geometry2, 1, intersect_codes, ni_holes);
|
||
<a name="l00525"></a>00525
|
||
<a name="l00526"></a>00526 <span class="keywordflow">if</span> (! had_ips && ips.size() <= 0)
|
||
<a name="l00527"></a>00527 {
|
||
<a name="l00528"></a>00528 <span class="comment">// No intersections or collinearies found</span>
|
||
<a name="l00529"></a>00529 GeometryOut result;
|
||
<a name="l00530"></a>00530 <span class="keywordflow">if</span> (take_one<Direction>(geometry1, geometry2, result))
|
||
<a name="l00531"></a>00531 {
|
||
<a name="l00532"></a>00532 add_holes
|
||
<a name="l00533"></a>00533 <
|
||
<a name="l00534"></a>00534 tag_out, Geometry1, GeometryOut, hole_vector_type,
|
||
<a name="l00535"></a>00535 Direction
|
||
<a name="l00536"></a>00536 >::apply(geometry1, result, ni_holes);
|
||
<a name="l00537"></a>00537 *out = result;
|
||
<a name="l00538"></a>00538 out++;
|
||
<a name="l00539"></a>00539 }
|
||
<a name="l00540"></a>00540 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (take_one<Direction>(geometry2, geometry1, result))
|
||
<a name="l00541"></a>00541 {
|
||
<a name="l00542"></a>00542 add_holes
|
||
<a name="l00543"></a>00543 <
|
||
<a name="l00544"></a>00544 tag_out,
|
||
<a name="l00545"></a>00545 Geometry2, GeometryOut, hole_vector_type,
|
||
<a name="l00546"></a>00546 Direction
|
||
<a name="l00547"></a>00547 >::apply(geometry2, result, ni_holes);
|
||
<a name="l00548"></a>00548 *out = result;
|
||
<a name="l00549"></a>00549 out++;
|
||
<a name="l00550"></a>00550 }
|
||
<a name="l00551"></a>00551 <span class="keywordflow">else</span>
|
||
<a name="l00552"></a>00552 {
|
||
<a name="l00553"></a>00553 take_none_or_both
|
||
<a name="l00554"></a>00554 <
|
||
<a name="l00555"></a>00555 Geometry1, Geometry2,
|
||
<a name="l00556"></a>00556 OutputIterator, GeometryOut,
|
||
<a name="l00557"></a>00557 Direction
|
||
<a name="l00558"></a>00558 >::apply(geometry1, geometry2, out);
|
||
<a name="l00559"></a>00559 }
|
||
<a name="l00560"></a>00560 <span class="keywordflow">return</span> out;
|
||
<a name="l00561"></a>00561 }
|
||
<a name="l00562"></a>00562
|
||
<a name="l00563"></a>00563
|
||
<a name="l00564"></a>00564 <span class="comment">//std::cout << "enrich" << std::endl;</span>
|
||
<a name="l00565"></a>00565 <a class="code" href="group__overlay.html#g7bcb7f6c2fd6b4a0b94a64cf45c767d2" title="All intersection points are enriched with successor information.">geometry::enrich_intersection_points</a>(ips, geometry1, geometry2, side_strategy);
|
||
<a name="l00566"></a>00566
|
||
<a name="l00567"></a>00567 std::vector<ring_type> rings;
|
||
<a name="l00568"></a>00568 <span class="comment">//std::cout << "traverse" << std::endl;</span>
|
||
<a name="l00569"></a>00569 geometry::traverse<typename Strategy::side_strategy_type, ring_type>
|
||
<a name="l00570"></a>00570 (
|
||
<a name="l00571"></a>00571 geometry1,
|
||
<a name="l00572"></a>00572 geometry2,
|
||
<a name="l00573"></a>00573 Direction == -1
|
||
<a name="l00574"></a>00574 ? boost::geometry::detail::overlay::operation_intersection
|
||
<a name="l00575"></a>00575 : boost::geometry::detail::overlay::operation_union
|
||
<a name="l00576"></a>00576 ,
|
||
<a name="l00577"></a>00577 ips,
|
||
<a name="l00578"></a>00578 std::back_inserter(rings)
|
||
<a name="l00579"></a>00579 );
|
||
<a name="l00580"></a>00580 <span class="comment">//std::cout << "assemble" << std::endl;</span>
|
||
<a name="l00581"></a>00581
|
||
<a name="l00582"></a>00582 <span class="comment">// Get exterior ring (only done if exterior rings are equal or inside each other)</span>
|
||
<a name="l00583"></a>00583 <span class="comment">//if (! trivial)</span>
|
||
<a name="l00584"></a>00584 {
|
||
<a name="l00585"></a>00585 get_exterior_ring<tag1, tag2>::apply(geometry1, geometry2, intersect_codes, rings, Direction);
|
||
<a name="l00586"></a>00586 }
|
||
<a name="l00587"></a>00587
|
||
<a name="l00588"></a>00588 <span class="keywordflow">switch</span> (boost::size(rings))
|
||
<a name="l00589"></a>00589 {
|
||
<a name="l00590"></a>00590 <span class="keywordflow">case</span> 0 : <span class="keywordflow">break</span>;
|
||
<a name="l00591"></a>00591 <span class="keywordflow">case</span> 1 :
|
||
<a name="l00592"></a>00592 {
|
||
<a name="l00593"></a>00593 GeometryOut result;
|
||
<a name="l00594"></a>00594 <a class="code" href="group__convert.html#g84623f6ccaeba742bbebcdbc2c24ed05" title="Converts one geometry to another geometry.">geometry::convert</a>(rings.front(), result);
|
||
<a name="l00595"></a>00595 add_holes
|
||
<a name="l00596"></a>00596 <
|
||
<a name="l00597"></a>00597 tag_out,
|
||
<a name="l00598"></a>00598 ring_type, GeometryOut, hole_vector_type,
|
||
<a name="l00599"></a>00599 Direction
|
||
<a name="l00600"></a>00600 >::apply(rings.front(), result, ni_holes);
|
||
<a name="l00601"></a>00601 *out = result;
|
||
<a name="l00602"></a>00602 out++;
|
||
<a name="l00603"></a>00603 }
|
||
<a name="l00604"></a>00604 <span class="keywordflow">break</span>;
|
||
<a name="l00605"></a>00605 <span class="keywordflow">default</span> :
|
||
<a name="l00606"></a>00606 assemble_rings
|
||
<a name="l00607"></a>00607 <
|
||
<a name="l00608"></a>00608 tag_out, GeometryOut,
|
||
<a name="l00609"></a>00609 hole_vector_type, Direction
|
||
<a name="l00610"></a>00610 >::apply(rings, ni_holes, out);
|
||
<a name="l00611"></a>00611 }
|
||
<a name="l00612"></a>00612
|
||
<a name="l00613"></a>00613 <span class="keywordflow">return</span> out;
|
||
<a name="l00614"></a>00614 }
|
||
<a name="l00615"></a>00615 };
|
||
<a name="l00616"></a>00616
|
||
<a name="l00617"></a>00617
|
||
<a name="l00618"></a>00618 }} <span class="comment">// namespace detail::overlay</span>
|
||
<a name="l00619"></a>00619 <span class="preprocessor">#endif // DOXYGEN_NO_DETAIL</span>
|
||
<a name="l00620"></a>00620 <span class="preprocessor"></span>
|
||
<a name="l00621"></a>00621
|
||
<a name="l00622"></a>00622 }} <span class="comment">// namespace boost::geometry</span>
|
||
<a name="l00623"></a>00623
|
||
<a name="l00624"></a>00624 <span class="preprocessor">#endif //GGL_ALGORITHMS_OVERLAY_ASSEMBLE_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>
|