This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Avis, Lower bounds for geometric problems, Proc. 18th Allerton Conf. Commun., Contr., Comput. 1980, 35–40
M. Ben-Or, Lower bounds for algebraic computation trees, Proc. 15th STOC, 1983
J. L. Bentley, Multidimensional divide-and-conquer, Comm. ACM 23 (1980), 214–229
J. L. Bentley and H. A. Maurer, Efficient worst case data structures for range searching, Acta Informatica 13 (1980), 155–168
Th. Fischer, On the complexity of rectangle intersection problems under structural constraints, Preprint, 1986
Th. Fischer, A note on the combinatorial complexity of the convex hull problem, Preprint (to appear)
B. Grünbaum, Convex Polytopes, Wiley, New York, 1967
J. W. Jaromczyk, Linear decision trees are too weak for convex hull problem, IPL 12 (1981), 138–141
D. T. Lee and F. P. Preparata, Computational geometry — a survey, IEEE C-33 (1984), 1072–1101
R. J. Lipton, D. J. Rose, R. E. Tarjan, Generalized nested dissection, SIAM J. Num. Anal. 16 (1979), 346–358
R. J. Lipton and R. E. Tarjan, Applications of a planar separator theorem, SIAM J. Comp. 9 (1980), 615–627
G. Lueker, A data structure for orthogonal range queries, Proc. 19th FOCS, 1978, 28–34
K. Mehlhorn, Data Structures and Algorithms, Vol. 1–3, Springer 1984
J. Morávek and P. Pudlák, New lower bound for polyhedral membership problem with an application to linear programming, Proc. MFCS'84, LNCS 176 (1984), 416–424
L. J. Stockmeyer and C. K. Wong, On the number of comparisons to find the intersection of two relations, SIAM J. Comp. 8 (1979), 388–404
K. Wolfrum, Time — optimal algorithms for search problems in d-dimensional spaces, Preprint, 1985
K. Wolfrum, On some search problems in computational geometry, Preprint (to appear)
A. C. Yao and R. L. Rivest, On the polyhedral decision problem, SIAM J. Comp. 9 (1980), 343–347
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fischer, T.M., Wolfrum, K. (1986). On the inherent combinatorial complexity of geometric problems in d - dimensional space. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016256
Download citation
DOI: https://doi.org/10.1007/BFb0016256
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16783-9
Online ISBN: 978-3-540-39909-4
eBook Packages: Springer Book Archive