A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Our contribution is twofold. First, we show that (log n) is a time lower bound on the CREW-PRAM and the mesh with multiple broadcasting for the tasks of computing the perimeter, the area, the diameter, the width, the modality, the smallest-area enclosing rectangle, and the largest-area inscribed triangle of a convex n-gon. We show that the same time lower bound holds for the tasks of detecting whether a convex n-gon lies inside another as well as for computing the maximum distance between twodoi:10.1006/jpdc.1995.1078 fatcat:addyhjklpnedzmssj2ht6frcii