On levels in arrangements of curves

DOI10.1007/s00454-002-2840-2zbMath1038.68126OpenAlexW3147681132MaRDI QIDQ1404507

Timothy M. Chan

Publication date: 21 August 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-002-2840-2

zbMATH Keywords

minimum spanning trees

Mathematics Subject Classification ID

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

Related Items (6)

Cutting algebraic curves into pseudo-segments and applications ⋮ Barycentric systems and stretchability ⋮ On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves ⋮ On levels in arrangements of surfaces in three dimensions ⋮ Intersection reverse sequences and geometric applications. ⋮ A simple, faster method for kinetic proximity problems

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