2017-12-08 19:09:48 +05:00
|
|
|
.. _segments_around_vertex_algo_page:
|
|
|
|
|
|
|
|
**********************
|
|
|
|
Segments around Vertex
|
|
|
|
**********************
|
|
|
|
|
|
|
|
**Segments around Vertex** algorithm is considered to be a 0D meshing
|
|
|
|
algorithm, but, of course, it doesn't mesh vertices. It allows to define
|
|
|
|
the local size of the segments in the neighborhood of a certain
|
|
|
|
vertex. If we assign this algorithm to a geometrical object of higher
|
|
|
|
dimension, it applies to all its vertices.
|
|
|
|
|
2018-08-20 20:00:59 +05:00
|
|
|
.. _note: To create 0D elements, use :ref:`adding_nodes_and_elements_page` operation.
|
|
|
|
|
2017-12-08 19:09:48 +05:00
|
|
|
Length of segments near vertex is defined by **Length Near Vertex** hypothesis.
|
2018-05-25 22:04:48 +05:00
|
|
|
This hypothesis is used by :ref:`Wire Discretization <a1d_algos_anchor>` or
|
|
|
|
:ref:`Composite Side Discretization <a1d_algos_anchor>` algorithms as
|
2017-12-08 19:09:48 +05:00
|
|
|
follows: a geometrical edge is discretized according to a 1D
|
|
|
|
hypotheses and then nodes near vertices are modified to assure the
|
|
|
|
segment length required by **Length Near Vertex** hypothesis.
|
|
|
|
|
|
|
|
.. image:: ../images/lengthnearvertex.png
|
|
|
|
:align: center
|
|
|
|
|
2018-08-20 20:00:59 +05:00
|
|
|
**See also** a sample :ref:`TUI Script <tui_segments_around_vertex>`.
|