elsid 163968f578 Normalize area cost factor ... Recastnavigation uses path cost and heuristic based on distance to find shortest path by A* algorithm. Using raw speed values makes cost much lower value than heuristic (1000 times less at maximum). Heuristic is defined as distance from node to target * 0.999 that means area cost should never be less than 0.999 or 1 for simplicity. Use max speed to make lowest possible cost factor equal to 1.		2021-09-29 01:03:24 +02:00
..
benchmarks
bsatool
esmtool
essimporter	Fix/workaround for Issue #3246	2021-08-17 12:29:28 +10:00
launcher	Remove 'no relevant classes' moc warning	2021-09-14 11:20:18 +02:00
mwiniimporter
niftest	Use recurse subdirectory iterator to iterate over the VFS without exposing internal details	2021-09-14 18:09:54 +02:00
opencs	Merge branch 'OpenCS-preserve-blocked' into 'master'	2021-09-27 19:21:20 +00:00
openmw	Normalize area cost factor	2021-09-29 01:03:24 +02:00
openmw_test_suite	Merge branch 'Fix_ASCII' into 'master'	2021-09-26 20:08:55 +00:00
wizard	Remove 'no relevant classes' moc warning	2021-09-14 11:20:18 +02:00
doc.hpp