Optimal geometric flows via dual programs

DOI10.1145/2582112.2582163MaRDI QIDQ4635532zbMATH OpenOpenAlexWikidataFDO

Authors Sylvester Eriksson-Bique, Valentin Polishchuk, Mikko Sysikaski

Publication date 23 April 2018

Published in Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2582112.2582163

zbMATH Keywords

convex optimizationpotentials methodroute planning

Mathematics Subject Classification ID

Convex programming (90C25) Deterministic network models in operations research (90B10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On maximum flows in polyhedral domains
• Maximum flows and minimum cuts in the plane
• Maximum flows and minimum cuts in the plane
• Thick non-crossing paths and minimum-cost flows in polygonal domains
• A measure-theoretical max-flow-min-cut problem

Cited in

(3)

• Cost-minimizing networks among immiscible fluids in \({\mathbb{R}}^2\)
• Thick non-crossing paths and minimum-cost flows in polygonal domains
• Geometric numerical integration of the assignment flow

This page was built for publication: Optimal geometric flows via dual programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635532)