Constructive polynomial partitioning for algebraic curves in R^3 with applications

DOI10.1137/1.9781611975482.163MaRDI QIDQ5236353zbMATH OpenOpenAlexFDO

Authors Esther Ezra, J. 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

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

Recommendations

• Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
• Multilevel polynomial partitions and simplified range searching
• Eliminating depth cycles among triangles in three dimensions

Cited in

(6)

• Eliminating depth cycles among triangles in three dimensions
• Removing depth-order cycles among triangles: an algorithm generating triangular fragments
• Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
• An efficient algorithm for generalized polynomial partitioning and its applications
• Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
• On ray shooting for triangles in 3-space and related problems

This page was built for publication: Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236353)