论文信息 - Oracle Complexities for Computational Geometry of Semi-Algebraic Sets and Voronoi Diagrams

Oracle Complexities for Computational Geometry of Semi-Algebraic Sets and Voronoi Diagrams

We systematically analyze the concrete algebraic complexities of a set of oracles necessary for computing geometric properties of semi-algebraic sets related to convexity and Voronoi diagrams.

Lalit M. Patnaik | Chandan Haldar

[1] Alejandro A. Schäffer,et al. Convex Hulls of Piecewise-Smooth Jordan Curves , 1987, J. Algorithms.

[2] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[3] Chee-Keng Yap,et al. AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments , 1987, Discret. Comput. Geom..

[4] George E. Collins,et al. The Calculation of Multivariate Polynomial Resultants , 1971, JACM.