Wolfram Language

Distance between Convex Polyhedra

Find the distance between two convex polyhedra.

This example demonstrates how QuadraticOptimization can be used to minimize norms of or distances between sets, such as polyhedra, that can be expressed in terms of linear inequalities.

Show the nearest points with the line connecting them.

Related Examples

de es fr ja ko pt-br zh