plaza_preprocessing.optimizer package

Subpackages

• plaza_preprocessing.optimizer.graphprocessor package
  • Submodules
  • plaza_preprocessing.optimizer.graphprocessor.graphprocessor module
  • plaza_preprocessing.optimizer.graphprocessor.spiderwebgraph module
  • plaza_preprocessing.optimizer.graphprocessor.visibilitygraph module
  • Module contents

Submodules

plaza_preprocessing.optimizer.optimizer module

plaza_preprocessing.optimizer.shortest_paths module

plaza_preprocessing.optimizer.shortest_paths.compute_astar_shortest_paths(graph, entry_points)

compute a list of shortest paths as LineStrings between all pairs of entry points using the astar algorithm. Uses direct distance between entry points as a heuristic

Return type:List[LineString]

plaza_preprocessing.optimizer.shortest_paths.compute_dijkstra_shortest_paths(graph, entry_points)

compute a list of shortest paths as LineStrings between all pairs of entry points using the dijkstra algorithm

Return type:List[LineString]

plaza_preprocessing.optimizer.shortest_paths.create_graph(graph_edges)

create a networkx graph with a collection of edges

Return type:Graph

plaza_preprocessing.optimizer.utils module

plaza_preprocessing.optimizer.utils.find_nearest_geometry(obj, geometries)

return the geometry that is nearest to the object

plaza_preprocessing.optimizer.utils.get_polygon_coords(polygon)

return a list of coordinates of all points in a polygon

plaza_preprocessing.optimizer.utils.line_visible(plaza_geometry, line, delta_m)

check if the line is “visible”, i.e. unobstructed through the plaza

plaza_preprocessing.optimizer.utils.meters_to_degrees(meters)

convert meters to approximate degrees

plaza_preprocessing.optimizer.utils.timing(f)

decorator function to measure runtime of a function

plaza_preprocessing.optimizer.utils.unpack_geometry_coordinates(geometry)

return a set with every point in LineString and Point geometries

Module contents