The upper envelope of piecewise linear functions: Algorithms and applications

This publication has 22 references indexed in Scilit:

• Computing convolutions by reciprocal search
  Discrete & Computational Geometry, 1987
• Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams
  Discrete & Computational Geometry, 1987
• Algorithms in Combinatorial Geometry
  Published by Springer Nature ,1987
• Worst-case optimal hidden-surface removal
  ACM Transactions on Graphics, 1987
• Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
  Combinatorica, 1986
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
  Discrete & Computational Geometry, 1986
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
  SIAM Journal on Computing, 1984
• Stabbing line segments
  BIT Numerical Mathematics, 1982
• An algorithm for planning collision-free paths among polyhedral obstacles
  Communications of the ACM, 1979
• An efficient algorithm for a complete link method
  The Computer Journal, 1977