CUTTINGS AND APPLICATIONS
From MaRDI portal
Publication:4858649
DOI10.1142/S0218195995000210zbMath0837.68122OpenAlexW2144713886MaRDI QIDQ4858649
Otfried Schwarzkopf, Mark T. de Berg
Publication date: 1 February 1996
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195995000210
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Other problems of combinatorial convexity (52A37)
Related Items (13)
On the Zarankiewicz problem for intersection hypergraphs ⋮ Cutting algebraic curves into pseudo-segments and applications ⋮ Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location ⋮ Optimal partition trees ⋮ Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications ⋮ Removing depth-order cycles among triangles: an algorithm generating triangular fragments ⋮ On counting pairs of intersecting segments and off-line triangle range searching ⋮ Almost tight bounds for eliminating depth cycles in three dimensions ⋮ On approximate range counting and depth ⋮ ON ENUMERATING AND SELECTING DISTANCES ⋮ New lower bounds for Hopcroft's problem ⋮ Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model ⋮ On 3SUM-hard problems in the decision tree model
This page was built for publication: CUTTINGS AND APPLICATIONS
