30 #ifndef PATHRESIZE_H_INCLUDED_PREDOEHL_UOFARIZONA_VISION
31 #define PATHRESIZE_H_INCLUDED_PREDOEHL_UOFARIZONA_VISION 1
33 #include <l/l_debug.h>
60 static PixPath all_from_list_a_with_some_from_list_b(
66 static PixPath choose_random_redundancies(
69 std::vector< size_t >&,
73 static PixPath choose_hermitic_redundancies(
79 static size_t insertion_yield(
const std::vector< float >&,
float );
95 :
PixPath( expanded_pp( p, sz, distance_too_close ) )
120 const PixPath& base_path,
145 const PixPath& base_path,
147 float distance_too_close
152 float sosq_error(
const PixPath&,
size_t,
size_t );
PixPath polyline_approx(const PixPath &base_path, size_t goal_size, float *error)
compute polyline approximation to base_path with dynamic programming
Definition: pathresize.cpp:1262
float sosq_error(const PixPath &path, size_t iii, size_t jjj)
this is an error metric for a path bridging from index iii to jjj
Definition: pathresize.cpp:1244
Representation of a sequence of pixel coordinates.
Definition: pixpath.h:117
PixPath reduce_pixels_bfs(const PixPath &pixelpath)
another heuristic to reduce pixels, using previous two methods + BFS
Definition: pathresize.cpp:1462
Expand, if possible, a PixPath to fill a specified minimum size.
Definition: pathresize.h:54
PixPath_expander(const PixPath &p, size_t sz, float distance_too_close)
ctor builds a new path with at least as many points as requested.
Definition: pathresize.h:94
PixPath rightsize(const PixPath &base_path, size_t goal_size, float distance_too_close)
compute polyline approximation of base_path of the "right size."
Definition: pathresize.cpp:669
PixPath reduce_pixels_pv(const PixPath &pixelpath)
Remove "unnecessary" pixels, using the Perez-Vidal algorithm.
Definition: pathresize.cpp:1414
static PixPath cull_cozy_points(const PixPath &, float)
return a new path after eliminating points that are too close
Definition: pathresize.cpp:691
Definition for the Vector class, a thin wrapper on the KJB Vector struct and its related functionalit...
Contains definition for class PixPath.