Paper by Erik D. Demaine

Reference:

Ilya Baran and Erik D. Demaine, “Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric Black-Box Curve”, in Proceedings of the 20th Annual ACM Symposium on Computational Geometry (SoCG 2004), Brooklyn, New York, June 9–11, 2004, pages 220–229.

BibTeX

@InProceedings{Curves_SoCG2004,
  AUTHOR        = {Ilya Baran and Erik D. Demaine},
  TITLE         = {Optimal Adaptive Algorithms for Finding the Nearest and
                   Farthest Point on a Parametric Black-Box Curve},
  BOOKTITLE     = {Proceedings of the 20th Annual ACM Symposium on
                   Computational Geometry (SoCG 2004)},
  bookurl       = {http://socg.poly.edu/home.htm},
  MONTH         = {June 9--11},
  YEAR          = 2004,
  ADDRESS       = {Brooklyn, New York},
  PAGES         = {220--229},

  award         = {Invited to special issue of \emph{International Journal of Computational Geometry and Applications}.},
  papers        = {Curves_IJCGA},
  length        = {10 pages},
  doi           = {https://dx.doi.org/10.1145/997817.997852},
  dblp          = {https://dblp.org/rec/conf/compgeom/BaranD04},
  comments      = {This paper is also available from the
                   <A HREF="http://doi.acm.org/10.1145/997817.997852">ACM Digital Library</A> and as <A HREF="https://arXiv.org/abs/cs/0307005">arXiv:cs/0307005</A>.},
  withstudent   = 1,
}

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 (ε⁻¹ / OPT(C, p, ε))) samples. Furthermore, any algorithm requires Ω(k log (ε⁻¹ / 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 + ε⁻¹) m⁻¹ / 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.

Comments:

This paper is also available from the ACM Digital Library and as arXiv:cs/0307005.

Length:

The paper is 10 pages.

Availability:

The paper is available in PostScript (702k), gzipped PostScript (217k), and PDF (198k).

See information on file formats.

[Google Scholar search]

Related papers:

Curves_IJCGA (Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric Black-Box Curve)