两个区域间的最短距离
找出两个区域间的最短距离.
| In[1]:= |  X |
| In[2]:= |  X |
| Out[2]= |  |
| Out[3]= |  |
Related Examples
Basic Geometric Regions in 1D »
Basic Geometric Regions in 2D »
Basic Geometric Regions in 3D »
Basic Geometric Regions in nD »
Implicitly Defined Curves in 2D »
Parametrically Defined Curves in 2D »
Implicitly Defined Regions in 2D »
Formula Regions in 3D »
Boolean Regions »
Affine Transformation of a Region »
Nonlinear Transformation of a Region »
Cartesian Products of Regions »
Region Measures (Length, Area, Volume, etc.) »
Compute Region Centroids »
Integrate over Regions »
Solve PDEs over a Region »
Questions? Comments? Contact a Wolfram expert »
© 2024 Wolfram. All rights reserved.
