Recent Results on the Average Time Behavior of Some Algorithms in Computational Geometry

This publication has 22 references indexed in Scilit:

• Average time behavior of distributive sorting algorithms
  Computing, 1981
• Optimal Expected-Time Algorithms for Closest Point Problems
  ACM Transactions on Mathematical Software, 1980
• A note on finding convex hulls via maximal vectors
  Information Processing Letters, 1980
• Data Structures for Range Searching
  ACM Computing Surveys, 1979
• A fast convex hull algorithm
  Information Processing Letters, 1978
• Divide and conquer for linear expected time
  Information Processing Letters, 1978
• A New Convex Hull Algorithm for Planar Sets
  ACM Transactions on Mathematical Software, 1977
• Finding Minimum Spanning Trees
  SIAM Journal on Computing, 1976
• Die konvexe Hülle von n rotationssymmetrisch verteilten Punkten
  Probability Theory and Related Fields, 1970
• On the Distribution of the Number of Admissible Points in a Vector Random Sample
  Theory of Probability and Its Applications, 1966