Skip to main content
SpringerLink
Log in
Book cover

Workshop on Computational Geometry

CG 1988: Computational Geometry and its Applications pp 71–84Cite as

Point location in arrangements

Extended abstract

  • Conference paper
  • First Online:

  • 192 Accesses

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

Abstract

We present a data structure and an algorithm for the point location problem in arrangements of hyperplanes in E d with running time O(d 5 logn) and space O(n d+k) for arbitrary κ>0, where n is the number of hyperplanes. The main result is the d 5 factor in the asymptotic expression for the running time, whereas all previously known algorithms depend exponentially on d.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.L. Clarkson A Probabilistic Algorithm for the Post Office Problem ACM, STOC (1985), pp. 175–184

    Google Scholar 

  2. K.L. Clarkson Further Applications of Random Sampling to Computational Geometry ACM, STOC (1986), pp. 414–423

    Google Scholar 

  3. D. Dobkin, R.J. Lipton Multidimensional Searching Problems SIAM, J. Comp. Vol. 5 No. 2 (1976), pp. 181–186

    Google Scholar 

  4. H. Edelsbrunner Algorithms in Combinatorial Geometry Springer-Verlag (1987)

    Google Scholar 

  5. B. Grünbaum Convex Polytopes John Wiley & Sons (1967)

    Google Scholar 

  6. D. Haussler, E. Welzl Epsilon-Nets and Simplex Range Queries ACM, Proc. of the 2. Symp. on Comp. Geometry (1986), pp. 61–71

    Google Scholar 

  7. D.S. Johnson The NP-Completeness Column Academic Press, J. of Algorithms 2 (1987), pp. 285–303

    Google Scholar 

  8. K. Mehlhorn Data Structures and Algorithms, Vol. 1–3 Springer-Verlag (1984)

    Google Scholar 

  9. S. Meiser Suche in einem Arrangement von Hyperebenen Diplomarbeit, Fachbereich 10, Universität des Saarlandes, D-6600 Saarbrücken, (1988)

    Google Scholar 

  10. F. Meyer auf der Heide A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem J. ACM 31 (3), (1984), pp. 668–676

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB10, Informatik, Universität des Saarlandes, D-6600, Saarbrücken

    Stefan Meiser

Authors
  1. Stefan Meiser
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Noltemeier

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meiser, S. (1988). Point location in arrangements. In: Noltemeier, H. (eds) Computational Geometry and its Applications. CG 1988. Lecture Notes in Computer Science, vol 333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50335-8_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-50335-8_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50335-4

  • Online ISBN: 978-3-540-45975-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation