3 \page segments_around_vertex_algo_page Segments around Vertex
5 \n <b>Segments around Vertex</b> algorithm is considered to be a 0D meshing
6 algorithm, but, of course, it doesn't mesh vertices. It allows to define
7 the local size of the segments in the neighborhood of a certain
8 vertex. If we assign this algorithm to a geometrical object of higher
9 dimension, it applies to all its vertices.
11 Length of segments near vertex is defined by <b> Length Near
12 Vertex </b> hypothesis.
13 This hypothesis is used by \ref a1d_algos_anchor "Wire Discretization" or
14 \ref a1d_algos_anchor "Composite Side Discretization" algorithms as
15 follows: a geometrical edge is discretized according to a 1D
16 hypotheses and then nodes near vertices are modified to assure the
17 segment length required by <b> Length Near Vertex </b> hypothesis.
19 \image html lengthnearvertex.png
