Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation
Verifiable implementation of geometric algorithms using finite precision arithmetic
Artificial Intelligence - Special issue on geometric reasoning
Recipes for geometry and numerical analysis - Part I: an empirical study
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Towards implementing robust geometric computations
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A geometric consistency theorem for a symbolic perturbation scheme
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Epsilon geometry: building robust algorithms from imprecise computations
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Finding compact coordinate representations for polygons and polyhedra
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Some provably hard crossing number problems
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Finding compact coordinate representations for polygons and polyhedra
IBM Journal of Research and Development
Computational algebraic geometry of projective configurations
Journal of Symbolic Computation
Computational geometry column 18
ACM SIGACT News
Cutting dense point sets in half
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Enumerating order types for small sets with applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Inner and outer rounding of set operations on lattice polygonal regions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Abstract order type extension and new results on the rectilinear crossing number
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Abstract order type extension and new results on the rectilinear crossing number
Computational Geometry: Theory and Applications - Special issue on the 21st European workshop on computational geometry (EWCG 2005)
Proceedings of the twenty-fourth annual symposium on Computational geometry
Learning Combinatorial Map Information from Permutations of Landmarks
International Journal of Robotics Research
Complexity of some geometric and topological problems
GD'09 Proceedings of the 17th international conference on Graph Drawing
A condensed semantics for qualitative spatial reasoning about oriented straight line segments
Artificial Intelligence
Integer realizations of disk and segment graphs
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |
We give doubly exponential upper and lower bounds on the size of the smallest grid on which we can embed every planar configuration of n points in general position up to order type. The lower bound is achieved by the construction of a widely dispersed “rigid” configuration which is then modified to one in general position by recent techniques of Sturmfels and White, while the upper bound uses recent results of Grigor'ev and Vorobjou on the solution of simultaneous inequalities. This provides a sharp answer to a question first posed by Chazelle.