#include <slap_tool.h>
Collaboration diagram for mimas::slap_tool:
Public Types | |
typedef string_el_ptr_list::iterator | string_it |
typedef boost::numeric::ublas::vector< double > | Vector |
Public Member Functions | |
slap_tool (void) | |
Default constructor. | |
slap_tool (double d) | |
line_ptr_list | findStraightLines (edge_string_ptr_list &es_list) |
Return a list of straight lines from a given list of edge strings. |
use this tool to turn edge strings into lists of straight line segments. Algorithm here is based on the original by Dr xxxx (can fbc provide this reference please?). Implementation by stu. Sun 13 Oct 2002 14:45:26 CEST
Algorithm takes a parameter- anglesigma which is used to determine how the edge strings should be broken into straight line segments. A high value means that only large changes in the angle of an edge string will be encorporated into a single straight line, therefore producing a very approximate set of output lines (blocky). With a lower value the straight lines more closely follow the edge strings and the output will look more like the input. (smoother)
Definition at line 35 of file slap_tool.h.
typedef string_el_ptr_list::iterator mimas::slap_tool::string_it |
Definition at line 42 of file slap_tool.h.
typedef boost::numeric::ublas::vector< double > mimas::slap_tool::Vector |
Definition at line 43 of file slap_tool.h.
mimas::slap_tool::slap_tool | ( | void | ) | [inline] |
Default constructor.
Sets a default anglesigma value. NOTE: this value needs to be small otherwise the algorithm fails : as this implementation requires that tan(anglesigma) is : approx= anglesigma
Definition at line 51 of file slap_tool.h.
mimas::slap_tool::slap_tool | ( | double | d | ) | [inline] |
Definition at line 56 of file slap_tool.h.
line_ptr_list mimas::slap_tool::findStraightLines | ( | edge_string_ptr_list & | es_list | ) |
Return a list of straight lines from a given list of edge strings.
A suitable list of edge strings is produced by, for example, the canny_tool.