Constructive Polynomial Partitioning for Algebraic Curves in ℝ3 with Applications

DOI10.1137/1.9781611975482.163zbMath1432.68482OpenAlexW4253926061MaRDI QIDQ5236353

Esther Ezra, Joshua Zahl, Boris Aronov

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Real algebraic sets (14P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects of algebraic curves (14Q05) Computational real algebraic geometry (14Q30)

Related Items (5)

Eliminating depth cycles among triangles in three dimensions ⋮ Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications ⋮ Removing depth-order cycles among triangles: an algorithm generating triangular fragments ⋮ Unnamed Item ⋮ Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications

This page was built for publication: Constructive Polynomial Partitioning for Algebraic Curves in ℝ³ with Applications