include
tuw_voronoi_graph
voronoi_graph_generator.h
Go to the documentation of this file.
1
/*
2
* Copyright (c) 2017, <copyright holder> <email>
3
* All rights reserved.
4
*
5
* Redistribution and use in source and binary forms, with or without
6
* modification, are permitted provided that the following conditions are met:
7
* * Redistributions of source code must retain the above copyright
8
* notice, this list of conditions and the following disclaimer.
9
* * Redistributions in binary form must reproduce the above copyright
10
* notice, this list of conditions and the following disclaimer in the
11
* documentation and/or other materials provided with the distribution.
12
* * Neither the name of the <organization> nor the
13
* names of its contributors may be used to endorse or promote products
14
* derived from this software without specific prior written permission.
15
*
16
* THIS SOFTWARE IS PROVIDED BY <copyright holder> <email> ''AS IS'' AND ANY
17
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
18
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
19
* DISCLAIMED. IN NO EVENT SHALL <copyright holder> <email> BE LIABLE FOR ANY
20
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
21
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
22
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
23
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26
*
27
*/
28
29
#ifndef VORONOI_GRAPH_GENERATOR_H
30
#define VORONOI_GRAPH_GENERATOR_H
31
32
#include <
ros/ros.h
>
33
#include <
tuw_voronoi_graph/segment.h
>
34
#include <
tuw_voronoi_graph/segment_expander.h
>
35
36
namespace
tuw_graph
37
{
38
class
VoronoiGraphGenerator
39
{
40
public
:
41
VoronoiGraphGenerator
();
52
std::vector<Segment>
calcSegments
(cv::Mat &_map, cv::Mat &_distField, cv::Mat &_voronoiPath,
float
* potential,
float
_path_length,
float
_optimizeCrossingPixels,
float
_optimizeEndSegmentsPixel);
53
54
};
55
}
56
#endif // PLANNER_NODE_H
ros.h
tuw_graph::VoronoiGraphGenerator::VoronoiGraphGenerator
VoronoiGraphGenerator()
Definition:
voronoi_graph_generator.cpp:34
tuw_graph::VoronoiGraphGenerator
Definition:
voronoi_graph_generator.h:38
segment_expander.h
tuw_graph
Definition:
serializer.h:19
tuw_graph::VoronoiGraphGenerator::calcSegments
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
Definition:
voronoi_graph_generator.cpp:39
segment.h
tuw_voronoi_graph
Author(s): Benjamin Binder
autogenerated on Wed Mar 2 2022 01:10:12