The power of geometric duality
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
This paper uses a new formulation of the notion of duality that allows the unified treatment of a number of geometric problems. In particular, we are able to apply our approach to solve two long-standing problems of computational geometry: one is to obtain a quadratic algorithm for computing the minimum-area triangle with vertices chosen amongn points in the plane; the other is to produce an optimal algorithm for the half-plane range query problem. This problem is to preprocessn points in the plane, so that given a test half-plane, one can efficiently determine all points lying in the half-plane. We describe an optimalO(k + logn) time algorithm for answering such queries, wherek is the number of points to be reported. The algorithm requiresO(n) space andO(n logn) preprocessing time. Both of these results represent significant improvements over the best methods previously known. In addition, we give a number of new combinatorial results related to the computation of line arrangements.
- K. Q. Brown,Geometric transforms for fast geometric algorithms, PhD thesis, Carnegie-Mellon Univ., 1979.
- B. Chazelle,Optimal algorithms for computing depths and layers, Brown University, Technical Report, CS-83-13, March 1983.
- B. Chazelle,Filtering search: A new approach to query-answering, Proc. 24th Annual FOCS Symp., pp. 122–132, November 1983.
- B. Chazelle and D. Dobkin,Detection is easier than computation, Proc. 12th Annual SIGACT Symp., Los Angeles, California, pp. 146–153, May 1980.
- H. Edelsbrunner,Private Communication, June 1983.
- H. Edelsbrunner, D. G. Kirkpatrick and H. A. Maurer,Polygonal intersection searching, Inf. Proc. Lett., 14, pp. 74–79, 1982. CrossRef
- H. Edelsbrunner, J. O'Rourke and R. Seidel,Constructing arrangements of lines and hyperplanes with applications, Proc. 24th Annual FOCS Symp., pp. 83–91, November 1983.
- H. Edelsbrunner and E. Welzl,Halfplanar range estimation, Tech. Univ. of Graz, Tech Rep. F98, 1982.
- H. Edelsbrunner and E. Welzl,Halfplanar range search in linear space and O(n 0.695 ) query time, Tech. Univ. of Graz, Tech Rep. F111, 1983.
- M. R. Garey, D. S. Johnson, F. P. Preparata and R. E. Tarjan,Triangulating a simple polygon, Inf. Proc. Lett. 7(4), pp. 175–179, 1978. CrossRef
- L. J. Guibas and J. Stolfi,Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams, Proc. 15th Annual SIGACT Symp., pp. 221–234, April 1983.
- L. Guibas, L. Ramshaw and J. Stolfi,A kinetic framework for computational geometry, Proc. 24th Annual FOCS Symp., pp. 100–111, November 1983.
- D. G. Kirkpatrick,Optimal search in planar subdivisions, SIAM J. on Comp., Vol. 12, No. 1, pp. 28–35, February 1983. CrossRef
- R. J. Lipton and R. E. Tarjan,Applications of a planar separator theorem, SIAM J. Comp., 9(3), pp. 615–627, 1980. CrossRef
- D. E. Muller and F. P. Preparata,Finding the intersection of two convex polyhedra, Theoret. Comput. Sci. 7 (1978), pp. 217–236. CrossRef
- M. H. Overmars and J. van Leeuwen,Maintenance of configurations in the plane, Journal of Computer and System Sciences, 23, p. 166–204, 1981. CrossRef
- D. E. Willard,Polygon retrieval, SIAM J. Comp., 11, pp. 149–165, 1982. CrossRef
- F. F. Yao,A 3-space partition and its applications, Proc. 15th Annual SIGACT Symp., pp. 258–263, April 1983.
- The power of geometric duality
BIT Numerical Mathematics
Volume 25, Issue 1 , pp 76-90
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- Industry Sectors
- Author Affiliations
- 1. Department of Computer Science, Brown University, Box 1910, Providence, R.I., USA
- 2. Computer Science Laboratory, Xerox PARC, Palo Alto Research Center, 94304, Palo Alto, California, USA
- 3. Northwestern University, 60201, Evanston, Illinois, USA