2012-08-09 13:58:02 +06:00
|
|
|
/*!
|
|
|
|
|
|
2013-04-17 22:05:53 +06:00
|
|
|
\page min_distance_page Minimum Distance
|
2012-08-09 13:58:02 +06:00
|
|
|
|
|
|
|
|
Returns the minimum distance between two geometrical objects and
|
2013-02-12 17:35:16 +06:00
|
|
|
the coordinates of the vector of distance and shows the distance in
|
|
|
|
|
the viewer.
|
2012-08-09 13:58:02 +06:00
|
|
|
|
2013-04-17 22:05:53 +06:00
|
|
|
\note The query for minimum distance can find one or more
|
|
|
|
|
solutions, or even an infinite set of solutions. All
|
|
|
|
|
found solutions are listed in a dedicated combo-box. When one of the found solutions is selected, the presentation is displayed in the
|
|
|
|
|
OCC viewer and fields "Length", "DX", "DY" and "DZ" are filled with the
|
|
|
|
|
corresponding values. If no solutions have been found, the message "No
|
|
|
|
|
solution found" is shown.
|
2013-02-12 17:35:16 +06:00
|
|
|
|
2013-04-17 22:05:53 +06:00
|
|
|
\note The currently used OCCT algorithm finds a finite number of
|
|
|
|
|
solutions even if an infinite set of solutions exists.
|
2013-02-12 17:35:16 +06:00
|
|
|
|
2013-04-17 22:05:53 +06:00
|
|
|
\image html distance.png
|
|
|
|
|
|
|
|
|
|
\n On \b Apply or <b>Apply and Close</b> a set of closest
|
|
|
|
|
points, corresponding to all found solutions is created.
|
2013-02-12 17:35:16 +06:00
|
|
|
|
|
|
|
|
<b>TUI Commands:</b>
|
|
|
|
|
\n<em>aDist = geompy.MinDistance(Shape1, Shape2),</em>
|
|
|
|
|
\n<em>[aDist, DX, DY, DZ] = geompy.MinDistanceComponents(Shape1, Shape2),</em>
|
|
|
|
|
\n<em>[nbSols, (x11, y11, z11, x21, y21, z21, ...)] = geompy.ClosestPoints(Shape1, Shape2),</em>
|
|
|
|
|
\n where \em Shape1 and \em Shape2 are shapes between which the minimal
|
2012-08-09 13:58:02 +06:00
|
|
|
distance is computed.
|
|
|
|
|
|
|
|
|
|
See also a \ref tui_min_distance_page "TUI example".
|
|
|
|
|
|
2013-02-12 17:35:16 +06:00
|
|
|
*/
|
