Approximate geodesic calculation based on an ant colony iterative algorithm

DOI10.7511/DLLGXB201501017MaRDI QIDQ3194513zbMATH OpenFDO

Authors Yan Gong, Jie Yang, Wei Wu

Publication date 28 October 2015

Full work available at URL https://doi.org/10.7511/DLLGXB201501017

zbMATH Keywords

geodesiciterationself-adaptionsubdivide

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Recommendations

• Numerical solution of geodesic through two given points on a simple surface
• Approximate shortest path on a polyhedral surface and its applications
• Computation of geodesic lines between two points on algebraic surfaces
• Ant colony search algorithms for optimal polygonal approximation of plane curves.
• Approximate shortest descending paths

Cited in

(1)

• Local Geodesic Parametrization: an Ant’s Perspective

This page was built for publication: Approximate geodesic calculation based on an ant colony iterative algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3194513)