Optimal Geometric Flows via Dual Programs

DOI10.1145/2582112.2582163zbMath1395.68301OpenAlexW2013352739WikidataQ122277779 ScholiaQ122277779MaRDI QIDQ4635532

Mikko Sysikaski, Valentin Polishchuk, Sylvester Eriksson-Bique

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 optimizationroute planningpotentials method

Mathematics Subject Classification ID

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

This page was built for publication: Optimal Geometric Flows via Dual Programs