A chain of points is an object of a class deriving from qgar::AbstractGenPointChain.
Two polygonal approximation methods are available:
The Rosin & West's method is implemented by class qgar::RWSegmentVector. It defines a STL vector of line segments, instances of class qgar::GenSegment, obtained from a chain of points.
Thanks to class qgar::RWArcVector, Qgar arcs of circle (instances of class qgar::GenQgarArc) may be extracted from a RW vector of segments (instance of class qgar::RWSegmentVector).
Class qgar::RWTree is used for private purposes by class qgar::RWSegmentVector. Ordinary clients of library QgarLib are not concerned with it.
The Wall & Danielsson's method is implemented by class qgar::WDSegmentList. It defines a STL list of line segments, instances of class qgar::WDSegment, obtained from a chain of points.
Classes | |
| class | qgar::RWArcVector |
| A vector containing Qgar arcs. More... | |
| class | qgar::RWTree |
| Private class of class RWSegmentVector to construct a binary tree during Rosin and West's polygonal approximation. More... | |
| class | qgar::RWSegmentVector |
| Recursive polygonal approximation of a chain. More... | |
| class | qgar::WDSegment |
| A segment resulting from a polygonal approximation performed according to Wall and Danielsson's method. More... | |
| class | qgar::WDSegmentList |
| Polygonal approximation of a chain of points, using Wall & Danielsson's method. More... | |