| ||||
| ||||
Description | ||||
Graph Voronoi Diagram | ||||
Documentation | ||||
type Voronoi a = LRTree a | ||||
gvdIn :: (DynGraph gr, Real b) => [Node] -> gr a b -> Voronoi b | ||||
gvdOut :: (Graph gr, Real b) => [Node] -> gr a b -> Voronoi b | ||||
voronoiSet :: Real b => Node -> Voronoi b -> [Node] | ||||
nearestNode :: Real b => Node -> Voronoi b -> Maybe Node | ||||
nearestDist :: Real b => Node -> Voronoi b -> Maybe b | ||||
nearestPath :: Real b => Node -> Voronoi b -> Maybe Path | ||||
Produced by Haddock version 0.7 |