Peeling Potatoes Near-Optimally in Near-Linear Time

DOI10.1145/2582112.2582159zbMath1395.68293arXiv1406.1368OpenAlexW2963688152MaRDI QIDQ4635546

Jan Kynčl, Pavel Valtr, Josef Cibulka, Sergio Cabello, Maria Saumell

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://arxiv.org/abs/1406.1368

zbMATH Keywords

approximation algorithmvisibility graphgeometric optimizationgeometric probabilitypotato peeling

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Randomized algorithms (68W20)

This page was built for publication: Peeling Potatoes Near-Optimally in Near-Linear Time