#Steam Workshoprp_downtown_tits_v2_mode...
sly crown
Navmesh ?
sly crown
I don’t know what that is
tiny rain
I don’t know what that is
a narvmosh is a zero gravity version of a navmesh
sly crown
Never heard of it
viscid wedge
Narvmosh is a
sly crown
Updated on workshop
elfin comet
I think they were asking for a navmesh but because of their broken english, they couldn't say it correctly.
elfin comet
a narvmosh is a zero gravity version of a navmesh
That doesn't exist.
viscid wedge
Shut up
viscid wedge
I think they were asking for a navmesh but because of their broken english, they...
Fr ? Fr ?
viscid wedge
That doesn't exist.
On god ??
tiny rain
That doesn't exist.
What are you talking about
There is no known algorithm for optimally solving the navigation mesh problem in zero gravity. However, some heuristics and approximations have been proposed.
The first step is to construct a graph G from the environment. Each node in G represents a location in the environment, and each edge represents a path between two locations. The edges in G are weighted according to the cost of travel between the two locations.
The next step is to find the shortest path from the start location to the goal location in G. This can be done using any shortest path algorithm, such as Dijkstra's algorithm.
Once the shortest path has been found, the next step is to construct a narvigation mesh from G. This can be done by selecting a subset of the edges in G that form a loop around the start and goal locations. The edges in the narvmosh are then weighted according to the cost of travel along them.
The narvmosh can then be used to find the shortest path from the start location to the goal location. This path can be followed by the robot to reach the goal.
broken peak
dude