Cited By
View all- Chazelle BGuibas L(1986)Fractional cascading: II. ApplicationsAlgorithmica10.1007/BF018404411:1-4(163-191)Online publication date: Nov-1986
Linear data structures for two types of range search
Pages 293 - 302
Abstract
We present two algorithms for pictures of polyhedral scenes. These algorithms have been conjectured (and used for some time), but only now been verified. The combinatorial algorithm, proposed by Sugihara, uses counts on the incidence structure to characterize pictures which are generically the projection of sharp polyhedral scenes of planes and points. The geometric algorithm, described by Clerk Maxwell and rediscovered in the last decade, uses a reciprocal diagram in the plane to characterize pictures of strict oriented polyhedra in space.
References
[1]
Bentley, J.L. Multidimendonal divide a~d ~onqu6r, Comm. ACM, 23, 4 (1980), 214-229.
[2]
Chaselle, B. Filtering search: a new approach to query-an, wering, Proc. 24th Annu. IEEE Symp. Found. Comput. Sci. (1983), 122-132. To appear in SIAM .l. on Comput.
[3]
Chaselle, B. A functional approach to data structures and its use in multidimensional searching, Brown Univ. TR, No. CS-85-16, Sept. 1985. Preliminary version in Proc. 26th FOGS, 1985.
[4]
Chazelle, B., Edelsbrunner, H. Optimal $olutior~s for a Class of Point Retrieval Problems, Tech. Rep. No. CS-84-16, Brown Univ., Providence, 1984.
[5]
Chazelle, B., Guibas, L.J. Fractional cascading: a data structuring technique with geometric applications, Proc. 12th ICALP, LNC$, Springer-Verlag, pp. 90--99.
[6]
Chazelle, B., Guibas, L.J., Lee, D.T. The power of geometric duality, Proc. 24th Anna. IEEE Syrup. Found. Comput. Sci. (1983), 217-225. Also, BIT 25(1), 76--90, 1985.
[7]
Dobkin, D.P., Edelsbrunner, H. Sp4ce searching for intersecting objects Proc. 25th Annu. IEEE Syrup. Found. Comp. Sci. (1984), 387-392.
[8]
Edelsbrunner, H., Guibas, L., Stolfi, J. Optimal point location in a monotone subdivision, SIAM J. on Comput., to appear.
[9]
Edelsbrunner, H., Welzl, E. Halfplanar range search in lir~ear space and O(n~'~9~) querl~ time, Rep. Fill, Inst. Inform. Proc., Tech. Univ. Graz, Austria, 1983.
[10]
Gabow, H.N., Bentley, J.L., Tarjan, R.E. Scaling and related techniques for geometr~ problems, Proc. 16th Annu. ACM Syrup. on Theory of Comput. (1984), 135-143.
[11]
Ouibas, L. J., Stolfi, J. Primitives for the manipulation of ge~era/eubdivieione and the computation of Voronoi diagrams, Proc. 15th Annu. ACM Syrup. on Theory of Comput. (1983), 221-234.
[12]
Kirkpatrick, D.G. Optimal search in planar subdivisions, SIAM J. on Comput., Vol. 12, No. 1, pp. 28-35, 1983.
[13]
Kung, H.T., Luccio, F., Preparata, F.P. On finding the mazima of a set of vectors, J. ACM, 22 (1975), 469-476.
[14]
Lipton, R.J., Tarjan, R.E. Applications of a planar separator theorem, SIAM J. on Comput., Vol. 9, No. 3, pp. 615-627, Aug. 1980.
[15]
McCreight, E.M. Priority search trees, Rep. CSL-81-5, Xerox PARC, Palo Alto, 1981.
[16]
Muller, D.E., Preparata, F.P. Finding the ir~tersection of two convex polyhedra, Theoret. Comput. Sci., 7 (1978), 217-236.
[17]
Newman, W.M., Sproull, R.F. Principles of interactive computer graphics, McGraw-Hill, 1973.
[18]
Will~d, D.E. Polygon retrieval, SIAM J. Comp., 11 (1982), 149-165.
[19]
Yao, F.F. A S-space partition and its applicatior~s, Proc. 15th Annu. ACM Symp. on Theory of Comput. (258-263), 1983.
Index Terms
- Linear data structures for two types of range search
Recommendations
Linear space data structures for two types of range search
This paper investigates the existence of linear space data structures for range searching. We examine thehomothetic range search problem, where a setS ofn points in the plane is to be preprocessed so that for any triangleT with sides parallel to three ...
Halfspace range search: An algorithmic application ofk-sets
Given a fixed setS ofn points inE3 and a query plane , the halfspace range search problem asks for the retrieval of all points ofS on a chosen side of . We prove that withO(n(logn)8 (loglogn)4) storage it is possible to solve this problem inO(k+logn) ...
Origami Embedding of Piecewise-Linear Two-Manifolds
We show that any compact, orientable, piecewise-linear two-manifold with Euclidean metric can be realized as a flat origami, meaning a set of non-crossing polygons in Euclidean 2-space "plus layers". This result implies a weak form of a theorem of ...
Comments
Information & Contributors
Information
Published In
Copyright © 1986 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 August 1986
Check for updates
Qualifiers
- Article
Conference
CG86: The 2nd Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry
June 2 - 4, 1986
New York, Yorktown Heights, USA
Acceptance Rates
Overall Acceptance Rate 625 of 1,685 submissions, 37%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 368Total Downloads
- Downloads (Last 12 months)16
- Downloads (Last 6 weeks)2
Reflects downloads up to 02 Sep 2024
Other Metrics
Citations
Cited By
View all- Chazelle BGuibas L(1986)Fractional cascading: II. ApplicationsAlgorithmica10.1007/BF018404411:1-4(163-191)Online publication date: Nov-1986
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in