Algorthmic pradigms
N. Adlai A. DePano, Farinaz D. Boudreaux, Philip Katner, Brian Li · 1990
We discuss two problems from the relatively new field of computational geometry to illustrate two advanced notions in algorithm design and analysis.One problem deals with the triangulation of convex polygons while the other delves into minimum enclosing rectangles Our work continues with the objective set forth in an earlier paper of a similar title.