A Lane Tree represents how the road continues from a given lane on the map. The root of the Lane Tree is a selected source lane. The children of a tree node are its direct successor lanes at the end of the current Road Segment. Optionally, also the successors of neighbor lanes that are reachable through a lane change are child nodes. This supports exploration of reachable lanes from a given lane, up to a specified limit, either with or without lane changes. The limit can be either distance or driving time.
The caller must estimate maxLaneCount
. It is the maximum number of dwMapsLane
objects that can be stored in the tree. The function uses it to pre-allocate the buffers used during the tree creation.
There are three different ways to access the result:
Followed by:
Followed by:
There is a helper function to stitch the geometry of connected lanes into one single polyline, see dwMaps_stitchLaneGeometry()
in the next chapter: Lane Tree Helper Functions
For more information see Map Access Sample .