Skip to main content
SpringerLink
Log in

Towards a refined classification of geometric search and computation problems

  • Advanced Algorithms
  • Conference paper
  • First Online:
Eurocal '87 (EUROCAL 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 378))

Included in the following conference series:

  • 150 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ben-Or: Lower bounds for algebraic computation trees, Proc. 15th STOC (1983), 80–86

    Google Scholar 

  2. J.L. Bentley, D. Haken, R. Hon: Fast geometric algorithms for VLSI tasks, Proc. Comput. Conf. 1981, 88–92

    Google Scholar 

  3. J.L. Bentley, H.A. Maurer: Efficient worst case data structures for range searching, Acta Inform. 13 (1980), 155–168

    Article  Google Scholar 

  4. H. Edelsbrunner: A new approach to rectangle intersections, Intern. J. Comp. Math., 13 (1983), 209–229

    Google Scholar 

  5. Th. Fischer: Lower bounds in the geometry of boxes (to appear)

    Google Scholar 

  6. Th. Fischer: Voronoi diagrams and lower bounds (to appear)

    Google Scholar 

  7. Th. Fischer, K. Wolfrum: On the inherent complexity of geometric problems in d-space, Proc. MFCS'86, LNCS 233, 315–324

    Google Scholar 

  8. B. Gruenbaum: Convex Polytopes, Wiley Interscience 1967

    Google Scholar 

  9. A. Gyarfas, J. Lehl, Zs. Tuza: How many atoms can be defined by boxes? Combinatorica 5 (1985), 193–204

    Google Scholar 

  10. D.T. Lee, F.P. Preparata: Computational geometry — a survey, IEEE C-33 (1984), 1072–1101

    Google Scholar 

  11. G. Luecker: A data structure for orthogonal range queries, Proc. 19th FOCS, 1978, 28–34

    Google Scholar 

  12. K. Mehlhorn: Data Structures and Algorithms, Vol. 3, Springer 1984

    Google Scholar 

  13. N. Megiddo: Linear time algorithm for linear programming in R3 and related problems, SIAM J. Comp. 12(1983), 759–776

    Article  Google Scholar 

  14. J. Moravek, P. Pudlak: New lower bound for polyhedral membership problem with an application to linear programming, MFCS'84, LNCS 176, 416–424

    Google Scholar 

  15. F.P. Preparata, M.I. Shamos: Computational Geometry — an Introduction, Springer 1985

    Google Scholar 

  16. J.B. Saxe: On the number of range queries in k-space, DAM 1 (1979), 217–225

    Google Scholar 

  17. H.W. Six, D. Wood: Counting and reporting intersections of d-ranges, IEEE C-31 (1982), 181–187

    Google Scholar 

  18. L.J. Stockmeyer, C.K. Wong: On the number of comparisons to find the intersection of two relations, SIAM J. Comp., 8 (1979), 388–404

    Google Scholar 

  19. A.C. Yao, R.L. Rivest: On the polyhedral decision problem, SIAM Journal on Computing 9 (1980), 343–347

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Karl-Weierstraß-Institut für Mathematik, Akademie der Wissenschaften der DDR, PF 1304, 1086, Berlin, DDR

    Thomas Fischer

Authors
  1. Thomas Fischer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

James H. Davenport

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fischer, T. (1989). Towards a refined classification of geometric search and computation problems. In: Davenport, J.H. (eds) Eurocal '87. EUROCAL 1987. Lecture Notes in Computer Science, vol 378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51517-8_148

Download citation

  • DOI: https://doi.org/10.1007/3-540-51517-8_148

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51517-3

  • Online ISBN: 978-3-540-48207-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation