The power of geometric duality
暂无分享,去创建一个
[1] Leonidas J. Guibas,et al. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.
[2] Raimund Seidel,et al. Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..
[3] David E. Muller,et al. Finding the Intersection of two Convex Polyhedra , 1978, Theor. Comput. Sci..
[4] Raimund Seidel,et al. Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[5] Herbert Edelsbrunner,et al. Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time , 1986, Inf. Process. Lett..
[6] Kevin Q. Brown. Geometric transforms for fast geometric algorithms , 1979 .
[7] Jan van Leeuwen,et al. Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..
[8] Leonidas J. Guibas,et al. A kinetic framework for computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[9] Leonidas J. Guibas,et al. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.
[10] Robert E. Tarjan,et al. Triangulating a Simple Polygon , 1978, Inf. Process. Lett..
[11] Bernard Chazelle. Filtering Search: A New Approach to Query-Answering , 1983, FOCS.
[12] F. Frances Yao,et al. A 3-space partition and its applications , 1983, STOC.
[13] Bernard Chazelle. OPTIMAL ALGORITHMS FOR COMPUTING DEPTHS AND LAYERS. , 1983 .
[14] David G. Kirkpatrick,et al. Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..
[15] Bernard Chazelle,et al. Detection is easier than computation (Extended Abstract) , 1980, STOC '80.
[16] David G. Kirkpatrick,et al. Polygonal Intersection Searching , 1982, Inf. Process. Lett..
[17] Robert E. Tarjan,et al. Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).