Fractional cascading: II. Applications
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
This paper presents several applications offractional cascading, a new searching technique which has been described in a companion paper. The applications center around a variety of geometric query problems. Examples include intersecting a polygonal path with a line, slanted range search, orthogonal range search, computing locus functions, and others. Some results on the optimality of fractional cascading, and certain extensions of the technique for retrieving additional information are also included.
- Bentley, J. L. (1880) Multidimensional divide and conquer. Commun. ACM 23: pp. 214-229 CrossRef
- Bentley, J. L., Saxe, J. B. (1980) Decomposable searching problems I: static to dynamic transformations. J. Algorithms 1: pp. 301-358 CrossRef
- J. L. Bentley and M. I. Shamos.A problem in multivariate statistics: Algorithms, datastructures and applications. Proc. 15th Allerton Conf. Comm., Contr., and Comput. (1977), 193–201.
- Bentley, J. L., Wood, D. (1980) An Optimal worst-case algorithm for reporting intersections of rectangles. IEEE Trans. Comput. C-29: pp. 571-577 CrossRef
- B. Chazelle.Filtering search: A new approach to query-answering. Proc. 24th Ann. Symp. Found. Comput. Sci. (1983), 122–132. To appear in SIAM J. Comput. (1986).
- B. Chazelle.How to search in history. Inform, and Control (1985).
- B. Chazelle.A functional approach to data structures and its use in multidimensional searching. Brown Univ. Tech. Rept, CS-85-16, Sept. 1985 (preliminary version in 26th FOCS, 1985).
- Chazelle, B., Cole, R., Preparata, F. P., Yap, C. K. (1984) New upper bounds for neighbor searching. Brown University, Providence, RI
- B. Chazelle and H. Edelsbrunner.Linear space data structures for a class of range search. To appear in Proc. 2nd ACM Symposium on Computational Geometry, 1986.
- B. Chazelle and L. J. Guibas.Visibility and intersection problems in plane geometry. Proc. 1st ACM Symposium on Computational Geometry, Baltimore, MD, June 1985, pp. 135–146.
- Chazelle, B., Guibas, L. J., Lee, D. T. (1985) The power of geometric duality. BIT 25: pp. 1 CrossRef
- Cole, R. (1983) Searching and storing similar lists. Courant Inst., New York University, New York
- R. Cole and C. K. Yap.Geometric retrieval problems, Proc. 24th Ann. Symp. Found. Comput. Sci. (1983), 112–121.
- D. P. Dobkin and H. Edelsbrunner.Space searching for intersection objects. Proc. 25th Ann. Symp. Found. Comput. Sci. (1984).
- D. P. Dobkin and J. I. Munro.Efficient uses of the past. Proc. 21st Ann. Symp. Found. Comput. Sci. (1980), 200–206.
- Edelsbrunner, H. (1982) Intersection problems in computational geometry. Ph.D. Thesis. IIG, Univ. Graz, Austria
- H. Edelsbrunner, L. J. Guibas, and J. Stolfi.Optimal point location in a monotone subdivision. To appear.
- Edelsbrunner, H., Huber, F. (1984) Dissecting sets of points in two and three dimensions. Forthcoming technical report. IIG, University of Graz, Austria
- Edelsbrunner, H., Kirkpatrick, D. G., Maurer, H. A. (1982) Polygonal intersection search. In-form. Process. Lett 14: pp. 74-79 CrossRef
- Edelsbrunner, H., Welzl, E. (1983) Halfplanar range search in linear space and O(n0.695)query time. University of Graz, Austria
- H. N. Gabow, J. L. Bentley, and R. E. Tarjan.Scaling and related techniques for geometry problems. Proc. 16th Ann. SIGACT Symp. (1984), 135–143.
- Knuth, D. E. (1973) The art of computer programming, sorting and searching, Vol. 3. Addison-Wesley, Reading, MA
- Lee, D. T., Preparata, F. P. (1977) Location of a point in a planar subdivision and its applications. SIAM J. Comput 6: pp. 594-606 CrossRef
- E. M. McCreight.Efficient algorithms for enumerating intersecting intervals and rectangles. Tech. Rep., Xerox PARC, CSL-80-9 (June 1980).
- E. M. McCreight.Priority search trees. Tech. Rep., Xerox PARC, CSL-81-5 (1981).
- Overmars, M. H. (1983) The design of dynamic data structures. PhD Thesis. University of Utrecht, The Netherlands
- Tarjan, R. E. (1979) A class of algorithms which require nonlinear time to maintain disjoint sets. J. Comput. System Sci. 18: pp. 110-127 CrossRef
- D. E. Willard.New data structures for orthogonal queries. To appear in SIAM J. Comput.
- F. F. Yao.A 3-space partition and its applications. Proc. 15th Annual SIGACT Symp. (1983), 258–263.
- Fractional cascading: II. Applications
Volume 1, Issue 1-4 , pp 163-191
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Fractional cascading
- Iterative search
- Multiple look-up
- Binary search
- Iterative search
- Multiple look-up
- Range query
- Dynamization of data structures
- Industry Sectors