On levels in arrangements of curves, iii

DOI10.1145/1377676.1377691zbMath1221.52032OpenAlexW2014312515MaRDI QIDQ3602905

Timothy M. Chan

Publication date: 12 February 2009

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

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

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Asymptotic enumeration (05A16)

Related Items (7)

Kinetic \(k\)-semi-Yao graph and its applications ⋮ A crossing lemma for Jordan curves ⋮ Cutting algebraic curves into pseudo-segments and applications ⋮ Kinetic Reverse k-Nearest Neighbor Problem ⋮ Kinetic Euclidean minimum spanning tree in the plane ⋮ Approximate $k$-Nearest Neighbor Graph on Moving Points ⋮ On levels in arrangements of surfaces in three dimensions

This page was built for publication: On levels in arrangements of curves, iii