#include <blobs.h>
Definition at line 97 of file blobs.h.
◆ EDGEPT() [1/2]
◆ EDGEPT() [2/2]
EDGEPT::EDGEPT |
( |
const EDGEPT & |
src | ) |
|
|
inline |
◆ CopyFrom()
void EDGEPT::CopyFrom |
( |
const EDGEPT & |
src | ) |
|
|
inline |
◆ EqualPos()
bool EDGEPT::EqualPos |
( |
const EDGEPT & |
other | ) |
const |
|
inline |
◆ Hide()
◆ IsChopPt()
bool EDGEPT::IsChopPt |
( |
| ) |
const |
|
inline |
◆ IsHidden()
bool EDGEPT::IsHidden |
( |
| ) |
const |
|
inline |
◆ MarkChop()
void EDGEPT::MarkChop |
( |
| ) |
|
|
inline |
◆ operator=()
◆ Reveal()
◆ SegmentArea()
int EDGEPT::SegmentArea |
( |
const EDGEPT * |
end | ) |
const |
|
inline |
Definition at line 143 of file blobs.h.
149 area += origin_vec.cross(pt->
vec);
151 }
while (pt != end && pt !=
this);
◆ SegmentBox()
TBOX EDGEPT::SegmentBox |
( |
const EDGEPT * |
end | ) |
const |
|
inline |
Definition at line 129 of file blobs.h.
135 if (pt->
pos.
x < box.left()) box.set_left(pt->
pos.
x);
136 if (pt->
pos.
x > box.right()) box.set_right(pt->
pos.
x);
137 if (pt->
pos.
y < box.bottom()) box.set_bottom(pt->
pos.
y);
138 if (pt->
pos.
y > box.top()) box.set_top(pt->
pos.
y);
139 }
while (pt != end && pt !=
this);
◆ ShortNonCircularSegment()
bool EDGEPT::ShortNonCircularSegment |
( |
int |
min_points, |
|
|
const EDGEPT * |
end |
|
) |
| const |
|
inline |
Definition at line 156 of file blobs.h.
161 if (pt == end)
return true;
164 }
while (pt !=
this &&
count <= min_points);
◆ WeightedDistance()
int EDGEPT::WeightedDistance |
( |
const EDGEPT & |
other, |
|
|
int |
x_factor |
|
) |
| const |
|
inline |
Definition at line 120 of file blobs.h.
124 return x_dist * x_dist * x_factor + y_dist * y_dist;
◆ flags
◆ next
◆ pos
◆ prev
◆ src_outline
◆ start_step
◆ step_count
◆ vec
The documentation for this struct was generated from the following file: