On levels in arrangements of curves, iii

DOI10.1145/1377676.1377691zbMATH Open1221.52032OpenAlexW2014312515MaRDI QIDQ3602905FDOQ3602905

Authors: 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

Recommendations

• On levels in arrangements of curves. II: A simple inequality and its consequences
• On levels in arrangements of curves
• On levels in arrangements of lines, segments, planes, and triangles
• On levels in arrangements of surfaces in three dimensions
• On levels in arrangements of surfaces in three dimensions

Mathematics Subject Classification ID

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

Cited In (11)

• Kinetic \(k\)-semi-Yao graph and its applications
• Kinetic reverse \(k\)-nearest neighbor problem
• On levels in arrangements of surfaces in three dimensions
• Kinetic Euclidean minimum spanning tree in the plane
• A crossing lemma for Jordan curves
• On levels in arrangements of curves
• On the Lengths of Level Curves
• Cutting algebraic curves into pseudo-segments and applications
• On levels in arrangements of curves. II: A simple inequality and its consequences
• Approximate $k$-Nearest Neighbor Graph on Moving Points
• On s -intersecting curves and related problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602905)