Skip to main content
SpringerLink
Log in

Distribution-sensitive algorithms

  • Conference paper
  • First Online:
Algorithm Theory — SWAT'98 (SWAT 1998)

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

Included in the following conference series:

  • 129 Accesses

Abstract

We investigate a new paradigm of algorithm design for geometric problems that can be termed distribution-sensitive. Our notion of distribution is more combinatorial in nature than spatial. We illustrate this on problems like planar-hulls and 2D-maxima where some of the previously known output-sensitive algorithms are recast in this setting. In a number of cases, the distribution-sensitive analysis yields superior results for the above problems. Moreover these bounds are shown to be tight for a certain class of algorithms.

Our approach owes its spirit to the results known for sorting multisets and we exploit this relationship further to derive fast and efficient parallel algorithms for sorting multisets along with the geometric problems.

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. H Bast and T Hagerup. Fast parallel space allocation,estimation and integer sorting. Technical Report, MPI-I-93-123, June 1993.

    Google Scholar 

  2. M. Ben-Or Lower bounds for algebraic computation trees. Proc. of the 15th ACM STOC, pp. 80–86, 1983.

    Google Scholar 

  3. B. Bhattacharya and S. Sen. On a simple, practical, optimal, output-sensitive randomized planar convex-hull algorithm. Journal of Algorithms, 25, pp. 177–193, 1997.

    Article  MathSciNet  Google Scholar 

  4. T.M. Chan. Output-Sensitive Results on convex hulls, extreme points and related problems. ACM Symp. on Comput. Geom., 1995.

    Google Scholar 

  5. Timothy.M.Y. Chan, Jack Snoeyink, Chee-Keng Yap. Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. Proc. 6th ACM-SIAM Sympos. Discrete Algorithms 1995, pp 282–291.

    Google Scholar 

  6. M. Dyer Linear time algorithms for two and three variable linear programs. SIAM Journal on Computing, 13(1), pp. 31–45, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  7. Farach and Muthukrishnan. Optimal parallel randomized renaming. Information Processing Letters, pp. 12–15, Jan 1997.

    Google Scholar 

  8. R L Graham. An efficient algorithm for determining the convex hull of a finite planar set. Information Proc. Lett., 1:132–133, 1972.

    Article  MATH  Google Scholar 

  9. N. Gupta and S. Sen. Optimal, output-sensitive algorithms for constructing planar hulls in parallel. Computational Geometry: Theory and Applications, 8, 151–166, 1997.

    MathSciNet  Google Scholar 

  10. T. Hagerup. Fast deterministic processor allocation. Proc. of the 4th ACM Symposium on Discrete Algorithms 1993, pp. 1–10.

    Google Scholar 

  11. T. Goldberg and U. Zwick. Optimal Deterministic Approximate Parallel Prefix Sums and Their Applications. In Proc. Israel Symp. on Theory and Computing Systems (ISTCS'95), (1995), pp. 220–228.

    Google Scholar 

  12. S. Kapoor and P. Ramanan. Lower bounds for maximal and convex layer problems. Algorithmica, pages 447–459, 1989.

    Google Scholar 

  13. D G Kirkpatrick and R Seidel. The ultimate planar convex hull algorithm. SIAM Jl. of Comput., 15(1):287–299, Feb. 1986.

    Article  MathSciNet  Google Scholar 

  14. D G Kirkpatrick and R Seidel. Output-Size sensitive algorithms for finding maximal vectors. Proc. of ACM Symp. on Computational Geometry 1985, pp. 89–96.

    Google Scholar 

  15. H.T. Kung, F. Luccio and F.P. Preparata. On finding the maxima of a set of vectors. Journal of the ACM, 22, pp. 469–476, 1975.

    Article  MathSciNet  Google Scholar 

  16. P. D. MacKenzie. Load balancing requires Ω(log *n) expected time. Symp. on Discrete Algorithms, pp. 94–99, 1992.

    Google Scholar 

  17. N. Megiddo Linear time algorithms for linear programming in R3 and related problems. SIAM Journal on Computing 12(4), pp. 759–776, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  18. I.J. Munro and V. Raman. Sorting multisets and vectors In-place. Proc. of the 2nd WADS, LNCS 519, pp. 473–479, 1991.

    MathSciNet  Google Scholar 

  19. I. Munro and P.M. Spira Sorting and Searching in Multisets. SIAM journal on Computing, 5(1), pp. 1–8, 1976.

    Article  MathSciNet  Google Scholar 

  20. F P Preparata and S J Hong. Convex hulls of finite sets of points in two and three dimensions. Comm. ACM, 20:87–93, 1977.

    Article  MathSciNet  Google Scholar 

  21. F P Preparata and M I Shamos. Computational Geometry: An Introduction. Springer-verlag, New York, 1985.

    Google Scholar 

  22. S. Rajasekaran and S. Sen. Random sampling Techniques and parallel algorithm design. J.H. Reif editor. Morgan, Kaufman Publishers, 1993.

    Google Scholar 

  23. L.M. Wenger. Sorting a linked list with equal keys. Information Processing Letters, 15(5), pp. 205–208, 1982.

    Article  MathSciNet  Google Scholar 

  24. R. Wenger. Randomized Quick Hull. to appear in Algorithmica.

    Google Scholar 

  25. A.C. Yao A lower bound to finding convex hulls. Journal of the ACM, 28, pp. 780–787, 1981.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, I.I.T., 110016, New Delhi, India

    Sandeep Sen & Neelima Gupta

Authors
  1. Sandeep Sen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Neelima Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stefan Arnborg Lars Ivansson

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sen, S., Gupta, N. (1998). Distribution-sensitive algorithms. In: Arnborg, S., Ivansson, L. (eds) Algorithm Theory — SWAT'98. SWAT 1998. Lecture Notes in Computer Science, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054380

Download citation

  • DOI: https://doi.org/10.1007/BFb0054380

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64682-2

  • Online ISBN: 978-3-540-69106-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation