No Access

OPTIMAL ADAPTIVE ALGORITHMS FOR FINDING THE NEAREST AND FARTHEST POINT ON A PARAMETRIC BLACK-BOX CURVE

Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 32 Vassar Street, Cambridge, MA 02139, USA

Search for more papers by this author

and

ERIK D. DEMAINE

Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 32 Vassar Street, Cambridge, MA 02139, USA

Search for more papers by this author

https://doi.org/10.1142/S0218195905001737Cited by:6 (Source: Crossref)

Abstract

We consider a general model for representing and manipulating parametric curves, in which a curve is specified by a black box mapping a parameter value between 0 and 1 to a point in Euclidean d-space. In this model, we consider the nearest-point-on-curve and farthest-point-on-curve problems: given a curve C and a point p, find a point on C nearest to p or farthest from p. In the general black-box model, no algorithm can solve these problems. Assuming a known bound on the speed of the curve (a Lipschitz condition), the answer can be estimated up to an additive error of ε using O(1/ε) samples, and this bound is tight in the worst case. However, many instances can be solved with substantially fewer samples, and we give algorithms that adapt to the inherent difficulty of the particular instance, up to a logarithmic factor. More precisely, if OPT(C,p,ε) is the minimum number of samples of C that every correct algorithm must perform to achieve tolerance ε, then our algorithm performs O(OPT(C,p,ε) log(ε^-1/OPT(C,p,ε))) samples. Furthermore, any algorithm requires Ω(k log(ε^-1/k)) samples for some instance C′ with OPT(C′,p,ε) = k; except that, for the nearest-point-on-curve problem when the distance between C and p is less than ε, OPT is 1 but the upper and lower bounds on the number of samples are both Θ(1/ε). When bounds on relative error are desired, we give algorithms that perform O(OPT · log(2+(1+ε^-1) · m^-1/OPT)) samples (where m is the exact minimum or maximum distance from p to C) and prove that Ω(OPT · log(1/ε)) samples are necessary on some problem instances.

Keywords:

References

I. Baran, Adaptive algorithms for problems involving black-box lipschitz functions, Master's thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts (May 2004) . Google Scholar
J. Basch, J. Erickson, L. J. Guibas, J. Hershberger and L. Zhang, Kinetic collision detection for two simple polygons, in Proc. 10th Ann. ACM-SIAM Symp. Discrete Algorithms (1999), pp. 102–111 . Google Scholar
E. Berberich, A. Eigenwillig, M. Hemmer, S. Hert, K. Mehlhorn and E. Schömer, A computational basis for conic arcs and boolean operations on conic polygons, in Proc. 10th Ann. European Symp. Algorithms, Lecture Notes in Computer Science, Vol. 2461, Rome, Italy (September 2002), pp. 174–186 . Google Scholar
Y. Danilin, USSR Comput. Math. Math. Phys. 11, 261 (1971). Crossref, Google Scholar
E. D. Demaine, A. López-Ortiz and J. I. Munro, Adaptive set intersections, unions, and differences, in Proc. 11th Ann. ACM-SIAM Symp. Discrete Algorithms, San Francisco, California (January 2000), pp. 743–752 . Google Scholar
O. Devillerset al., Comput. Geom.: Th. Appl. 22, 119 (2002). Crossref, Web of Science, Google Scholar
V. Estivill-Castro and D. Wood, ACM Comput. Surv. 24(4), 441 (1992). Crossref, Web of Science, Google Scholar
R. Fagin, A. Lotem and M. Naor, J. Comput. Syst. Sci. 66(4), 614 (2003). Crossref, Web of Science, Google Scholar
O. Günther and E. Wong, Comput. Vis. Graph. Imag. Process. 51, 313 (1990). Crossref, Google Scholar
P. Hansen and B. Jaumard, Handbook of Global Optimization, eds. R. Horst and P. M. Pardalos (Kluwer, 1995) pp. 407–494. Crossref, Google Scholar
P. Hansen, B. Jaumard and S.-H. Lu, Math. Operat. Res. 16(2), 334 (1991). Crossref, Web of Science, Google Scholar
D. E. Johnson and E. Cohen, A framework for efficient minimum distance computation, in Proc. IEEE Conf. Robotics and Animation (May 1998), pp. 3678–3683 . Google Scholar
C. Lennerz and E. Schömer, Efficient distance computation for quadratic curves and surfaces, in Proc. 2nd Conf. Geometric Modeling and Processing (2002), pp. 60–69 . Google Scholar
S. Piyavskii, USSR Comput. Math. Math. Phys. 12, 57 (1972). Crossref, Google Scholar
J. M. Snyder, ACM SIGGRAPH Comput. Graph. 26(2), 121 (1992). Crossref, Google Scholar
J. Traub , G. Wasilkowski and H. Woźniakowski , Information-Based Complexity ( Academic Press , NY , 1988 ) . Google Scholar
R. Wein, High-level filtering for arrangements of conic arcs, in Proc. 10th Ann. European Symp. Algorithms, Lecture Notes in Computer Science, Vol. 2461, Rome, Italy (September 2002), pp. 884–895 . Google Scholar