Lower bounds for k-distance approximation

DOI10.1145/2462356.2462367zbMath1305.68264arXiv1303.5388OpenAlexW2067522133MaRDI QIDQ5174504

Quentin Mérigot

Publication date: 17 February 2015

Published in: Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.5388

zbMATH Keywords

order-\(k\) Voronoi diagramChernoff bound\(k\)-distance

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (1)

A \(k\)-points-based distance for robust geometric inference

This page was built for publication: Lower bounds for k-distance approximation