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

DOI10.1142/S0218195905001737zbMath1104.68113OpenAlexW2151221919MaRDI QIDQ5694054

Erik D. Demaine, Ilya Baran

Publication date: 29 September 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195905001737

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Optimally adaptive integration of univariate Lipschitz functions

Uses Software

• KSEG

Cites Work

• Optimal aggregation algorithms for middleware.
• Algebraic methods and arithmetic filtering for exact predicates on circle arcs
• On the Number of Iterations of Piyavskii's Global Optimization Algorithm
• An algorithm for finding the absolute extremum of a function
• Estimation of the efficiency of an absolute-minimum-finding algorithm

This page was built for publication: OPTIMAL ADAPTIVE ALGORITHMS FOR FINDING THE NEAREST AND FARTHEST POINT ON A PARAMETRIC BLACK-BOX CURVE