On levels in arrangements of lines, segments, planes, and triangles
From MaRDI portal
Publication:1387840
DOI10.1007/PL00009348zbMath0899.68106OpenAlexW1986004959MaRDI QIDQ1387840
Publication date: 8 June 1998
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009348
Related Items (21)
On the arrangement of stochastic lines in \(\mathbb{R}^2\) ⋮ Kinetic \(k\)-semi-Yao graph and its applications ⋮ Straight skeletons and mitered offsets of nonconvex polytopes ⋮ PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS ⋮ Cutting algebraic curves into pseudo-segments and applications ⋮ Improved bounds for the expected number of \(k\)-sets ⋮ Minimizing the error of linear separators on linearly inseparable data ⋮ Approximate $k$-Nearest Neighbor Graph on Moving Points ⋮ Relative \((p,\varepsilon )\)-approximations in geometry ⋮ Approximating the k-Level in Three-Dimensional Plane Arrangements ⋮ On levels in arrangements of surfaces in three dimensions ⋮ Approximation algorithms for maximum independent set of pseudo-disks ⋮ Minimum width color spanning annulus ⋮ The \(k\)-centrum multi-facility location problem ⋮ On the complexity of the \(k\)-level in arrangements of pseudoplanes ⋮ Unnamed Item ⋮ Crossing-free segments and triangles in point configurations ⋮ Optimal deterministic algorithms for 2-d and 3-d shallow cuttings ⋮ An Improved Bound for k-Sets in Four Dimensions ⋮ POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA ⋮ Efficient searching with linear constraints
This page was built for publication: On levels in arrangements of lines, segments, planes, and triangles
