Some problems in computational geometry

This publication has 8 references indexed in Scilit:

• The Ultimate Planar Convex Hull Algorithm?
  SIAM Journal on Computing, 1986
• Computational Geometry—A Survey
  IEEE Transactions on Computers, 1984
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
  SIAM Journal on Computing, 1982
• Optimal Expected-Time Algorithms for Closest Point Problems
  ACM Transactions on Mathematical Software, 1980
• Divide and conquer for linear expected time
  Information Processing Letters, 1978
• Divide-and-conquer in multidimensional space
  Published by Association for Computing Machinery (ACM) ,1976
• Closest-point problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1975
• ber die konvexe H lle von n zuf llig gew hlten Punkten
  Probability Theory and Related Fields, 1963