Key-problems and key-methods in computational geometry

This publication has 10 references indexed in Scilit:

• An efficient algorith for determining the convex hull of a finite planar set
  Published by Elsevier ,2002
• Constructing arrangements of lines and hyperplanes with applications
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Optimal Search in Planar Subdivisions
  SIAM Journal on Computing, 1983
• Spatial Planning: A Configuration Space Approach
  IEEE Transactions on Computers, 1983
• Linear-time algorithms for linear programming in R3 and related problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• Plane-sweep algorithms for intersecting geometric figures
  Communications of the ACM, 1982
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
  IEEE Transactions on Computers, 1982
• Applications of a planar separator theorem
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1977
• Convex hulls of finite sets of points in two and three dimensions
  Communications of the ACM, 1977
• Closest-point problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1975