lower envelopes of circular arcs
yaronber at cs.huji.ac.il
Sun Jan 5 17:25:33 PST 2003
Does anyone know of an existing algorithm for finding the lower (upper)
envelope of circular arc segments?
Obviously the complexity should be better than computing the arrangement
of the arcs, preferably O(nlogn).
The compgeom mailing lists: see
or send mail to compgeom-request at research.bell-labs.com with the line:
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
More information about the Compgeom-announce