![]() |
Fréchet View
1.6.0
A Tool for Exploring Fréchet Distance Algorithms
|
holds data for one cell of the free-space diagram
That is, the intervals L_ij and B_ij
For use by the k-Frechet distance, we store the bounding box of the free-space area as bounds.H and bounds.V
Definition at line 27 of file freespace.h.
#include <freespace.h>
Public Member Functions | |
double & | a () |
double & | b () |
double & | c () |
double & | d () |
double | a () const |
double | b () const |
double | c () const |
double | d () const |
const data::Interval & | LB (bool l) |
Public Attributes | |
data::Interval | L |
data::Interval | B |
data::IntervalPair | bounds |
|
inline |
Definition at line 47 of file freespace.h.
|
inline |
Definition at line 56 of file freespace.h.
|
inline |
Definition at line 49 of file freespace.h.
|
inline |
Definition at line 58 of file freespace.h.
|
inline |
Definition at line 51 of file freespace.h.
|
inline |
Definition at line 60 of file freespace.h.
|
inline |
Definition at line 53 of file freespace.h.
|
inline |
Definition at line 62 of file freespace.h.
|
inline |
data::Interval frechet::fs::Cell::B |
Definition at line 31 of file freespace.h.
data::IntervalPair frechet::fs::Cell::bounds |
Free Space boundary; determined by L,B plus ellipse bounds (only needed for k-Frechet algorithm) Note: bounds are needed to calculate component intervals (projections) but need not be persisted for the k-Frechet algorithm. We persist it only for the purpose of visualisation.
Definition at line 40 of file freespace.h.
data::Interval frechet::fs::Cell::L |
Intersection of Free Space with Grid L_ij = (a,b), B_ij = (c,d)
Definition at line 31 of file freespace.h.