Open CASCADE Technology 6.6.0
|
#include <Standard.hxx>
#include <Standard_DefineAlloc.hxx>
#include <Standard_Macro.hxx>
#include <Standard_Real.hxx>
#include <Hatch_SequenceOfLine.hxx>
#include <Standard_Boolean.hxx>
#include <Hatch_LineForm.hxx>
#include <Standard_Integer.hxx>
#include <Hatch_Hatcher.lxx>
Data Structures | |
class | Hatch_Hatcher |
The Hatcher is an algorithm to compute cross hatchings in a 2d plane. It is mainly dedicated to display purpose. Computing cross hatchings is a 3 steps process : 1. The users stores in the Hatcher a set of 2d lines to be trimmed. Methods in the "Lines" category. 2. The user trims the lines with a boundary. The inside of a boundary is on the left side. Methods in the "Trimming" category. 3. The user reads back the trimmed lines. Methods in the "Results" category. The result is a set of parameter intervals on the line. The first parameter of an Interval may be RealFirst() and the last may be RealLast(). A line can be a line parallel to the axis (X or Y line or a 2D line. The Hatcher has two modes : * The "Oriented" mode, where the orientation of the trimming curves is considered. The hatch are kept on the left of the trimming curve. In this mode infinite hatch can be computed. * The "UnOriented" mode, where the hatch are always finite. More... |