Curve-Sensitive Cuttings

DOI10.1137/S0097539703435686zbMath1075.68093OpenAlexW2102370538MaRDI QIDQ5317179

Vladlen Koltun, Micha Sharir

Publication date: 16 September 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539703435686

zbMATH Keywords

computational geometryrandom samplingcuttingszonecurves in space

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20) Combinatorial complexity of geometric structures (52C45)

Related Items (5)

Cuttings for disks and axis-aligned rectangles in three-space ⋮ Approximating the k-Level in Three-Dimensional Plane Arrangements ⋮ Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications ⋮ Counting and representing intersections among triangles in three dimensions ⋮ Multilevel polynomial partitions and simplified range searching

This page was built for publication: Curve-Sensitive Cuttings