|
|||||
|
|
|
|
|
|
|
|
|
Cost-minimizing
networks among immiscible fluids in ℝ2
David Futer, Andrei Gnepp, David McMath, Brian A. Munson, Ting Ng, Sang-Hyoun Pahk and Cara Yoder |
|
Vol. 196 (2000), No. 2, 395–415
|
Abstract |
|
We model interfaces between immiscible fluids as cost-minimizing networks, where “cost” is a weighted length. We consider conjectured necessary and sufficient conditions for when a planar cone is minimizing. In some cases we give a proof; in other cases we provide a counterexample. |
Milestones
Received: 12 February 1999
Revised: 12 August 1999
Published: 1 December 2000
|
Authors |
| David Futer | |
| University of Penn. | |
| Andrei Gnepp | |
| Harvard University | |
| David McMath | |
| Stanford University | |
| Brian A. Munson | |
| University of Oregon | |
| Ting Ng | |
| University of Penn. | |
| Sang-Hyoun Pahk | |
| Williams College | |
| Cara Yoder | |
| Williams College | |
|
