The power of geometric duality revisited

Information Processing Letters - Tập 21 - Trang 117-122 - 1985
D.T. Lee1, Y.T. Ching1
1Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL 60201, U.S.A.

Tài liệu tham khảo

Chazelle, 1983, The power of geometric duality, 217 Chazelle, 1985, BIT, 25, 76, 10.1007/BF01934990 Cole, 1983, Geometric retrieval problems, 112 H. Edelsbrunner, L.J. Guibas and J. Stolfi, Optimal point location in a monotone subdivision, SIAM J. Comput., to appear. Edelsbrunner, 1982, Polygonal intersection searching, Inform. Process. Lett., 14, 74, 10.1016/0020-0190(82)90090-4 Edelsbrunner, 1983, Constructing arrangements of lines and hyperplanes with applications, 83 Edelsbrunner, 1983, Halfplanar range search in linear space and O(n0.695) query time Goodman, 1983, Multidimensional sorting, SIAM J. Comput., 12, 484, 10.1137/0212032 Guibas, 1983, A kinetic framework for computational geometry, 100 Kirkpatrick, 1983, Optimal search in planar subdivisions, SIAM J. Comput., 12, 28, 10.1137/0212002 Megiddo, 1983, Finding least-distances lines, SIAM J. Alg. Disc. Math., 4, 207, 10.1137/0604021 Willard, 1982, Polygon retrieval, SIAM J. Comput., 11, 149, 10.1137/0211012 Yao, 1983, A 3-space partition and its applications, 258