Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference23 articles.
1. Agarwal, P. K. Partitioning arrangements of lines, I: An efficient deterministic algorithm,Discrete Comput. Geom. 5 (1990), 449–483.
2. Brown, K. Q. Voronoi diagrams from convex hulls,Inform. Process. Lett. 9 (1979), 223–228.
3. Chazelle, B. Cutting hyperplanes for divide-and-conquer,Discrete Comput. Geom. 9 (1993), 145–158.
4. Chazelle, B., Friedman, J. A deterministic view of random sampling and its use in geometry,Combinatorica 10 (1990), 229–249.
5. Chazelle, B., Matoušek, J. Derandomizing an output-sensitive convex hull algorithm in three dimensions (submitted for publication).
Cited by
232 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献