On constants for cuttings in the plane

DOI10.1007/PL00009394zbMath0912.68203OpenAlexW2013561419MaRDI QIDQ1275667

Ji{ří} Matoušek

Publication date: 13 January 1999

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

Full work available at URL: https://doi.org/10.1007/pl00009394

zbMATH Keywords

computational geometry

Mathematics Subject Classification ID

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

Related Items (5)

Tighter estimates for \(\epsilon\)-nets for disks ⋮ Approximating the k-Level in Three-Dimensional Plane Arrangements ⋮ Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems ⋮ A research note on design of fair surfaces over irregular domains using data-dependent triangulation ⋮ Optimal deterministic algorithms for 2-d and 3-d shallow cuttings

This page was built for publication: On constants for cuttings in the plane