Flexible high-order discretization of geometric data for global motion planning

DOI10.1016/0304-3975(95)00175-1zbMath0871.68167OpenAlexW2009636433MaRDI QIDQ1351696

Y. Elihai, Yosef Yomdin

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00175-1

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items

Flexible high-order discretization of geometric data for global motion planning ⋮ Complexity of functions: Some questions, conjectures, and results ⋮ Smooth parametrizations in dynamics, analysis, diophantine and computational geometry ⋮ Semialgebraic complexity of functions ⋮ Numerical solution of field problems by nonconforming Taylor discretization ⋮ From formal numerical solutions of elliptic PDE's to the true ones

Cites Work

• Complexity of functions: Some questions, conjectures, and results
• Singularities of the maximum of a parametrically dependent function
• Flexible high-order discretization of geometric data for global motion planning
• Critical and near-critical values in polynomial control problems. I: One- dimensional case
• Repeatability of redundant manipulators: mathematical solution of the problem
• From formal numerical solutions of elliptic PDE's to the true ones
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item