#include <voronoi_graph_generator.h>

Public Member Functions | |
| std::vector< Segment > | calcSegments (cv::Mat &_map, cv::Mat &_distField, cv::Mat &_voronoiPath, float *potential, float _path_length, float _optimizeCrossingPixels, float _optimizeEndSegmentsPixel) |
| calculates the search graph More... | |
| VoronoiGraphGenerator () | |
Definition at line 38 of file voronoi_graph_generator.h.
| tuw_graph::VoronoiGraphGenerator::VoronoiGraphGenerator | ( | ) |
Definition at line 34 of file voronoi_graph_generator.cpp.
| std::vector< Segment > tuw_graph::VoronoiGraphGenerator::calcSegments | ( | cv::Mat & | _map, |
| cv::Mat & | _distField, | ||
| cv::Mat & | _voronoiPath, | ||
| float * | potential, | ||
| float | _path_length, | ||
| float | _optimizeCrossingPixels, | ||
| float | _optimizeEndSegmentsPixel | ||
| ) |
calculates the search graph
| _map | the map |
| _distField | the distance_field generated from the map (e.g.: opencv distance_transform) |
| _voronoiPath | the generated voronoi path out of the distance field (e.g.: ridge following; zhang suen thinning...) |
| potential | the potential used for expanding (debuggin purpose) |
| _path_length | the minimum path length a segment has to have |
| _optimizePixelsCrossing | if crossings have less distance than _optimizePixelsCrossing to each other they are merged |
| _optimizePixelsEndSegments | if a end segment has less length than this var it is removed |
Definition at line 39 of file voronoi_graph_generator.cpp.