Differences

This shows you the differences between two versions of the page.

Link to this comparison view

maps [2009/02/09 21:09]
hadrien
maps [2013/07/09 12:09] (current)
hadrien
Line 211: Line 211:
 TimedMap is actually a container for maps. It stores successive versions of a map, duplicating the last version at each step for keeping track of it. TimedMap uses COWGridMap at duplication,​ to reduce memory consumption. TimedMap also inherits from GridMapBase,​ which may look weird, but actually is a shortcut to accessing the last map. This compatibility also enables using TimedMap in functions and algorithms working with GridMapBase. TimedMap is actually a container for maps. It stores successive versions of a map, duplicating the last version at each step for keeping track of it. TimedMap uses COWGridMap at duplication,​ to reduce memory consumption. TimedMap also inherits from GridMapBase,​ which may look weird, but actually is a shortcut to accessing the last map. This compatibility also enables using TimedMap in functions and algorithms working with GridMapBase.
  
-Map duplication is done when calling the increment operator (myTimedMap++);​ access to older version of the map is done through the bracket operator ​ (myTimedMap[5] is the map 5 steps ago).+Map duplication is done when calling the increment operator (<​nowiki>​myTimedMap++</​nowiki>​); access to older version of the map is done through the bracket operator ​ (myTimedMap[5] is the map 5 steps ago).
  
 <​graphviz>​ <​graphviz>​
Line 252: Line 252:
   * simplification:​ using the [[algorithms#​DP|Douglas-Peucker]] algorithm, this operation removes edges depending on a tolerance parameters   * simplification:​ using the [[algorithms#​DP|Douglas-Peucker]] algorithm, this operation removes edges depending on a tolerance parameters
   * triangulation:​ the polygon is split in triangles in an operation called Constrained Delaunay Triangulation;​ the properties of this algorithm are useful for triangle-based pathfinding.   * triangulation:​ the polygon is split in triangles in an operation called Constrained Delaunay Triangulation;​ the properties of this algorithm are useful for triangle-based pathfinding.
- 
 
maps.txt ยท Last modified: 2013/07/09 12:09 by hadrien
Recent changes RSS feed Creative Commons License Donate Powered by PHP Valid XHTML 1.0 Valid CSS La rache Driven by DokuWiki