Optimal Geometric Flows via Dual Programs
Sylvester David Eriksson-Bique, Valentin Polishchuk, Mikko Sysikaski · 2014
Considering potentials in the dual of a planar network has proved to be a powerful tool for computing planar maximum flows. In this paper we explore the use of potentials for giving algorithmic and combinatorial results on continuous flows in geometric domains -- a (far going) generalization of discrete flows in unit-capacity planar networks.