Jeff Erickson
- 1.P. K. Agarwal. Range searching. Report CS-1996- 05, Dept. Comput. Sci., Duke Univ., 1996. http:// www.cs.duke.edu/-pankaj/papers/range-survey.ps.gz. To appear in The CRC Hur#dbook of D#cref.e arLd Comp#io,a# Geome#, J. E. Goodman and J. O'R#urke, editors, CRC Press. Google Scholar
Digital Library
- 2.P. K. Agarwal and J. Matou#k. Ray shooting and parametric search. SIAM J. Comp#t. 22(4):794-806, 1993. Google ScholarDigital Library
- 3.A. Aggarwal, M. Hansen, and T. Leighton. Solving query-retrieval problems by compacting Voronoi diagrams. Proc. F2nd Annu. A CM Sympos. Theory Comput, pp. 331-340, 1990. Google ScholarDigital Library
- 4.M. Ben-Or. Lower bounds for algebraic computation trees. Proc. 15th Annu. ACM Sympos. Theory Cornput., pp. 80-86, 1983. Google ScholarDigital Library
- 5.M. de Berg, M. Overmars, and O. Schwarzkopf. Computing and verifying depth orders. SIAM J. Comput 23:437-446, 1994. Google ScholarDigital Library
- 6.H. Br6nnimann, B. Chazelle, and J. Pach. How hard is halfspace range searching? Discrete Comput Geom. I0:143--155, 1993.Google Scholar
- 7.T. M. Chan. Fixed-dimensional linear programming queries made easy. Proc. 12th Annu. ACM Sympos. Comput Geom., pp. 284-290, 1996. Google ScholarDigital Library
- 8.T. M. Chart. Output-sensitive results on convex hulls, extreme points, and related problems. Discrete Cornput Geom. 16:369--387, 1996.Google ScholarDigital Library
- 9.B. Chazelle. Lower bounds on the complexity of polytope range searching. J. Amer. Ma#h. Soc. 2:637--666, 1989.Google Scholar
- 10.B. Chazelle. Cutting hyperplanes for divide-andconquer. Discref, e Corr#put,. Geom. 9(2):145-158, 1993.Google ScholarDigital Library
- 11.B. Chazelle, H. Edelsbrnnner, L. Guibas, and M. Sharir. Algorithms for bichromatic line segment problems and polyhedral terrains. Algori#hmica 11:116-132, 1994.Google Scholar
- 12.B. Chazelle and J. Friedman. Point location among hyperplanes and unidirectional ray-shooting. Comput. Geom. Theory Appl. 4:53-62, 1994. Google ScholarDigital Library
- 13.B. Chazelle, L. J. Guibas, and D. T. Lee. The power of geometric duality. BIT 25:76-90, 1985. Google ScholarDigital Library
- 14.B. Chazelle and B. Rosenberg. Simplex range reporting on a pointer machine. Comput Geom. Theory Appl. 5:237-247, 1996. Google ScholarDigital Library
- 15.B. Chazelle. Lower bounds for off-line range searching. Discrete Comput Geom. 17(1):53-66, 1997.Google ScholarDigital Library
- 16.D. P. Dobkin and D. G. Kirkpatrick. Determining the separation of preprocessed polyhedra- a unified approach. Proc. 17th Inter'nat. Colloq. Automata Lang. Program., pp. 400-413. Springer-Verlag, Lecture Notes in Computer Science 443, 1990. Google ScholarDigital Library
- 17.R. Dwyer and W. Eddy. Maximal empty ellipsoids. Internat. J. Comput. Geom. Appl. 6:169--186, 1996.Google ScholarCross Ref
- 18.J. Erickson. New lower bounds for halfspace emptiness. Proc. 37#h Annu. IEEE Syrnpo$. Found. Cornput. Sci., pp. 472-481, 1996. Google ScholarDigital Library
- 19.J. Erickson. New lower bounds for Hopcroft's problem. Discrete Comput. Geom. 16:389-418, 1996.Google ScholarDigital Library
- 20.M. L. Fredman. Lower bounds on the complexity of some optimal data structures. SIAM J. Comput 10:1- 10, 1981.Google ScholarDigital Library
- 21.J. Matou#ek. Efficient partition trees. Discrete Cornput Geom. 8:315-334, 1992.Google ScholarDigital Library
- 22.J. Matotu#ek. Reporting points in halfspaces. Comput Geom. Theory Appl. 2(3):169--186, 1992. Google ScholarDigital Library
- 23.J. MatouJek. Linear optimization queries. J. Algor/t#ms 14:432--448, 1993. Google ScholarDigital Library
- 24.J. Matouiek. On vertical ray shooting in arrangements. Comput Geom. Theory Appl. 2(5):279-285, Mar. 1993. Google ScholarDigital Library
- 25.J. Matou#k. Range searching with efficient hierarchical cuttings. Discrete Comput Geom. 10(2):157-182, 1993.Google ScholarDigital Library
- 26.J. Matouiek. Geometric range searching. A CM Cornput Surv. 26:421-461, 1994. Google ScholarDigital Library
- 27.J. Mato# and O. Schwarzkopf. On ray shooting in convex polytopes. Discrete Comput Geom. 10(2):215- 232, 1993.Google ScholarDigital Library
- 28.J. Pach and P. K. Agarwal. Combinatorial Geometry. John Wiley & Sons, New York, NY, 1995.Google Scholar
- 29.F. P. Preparata and M. I. Shamos. Computa$ional Geome#ry: An Introduction. Springer-Verlag, New York, NY, 1985. Google ScholarDigital Library
- 30.R. E. Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. J. Comput Syst Sc/. 18:110-127, 1979.Google Scholar
- 31.A. C. Yao. On the complexity of maintaining partial sums. SIAM J. Comput 14:277-288, 1985.Google ScholarDigital Library
Index Terms
- Space-time tradeoffs for emptiness queries (extended abstract)
Recommendations
Punctured super-orthogonal space-time trellis codes
In this paper, we propose punctured super-orthogonal space-time trellis codes. First, considering a system with two transmit antennas, we present the basic design criteria for the punctured super-orthogonal codes. Then, staged decoding, a sub-optimal ...
Multigroup ML decodable collocated and distributed space-time block codes
In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multigroup maximum-likelihood (ML) decoding are studied. First, the collocated case is considered and the problem of constructing space-time block codes (STBCs) which ...
Novel full diversity space time codes
A novel full diversity space-time trellis code, referred to as an assembled space-time trellis code (ASTTC), is presented in this letter. For this scheme, space-time trellis coded signals are first linearly transformed, and then the transformed signals ...
Comments