<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic visibility graph in ArcObjects SDK Questions</title>
    <link>https://community.esri.com/t5/arcobjects-sdk-questions/visibility-graph/m-p/718232#M19133</link>
    <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;SPAN&gt;Hello,&lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;I'm looking for the way to construct visibility graph (not visibility analysis) in ArcGIS. visibility graph is: &lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;&amp;nbsp; "v.net.visibility computes the visibility graph of a vector map containing lines, areas (boundaries) and points. The visibility graph is the graph where the nodes are the end point of the lines, boundaries or simply the points. There is an edge between two nodes if they are 'visible'. Two nodes are visibible if there is no segments in between them, i.e. the edge doesn't intersect any line or boundary in the vector map. This is useful to compute the sortest path in a vector map from any two points. To do this, first you need to compute the visibility graph and from it compute the shortest path using v.net.path or d.path."&amp;nbsp;&amp;nbsp; (from manual of GRASS GIS) &lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;There are huge amount of research in the field of computational geometry, but they are just about algoritm itself.&lt;/SPAN&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
    <pubDate>Mon, 11 Jun 2012 18:10:13 GMT</pubDate>
    <dc:creator>InsuHong1</dc:creator>
    <dc:date>2012-06-11T18:10:13Z</dc:date>
    <item>
      <title>visibility graph</title>
      <link>https://community.esri.com/t5/arcobjects-sdk-questions/visibility-graph/m-p/718232#M19133</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;SPAN&gt;Hello,&lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;I'm looking for the way to construct visibility graph (not visibility analysis) in ArcGIS. visibility graph is: &lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;&amp;nbsp; "v.net.visibility computes the visibility graph of a vector map containing lines, areas (boundaries) and points. The visibility graph is the graph where the nodes are the end point of the lines, boundaries or simply the points. There is an edge between two nodes if they are 'visible'. Two nodes are visibible if there is no segments in between them, i.e. the edge doesn't intersect any line or boundary in the vector map. This is useful to compute the sortest path in a vector map from any two points. To do this, first you need to compute the visibility graph and from it compute the shortest path using v.net.path or d.path."&amp;nbsp;&amp;nbsp; (from manual of GRASS GIS) &lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;There are huge amount of research in the field of computational geometry, but they are just about algoritm itself.&lt;/SPAN&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Mon, 11 Jun 2012 18:10:13 GMT</pubDate>
      <guid>https://community.esri.com/t5/arcobjects-sdk-questions/visibility-graph/m-p/718232#M19133</guid>
      <dc:creator>InsuHong1</dc:creator>
      <dc:date>2012-06-11T18:10:13Z</dc:date>
    </item>
    <item>
      <title>Re: visibility graph</title>
      <link>https://community.esri.com/t5/arcobjects-sdk-questions/visibility-graph/m-p/718233#M19134</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;BLOCKQUOTE class="jive-quote"&gt;Hello,&lt;BR /&gt;&lt;BR /&gt;I'm looking for the way to construct visibility graph (not visibility analysis) in ArcGIS. visibility graph is: &lt;BR /&gt;&lt;BR /&gt;&amp;nbsp; "v.net.visibility computes the visibility graph of a vector map containing lines, areas (boundaries) and points. The visibility graph is the graph where the nodes are the end point of the lines, boundaries or simply the points. There is an edge between two nodes if they are 'visible'. Two nodes are visibible if there is no segments in between them, i.e. the edge doesn't intersect any line or boundary in the vector map. This is useful to compute the sortest path in a vector map from any two points. To do this, first you need to compute the visibility graph and from it compute the shortest path using v.net.path or d.path."&amp;nbsp;&amp;nbsp; (from manual of GRASS GIS) &lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;There are huge amount of research in the field of computational geometry, but they are just about algoritm itself.&lt;/BLOCKQUOTE&gt;&lt;BR /&gt;&lt;SPAN&gt; &lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;Hello iaminsu12,&lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;I'm kind of dealing with the same problem for a university project work. Have you found any proper solution to computing visibility graphs (for LOS Connections, etc.)?&lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;Thanks...&lt;/SPAN&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 11 Jul 2013 07:43:29 GMT</pubDate>
      <guid>https://community.esri.com/t5/arcobjects-sdk-questions/visibility-graph/m-p/718233#M19134</guid>
      <dc:creator>HaraldMathae</dc:creator>
      <dc:date>2013-07-11T07:43:29Z</dc:date>
    </item>
    <item>
      <title>Re: visibility graph</title>
      <link>https://community.esri.com/t5/arcobjects-sdk-questions/visibility-graph/m-p/718234#M19135</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;SPAN&gt;Hey All.&amp;nbsp; I figured out how to do this but I didn't use the esri tools as they currently do not have a tool set to support the creation of a visibility graph.&amp;nbsp; There is a request on the "Esri Ideas" page though.&amp;nbsp; Might want to find it and like it so it gets promoted.&lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;Here's what I did:&lt;/SPAN&gt;&lt;BR /&gt;&lt;SPAN&gt;- Download QGIS, GRASS, and the GRASS toolbox for QGIS (all free open source software).&lt;/SPAN&gt;&lt;BR /&gt;&lt;SPAN&gt;- You'll probably need to also download a GDAL library (check out &lt;/SPAN&gt;&lt;A _jive_internal="true" href="https://community.esri.com/www.maptools.com"&gt;www.maptools.com&lt;/A&gt;&lt;SPAN&gt;) Also free.&lt;/SPAN&gt;&lt;BR /&gt;&lt;SPAN&gt;- Open GRASS and make a new 'mapset'.&amp;nbsp; (They have their own terminology for things and I'm a rookie so I might be getting these names wrong).&amp;nbsp; You can import shapefiles directly into GRASS adn save them as a new mapset.&lt;/SPAN&gt;&lt;BR /&gt;&lt;SPAN&gt;- Open QGIS and make sure the GRASS Toolbox is downloaded.&lt;/SPAN&gt;&lt;BR /&gt;&lt;SPAN&gt;- Import GRASS mapset into QGIS instance via the toolbox.&lt;/SPAN&gt;&lt;BR /&gt;&lt;SPAN&gt;- Use GRASS toolbox in QGIS to run the VGA tool (&lt;/SPAN&gt;&lt;A href="http://grass.osgeo.org/grass64/manuals/v.net.visibility.html"&gt;http://grass.osgeo.org/grass64/manuals/v.net.visibility.html&lt;/A&gt;&lt;SPAN&gt;)&lt;/SPAN&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;I glossed over some things but this is the jist of it.&amp;nbsp; If I can figure it out, you can too.&lt;/SPAN&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Tue, 14 Jan 2014 14:23:01 GMT</pubDate>
      <guid>https://community.esri.com/t5/arcobjects-sdk-questions/visibility-graph/m-p/718234#M19135</guid>
      <dc:creator>DanMeehan</dc:creator>
      <dc:date>2014-01-14T14:23:01Z</dc:date>
    </item>
  </channel>
</rss>

