An optimal algorithm for the boundary of a cell in a union of rays

This publication has 10 references indexed in Scilit:

• Separating two simple polygons by a sequence of translations
  Discrete & Computational Geometry, 1988
• Planar realizations of nonlinear davenport-schinzel sequences by segments
  Discrete & Computational Geometry, 1988
• On the general motion planning problem with two degrees of freedom
  Published by Association for Computing Machinery (ACM) ,1988
• The complexity of many faces in arrangements of lines of segments
  Published by Association for Computing Machinery (ACM) ,1988
• An optimal O(n log n) algorithm for contour reconstruction from rays
  Published by Association for Computing Machinery (ACM) ,1987
• Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
  Combinatorica, 1986
• Constructing Arrangements of Lines and Hyperplanes with Applications
  SIAM Journal on Computing, 1986
• The power of geometric duality
  BIT Numerical Mathematics, 1985
• Visibility and intersectin problems in plane geometry
  Published by Association for Computing Machinery (ACM) ,1985
• Dynamic computational geometry
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983