Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve

  title={Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve},
  author={Ilya Baran and Erik D. Demaine},
  journal={Int. J. Comput. Geom. Appl.},
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 <i>d</i>-space. In this model, we consider the nearest-point-on-curve and farthest-point-on-curve problems: given a curve <i>C</i> and a point <i>p</i>, find a point on <i>C</i> nearest to <i>p</i> or farthest from <i>p</i>. In the general black-box model, no algorithm can solve these problems. Assuming a… 

Figures from this paper

Adaptive algorithms for problems involving black-box Lipschitz functions
This work considers queries that can be answered about a Lipschitz function by using a finite number of black-box evaluations, and gives optimally adaptive algorithms for winding number computation and univariate approximation and integration.
Exact and approximate algorithms for the most connected vertex problem
An efficient randomized algorithm is given that can perform more queries than the optimal solution (which is unknown) by only a constant factor, and beats the Ω(<i>nm</i>) lower bound for solving the <i>k</i>-MCV problem exactly.
Adaptive Algorithms for Planar Convex Hull Problems
This paper generalizes the framework for adaptive algorithms for sorting problem to geometric problems, and thinks of geometric problems as permutation problems of arrays, and defines the “presortedness” as a distance from the input array to the desired output array.
Optimally Adaptive Integration of Univariate Lipschitz Functions
By combining a deterministic adaptive algorithm and Monte Carlo sampling with variance reduction, this work gives an algorithm that uses at most at most samples in expectation on some problem instance (f,ε), which proves that the algorithm is optimal.
Instance-Optimal Geometric Algorithms
For 2-d convex hulls, it is proved that a version of the well known algorithm by Kirkpatrick and Seidel (1986) or Chan, Snoeyink, and Yap (1995) already attains this lower bound, and a new algorithm is proposed.
Instance Complexity and Unlabeled Certificates in the Decision Tree Model
A new measure of complexity called unlabeled -certificate complexity is introduced, appropriate for graph properties and other functions with symmetries, where only information about the structure of the graph is known to the competing algorithm.
Min-Entropic Optimality
The notion of Min-Entropic Optimality is introduced thereby providing a framework for arguing that a given algorithm computes a function better than any other algorithm, and it is shown that some natural search problems, such as k-Sum, are unlikely to have optimal algorithms under this notion.
Finding maximum degrees in hidden bipartite graphs
An adaptive algorithm that can perform more queries than the optimal solution (which is currently unknown) by only a constant factor is given, and it is proved that it is instance optimal among a broad class of solutions.
Instance-Optimality in the Noisy Value-and Comparison-Model - Accept, Accept, Strong Accept: Which Papers get in?
This paper shows optimal worst-case query complexity for the max, threshold, and top-k problems and addresses the question of the importance of knowledge of the instance by providing, for a large range of parameters, instance-optimal algorithms with respect to the query complexity.


Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygonal decomposition of
On the Number of Iterations of Piyavskii's Global Optimization Algorithm
It is shown that the number of iterations needed by Piyavskii's algorithm to obtain a globally e-optimal value together with a corresponding point (nPY) satisfies nPY ≤ 4nB + 1 and that this bound is again sharp.
Adaptive set intersections, unions, and differences
This work develops a framework for designing and evaluating adaptive algorithms in the comparison model, and presents adaptive algorithms that make no a priori assumptions about the problem instance, and show that their running times are within a constant factor of optimal with respect to a natural measure of the difficulty of an instance.
The arc tree: An approximation scheme to represent arbitrary curved shapes
This paper discusses several options to embed arc trees as complex objects in an extensible database management system and argues that the embedding as an abstract data type is most promising.
Efficient distance computation for quadratic curves and surfaces
  • C. Lennerz, E. Schömer
  • Computer Science
    Geometric Modeling and Processing. Theory and Applications. GMP 2002. Proceedings
  • 2002
This work presents an efficient algorithm for computing the distance between patches of quadratic surfaces trimmed byquadratic curves, which directly operates on the original CAD-data and reduces the input complexity and avoids accuracy problems due to approximation errors.
High-Level Filtering for Arrangements of Conic Arcs
This paper suggests a simple technique for filtering the computations involved in the arrangement construction: when constructing an arrangement vertex, this construction history can be used for answering predicates very efficiently, compared to a naive implementation with an exact number type.
Algebraic methods and arithmetic filtering for exact predicates on circle arcs
A new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs is presented, focusing on the comparison of the abscissae of two intersection points of circle arcs.
A survey of adaptive sorting algorithms
This survey presents the basic notions and concepts of adaptive sorting, the demonstration that several algorithms currently in use are adaptive, and the development of new algorithms, similar to currently used algorithms that perform competitively on random sequences and are significantly faster on nearly sorted sequences.
Optimal aggregation algorithms for middleware
An elegant and remarkably simple algorithm is analyzed that is optimal in a much stronger sense than FA, and is essentially optimal, not just for some monotone aggregation functions, but for all of them, and not just in a high-probability sense, but over every database.
Kinetic collision detection for simple polygons
A simple and elegant kinetic data structure for detecting collisions between polygonal (but not necessarily convex) objects in motion in the plane that gives an easy upper bound on the worst case number of certificate failures.