Changes between Version 4 and Version 5 of doc/tec/mas/agent_preprocessing

Timestamp:

Aug 31, 2018 12:21:31 PM (7 years ago)

Author:

sward

Comment:

--

doc/tec/mas/agent_preprocessing

@@ -16 +16 @@
 * Determine furthest vertex p,,f,, from p,,0,,p,,n,,
 * If distance d(p,,f,,,p,,0,,p,,n,,) < ε, accept p,,0,,p,,n,, as approximation.\\
-        Else, break P at p,,f,, and recursively\\
-        approximate {p,,0,,,p,,1,,,...,p,,f,,} and {p,,f,,,...,p,,n,,}
+        Else, break P at p,,f,, and recursively approximate {p,,0,,,p,,1,,,...,p,,f,,} and {p,,f,,,...,p,,n,,}
 }}}
 {{{#!td style="vertical-align:top; text-align:left;width: 250px"
-asdf
+[[Image(poiker.gif,400px)]]
 }}}
 
 3) All remaining convex polygon vertices are '''added to the graph''' as nodes.\\
 4) '''Connections''' are established between each pair of nodes that are visible by each other. The associated cost is set to the direct distance.\\
-5) The polygon and graph data is '''output''' to a Fortran binary file that can be read by PALM.\\
+5) The polygon and graph data is '''output''' to a [wiki:doc/app/iofiles#NAVIGATION_DATA Fortran binary file] that can be read by PALM.\\