[a / b / c / d / e / f / g / gif / h / hr / k / m / o / p / r / s / t / u / v / vg / vm / vmg / vr / vrpg / vst / w / wg] [i / ic] [r9k / s4s / vip / qa] [cm / hm / lgbt / y] [3 / aco / adv / an / bant / biz / cgl / ck / co / diy / fa / fit / gd / hc / his / int / jp / lit / mlp / mu / n / news / out / po / pol / pw / qst / sci / soc / sp / tg / toy / trv / tv / vp / vt / wsg / wsr / x / xs] [Settings] [Search] [Mobile] [Home]
Board
Settings Mobile Home
/sci/ - Science & Math


Thread archived.
You cannot reply anymore.


[Advertise on 4chan]


File: manifold.jpg (18 KB, 474x494)
18 KB
18 KB JPG
I am trying to find an algorithm to take any non-intersecting n-dimensional surface and find the shortest path between any two unique points on its surface. I have not been able to find or create a solution; if anyone here can think of one, please reply as i am starting to think the problem is not possible to solve.
>>
>>16259387
Geodesic equation is just a differential equation. There are dozens of algorithms for approximating solutions it a differential equation.
>>
>>16259387
Do you have the metric for the surface?
>>
>>16259387
the surface obviously needs to be convex, retard



[Advertise on 4chan]

Delete Post: [File Only] Style:
[Disable Mobile View / Use Desktop Site]

[Enable Mobile View / Use Mobile Site]

All trademarks and copyrights on this page are owned by their respective parties. Images uploaded are the responsibility of the Poster. Comments are owned by the Poster.