942 lines
70 KiB
HTML
942 lines
70 KiB
HTML
<!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"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.11"/>
|
|
<title>GEOS: geos::operation::polygonize::PolygonizeGraph Class Reference</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">GEOS
|
|
 <span id="projectnumber">3.9.1dev</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.11 -->
|
|
<div id="navrow1" 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 class="current"><a href="annotated.html"><span>Classes</span></a></li>
|
|
<li><a href="files.html"><span>Files</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="navrow2" class="tabs2">
|
|
<ul class="tablist">
|
|
<li><a href="annotated.html"><span>Class List</span></a></li>
|
|
<li><a href="inherits.html"><span>Class Hierarchy</span></a></li>
|
|
<li><a href="functions.html"><span>Class Members</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="nav-path" class="navpath">
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="namespacegeos.html">geos</a></li><li class="navelem"><a class="el" href="namespacegeos_1_1operation.html">operation</a></li><li class="navelem"><a class="el" href="namespacegeos_1_1operation_1_1polygonize.html">polygonize</a></li><li class="navelem"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html">PolygonizeGraph</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="summary">
|
|
<a href="#pub-methods">Public Member Functions</a> |
|
|
<a href="#pub-static-methods">Static Public Member Functions</a> |
|
|
<a href="#pri-methods">Private Member Functions</a> |
|
|
<a href="#pri-static-methods">Static Private Member Functions</a> |
|
|
<a href="#pri-attribs">Private Attributes</a> |
|
|
<a href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph-members.html">List of all members</a> </div>
|
|
<div class="headertitle">
|
|
<div class="title">geos::operation::polygonize::PolygonizeGraph Class Reference</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p>Represents a planar graph of edges that can be used to compute a polygonization, and implements the algorithms to compute the EdgeRings formed by the graph.
|
|
<a href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#details">More...</a></p>
|
|
|
|
<p><code>#include <<a class="el" href="PolygonizeGraph_8h_source.html">PolygonizeGraph.h</a>></code></p>
|
|
<div class="dynheader">
|
|
Inheritance diagram for geos::operation::polygonize::PolygonizeGraph:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph__inherit__graph.svg" width="208" height="147"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
</div>
|
|
<center><span class="legend">[<a href="graph_legend.html">legend</a>]</span></center></div>
|
|
<div class="dynheader">
|
|
Collaboration diagram for geos::operation::polygonize::PolygonizeGraph:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph__coll__graph.svg" width="100%" height="431"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
|
</div>
|
|
<center><span class="legend">[<a href="graph_legend.html">legend</a>]</span></center></div>
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
|
|
Public Member Functions</h2></td></tr>
|
|
<tr class="memitem:aa8705c8bedb0c60e2f2a6f614c5207df"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#aa8705c8bedb0c60e2f2a6f614c5207df">PolygonizeGraph</a> (const <a class="el" href="classgeos_1_1geom_1_1GeometryFactory.html">geom::GeometryFactory</a> *newFactory)</td></tr>
|
|
<tr class="memdesc:aa8705c8bedb0c60e2f2a6f614c5207df"><td class="mdescLeft"> </td><td class="mdescRight">Create a new polygonization graph. <a href="#aa8705c8bedb0c60e2f2a6f614c5207df">More...</a><br /></td></tr>
|
|
<tr class="separator:aa8705c8bedb0c60e2f2a6f614c5207df"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a7a89e83b7641eb7e202d7319a5b38aac"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a7a89e83b7641eb7e202d7319a5b38aac">~PolygonizeGraph</a> () override</td></tr>
|
|
<tr class="memdesc:a7a89e83b7641eb7e202d7319a5b38aac"><td class="mdescLeft"> </td><td class="mdescRight">Destroy a polygonization graph. <a href="#a7a89e83b7641eb7e202d7319a5b38aac">More...</a><br /></td></tr>
|
|
<tr class="separator:a7a89e83b7641eb7e202d7319a5b38aac"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a61a8606fd05649244acbb6227a147170"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a61a8606fd05649244acbb6227a147170">addEdge</a> (const <a class="el" href="classgeos_1_1geom_1_1LineString.html">geom::LineString</a> *line)</td></tr>
|
|
<tr class="memdesc:a61a8606fd05649244acbb6227a147170"><td class="mdescLeft"> </td><td class="mdescRight">Add a LineString forming an edge of the polygon graph. <a href="#a61a8606fd05649244acbb6227a147170">More...</a><br /></td></tr>
|
|
<tr class="separator:a61a8606fd05649244acbb6227a147170"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a004c877e7b17942ec15fc2176dd89cf4"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a004c877e7b17942ec15fc2176dd89cf4">getEdgeRings</a> (std::vector< <a class="el" href="classgeos_1_1operation_1_1polygonize_1_1EdgeRing.html">EdgeRing</a> * > &edgeRingList)</td></tr>
|
|
<tr class="memdesc:a004c877e7b17942ec15fc2176dd89cf4"><td class="mdescLeft"> </td><td class="mdescRight">Computes the EdgeRings formed by the edges in this graph. <a href="#a004c877e7b17942ec15fc2176dd89cf4">More...</a><br /></td></tr>
|
|
<tr class="separator:a004c877e7b17942ec15fc2176dd89cf4"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a0992fffa3d00e4f4084fbb2a78ad1988"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a0992fffa3d00e4f4084fbb2a78ad1988">deleteCutEdges</a> (std::vector< const <a class="el" href="classgeos_1_1geom_1_1LineString.html">geom::LineString</a> * > &cutLines)</td></tr>
|
|
<tr class="memdesc:a0992fffa3d00e4f4084fbb2a78ad1988"><td class="mdescLeft"> </td><td class="mdescRight">Finds and removes all cut edges from the graph. <a href="#a0992fffa3d00e4f4084fbb2a78ad1988">More...</a><br /></td></tr>
|
|
<tr class="separator:a0992fffa3d00e4f4084fbb2a78ad1988"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:af637ef4dcd1ce6d31a335b26d55bad5e"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#af637ef4dcd1ce6d31a335b26d55bad5e">deleteDangles</a> (std::vector< const <a class="el" href="classgeos_1_1geom_1_1LineString.html">geom::LineString</a> * > &dangleLines)</td></tr>
|
|
<tr class="memdesc:af637ef4dcd1ce6d31a335b26d55bad5e"><td class="mdescLeft"> </td><td class="mdescRight">Marks all edges from the graph which are "dangles". <a href="#af637ef4dcd1ce6d31a335b26d55bad5e">More...</a><br /></td></tr>
|
|
<tr class="separator:af637ef4dcd1ce6d31a335b26d55bad5e"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="inherit_header pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_classgeos_1_1planargraph_1_1PlanarGraph')"><img src="closed.png" alt="-"/> Public Member Functions inherited from <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html">geos::planargraph::PlanarGraph</a></td></tr>
|
|
<tr class="memitem:a01eaae76182f6582461a7a6e391269bc inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a01eaae76182f6582461a7a6e391269bc">PlanarGraph</a> ()</td></tr>
|
|
<tr class="memdesc:a01eaae76182f6582461a7a6e391269bc inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Constructs a <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html" title="Represents a directed graph which is embeddable in a planar surface. ">PlanarGraph</a> without any Edges, DirectedEdges, or Nodes. <a href="#a01eaae76182f6582461a7a6e391269bc">More...</a><br /></td></tr>
|
|
<tr class="separator:a01eaae76182f6582461a7a6e391269bc inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a33c3d2b7169a9a793d29bf9fd960d628 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">virtual </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a33c3d2b7169a9a793d29bf9fd960d628">~PlanarGraph</a> ()</td></tr>
|
|
<tr class="separator:a33c3d2b7169a9a793d29bf9fd960d628 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a08ddec6cb0d67c5837227475058ebdd4 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classgeos_1_1planargraph_1_1Node.html">Node</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a08ddec6cb0d67c5837227475058ebdd4">findNode</a> (const <a class="el" href="classgeos_1_1geom_1_1Coordinate.html">geom::Coordinate</a> &pt)</td></tr>
|
|
<tr class="memdesc:a08ddec6cb0d67c5837227475058ebdd4 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Returns the <a class="el" href="classgeos_1_1planargraph_1_1Node.html" title="A node in a PlanarGraph is a location where 0 or more Edge meet. ">Node</a> at the given location, or null if no <a class="el" href="classgeos_1_1planargraph_1_1Node.html" title="A node in a PlanarGraph is a location where 0 or more Edge meet. ">Node</a> was there. <a href="#a08ddec6cb0d67c5837227475058ebdd4">More...</a><br /></td></tr>
|
|
<tr class="separator:a08ddec6cb0d67c5837227475058ebdd4 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a5e041772de46fbd0d04b9adced4eddc4 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">NodeMap::container::iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a5e041772de46fbd0d04b9adced4eddc4">nodeIterator</a> ()</td></tr>
|
|
<tr class="memdesc:a5e041772de46fbd0d04b9adced4eddc4 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Returns an Iterator over the Nodes in this <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html" title="Represents a directed graph which is embeddable in a planar surface. ">PlanarGraph</a>. <a href="#a5e041772de46fbd0d04b9adced4eddc4">More...</a><br /></td></tr>
|
|
<tr class="separator:a5e041772de46fbd0d04b9adced4eddc4 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a3f53a024abe1fc34d5d9a2254c7aeac9 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">NodeMap::container::iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a3f53a024abe1fc34d5d9a2254c7aeac9">nodeBegin</a> ()</td></tr>
|
|
<tr class="separator:a3f53a024abe1fc34d5d9a2254c7aeac9 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a78fa2f35af83a15dfe103a3f2330e126 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">NodeMap::container::const_iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a78fa2f35af83a15dfe103a3f2330e126">nodeBegin</a> () const </td></tr>
|
|
<tr class="separator:a78fa2f35af83a15dfe103a3f2330e126 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ad0e720302026c83b11904029f0017e0f inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">NodeMap::container::iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#ad0e720302026c83b11904029f0017e0f">nodeEnd</a> ()</td></tr>
|
|
<tr class="separator:ad0e720302026c83b11904029f0017e0f inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:aed4a690505edbb0421d2758bc71864a6 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">NodeMap::container::const_iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#aed4a690505edbb0421d2758bc71864a6">nodeEnd</a> () const </td></tr>
|
|
<tr class="separator:aed4a690505edbb0421d2758bc71864a6 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ae2a0cbc53de6ee7191cf2a19156f7053 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#ae2a0cbc53de6ee7191cf2a19156f7053">getNodes</a> (std::vector< <a class="el" href="classgeos_1_1planargraph_1_1Node.html">Node</a> * > &nodes)</td></tr>
|
|
<tr class="memdesc:ae2a0cbc53de6ee7191cf2a19156f7053 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Returns the Nodes in this <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html" title="Represents a directed graph which is embeddable in a planar surface. ">PlanarGraph</a>. <a href="#ae2a0cbc53de6ee7191cf2a19156f7053">More...</a><br /></td></tr>
|
|
<tr class="separator:ae2a0cbc53de6ee7191cf2a19156f7053 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a3acaf9fdbb54655fdf1e097462dc49d6 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">std::vector< <a class="el" href="classgeos_1_1planargraph_1_1DirectedEdge.html">DirectedEdge</a> * >::iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a3acaf9fdbb54655fdf1e097462dc49d6">dirEdgeIterator</a> ()</td></tr>
|
|
<tr class="memdesc:a3acaf9fdbb54655fdf1e097462dc49d6 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Returns an Iterator over the DirectedEdges in this <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html" title="Represents a directed graph which is embeddable in a planar surface. ">PlanarGraph</a>, in the order in which they were added. <a href="#a3acaf9fdbb54655fdf1e097462dc49d6">More...</a><br /></td></tr>
|
|
<tr class="separator:a3acaf9fdbb54655fdf1e097462dc49d6 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a90498ae812494e804effb9f244679212 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">std::vector< <a class="el" href="classgeos_1_1planargraph_1_1Edge.html">Edge</a> * >::iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a90498ae812494e804effb9f244679212">edgeIterator</a> ()</td></tr>
|
|
<tr class="memdesc:a90498ae812494e804effb9f244679212 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Alias for <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#aab2c1afdc638406f50b88c33aa592d86" title="Returns an iterator to first Edge in this graph. ">edgeBegin()</a> <a href="#a90498ae812494e804effb9f244679212">More...</a><br /></td></tr>
|
|
<tr class="separator:a90498ae812494e804effb9f244679212 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:aab2c1afdc638406f50b88c33aa592d86 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">std::vector< <a class="el" href="classgeos_1_1planargraph_1_1Edge.html">Edge</a> * >::iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#aab2c1afdc638406f50b88c33aa592d86">edgeBegin</a> ()</td></tr>
|
|
<tr class="memdesc:aab2c1afdc638406f50b88c33aa592d86 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Returns an iterator to first <a class="el" href="classgeos_1_1planargraph_1_1Edge.html" title="Represents an undirected edge of a PlanarGraph. ">Edge</a> in this graph. <a href="#aab2c1afdc638406f50b88c33aa592d86">More...</a><br /></td></tr>
|
|
<tr class="separator:aab2c1afdc638406f50b88c33aa592d86 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:abf4facc89036fbd09552c3edc8ab8d57 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">std::vector< <a class="el" href="classgeos_1_1planargraph_1_1Edge.html">Edge</a> * >::iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#abf4facc89036fbd09552c3edc8ab8d57">edgeEnd</a> ()</td></tr>
|
|
<tr class="memdesc:abf4facc89036fbd09552c3edc8ab8d57 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Returns an iterator to one-past last <a class="el" href="classgeos_1_1planargraph_1_1Edge.html" title="Represents an undirected edge of a PlanarGraph. ">Edge</a> in this graph. <a href="#abf4facc89036fbd09552c3edc8ab8d57">More...</a><br /></td></tr>
|
|
<tr class="separator:abf4facc89036fbd09552c3edc8ab8d57 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a46c8a6e3d8f79b1eab86fa542c073157 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">std::vector< <a class="el" href="classgeos_1_1planargraph_1_1Edge.html">Edge</a> * > * </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a46c8a6e3d8f79b1eab86fa542c073157">getEdges</a> ()</td></tr>
|
|
<tr class="separator:a46c8a6e3d8f79b1eab86fa542c073157 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:aa166b3ada82735e14acbe4f03bafc9a7 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#aa166b3ada82735e14acbe4f03bafc9a7">remove</a> (<a class="el" href="classgeos_1_1planargraph_1_1Edge.html">Edge</a> *edge)</td></tr>
|
|
<tr class="memdesc:aa166b3ada82735e14acbe4f03bafc9a7 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Removes an <a class="el" href="classgeos_1_1planargraph_1_1Edge.html" title="Represents an undirected edge of a PlanarGraph. ">Edge</a> and its associated DirectedEdges from their from-Nodes and from this <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html" title="Represents a directed graph which is embeddable in a planar surface. ">PlanarGraph</a>. <a href="#aa166b3ada82735e14acbe4f03bafc9a7">More...</a><br /></td></tr>
|
|
<tr class="separator:aa166b3ada82735e14acbe4f03bafc9a7 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a464db5ab65d3162b11636f2cc91e8209 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a464db5ab65d3162b11636f2cc91e8209">remove</a> (<a class="el" href="classgeos_1_1planargraph_1_1DirectedEdge.html">DirectedEdge</a> *de)</td></tr>
|
|
<tr class="memdesc:a464db5ab65d3162b11636f2cc91e8209 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Removes <a class="el" href="classgeos_1_1planargraph_1_1DirectedEdge.html" title="Represents a directed edge in a PlanarGraph. ">DirectedEdge</a> from its from-Node and from this <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html" title="Represents a directed graph which is embeddable in a planar surface. ">PlanarGraph</a>. <a href="#a464db5ab65d3162b11636f2cc91e8209">More...</a><br /></td></tr>
|
|
<tr class="separator:a464db5ab65d3162b11636f2cc91e8209 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:abce614860682ea033b3c6a48fe3e6fbe inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#abce614860682ea033b3c6a48fe3e6fbe">remove</a> (<a class="el" href="classgeos_1_1planargraph_1_1Node.html">Node</a> *node)</td></tr>
|
|
<tr class="memdesc:abce614860682ea033b3c6a48fe3e6fbe inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Removes a node from the graph, along with any associated DirectedEdges and Edges. <a href="#abce614860682ea033b3c6a48fe3e6fbe">More...</a><br /></td></tr>
|
|
<tr class="separator:abce614860682ea033b3c6a48fe3e6fbe inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a401916302cf0d46ccafa61413b5de67f inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">std::vector< <a class="el" href="classgeos_1_1planargraph_1_1Node.html">Node</a> * > * </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a401916302cf0d46ccafa61413b5de67f">findNodesOfDegree</a> (std::size_t degree)</td></tr>
|
|
<tr class="memdesc:a401916302cf0d46ccafa61413b5de67f inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Returns all Nodes with the given number of Edges around it. The return value is a newly allocated vector of existing nodes. <a href="#a401916302cf0d46ccafa61413b5de67f">More...</a><br /></td></tr>
|
|
<tr class="separator:a401916302cf0d46ccafa61413b5de67f inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:acc1cd6e0d73e442d08ec563bfdba9454 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#acc1cd6e0d73e442d08ec563bfdba9454">findNodesOfDegree</a> (std::size_t degree, std::vector< <a class="el" href="classgeos_1_1planargraph_1_1Node.html">Node</a> * > &to)</td></tr>
|
|
<tr class="memdesc:acc1cd6e0d73e442d08ec563bfdba9454 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Get all Nodes with the given number of Edges around it. <a href="#acc1cd6e0d73e442d08ec563bfdba9454">More...</a><br /></td></tr>
|
|
<tr class="separator:acc1cd6e0d73e442d08ec563bfdba9454 inherit pub_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-static-methods"></a>
|
|
Static Public Member Functions</h2></td></tr>
|
|
<tr class="memitem:a027be1de727ccdf1d9784fd95dcb2714"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a027be1de727ccdf1d9784fd95dcb2714">deleteAllEdges</a> (<a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a> *node)</td></tr>
|
|
<tr class="memdesc:a027be1de727ccdf1d9784fd95dcb2714"><td class="mdescLeft"> </td><td class="mdescRight">Deletes all edges at a node. <a href="#a027be1de727ccdf1d9784fd95dcb2714">More...</a><br /></td></tr>
|
|
<tr class="separator:a027be1de727ccdf1d9784fd95dcb2714"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-methods"></a>
|
|
Private Member Functions</h2></td></tr>
|
|
<tr class="memitem:abe738fd38b7b592353d5b7676955f55f"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#abe738fd38b7b592353d5b7676955f55f">getNode</a> (const <a class="el" href="classgeos_1_1geom_1_1Coordinate.html">geom::Coordinate</a> &pt)</td></tr>
|
|
<tr class="separator:abe738fd38b7b592353d5b7676955f55f"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a0a56a697fa850260af5fa7bb0495fac2"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a0a56a697fa850260af5fa7bb0495fac2">computeNextCWEdges</a> ()</td></tr>
|
|
<tr class="separator:a0a56a697fa850260af5fa7bb0495fac2"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ad04246f6722be8f6e113aeb49b3a517f"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#ad04246f6722be8f6e113aeb49b3a517f">convertMaximalToMinimalEdgeRings</a> (std::vector< <a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeDirectedEdge.html">PolygonizeDirectedEdge</a> * > &ringEdges)</td></tr>
|
|
<tr class="memdesc:ad04246f6722be8f6e113aeb49b3a517f"><td class="mdescLeft"> </td><td class="mdescRight">Convert the maximal edge rings found by the initial graph traversal into the minimal edge rings required by JTS polygon topology rules. <a href="#ad04246f6722be8f6e113aeb49b3a517f">More...</a><br /></td></tr>
|
|
<tr class="separator:ad04246f6722be8f6e113aeb49b3a517f"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a515c52d1a356cb68c86ce409b48daf76"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1EdgeRing.html">EdgeRing</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a515c52d1a356cb68c86ce409b48daf76">findEdgeRing</a> (<a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeDirectedEdge.html">PolygonizeDirectedEdge</a> *startDE)</td></tr>
|
|
<tr class="separator:a515c52d1a356cb68c86ce409b48daf76"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-static-methods"></a>
|
|
Static Private Member Functions</h2></td></tr>
|
|
<tr class="memitem:a3e844cb6721bd21e78485232ae893fac"><td class="memItemLeft" align="right" valign="top">static int </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a3e844cb6721bd21e78485232ae893fac">getDegreeNonDeleted</a> (<a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a> *node)</td></tr>
|
|
<tr class="separator:a3e844cb6721bd21e78485232ae893fac"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a79a7d031e5655e343aebfc7867591594"><td class="memItemLeft" align="right" valign="top">static int </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a79a7d031e5655e343aebfc7867591594">getDegree</a> (<a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a> *node, long <a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a021049c4d0697b33bd2e660c9de50023">label</a>)</td></tr>
|
|
<tr class="separator:a79a7d031e5655e343aebfc7867591594"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ae48c0eb5b219723a5a49387f0a68d35c"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#ae48c0eb5b219723a5a49387f0a68d35c">findIntersectionNodes</a> (<a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeDirectedEdge.html">PolygonizeDirectedEdge</a> *startDE, long <a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a021049c4d0697b33bd2e660c9de50023">label</a>, std::vector< <a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a> * > &intNodes)</td></tr>
|
|
<tr class="memdesc:ae48c0eb5b219723a5a49387f0a68d35c"><td class="mdescLeft"> </td><td class="mdescRight">Finds all nodes in a maximal edgering which are self-intersection nodes. <a href="#ae48c0eb5b219723a5a49387f0a68d35c">More...</a><br /></td></tr>
|
|
<tr class="separator:ae48c0eb5b219723a5a49387f0a68d35c"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ac6f941c88581b297da633d230f8ea8c2"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#ac6f941c88581b297da633d230f8ea8c2">findLabeledEdgeRings</a> (std::vector< <a class="el" href="classgeos_1_1planargraph_1_1DirectedEdge.html">planargraph::DirectedEdge</a> * > &dirEdgesIn, std::vector< <a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeDirectedEdge.html">PolygonizeDirectedEdge</a> * > &dirEdgesOut)</td></tr>
|
|
<tr class="separator:ac6f941c88581b297da633d230f8ea8c2"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a021049c4d0697b33bd2e660c9de50023"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a021049c4d0697b33bd2e660c9de50023">label</a> (std::vector< <a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeDirectedEdge.html">PolygonizeDirectedEdge</a> * > &<a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a69775a29920eea17e7760fd58a31afb4">dirEdges</a>, long label)</td></tr>
|
|
<tr class="separator:a021049c4d0697b33bd2e660c9de50023"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a052bbf9a0455a0107cdabb005b89ad13"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a052bbf9a0455a0107cdabb005b89ad13">label</a> (std::vector< <a class="el" href="classgeos_1_1planargraph_1_1DirectedEdge.html">planargraph::DirectedEdge</a> * > &<a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a69775a29920eea17e7760fd58a31afb4">dirEdges</a>, long label)</td></tr>
|
|
<tr class="separator:a052bbf9a0455a0107cdabb005b89ad13"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a78d6cdd0bcde58373af42f2b5020191d"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a78d6cdd0bcde58373af42f2b5020191d">computeNextCWEdges</a> (<a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a> *node)</td></tr>
|
|
<tr class="separator:a78d6cdd0bcde58373af42f2b5020191d"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:aede6ace086b511b2b9bcc5e7d007c5a7"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#aede6ace086b511b2b9bcc5e7d007c5a7">computeNextCCWEdges</a> (<a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a> *node, long <a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a021049c4d0697b33bd2e660c9de50023">label</a>)</td></tr>
|
|
<tr class="memdesc:aede6ace086b511b2b9bcc5e7d007c5a7"><td class="mdescLeft"> </td><td class="mdescRight">Computes the next edge pointers going CCW around the given node, for the given edgering label. This algorithm has the effect of converting maximal edgerings into minimal edgerings. <a href="#aede6ace086b511b2b9bcc5e7d007c5a7">More...</a><br /></td></tr>
|
|
<tr class="separator:aede6ace086b511b2b9bcc5e7d007c5a7"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
|
|
Private Attributes</h2></td></tr>
|
|
<tr class="memitem:a12f5401a9d58f574292f7beffd4e9c38"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="classgeos_1_1geom_1_1GeometryFactory.html">geom::GeometryFactory</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a12f5401a9d58f574292f7beffd4e9c38">factory</a></td></tr>
|
|
<tr class="separator:a12f5401a9d58f574292f7beffd4e9c38"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a3b0a98465de20d72c679223532b87650"><td class="memItemLeft" align="right" valign="top">std::vector< <a class="el" href="classgeos_1_1planargraph_1_1Edge.html">planargraph::Edge</a> * > </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a3b0a98465de20d72c679223532b87650">newEdges</a></td></tr>
|
|
<tr class="separator:a3b0a98465de20d72c679223532b87650"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a2acacaa01ae72f827d8260a6fa7ef112"><td class="memItemLeft" align="right" valign="top">std::vector< <a class="el" href="classgeos_1_1planargraph_1_1DirectedEdge.html">planargraph::DirectedEdge</a> * > </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a2acacaa01ae72f827d8260a6fa7ef112">newDirEdges</a></td></tr>
|
|
<tr class="separator:a2acacaa01ae72f827d8260a6fa7ef112"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a9df392d5d8be84e61974e2ac87076e13"><td class="memItemLeft" align="right" valign="top">std::vector< <a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a> * > </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a9df392d5d8be84e61974e2ac87076e13">newNodes</a></td></tr>
|
|
<tr class="separator:a9df392d5d8be84e61974e2ac87076e13"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a9477440faa7942424345333c2a86c4d3"><td class="memItemLeft" align="right" valign="top">std::vector< <a class="el" href="classgeos_1_1operation_1_1polygonize_1_1EdgeRing.html">EdgeRing</a> * > </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#a9477440faa7942424345333c2a86c4d3">newEdgeRings</a></td></tr>
|
|
<tr class="separator:a9477440faa7942424345333c2a86c4d3"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:acbe848df963df98833f7ded5967bbf9e"><td class="memItemLeft" align="right" valign="top">std::vector< <a class="el" href="classgeos_1_1geom_1_1CoordinateSequence.html">geom::CoordinateSequence</a> * > </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html#acbe848df963df98833f7ded5967bbf9e">newCoords</a></td></tr>
|
|
<tr class="separator:acbe848df963df98833f7ded5967bbf9e"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="inherited"></a>
|
|
Additional Inherited Members</h2></td></tr>
|
|
<tr class="inherit_header pub_types_classgeos_1_1planargraph_1_1PlanarGraph"><td colspan="2" onclick="javascript:toggleInherit('pub_types_classgeos_1_1planargraph_1_1PlanarGraph')"><img src="closed.png" alt="-"/> Public Types inherited from <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html">geos::planargraph::PlanarGraph</a></td></tr>
|
|
<tr class="memitem:a40f7bb547ee1f957c716bcac6eade462 inherit pub_types_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">typedef std::vector< <a class="el" href="classgeos_1_1planargraph_1_1Edge.html">Edge</a> * > </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a40f7bb547ee1f957c716bcac6eade462">EdgeContainer</a></td></tr>
|
|
<tr class="separator:a40f7bb547ee1f957c716bcac6eade462 inherit pub_types_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a4648cd7b6b17aca8d4d5a877762b5982 inherit pub_types_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">typedef EdgeContainer::iterator </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a4648cd7b6b17aca8d4d5a877762b5982">EdgeIterator</a></td></tr>
|
|
<tr class="separator:a4648cd7b6b17aca8d4d5a877762b5982 inherit pub_types_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="inherit_header pro_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td colspan="2" onclick="javascript:toggleInherit('pro_methods_classgeos_1_1planargraph_1_1PlanarGraph')"><img src="closed.png" alt="-"/> Protected Member Functions inherited from <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html">geos::planargraph::PlanarGraph</a></td></tr>
|
|
<tr class="memitem:a930a3d2e45f4a2caef6cb86cbe7fd731 inherit pro_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a930a3d2e45f4a2caef6cb86cbe7fd731">add</a> (<a class="el" href="classgeos_1_1planargraph_1_1Node.html">Node</a> *node)</td></tr>
|
|
<tr class="memdesc:a930a3d2e45f4a2caef6cb86cbe7fd731 inherit pro_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Adds a node to the std::map, replacing any that is already at that location. <a href="#a930a3d2e45f4a2caef6cb86cbe7fd731">More...</a><br /></td></tr>
|
|
<tr class="separator:a930a3d2e45f4a2caef6cb86cbe7fd731 inherit pro_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a5217df65deeba7c4834709d44854066b inherit pro_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a5217df65deeba7c4834709d44854066b">add</a> (<a class="el" href="classgeos_1_1planargraph_1_1Edge.html">Edge</a> *edge)</td></tr>
|
|
<tr class="memdesc:a5217df65deeba7c4834709d44854066b inherit pro_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Adds the <a class="el" href="classgeos_1_1planargraph_1_1Edge.html" title="Represents an undirected edge of a PlanarGraph. ">Edge</a> and its DirectedEdges with this <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html" title="Represents a directed graph which is embeddable in a planar surface. ">PlanarGraph</a>. <a href="#a5217df65deeba7c4834709d44854066b">More...</a><br /></td></tr>
|
|
<tr class="separator:a5217df65deeba7c4834709d44854066b inherit pro_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a92507cdab36f99269e388d190b01e227 inherit pro_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a92507cdab36f99269e388d190b01e227">add</a> (<a class="el" href="classgeos_1_1planargraph_1_1DirectedEdge.html">DirectedEdge</a> *dirEdge)</td></tr>
|
|
<tr class="memdesc:a92507cdab36f99269e388d190b01e227 inherit pro_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="mdescLeft"> </td><td class="mdescRight">Adds the <a class="el" href="classgeos_1_1planargraph_1_1Edge.html" title="Represents an undirected edge of a PlanarGraph. ">Edge</a> to this <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html" title="Represents a directed graph which is embeddable in a planar surface. ">PlanarGraph</a>. <a href="#a92507cdab36f99269e388d190b01e227">More...</a><br /></td></tr>
|
|
<tr class="separator:a92507cdab36f99269e388d190b01e227 inherit pro_methods_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="inherit_header pro_attribs_classgeos_1_1planargraph_1_1PlanarGraph"><td colspan="2" onclick="javascript:toggleInherit('pro_attribs_classgeos_1_1planargraph_1_1PlanarGraph')"><img src="closed.png" alt="-"/> Protected Attributes inherited from <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html">geos::planargraph::PlanarGraph</a></td></tr>
|
|
<tr class="memitem:a6faf3a6fe3f5e3023470fbb6c34247fd inherit pro_attribs_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">std::vector< <a class="el" href="classgeos_1_1planargraph_1_1Edge.html">Edge</a> * > </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a6faf3a6fe3f5e3023470fbb6c34247fd">edges</a></td></tr>
|
|
<tr class="separator:a6faf3a6fe3f5e3023470fbb6c34247fd inherit pro_attribs_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a69775a29920eea17e7760fd58a31afb4 inherit pro_attribs_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top">std::vector< <a class="el" href="classgeos_1_1planargraph_1_1DirectedEdge.html">DirectedEdge</a> * > </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a69775a29920eea17e7760fd58a31afb4">dirEdges</a></td></tr>
|
|
<tr class="separator:a69775a29920eea17e7760fd58a31afb4 inherit pro_attribs_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a59d27326b0abb7e5bb28a784cb490279 inherit pro_attribs_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classgeos_1_1planargraph_1_1NodeMap.html">NodeMap</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html#a59d27326b0abb7e5bb28a784cb490279">nodeMap</a></td></tr>
|
|
<tr class="separator:a59d27326b0abb7e5bb28a784cb490279 inherit pro_attribs_classgeos_1_1planargraph_1_1PlanarGraph"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
|
<div class="textblock"><p>Represents a planar graph of edges that can be used to compute a polygonization, and implements the algorithms to compute the EdgeRings formed by the graph. </p>
|
|
<p>The marked flag on DirectedEdge is used to indicate that a directed edge has be logically deleted from the graph. </p>
|
|
|
|
<p>Definition at line <a class="el" href="PolygonizeGraph_8h_source.html#l00069">69</a> of file <a class="el" href="PolygonizeGraph_8h_source.html">PolygonizeGraph.h</a>.</p>
|
|
</div><h2 class="groupheader">Constructor & Destructor Documentation</h2>
|
|
<a class="anchor" id="aa8705c8bedb0c60e2f2a6f614c5207df"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">geos::operation::polygonize::PolygonizeGraph::PolygonizeGraph </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const <a class="el" href="classgeos_1_1geom_1_1GeometryFactory.html">geom::GeometryFactory</a> * </td>
|
|
<td class="paramname"><em>newFactory</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">explicit</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Create a new polygonization graph. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a7a89e83b7641eb7e202d7319a5b38aac"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">geos::operation::polygonize::PolygonizeGraph::~PolygonizeGraph </td>
|
|
<td>(</td>
|
|
<td class="paramname"></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">override</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Destroy a polygonization graph. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<h2 class="groupheader">Member Function Documentation</h2>
|
|
<a class="anchor" id="a61a8606fd05649244acbb6227a147170"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void geos::operation::polygonize::PolygonizeGraph::addEdge </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const <a class="el" href="classgeos_1_1geom_1_1LineString.html">geom::LineString</a> * </td>
|
|
<td class="paramname"><em>line</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Add a LineString forming an edge of the polygon graph. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">line</td><td>the line to add </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="aede6ace086b511b2b9bcc5e7d007c5a7"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">static void geos::operation::polygonize::PolygonizeGraph::computeNextCCWEdges </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a> * </td>
|
|
<td class="paramname"><em>node</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">long </td>
|
|
<td class="paramname"><em>label</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">static</span><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Computes the next edge pointers going CCW around the given node, for the given edgering label. This algorithm has the effect of converting maximal edgerings into minimal edgerings. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a0a56a697fa850260af5fa7bb0495fac2"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void geos::operation::polygonize::PolygonizeGraph::computeNextCWEdges </td>
|
|
<td>(</td>
|
|
<td class="paramname"></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a78d6cdd0bcde58373af42f2b5020191d"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">static void geos::operation::polygonize::PolygonizeGraph::computeNextCWEdges </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a> * </td>
|
|
<td class="paramname"><em>node</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">static</span><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="ad04246f6722be8f6e113aeb49b3a517f"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void geos::operation::polygonize::PolygonizeGraph::convertMaximalToMinimalEdgeRings </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< <a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeDirectedEdge.html">PolygonizeDirectedEdge</a> * > & </td>
|
|
<td class="paramname"><em>ringEdges</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Convert the maximal edge rings found by the initial graph traversal into the minimal edge rings required by JTS polygon topology rules. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">ringEdges</td><td>the list of start edges for the edgeRings to convert. </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a027be1de727ccdf1d9784fd95dcb2714"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">static void geos::operation::polygonize::PolygonizeGraph::deleteAllEdges </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a> * </td>
|
|
<td class="paramname"><em>node</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">static</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Deletes all edges at a node. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a0992fffa3d00e4f4084fbb2a78ad1988"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void geos::operation::polygonize::PolygonizeGraph::deleteCutEdges </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< const <a class="el" href="classgeos_1_1geom_1_1LineString.html">geom::LineString</a> * > & </td>
|
|
<td class="paramname"><em>cutLines</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Finds and removes all cut edges from the graph. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">cutLines</td><td>: the list of the LineString forming the removed cut edges will be pushed here.</td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<p>TODO: document ownership of the returned LineStrings </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="af637ef4dcd1ce6d31a335b26d55bad5e"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void geos::operation::polygonize::PolygonizeGraph::deleteDangles </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< const <a class="el" href="classgeos_1_1geom_1_1LineString.html">geom::LineString</a> * > & </td>
|
|
<td class="paramname"><em>dangleLines</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Marks all edges from the graph which are "dangles". </p>
|
|
<p>Dangles are which are incident on a node with degree 1. This process is recursive, since removing a dangling edge may result in another edge becoming a dangle. In order to handle large recursion depths efficiently, an explicit recursion stack is used</p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">dangleLines</td><td>: the LineStrings that formed dangles will be push_back'ed here </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a515c52d1a356cb68c86ce409b48daf76"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1EdgeRing.html">EdgeRing</a>* geos::operation::polygonize::PolygonizeGraph::findEdgeRing </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeDirectedEdge.html">PolygonizeDirectedEdge</a> * </td>
|
|
<td class="paramname"><em>startDE</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="ae48c0eb5b219723a5a49387f0a68d35c"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">static void geos::operation::polygonize::PolygonizeGraph::findIntersectionNodes </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeDirectedEdge.html">PolygonizeDirectedEdge</a> * </td>
|
|
<td class="paramname"><em>startDE</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">long </td>
|
|
<td class="paramname"><em>label</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::vector< <a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a> * > & </td>
|
|
<td class="paramname"><em>intNodes</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">static</span><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Finds all nodes in a maximal edgering which are self-intersection nodes. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">startDE</td><td></td></tr>
|
|
<tr><td class="paramname">label</td><td></td></tr>
|
|
<tr><td class="paramname">intNodes</td><td>: intersection nodes found will be pushed here the vector won't be cleared before pushing. </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="ac6f941c88581b297da633d230f8ea8c2"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">static void geos::operation::polygonize::PolygonizeGraph::findLabeledEdgeRings </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< <a class="el" href="classgeos_1_1planargraph_1_1DirectedEdge.html">planargraph::DirectedEdge</a> * > & </td>
|
|
<td class="paramname"><em>dirEdgesIn</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">std::vector< <a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeDirectedEdge.html">PolygonizeDirectedEdge</a> * > & </td>
|
|
<td class="paramname"><em>dirEdgesOut</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">static</span><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Finds and labels all edgerings in the graph.</p>
|
|
<p>The edge rings are labeling with unique integers. The labeling allows detecting cut edges.</p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">dirEdgesIn</td><td>a list of the DirectedEdges in the graph </td></tr>
|
|
<tr><td class="paramname">dirEdgesOut</td><td>each ring found will be pushed here </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a79a7d031e5655e343aebfc7867591594"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">static int geos::operation::polygonize::PolygonizeGraph::getDegree </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a> * </td>
|
|
<td class="paramname"><em>node</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">long </td>
|
|
<td class="paramname"><em>label</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">static</span><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a3e844cb6721bd21e78485232ae893fac"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">static int geos::operation::polygonize::PolygonizeGraph::getDegreeNonDeleted </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a> * </td>
|
|
<td class="paramname"><em>node</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">static</span><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a004c877e7b17942ec15fc2176dd89cf4"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void geos::operation::polygonize::PolygonizeGraph::getEdgeRings </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< <a class="el" href="classgeos_1_1operation_1_1polygonize_1_1EdgeRing.html">EdgeRing</a> * > & </td>
|
|
<td class="paramname"><em>edgeRingList</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Computes the EdgeRings formed by the edges in this graph. </p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramname">edgeRingList</td><td>: the <a class="el" 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> found by the polygonization process will be pushed here. </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="abe738fd38b7b592353d5b7676955f55f"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname"><a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a>* geos::operation::polygonize::PolygonizeGraph::getNode </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const <a class="el" href="classgeos_1_1geom_1_1Coordinate.html">geom::Coordinate</a> & </td>
|
|
<td class="paramname"><em>pt</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a021049c4d0697b33bd2e660c9de50023"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">static void geos::operation::polygonize::PolygonizeGraph::label </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< <a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeDirectedEdge.html">PolygonizeDirectedEdge</a> * > & </td>
|
|
<td class="paramname"><em>dirEdges</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">long </td>
|
|
<td class="paramname"><em>label</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">static</span><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a052bbf9a0455a0107cdabb005b89ad13"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">static void geos::operation::polygonize::PolygonizeGraph::label </td>
|
|
<td>(</td>
|
|
<td class="paramtype">std::vector< <a class="el" href="classgeos_1_1planargraph_1_1DirectedEdge.html">planargraph::DirectedEdge</a> * > & </td>
|
|
<td class="paramname"><em>dirEdges</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">long </td>
|
|
<td class="paramname"><em>label</em> </td>
|
|
</tr>
|
|
<tr>
|
|
<td></td>
|
|
<td>)</td>
|
|
<td></td><td></td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">static</span><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
</div>
|
|
</div>
|
|
<h2 class="groupheader">Member Data Documentation</h2>
|
|
<a class="anchor" id="a12f5401a9d58f574292f7beffd4e9c38"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">const <a class="el" href="classgeos_1_1geom_1_1GeometryFactory.html">geom::GeometryFactory</a>* geos::operation::polygonize::PolygonizeGraph::factory</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Definition at line <a class="el" href="PolygonizeGraph_8h_source.html#l00139">139</a> of file <a class="el" href="PolygonizeGraph_8h_source.html">PolygonizeGraph.h</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="acbe848df963df98833f7ded5967bbf9e"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">std::vector<<a class="el" href="classgeos_1_1geom_1_1CoordinateSequence.html">geom::CoordinateSequence</a>*> geos::operation::polygonize::PolygonizeGraph::newCoords</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Definition at line <a class="el" href="PolygonizeGraph_8h_source.html#l00205">205</a> of file <a class="el" href="PolygonizeGraph_8h_source.html">PolygonizeGraph.h</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a2acacaa01ae72f827d8260a6fa7ef112"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">std::vector<<a class="el" href="classgeos_1_1planargraph_1_1DirectedEdge.html">planargraph::DirectedEdge</a>*> geos::operation::polygonize::PolygonizeGraph::newDirEdges</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Definition at line <a class="el" href="PolygonizeGraph_8h_source.html#l00202">202</a> of file <a class="el" href="PolygonizeGraph_8h_source.html">PolygonizeGraph.h</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a9477440faa7942424345333c2a86c4d3"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">std::vector<<a class="el" href="classgeos_1_1operation_1_1polygonize_1_1EdgeRing.html">EdgeRing</a>*> geos::operation::polygonize::PolygonizeGraph::newEdgeRings</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Definition at line <a class="el" href="PolygonizeGraph_8h_source.html#l00204">204</a> of file <a class="el" href="PolygonizeGraph_8h_source.html">PolygonizeGraph.h</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a3b0a98465de20d72c679223532b87650"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">std::vector<<a class="el" href="classgeos_1_1planargraph_1_1Edge.html">planargraph::Edge</a>*> geos::operation::polygonize::PolygonizeGraph::newEdges</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Definition at line <a class="el" href="PolygonizeGraph_8h_source.html#l00201">201</a> of file <a class="el" href="PolygonizeGraph_8h_source.html">PolygonizeGraph.h</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a class="anchor" id="a9df392d5d8be84e61974e2ac87076e13"></a>
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">std::vector<<a class="el" href="classgeos_1_1planargraph_1_1Node.html">planargraph::Node</a>*> geos::operation::polygonize::PolygonizeGraph::newNodes</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Definition at line <a class="el" href="PolygonizeGraph_8h_source.html#l00203">203</a> of file <a class="el" href="PolygonizeGraph_8h_source.html">PolygonizeGraph.h</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<hr/>The documentation for this class was generated from the following file:<ul>
|
|
<li><a class="el" href="PolygonizeGraph_8h_source.html">PolygonizeGraph.h</a></li>
|
|
</ul>
|
|
</div><!-- contents -->
|
|
<!-- start footer part -->
|
|
<hr class="footer"/><address class="footer"><small>
|
|
Generated by  <a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/>
|
|
</a> 1.8.11
|
|
</small></address>
|
|
</body>
|
|
</html>
|