<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>GEOS: SegmentIntersectionDetector.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.1 -->
<div class="navigation" id="top">
<div class="tabs">
<ul class="tablist">
<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="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>
</ul>
</div>
<div class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
</ul>
</div>
<div class="header">
<div class="headertitle">
<h1>SegmentIntersectionDetector.h</h1> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/**********************************************************************</span>
<a name="l00002"></a>00002 <span class="comment"> * $Id: SegmentIntersectionDetector.h 2263 2009-01-29 18:56:00Z mloskot $</span>
<a name="l00003"></a>00003 <span class="comment"> *</span>
<a name="l00004"></a>00004 <span class="comment"> * GEOS - Geometry Engine Open Source</span>
<a name="l00005"></a>00005 <span class="comment"> * http://geos.refractions.net</span>
<a name="l00006"></a>00006 <span class="comment"> *</span>
<a name="l00007"></a>00007 <span class="comment"> * Copyright (C) 2006 Refractions Research Inc.</span>
<a name="l00008"></a>00008 <span class="comment"> *</span>
<a name="l00009"></a>00009 <span class="comment"> * This is free software; you can redistribute and/or modify it under</span>
<a name="l00010"></a>00010 <span class="comment"> * the terms of the GNU Lesser General Public Licence as published</span>
<a name="l00011"></a>00011 <span class="comment"> * by the Free Software Foundation. </span>
<a name="l00012"></a>00012 <span class="comment"> * See the COPYING file for more information.</span>
<a name="l00013"></a>00013 <span class="comment"> *</span>
<a name="l00014"></a>00014 <span class="comment"> *</span>
<a name="l00015"></a>00015 <span class="comment"> **********************************************************************/</span>
<a name="l00016"></a>00016
<a name="l00017"></a>00017 <span class="preprocessor">#ifndef GEOS_GEOM_PREP_SEGMENTINTERSECTIONDETECTOR_H</span>
<a name="l00018"></a>00018 <span class="preprocessor"></span><span class="preprocessor">#define GEOS_GEOM_PREP_SEGMENTINTERSECTIONDETECTOR_H</span>
<a name="l00019"></a>00019 <span class="preprocessor"></span>
<a name="l00020"></a>00020 <span class="preprocessor">#include <geos/noding/SegmentIntersector.h></span>
<a name="l00021"></a>00021 <span class="preprocessor">#include <geos/algorithm/LineIntersector.h></span>
<a name="l00022"></a>00022 <span class="preprocessor">#include <geos/geom/Coordinate.h></span>
<a name="l00023"></a>00023 <span class="preprocessor">#include <geos/geom/CoordinateSequence.h></span>
<a name="l00024"></a>00024 <span class="preprocessor">#include <geos/noding/SegmentString.h></span>
<a name="l00025"></a>00025
<a name="l00026"></a>00026 <span class="keyword">using namespace </span>geos::algorithm;
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="keyword">namespace </span>geos {
<a name="l00029"></a>00029 <span class="keyword">namespace </span>noding { <span class="comment">// geos::noding</span>
<a name="l00030"></a>00030
<a name="l00044"></a><a class="code" href="classgeos_1_1noding_1_1SegmentIntersectionDetector.html">00044</a> <span class="keyword">class </span><a class="code" href="classgeos_1_1noding_1_1SegmentIntersectionDetector.html" title="Detects and records an intersection between two SegmentStrings, if one exists.">SegmentIntersectionDetector</a> : <span class="keyword">public</span> <a class="code" href="classgeos_1_1noding_1_1SegmentIntersector.html" title="Processes possible intersections detected by a Noder.">SegmentIntersector</a>
<a name="l00045"></a>00045 {
<a name="l00046"></a>00046 <span class="keyword">private</span>:
<a name="l00047"></a>00047 <a class="code" href="classgeos_1_1algorithm_1_1LineIntersector.html" title="A LineIntersector is an algorithm that can both test whether two line segments intersect and compute ...">LineIntersector</a> * li;
<a name="l00048"></a>00048
<a name="l00049"></a>00049 <span class="keywordtype">bool</span> findProper;
<a name="l00050"></a>00050 <span class="keywordtype">bool</span> findAllTypes;
<a name="l00051"></a>00051
<a name="l00052"></a>00052 <span class="keywordtype">bool</span> _hasIntersection;
<a name="l00053"></a>00053 <span class="keywordtype">bool</span> _hasProperIntersection;
<a name="l00054"></a>00054 <span class="keywordtype">bool</span> _hasNonProperIntersection;
<a name="l00055"></a>00055
<a name="l00056"></a>00056 <span class="keyword">const</span> <a class="code" href="classgeos_1_1geom_1_1Coordinate.html" title="Coordinate is the lightweight class used to store coordinates.">geom::Coordinate</a> * intPt;
<a name="l00057"></a>00057 <a class="code" href="classgeos_1_1geom_1_1CoordinateSequence.html" title="The internal representation of a list of coordinates inside a Geometry.">geom::CoordinateSequence</a> * intSegments;
<a name="l00058"></a>00058
<a name="l00059"></a>00059 <span class="keyword">protected</span>:
<a name="l00060"></a>00060 <span class="keyword">public</span>:
<a name="l00061"></a>00061 <a class="code" href="classgeos_1_1noding_1_1SegmentIntersectionDetector.html" title="Detects and records an intersection between two SegmentStrings, if one exists.">SegmentIntersectionDetector</a>( <a class="code" href="classgeos_1_1algorithm_1_1LineIntersector.html" title="A LineIntersector is an algorithm that can both test whether two line segments intersect and compute ...">LineIntersector</a> * li)
<a name="l00062"></a>00062 :
<a name="l00063"></a>00063 li( li),
<a name="l00064"></a>00064 findProper(<span class="keyword">false</span>),
<a name="l00065"></a>00065 findAllTypes(<span class="keyword">false</span>),
<a name="l00066"></a>00066 _hasIntersection(<span class="keyword">false</span>),
<a name="l00067"></a>00067 _hasProperIntersection(<span class="keyword">false</span>),
<a name="l00068"></a>00068 _hasNonProperIntersection(<span class="keyword">false</span>),
<a name="l00069"></a>00069 intPt( NULL),
<a name="l00070"></a>00070 intSegments( NULL)
<a name="l00071"></a>00071 { }
<a name="l00072"></a>00072
<a name="l00073"></a>00073 ~<a class="code" href="classgeos_1_1noding_1_1SegmentIntersectionDetector.html" title="Detects and records an intersection between two SegmentStrings, if one exists.">SegmentIntersectionDetector</a>()
<a name="l00074"></a>00074 {
<a name="l00075"></a>00075 <span class="comment">//delete intPt;</span>
<a name="l00076"></a>00076 <span class="keyword">delete</span> intSegments;
<a name="l00077"></a>00077 }
<a name="l00078"></a>00078
<a name="l00079"></a>00079
<a name="l00080"></a>00080 <span class="keywordtype">void</span> setFindProper( <span class="keywordtype">bool</span> findProper)
<a name="l00081"></a>00081 {
<a name="l00082"></a>00082 this->findProper = findProper;
<a name="l00083"></a>00083 }
<a name="l00084"></a>00084
<a name="l00085"></a>00085 <span class="keywordtype">void</span> setFindAllIntersectionTypes( <span class="keywordtype">bool</span> findAllTypes)
<a name="l00086"></a>00086 {
<a name="l00087"></a>00087 this->findAllTypes = findAllTypes;
<a name="l00088"></a>00088 }
<a name="l00089"></a>00089
<a name="l00095"></a><a class="code" href="classgeos_1_1noding_1_1SegmentIntersectionDetector.html#adb04288ed28b12593d58f0d767ec9064">00095</a> <span class="keywordtype">bool</span> hasIntersection()<span class="keyword"> const</span>
<a name="l00096"></a>00096 <span class="keyword"> </span>{
<a name="l00097"></a>00097 <span class="keywordflow">return</span> _hasIntersection;
<a name="l00098"></a>00098 }
<a name="l00099"></a>00099
<a name="l00105"></a><a class="code" href="classgeos_1_1noding_1_1SegmentIntersectionDetector.html#a506450066c5a2897ca109c269c47fd89">00105</a> <span class="keywordtype">bool</span> hasProperIntersection()<span class="keyword"> const </span>
<a name="l00106"></a>00106 <span class="keyword"> </span>{
<a name="l00107"></a>00107 <span class="keywordflow">return</span> _hasProperIntersection;
<a name="l00108"></a>00108 }
<a name="l00109"></a>00109
<a name="l00115"></a><a class="code" href="classgeos_1_1noding_1_1SegmentIntersectionDetector.html#aa7542ef3ed118313eabce3a8ddf766ed">00115</a> <span class="keywordtype">bool</span> hasNonProperIntersection()<span class="keyword"> const</span>
<a name="l00116"></a>00116 <span class="keyword"> </span>{
<a name="l00117"></a>00117 <span class="keywordflow">return</span> _hasNonProperIntersection;
<a name="l00118"></a>00118 }
<a name="l00119"></a>00119
<a name="l00126"></a><a class="code" href="classgeos_1_1noding_1_1SegmentIntersectionDetector.html#aa13289ab24e47df9c67a503ce2880945">00126</a> <span class="keyword">const</span> <a class="code" href="classgeos_1_1geom_1_1Coordinate.html" title="Coordinate is the lightweight class used to store coordinates.">geom::Coordinate</a> * <span class="keyword">const</span> getIntersection()<span class="keyword"> const</span>
<a name="l00127"></a>00127 <span class="keyword"> </span>{
<a name="l00128"></a>00128 <span class="keywordflow">return</span> intPt;
<a name="l00129"></a>00129 }
<a name="l00130"></a>00130
<a name="l00131"></a>00131
<a name="l00137"></a><a class="code" href="classgeos_1_1noding_1_1SegmentIntersectionDetector.html#a378dc2d15f6a4f759daf5d9b32e5f259">00137</a> <span class="keyword">const</span> <a class="code" href="classgeos_1_1geom_1_1CoordinateSequence.html" title="The internal representation of a list of coordinates inside a Geometry.">geom::CoordinateSequence</a> * getIntersectionSegments()<span class="keyword"> const</span>
<a name="l00138"></a>00138 <span class="keyword"> </span>{
<a name="l00139"></a>00139 <span class="keywordflow">return</span> intSegments;
<a name="l00140"></a>00140 }
<a name="l00141"></a>00141
<a name="l00142"></a><a class="code" href="classgeos_1_1noding_1_1SegmentIntersectionDetector.html#a7696b62e218cd0c5dd221d8737f275e9">00142</a> <span class="keywordtype">bool</span> isDone()<span class="keyword"> const</span>
<a name="l00143"></a>00143 <span class="keyword"> </span>{
<a name="l00144"></a>00144 <span class="comment">// If finding all types, we can stop</span>
<a name="l00145"></a>00145 <span class="comment">// when both possible types have been found.</span>
<a name="l00146"></a>00146 <span class="keywordflow">if</span> (findAllTypes)
<a name="l00147"></a>00147 <span class="keywordflow">return</span> _hasProperIntersection && _hasNonProperIntersection;
<a name="l00148"></a>00148
<a name="l00149"></a>00149 <span class="comment">// If searching for a proper intersection, only stop if one is found</span>
<a name="l00150"></a>00150 <span class="keywordflow">if</span> (findProper)
<a name="l00151"></a>00151 <span class="keywordflow">return</span> _hasProperIntersection;
<a name="l00152"></a>00152
<a name="l00153"></a>00153 <span class="keywordflow">return</span> _hasIntersection;
<a name="l00154"></a>00154 }
<a name="l00155"></a>00155
<a name="l00164"></a>00164 <span class="keywordtype">void</span> processIntersections( <a class="code" href="classgeos_1_1noding_1_1SegmentString.html" title="An interface for classes which represent a sequence of contiguous line segments.">noding::SegmentString</a> * e0, <span class="keywordtype">int</span> segIndex0,
<a name="l00165"></a>00165 <a class="code" href="classgeos_1_1noding_1_1SegmentString.html" title="An interface for classes which represent a sequence of contiguous line segments.">noding::SegmentString</a> * e1, <span class="keywordtype">int</span> segIndex1 );
<a name="l00166"></a>00166
<a name="l00167"></a>00167 };
<a name="l00168"></a>00168
<a name="l00169"></a>00169 } <span class="comment">// namespace geos::noding</span>
<a name="l00170"></a>00170 } <span class="comment">// namespace geos</span>
<a name="l00171"></a>00171
<a name="l00172"></a>00172 <span class="preprocessor">#endif // GEOS_GEOM_PREP_SEGMENTINTERSECTIONDETECTOR_H</span>
<a name="l00173"></a>00173 <span class="preprocessor"></span><span class="comment">/**********************************************************************</span>
<a name="l00174"></a>00174 <span class="comment"> * $Log$</span>
<a name="l00175"></a>00175 <span class="comment"> **********************************************************************/</span>
<a name="l00176"></a>00176
<a name="l00177"></a>00177
</pre></div></div>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Thu Jul 22 2010 for GEOS by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.1 </small></address>
</body>
</html>
