generateNavigationGraph
fun generateNavigationGraph(origin: Euclidean2DPosition = Euclidean2DPosition(0.0, 0.0), width: Double, height: Double, obstacles: List<Shape>, rooms: Collection<Euclidean2DPosition>, unity: Double = 1.0): Euclidean2DNavigationGraph(source)
Parameters
origin
the origin of the environment, defaults to (0,0).Content copied to clipboard
width
the width of the environment (only positive).Content copied to clipboard
height
the height of the environment (only positive).Content copied to clipboard
obstacles
the obstacles of the environment (only convex polygonal obstacles
are supported).Content copied to clipboard
rooms
a collection of positions where to plant initial seeds. In indoor
environments, these positions are usually located inside rooms
(and corridors), hence the name of the parameter.Content copied to clipboard
unity
the quantity considered to be a unit in the environment (defaults
to 1.0 because this algorithm works best with environments featuring
integer coordinates). In the growing phase, each side of each seed
will be advanced of a quantity equal to unity iteratively, hence the
smaller this value is the slower the algorithm will be.Content copied to clipboard