Some techniques for geometric searching with implicit set representations
- 38 Downloads
There are many efficient ways of searching a set when all its elements can be represented in memory. Often, however, the domain of the search is too large to have each element stored separately, and some implicit representation must be used. Whether it is still possible to search efficiently in these conditions is the underlying theme of this paper. We look at several occurrences of this problem in computational geometry and we propose various lines of attack. In the course of doing so, we improve the solutions of several specific problems; for example, computing order statistics, performing polygonal range searching, testing algebraic predicates, etc.
KeywordsInformation System Operating System Data Structure Communication Network Information Theory
Unable to display preview. Download preview PDF.
- 2.Bentley, J.L., Shamos, M.I.: Divide-and-conquer in multidimensional space. Proc. 8th Ann. ACM Symp. Theory Comput. (1976), pp. 220–230Google Scholar
- 5.Chazelle, B.: Fast searching in a real algebraic manifold with applications to geometric complexity. Proc. CAAP'85, Berlin, LNCS, pp 145–156. Berlin, Heidelberg, New York: Springer Verlag 1985Google Scholar
- 6.Chazelle, B.: New techniques for computing order statistics in Euclidean space. Proc. ACM Symp. Comput. Geometry, pp. 125–134, 1985Google Scholar
- 11.Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. Proc. of 25th Ann. IEEE Symp. Found. Comput. Sci., pp. 255–259. Singer Island 1984Google Scholar
- 20.Haussler, D., Welzl, E.: Epsilon-nets and simplex range queries. Proc. 2nd Annu. ACM Symp. Comput. Geometry, pp. 61–71 (1986)Google Scholar
- 22.McKenna, M., Toussaint, G.T.: Finding the minimum vertex distance between two disjoint convex polygons in linear time. Tech. Rep. SOCS-83-6, McGill University, 1983Google Scholar
- 28.Salowe, J.S.: Efficient geometric selection in the plane. M. Sc. Thesis, Rutgers University, 1985Google Scholar
- 29.Shamos, M.I.: Geometry and statistics: problems at the interface, in: Algorithms and complexity: new directions and recent results, J.F. Traub (ed.), pp. 251–280. New York: Academic Press 1976Google Scholar
- 30.Tarski, A.: A decision method for elementary algebra and geometry. Univ. of Calif. Press, 1948, 2nd Ed., 1951Google Scholar
- 31.Toussaint, G.T.: An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons. Proc. 21st Allerton Conf. Comm. Control Comput., pp 457–458 (1983)Google Scholar
- 34.Yao, A.C., Yao, F.F.: A general approach to d-dimensional geometric queries, 17th Ann. ACM Symp. Theory Comput., pp. 163–168. Providence, RI, 1985Google Scholar