Presents a systematic algorithm for proving that certain cones are area-minimizing. The algorithm the author describes consists of examining a first order ordinary equation based on the curvature and dimension of the cone and ensuring that certain line segments normal to the curve do not intersect.
Read More
Presents a systematic algorithm for proving that certain cones are area-minimizing. The algorithm the author describes consists of examining a first order ordinary equation based on the curvature and dimension of the cone and ensuring that certain line segments normal to the curve do not intersect.
Read Less
Add this copy of A Sufficient Criterion for a Cone to Be Area-Minimizing to cart. £49.81, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 1991 by Amer Mathematical Society.
