lower envelopes of circular arcs

[Ovidiu Daescu]

Yaron,
See Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael
    T. Goodrich and Jack Snoeyink: Efficiently approximating
    polygonal paths in three and higher dimensions,
    Algorithmica, Vol. 33, No. 2, 2002, pg. 150-167.

Ovidiu

********************************************************************
  Ovidiu Daescu, Assistant Professor
  Department of Computer Science
  Erik Jonsson School of Engineering and Computer Science
  Box 830688, MS EC 31
  University of Texas at Dallas
  Richardson, TX 75083-0688      
  Phone : 972-883-4196
  Fax   : 972-883-2349
  E-mail: daescu at utdallas.edu   
********************************************************************


On Sun, 5 Jan 2003, Yaron Berman wrote:

> Hello,
> 
> 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).
> 
> Yaron Ostrovsky-Berman
> 
> 
> 
> -------------
> The compgeom mailing lists: see
> http://netlib.bell-labs.com/netlib/compgeom/readme.html
> or send mail to compgeom-request at research.bell-labs.com with the line:
> send readme
> Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
> 


-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.