<!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: PolygonizeGraph.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>PolygonizeGraph.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: PolygonizeGraph.h 2730 2009-11-19 20:29:01Z strk $</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"> * Copyright (C) 2001-2002 Vivid Solutions Inc.</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * This is free software; you can redistribute and/or modify it under</span>
<a name="l00011"></a>00011 <span class="comment"> * the terms of the GNU Lesser General Public Licence as published</span>
<a name="l00012"></a>00012 <span class="comment"> * by the Free Software Foundation. </span>
<a name="l00013"></a>00013 <span class="comment"> * See the COPYING file for more information.</span>
<a name="l00014"></a>00014 <span class="comment"> *</span>
<a name="l00015"></a>00015 <span class="comment"> **********************************************************************</span>
<a name="l00016"></a>00016 <span class="comment"> *</span>
<a name="l00017"></a>00017 <span class="comment"> * Last port: operation/polygonize/PolygonizeGraph.java rev. 1.6 (JTS-1.10)</span>
<a name="l00018"></a>00018 <span class="comment"> *</span>
<a name="l00019"></a>00019 <span class="comment"> **********************************************************************/</span>
<a name="l00020"></a>00020
<a name="l00021"></a>00021
<a name="l00022"></a>00022 <span class="preprocessor">#ifndef GEOS_OP_POLYGONIZE_POLYGONIZEGRAPH_H</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define GEOS_OP_POLYGONIZE_POLYGONIZEGRAPH_H</span>
<a name="l00024"></a>00024 <span class="preprocessor"></span>
<a name="l00025"></a>00025 <span class="preprocessor">#include <geos/export.h></span>
<a name="l00026"></a>00026
<a name="l00027"></a>00027 <span class="preprocessor">#include <geos/planargraph/PlanarGraph.h></span> <span class="comment">// for inheritance</span>
<a name="l00028"></a>00028
<a name="l00029"></a>00029 <span class="preprocessor">#include <vector></span>
<a name="l00030"></a>00030
<a name="l00031"></a>00031 <span class="comment">// Forward declarations</span>
<a name="l00032"></a>00032 <span class="keyword">namespace </span>geos {
<a name="l00033"></a>00033 <span class="keyword">namespace </span>geom {
<a name="l00034"></a>00034 <span class="keyword">class </span>LineString;
<a name="l00035"></a>00035 <span class="keyword">class </span>GeometryFactory;
<a name="l00036"></a>00036 <span class="keyword">class </span>Coordinate;
<a name="l00037"></a>00037 <span class="keyword">class </span>CoordinateSequence;
<a name="l00038"></a>00038 }
<a name="l00039"></a>00039 <span class="keyword">namespace </span>planargraph {
<a name="l00040"></a>00040 <span class="keyword">class </span>Node;
<a name="l00041"></a>00041 <span class="keyword">class </span>Edge;
<a name="l00042"></a>00042 <span class="keyword">class </span>DirectedEdge;
<a name="l00043"></a>00043 }
<a name="l00044"></a>00044 <span class="keyword">namespace </span>operation {
<a name="l00045"></a>00045 <span class="keyword">namespace </span>polygonize {
<a name="l00046"></a>00046 <span class="keyword">class </span>EdgeRing;
<a name="l00047"></a>00047 <span class="keyword">class </span>PolygonizeDirectedEdge;
<a name="l00048"></a>00048 }
<a name="l00049"></a>00049 }
<a name="l00050"></a>00050 }
<a name="l00051"></a>00051
<a name="l00052"></a>00052 <span class="keyword">namespace </span>geos {
<a name="l00053"></a>00053 <span class="keyword">namespace </span>operation { <span class="comment">// geos::operation</span>
<a name="l00054"></a>00054 <span class="keyword">namespace </span>polygonize { <span class="comment">// geos::operation::polygonize</span>
<a name="l00055"></a>00055
<a name="l00056"></a>00056
<a name="l00066"></a><a class="code" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html">00066</a> <span class="keyword">class </span>GEOS_DLL <a class="code" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html" title="Represents a planar graph of edges that can be used to compute a polygonization, and implements the a...">PolygonizeGraph</a>: <span class="keyword">public</span> planargraph::PlanarGraph {
<a name="l00067"></a>00067
<a name="l00068"></a>00068 <span class="keyword">public</span>:
<a name="l00069"></a>00069
<a name="l00074"></a>00074 <span class="keyword">static</span> <span class="keywordtype">void</span> deleteAllEdges(<a class="code" href="classgeos_1_1planargraph_1_1Node.html" title="A node in a PlanarGraph is a location where 0 or more Edge meet.">planargraph::Node</a> *node);
<a name="l00075"></a>00075
<a name="l00080"></a>00080 <a class="code" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html" title="Represents a planar graph of edges that can be used to compute a polygonization, and implements the a...">PolygonizeGraph</a>(<span class="keyword">const</span> <a class="code" href="classgeos_1_1geom_1_1GeometryFactory.html" title="Supplies a set of utility methods for building Geometry objects from CoordinateSequence or other Geom...">geom::GeometryFactory</a> *newFactory);
<a name="l00081"></a>00081
<a name="l00086"></a>00086 ~<a class="code" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html" title="Represents a planar graph of edges that can be used to compute a polygonization, and implements the a...">PolygonizeGraph</a>();
<a name="l00087"></a>00087
<a name="l00093"></a>00093 <span class="keywordtype">void</span> addEdge(<span class="keyword">const</span> <a class="code" href="classgeos_1_1geom_1_1LineString.html" title="Basic implementation of LineString.">geom::LineString</a> *line);
<a name="l00094"></a>00094
<a name="l00103"></a>00103 <span class="keywordtype">void</span> getEdgeRings(std::vector<EdgeRing*>& edgeRingList);
<a name="l00104"></a>00104
<a name="l00114"></a>00114 <span class="keywordtype">void</span> deleteCutEdges(std::vector<const geom::LineString*> &cutLines);
<a name="l00115"></a>00115
<a name="l00128"></a>00128 <span class="keywordtype">void</span> deleteDangles(std::vector<const geom::LineString*> &dangleLines);
<a name="l00129"></a>00129
<a name="l00130"></a>00130 <span class="keyword">private</span>:
<a name="l00131"></a>00131
<a name="l00132"></a>00132 <span class="keyword">static</span> <span class="keywordtype">int</span> getDegreeNonDeleted(<a class="code" href="classgeos_1_1planargraph_1_1Node.html" title="A node in a PlanarGraph is a location where 0 or more Edge meet.">planargraph::Node</a> *node);
<a name="l00133"></a>00133
<a name="l00134"></a>00134 <span class="keyword">static</span> <span class="keywordtype">int</span> getDegree(<a class="code" href="classgeos_1_1planargraph_1_1Node.html" title="A node in a PlanarGraph is a location where 0 or more Edge meet.">planargraph::Node</a> *node, <span class="keywordtype">long</span> label);
<a name="l00135"></a>00135
<a name="l00136"></a>00136 <span class="keyword">const</span> <a class="code" href="classgeos_1_1geom_1_1GeometryFactory.html" title="Supplies a set of utility methods for building Geometry objects from CoordinateSequence or other Geom...">geom::GeometryFactory</a> *factory;
<a name="l00137"></a>00137
<a name="l00138"></a>00138 <a class="code" href="classgeos_1_1planargraph_1_1Node.html" title="A node in a PlanarGraph is a location where 0 or more Edge meet.">planargraph::Node</a>* getNode(<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>& pt);
<a name="l00139"></a>00139
<a name="l00140"></a>00140 <span class="keywordtype">void</span> computeNextCWEdges();
<a name="l00141"></a>00141
<a name="l00151"></a>00151 <span class="keywordtype">void</span> convertMaximalToMinimalEdgeRings(
<a name="l00152"></a>00152 std::vector<PolygonizeDirectedEdge*> &ringEdges);
<a name="l00153"></a>00153
<a name="l00164"></a>00164 <span class="keyword">static</span> <span class="keywordtype">void</span> findIntersectionNodes( <a class="code" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeDirectedEdge.html" title="A DirectedEdge of a PolygonizeGraph, which represents an edge of a polygon formed by the graph...">PolygonizeDirectedEdge</a> *startDE,
<a name="l00165"></a>00165 <span class="keywordtype">long</span> label, std::vector<planargraph::Node*>& intNodes
<a name="l00166"></a>00166 );
<a name="l00167"></a>00167
<a name="l00177"></a>00177 <span class="keyword">static</span> <span class="keywordtype">void</span> findLabeledEdgeRings(
<a name="l00178"></a>00178 std::vector<planargraph::DirectedEdge*> &dirEdgesIn,
<a name="l00179"></a>00179 std::vector<PolygonizeDirectedEdge*> &dirEdgesOut);
<a name="l00180"></a>00180
<a name="l00181"></a>00181 <span class="keyword">static</span> <span class="keywordtype">void</span> label(std::vector<planargraph::DirectedEdge*> &dirEdges, <span class="keywordtype">long</span> label);
<a name="l00182"></a>00182
<a name="l00183"></a>00183 <span class="keyword">static</span> <span class="keywordtype">void</span> computeNextCWEdges(<a class="code" href="classgeos_1_1planargraph_1_1Node.html" title="A node in a PlanarGraph is a location where 0 or more Edge meet.">planargraph::Node</a> *node);
<a name="l00184"></a>00184
<a name="l00192"></a>00192 <span class="keyword">static</span> <span class="keywordtype">void</span> computeNextCCWEdges(<a class="code" href="classgeos_1_1planargraph_1_1Node.html" title="A node in a PlanarGraph is a location where 0 or more Edge meet.">planargraph::Node</a> *node, <span class="keywordtype">long</span> label);
<a name="l00193"></a>00193
<a name="l00204"></a>00204 <span class="keyword">static</span> <span class="keywordtype">void</span> findDirEdgesInRing(<a class="code" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeDirectedEdge.html" title="A DirectedEdge of a PolygonizeGraph, which represents an edge of a polygon formed by the graph...">PolygonizeDirectedEdge</a> *startDE,
<a name="l00205"></a>00205 std::vector<planargraph::DirectedEdge*>& edgesInRing);
<a name="l00206"></a>00206
<a name="l00207"></a>00207 <a class="code" href="classgeos_1_1operation_1_1polygonize_1_1EdgeRing.html" title="Represents a ring of PolygonizeDirectedEdge which form a ring of a polygon. The ring may be either an...">EdgeRing</a>* findEdgeRing(<a class="code" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeDirectedEdge.html" title="A DirectedEdge of a PolygonizeGraph, which represents an edge of a polygon formed by the graph...">PolygonizeDirectedEdge</a> *startDE);
<a name="l00208"></a>00208
<a name="l00209"></a>00209 <span class="comment">/* Tese are for memory management */</span>
<a name="l00210"></a>00210 std::vector<planargraph::Edge *> newEdges;
<a name="l00211"></a>00211 std::vector<planargraph::DirectedEdge *> newDirEdges;
<a name="l00212"></a>00212 std::vector<planargraph::Node *> newNodes;
<a name="l00213"></a>00213 std::vector<EdgeRing *> newEdgeRings;
<a name="l00214"></a>00214 std::vector<geom::CoordinateSequence *> newCoords;
<a name="l00215"></a>00215 };
<a name="l00216"></a>00216
<a name="l00217"></a>00217 } <span class="comment">// namespace geos::operation::polygonize</span>
<a name="l00218"></a>00218 } <span class="comment">// namespace geos::operation</span>
<a name="l00219"></a>00219 } <span class="comment">// namespace geos</span>
<a name="l00220"></a>00220
<a name="l00221"></a>00221 <span class="preprocessor">#endif // GEOS_OP_POLYGONIZE_POLYGONIZEGRAPH_H</span>
<a name="l00222"></a>00222 <span class="preprocessor"></span>
<a name="l00223"></a>00223 <span class="comment">/**********************************************************************</span>
<a name="l00224"></a>00224 <span class="comment"> * $Log$</span>
<a name="l00225"></a>00225 <span class="comment"> * Revision 1.1 2006/03/22 11:19:06 strk</span>
<a name="l00226"></a>00226 <span class="comment"> * opPolygonize.h headers split.</span>
<a name="l00227"></a>00227 <span class="comment"> *</span>
<a name="l00228"></a>00228 <span class="comment"> **********************************************************************/</span>
</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>
