...
The Points Classification dialog
The content of the menu
Theese are the The classification options are:
Shoals, Deeps, Saddles, Ridges Saddles Valleys and Valleys
The points ar defined as:
- Shoal point: The shallowest point (node or sounding) in an area. All surrounding nodes are deeper.
- Deep point: The deepest point (node or sounding) in an area. All surrounding nodes are shallower.
- Saddle point: The shallowest point (node) in a fairway. The surrounding nodes are deeper on two sides and shallower on the two perpendicular sides.
- Ridge point: A break point (node) on a ridge. The surrounding nodes are deeper on three sides and shallower on the fourth side.
- Valley point: A break point (node) in a valley. The surrounding nodes are shallower on three sides and deeper on the fourth side.
Classification points
Set the correct parameters for the selected options and click Execute.
The result is a set of points that tells where the selected classification points are located.The The classification points are saved under the <chart name> folder and a <classification>
folder with the name of the option and the parameters selected.
The parameters are set in the four tabs: Shoals/Deeps, Saddles, Ridges and Valleys
The Shoals/Deeps ta
Shoals
Will find those grids nodes that are the shallowest within the Minimum distance.
The option Filter Mask width is a mask moving over the grid and checking the centre node with the nodes around.
A shoal is detected when the centre node is shallower than the rest of the nodes in the mask. After the detection the points are sorted on increasing depth values, and by starting with the first (and shallowest) point, all points with a distance smaller than the Minimum distance will be removed. Then the same test is performed for the next valid point, etc.
The shoals are saved in <chart name> classification shoals_<filter width>_<distance>.
...
Will find those grids nodes that are the highest within the Minimum distance.
The option Filter Mask width is a mask moving over the grid and checking the centre node with the nodes around.
A deep is detected when the centre node is deeper than the rest of the nodes in the mask. After the detection the points are sorted on decreasing depth values, and by starting with the first (and deepest) point, all points with a distance smaller than the Minimum distance will be removed. Then the same test is performed for the next valid point, etc.
The deeps are saved in <chart name> classification deeps_<filter width>_<distance>.
...