1 research outputs found
On Finding Ordinary or Monochromatic Intersection Points
An algorithm is demonstrated that finds an ordinary intersection in an
arrangement of lines in , not all parallel and not all
passing through a common point, in time . The algorithm is then
extended to find an ordinary intersection among an arrangement of hyperplanes
in , no passing through a line and not all passing through
the same point, again, in time .
Two additional algorithms are provided that find an ordinary or monochromatic
intersection, respectively, in an arrangement of pseudolines in time .Comment: 21 pages, 4 figure