Notes on computing peaks in k-levels and parametric spanning trees

DOI10.1145/378583.378675zbMath1375.68150OpenAlexW2150882433MaRDI QIDQ5361583

Takeshi Tokuyama, Naoki Katoh

Publication date: 29 September 2017

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items (2)

A stronger lower bound on parametric minimum spanning trees ⋮ A stronger lower bound on parametric minimum spanning trees

This page was built for publication: Notes on computing peaks in k-levels and parametric spanning trees