2011-04-10 14:16:27 +02:00
|
|
|
/*
|
2013-02-24 18:40:43 +01:00
|
|
|
Minetest
|
2013-02-24 19:38:45 +01:00
|
|
|
Copyright (C) 2013 celeron55, Perttu Ahola <celeron55@gmail.com>
|
2011-04-10 14:16:27 +02:00
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
2012-06-05 16:56:56 +02:00
|
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
|
|
the Free Software Foundation; either version 2.1 of the License, or
|
2011-04-10 14:16:27 +02:00
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
2012-06-05 16:56:56 +02:00
|
|
|
GNU Lesser General Public License for more details.
|
2011-04-10 14:16:27 +02:00
|
|
|
|
2012-06-05 16:56:56 +02:00
|
|
|
You should have received a copy of the GNU Lesser General Public License along
|
2011-04-10 14:16:27 +02:00
|
|
|
with this program; if not, write to the Free Software Foundation, Inc.,
|
|
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "collision.h"
|
2018-04-03 18:16:17 +02:00
|
|
|
#include <cmath>
|
2011-04-10 14:16:27 +02:00
|
|
|
#include "mapblock.h"
|
|
|
|
#include "map.h"
|
2011-11-14 20:41:30 +01:00
|
|
|
#include "nodedef.h"
|
|
|
|
#include "gamedef.h"
|
2017-01-09 20:39:22 +01:00
|
|
|
#ifndef SERVER
|
2018-11-28 20:01:49 +01:00
|
|
|
#include "client/clientenvironment.h"
|
2020-04-08 22:45:05 +02:00
|
|
|
#include "client/localplayer.h"
|
2017-01-09 20:39:22 +01:00
|
|
|
#endif
|
2017-01-08 11:01:35 +01:00
|
|
|
#include "serverenvironment.h"
|
2020-04-10 21:25:42 +02:00
|
|
|
#include "server/serveractiveobject.h"
|
2017-01-09 20:39:22 +01:00
|
|
|
#include "util/timetaker.h"
|
2012-03-19 04:25:09 +01:00
|
|
|
#include "profiler.h"
|
|
|
|
|
2020-04-16 10:23:48 +02:00
|
|
|
#ifdef __FAST_MATH__
|
|
|
|
#warning "-ffast-math is known to cause bugs in collision code, do not use!"
|
|
|
|
#endif
|
2016-01-09 23:07:46 +01:00
|
|
|
|
2024-04-23 20:23:31 +02:00
|
|
|
namespace {
|
|
|
|
|
2016-01-09 23:07:46 +01:00
|
|
|
struct NearbyCollisionInfo {
|
2020-04-26 22:52:00 +02:00
|
|
|
// node
|
2024-04-23 20:23:31 +02:00
|
|
|
NearbyCollisionInfo(bool is_ul, int bouncy, v3s16 pos, const aabb3f &box) :
|
2020-04-26 22:52:00 +02:00
|
|
|
obj(nullptr),
|
2024-04-23 20:23:31 +02:00
|
|
|
box(box),
|
2016-01-09 23:07:46 +01:00
|
|
|
position(pos),
|
2024-04-23 20:23:31 +02:00
|
|
|
bouncy(bouncy),
|
|
|
|
is_unloaded(is_ul),
|
|
|
|
is_step_up(false)
|
2016-01-09 23:07:46 +01:00
|
|
|
{}
|
|
|
|
|
2020-04-26 22:52:00 +02:00
|
|
|
// object
|
2024-04-23 20:23:31 +02:00
|
|
|
NearbyCollisionInfo(ActiveObject *obj, int bouncy, const aabb3f &box) :
|
2020-04-26 22:52:00 +02:00
|
|
|
obj(obj),
|
2024-04-23 20:23:31 +02:00
|
|
|
box(box),
|
2020-04-26 22:52:00 +02:00
|
|
|
bouncy(bouncy),
|
2024-04-23 20:23:31 +02:00
|
|
|
is_unloaded(false),
|
|
|
|
is_step_up(false)
|
2020-04-26 22:52:00 +02:00
|
|
|
{}
|
|
|
|
|
|
|
|
inline bool isObject() const { return obj != nullptr; }
|
|
|
|
|
|
|
|
ActiveObject *obj;
|
2016-01-09 23:07:46 +01:00
|
|
|
aabb3f box;
|
2024-04-23 20:23:31 +02:00
|
|
|
v3s16 position;
|
|
|
|
u8 bouncy;
|
|
|
|
// bitfield to save space
|
|
|
|
bool is_unloaded:1, is_step_up:1;
|
2016-01-09 23:07:46 +01:00
|
|
|
};
|
|
|
|
|
2020-05-14 19:28:27 +02:00
|
|
|
// Helper functions:
|
|
|
|
// Truncate floating point numbers to specified number of decimal places
|
|
|
|
// in order to move all the floating point error to one side of the correct value
|
2024-04-23 20:23:31 +02:00
|
|
|
inline f32 truncate(const f32 val, const f32 factor)
|
2020-05-14 19:28:27 +02:00
|
|
|
{
|
|
|
|
return truncf(val * factor) / factor;
|
|
|
|
}
|
|
|
|
|
2024-04-23 20:23:31 +02:00
|
|
|
inline v3f truncate(const v3f vec, const f32 factor)
|
2020-05-14 19:28:27 +02:00
|
|
|
{
|
|
|
|
return v3f(
|
|
|
|
truncate(vec.X, factor),
|
|
|
|
truncate(vec.Y, factor),
|
|
|
|
truncate(vec.Z, factor)
|
|
|
|
);
|
|
|
|
}
|
2016-01-09 23:07:46 +01:00
|
|
|
|
2024-04-23 20:23:31 +02:00
|
|
|
}
|
|
|
|
|
2012-03-19 04:25:09 +01:00
|
|
|
// Helper function:
|
|
|
|
// Checks for collision of a moving aabbox with a static aabbox
|
|
|
|
// Returns -1 if no collision, 0 if X collision, 1 if Y collision, 2 if Z collision
|
|
|
|
// The time after which the collision occurs is stored in dtime.
|
2019-06-10 13:00:35 +02:00
|
|
|
CollisionAxis axisAlignedCollision(
|
2012-03-19 04:25:09 +01:00
|
|
|
const aabb3f &staticbox, const aabb3f &movingbox,
|
2024-03-12 14:13:24 +01:00
|
|
|
const v3f speed, f32 *dtime)
|
2012-03-19 04:25:09 +01:00
|
|
|
{
|
|
|
|
//TimeTaker tt("axisAlignedCollision");
|
|
|
|
|
|
|
|
aabb3f relbox(
|
2020-05-14 19:28:27 +02:00
|
|
|
(movingbox.MaxEdge.X - movingbox.MinEdge.X) + (staticbox.MaxEdge.X - staticbox.MinEdge.X), // sum of the widths
|
|
|
|
(movingbox.MaxEdge.Y - movingbox.MinEdge.Y) + (staticbox.MaxEdge.Y - staticbox.MinEdge.Y),
|
|
|
|
(movingbox.MaxEdge.Z - movingbox.MinEdge.Z) + (staticbox.MaxEdge.Z - staticbox.MinEdge.Z),
|
2020-04-08 22:45:05 +02:00
|
|
|
std::max(movingbox.MaxEdge.X, staticbox.MaxEdge.X) - std::min(movingbox.MinEdge.X, staticbox.MinEdge.X), //outer bounding 'box' dimensions
|
|
|
|
std::max(movingbox.MaxEdge.Y, staticbox.MaxEdge.Y) - std::min(movingbox.MinEdge.Y, staticbox.MinEdge.Y),
|
|
|
|
std::max(movingbox.MaxEdge.Z, staticbox.MaxEdge.Z) - std::min(movingbox.MinEdge.Z, staticbox.MinEdge.Z)
|
2012-03-19 04:25:09 +01:00
|
|
|
);
|
|
|
|
|
2020-04-08 22:45:05 +02:00
|
|
|
const f32 dtime_max = *dtime;
|
2020-05-14 19:28:27 +02:00
|
|
|
f32 inner_margin; // the distance of clipping recovery
|
2020-04-08 22:45:05 +02:00
|
|
|
f32 distance;
|
|
|
|
f32 time;
|
|
|
|
|
|
|
|
|
2020-05-14 19:28:27 +02:00
|
|
|
if (speed.Y) {
|
|
|
|
distance = relbox.MaxEdge.Y - relbox.MinEdge.Y;
|
|
|
|
*dtime = distance / std::abs(speed.Y);
|
2020-04-08 22:45:05 +02:00
|
|
|
time = std::max(*dtime, 0.0f);
|
|
|
|
|
2020-05-14 19:28:27 +02:00
|
|
|
if (*dtime <= dtime_max) {
|
|
|
|
inner_margin = std::max(-0.5f * (staticbox.MaxEdge.Y - staticbox.MinEdge.Y), -2.0f);
|
|
|
|
|
|
|
|
if ((speed.Y > 0 && staticbox.MinEdge.Y - movingbox.MaxEdge.Y > inner_margin) ||
|
|
|
|
(speed.Y < 0 && movingbox.MinEdge.Y - staticbox.MaxEdge.Y > inner_margin)) {
|
|
|
|
if (
|
|
|
|
(std::max(movingbox.MaxEdge.X + speed.X * time, staticbox.MaxEdge.X)
|
|
|
|
- std::min(movingbox.MinEdge.X + speed.X * time, staticbox.MinEdge.X)
|
|
|
|
- relbox.MinEdge.X < 0) &&
|
2020-04-08 22:45:05 +02:00
|
|
|
(std::max(movingbox.MaxEdge.Z + speed.Z * time, staticbox.MaxEdge.Z)
|
|
|
|
- std::min(movingbox.MinEdge.Z + speed.Z * time, staticbox.MinEdge.Z)
|
|
|
|
- relbox.MinEdge.Z < 0)
|
2020-05-14 19:28:27 +02:00
|
|
|
)
|
|
|
|
return COLLISION_AXIS_Y;
|
2020-04-08 22:45:05 +02:00
|
|
|
}
|
2012-03-19 04:25:09 +01:00
|
|
|
}
|
2020-05-14 19:28:27 +02:00
|
|
|
else {
|
|
|
|
return COLLISION_AXIS_NONE;
|
|
|
|
}
|
2012-03-19 04:25:09 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// NO else if here
|
|
|
|
|
2020-05-14 19:28:27 +02:00
|
|
|
if (speed.X) {
|
|
|
|
distance = relbox.MaxEdge.X - relbox.MinEdge.X;
|
|
|
|
*dtime = distance / std::abs(speed.X);
|
2020-04-08 22:45:05 +02:00
|
|
|
time = std::max(*dtime, 0.0f);
|
|
|
|
|
2020-05-14 19:28:27 +02:00
|
|
|
if (*dtime <= dtime_max) {
|
|
|
|
inner_margin = std::max(-0.5f * (staticbox.MaxEdge.X - staticbox.MinEdge.X), -2.0f);
|
|
|
|
|
|
|
|
if ((speed.X > 0 && staticbox.MinEdge.X - movingbox.MaxEdge.X > inner_margin) ||
|
|
|
|
(speed.X < 0 && movingbox.MinEdge.X - staticbox.MaxEdge.X > inner_margin)) {
|
|
|
|
if (
|
|
|
|
(std::max(movingbox.MaxEdge.Y + speed.Y * time, staticbox.MaxEdge.Y)
|
|
|
|
- std::min(movingbox.MinEdge.Y + speed.Y * time, staticbox.MinEdge.Y)
|
|
|
|
- relbox.MinEdge.Y < 0) &&
|
2020-04-08 22:45:05 +02:00
|
|
|
(std::max(movingbox.MaxEdge.Z + speed.Z * time, staticbox.MaxEdge.Z)
|
|
|
|
- std::min(movingbox.MinEdge.Z + speed.Z * time, staticbox.MinEdge.Z)
|
|
|
|
- relbox.MinEdge.Z < 0)
|
2021-12-02 00:54:12 +01:00
|
|
|
)
|
2020-05-14 19:28:27 +02:00
|
|
|
return COLLISION_AXIS_X;
|
2020-04-08 22:45:05 +02:00
|
|
|
}
|
2020-05-14 19:28:27 +02:00
|
|
|
} else {
|
|
|
|
return COLLISION_AXIS_NONE;
|
2012-03-19 04:25:09 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// NO else if here
|
|
|
|
|
2020-04-08 22:45:05 +02:00
|
|
|
if (speed.Z) {
|
|
|
|
distance = relbox.MaxEdge.Z - relbox.MinEdge.Z;
|
2020-05-14 19:28:27 +02:00
|
|
|
*dtime = distance / std::abs(speed.Z);
|
2020-04-08 22:45:05 +02:00
|
|
|
time = std::max(*dtime, 0.0f);
|
|
|
|
|
2020-05-14 19:28:27 +02:00
|
|
|
if (*dtime <= dtime_max) {
|
|
|
|
inner_margin = std::max(-0.5f * (staticbox.MaxEdge.Z - staticbox.MinEdge.Z), -2.0f);
|
|
|
|
|
|
|
|
if ((speed.Z > 0 && staticbox.MinEdge.Z - movingbox.MaxEdge.Z > inner_margin) ||
|
|
|
|
(speed.Z < 0 && movingbox.MinEdge.Z - staticbox.MaxEdge.Z > inner_margin)) {
|
|
|
|
if (
|
|
|
|
(std::max(movingbox.MaxEdge.X + speed.X * time, staticbox.MaxEdge.X)
|
|
|
|
- std::min(movingbox.MinEdge.X + speed.X * time, staticbox.MinEdge.X)
|
|
|
|
- relbox.MinEdge.X < 0) &&
|
2020-04-08 22:45:05 +02:00
|
|
|
(std::max(movingbox.MaxEdge.Y + speed.Y * time, staticbox.MaxEdge.Y)
|
|
|
|
- std::min(movingbox.MinEdge.Y + speed.Y * time, staticbox.MinEdge.Y)
|
|
|
|
- relbox.MinEdge.Y < 0)
|
2021-12-02 00:54:12 +01:00
|
|
|
)
|
2020-05-14 19:28:27 +02:00
|
|
|
return COLLISION_AXIS_Z;
|
2020-04-08 22:45:05 +02:00
|
|
|
}
|
2012-03-19 04:25:09 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-06-10 13:00:35 +02:00
|
|
|
return COLLISION_AXIS_NONE;
|
2012-03-19 04:25:09 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Helper function:
|
|
|
|
// Checks if moving the movingbox up by the given distance would hit a ceiling.
|
|
|
|
bool wouldCollideWithCeiling(
|
2016-01-09 23:07:46 +01:00
|
|
|
const std::vector<NearbyCollisionInfo> &cinfo,
|
2012-03-19 04:25:09 +01:00
|
|
|
const aabb3f &movingbox,
|
|
|
|
f32 y_increase, f32 d)
|
|
|
|
{
|
|
|
|
//TimeTaker tt("wouldCollideWithCeiling");
|
|
|
|
|
2015-03-06 11:21:51 +01:00
|
|
|
assert(y_increase >= 0); // pre-condition
|
2012-03-19 04:25:09 +01:00
|
|
|
|
2017-08-17 20:23:54 +02:00
|
|
|
for (const auto &it : cinfo) {
|
|
|
|
const aabb3f &staticbox = it.box;
|
2016-01-09 23:07:46 +01:00
|
|
|
if ((movingbox.MaxEdge.Y - d <= staticbox.MinEdge.Y) &&
|
2012-03-19 04:25:09 +01:00
|
|
|
(movingbox.MaxEdge.Y + y_increase > staticbox.MinEdge.Y) &&
|
|
|
|
(movingbox.MinEdge.X < staticbox.MaxEdge.X) &&
|
|
|
|
(movingbox.MaxEdge.X > staticbox.MinEdge.X) &&
|
|
|
|
(movingbox.MinEdge.Z < staticbox.MaxEdge.Z) &&
|
|
|
|
(movingbox.MaxEdge.Z > staticbox.MinEdge.Z))
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2018-02-10 21:04:16 +01:00
|
|
|
static inline void getNeighborConnectingFace(const v3s16 &p,
|
|
|
|
const NodeDefManager *nodedef, Map *map, MapNode n, int v, int *neighbors)
|
Nodebox: Allow nodeboxes to "connect"
We introduce a new nodebox type "connected", and allow these nodes to
have optional nodeboxes that connect it to other connecting nodeboxes.
This is all done at scenedraw time in the client. The client will
inspect the surrounding nodes and if they are to be connected to,
it will draw the appropriate connecting nodeboxes to make those
connections.
In the node_box definition, we have to specify separate nodeboxes for
each valid connection. This allows us to make nodes that connect only
horizontally (the common case) by providing optional nodeboxes for +x,
-x, +z, -z directions. Or this allows us to make wires that can connect
up and down, by providing nodeboxes that connect it up and down (+y,
-y) as well.
The optional nodeboxes can be arrays. They are named "connect_top,
"connect_bottom", "connect_front", "connect_left", "connect_back" and
"connect_right". Here, "front" means the south facing side of the node
that has facedir = 0.
Additionally, a "fixed" nodebox list present will always be drawn,
so one can make a central post, for instance. This "fixed" nodebox
can be omitted, or it can be an array of nodeboxes.
Collision boxes are also updated in exactly the same fashion, which
allows you to walk over the upper extremities of the individual
node boxes, or stand really close to them. You can also walk up
node noxes that are small in height, all as expected, and unlike the
NDT_FENCELIKE nodes.
I've posted a screenshot demonstrating the flexibility at
http://i.imgur.com/zaJq8jo.png
In the screenshot, all connecting nodes are of this new subtype.
Transparent textures render incorrectly, Which I don't think is
related to this text, as other nodeboxes also have issues with this.
A protocol bump is performed in order to be able to send older clients
a nodeblock that is usable for them. In order to avoid abuse of users
we send older clients a "full-size" node, so that it's impossible for
them to try and walk through a fence or wall that's created in this
fashion. This was tested with a pre-bump client connected against a
server running the new protocol.
These nodes connect to other nodes, and you can select which ones
those are by specifying node names (or group names) in the
connects_to string array:
connects_to = { "group:fence", "default:wood" }
By default, nodes do not connect to anything, allowing you to create
nodes that always have to be paired in order to connect. lua_api.txt
is updated to reflect the extension to the node_box API.
Example lua code needed to generate these nodes can be found here:
https://gist.github.com/sofar/b381c8c192c8e53e6062
2016-02-25 09:16:31 +01:00
|
|
|
{
|
2019-08-10 19:45:44 +02:00
|
|
|
MapNode n2 = map->getNode(p);
|
Allow nodes to specify which sides to connect to.
NDT_CONNECTED attempts to connect to any side of nodes that it can
connect to, which is troublesome for FACEDIR type nodes that generally
may only have one usable face, and can be rotated.
We introduce a node parameter `connect_sides` that is valid for
any node type. If specified, it lists faces of the node (in "top",
"bottom", "front", "left", "back", "right", form, as array) that
connecting nodeboxes can connect to. "front" corresponds to the south
facing side of a node with facedir = 0.
If the node is rotatable using *simple* FACEDIR, then the attached
face is properly rotated before checking. This allows e.g. a chest
to be attached to only from the rear side.
2016-03-04 08:18:04 +01:00
|
|
|
if (nodedef->nodeboxConnects(n, n2, v))
|
Nodebox: Allow nodeboxes to "connect"
We introduce a new nodebox type "connected", and allow these nodes to
have optional nodeboxes that connect it to other connecting nodeboxes.
This is all done at scenedraw time in the client. The client will
inspect the surrounding nodes and if they are to be connected to,
it will draw the appropriate connecting nodeboxes to make those
connections.
In the node_box definition, we have to specify separate nodeboxes for
each valid connection. This allows us to make nodes that connect only
horizontally (the common case) by providing optional nodeboxes for +x,
-x, +z, -z directions. Or this allows us to make wires that can connect
up and down, by providing nodeboxes that connect it up and down (+y,
-y) as well.
The optional nodeboxes can be arrays. They are named "connect_top,
"connect_bottom", "connect_front", "connect_left", "connect_back" and
"connect_right". Here, "front" means the south facing side of the node
that has facedir = 0.
Additionally, a "fixed" nodebox list present will always be drawn,
so one can make a central post, for instance. This "fixed" nodebox
can be omitted, or it can be an array of nodeboxes.
Collision boxes are also updated in exactly the same fashion, which
allows you to walk over the upper extremities of the individual
node boxes, or stand really close to them. You can also walk up
node noxes that are small in height, all as expected, and unlike the
NDT_FENCELIKE nodes.
I've posted a screenshot demonstrating the flexibility at
http://i.imgur.com/zaJq8jo.png
In the screenshot, all connecting nodes are of this new subtype.
Transparent textures render incorrectly, Which I don't think is
related to this text, as other nodeboxes also have issues with this.
A protocol bump is performed in order to be able to send older clients
a nodeblock that is usable for them. In order to avoid abuse of users
we send older clients a "full-size" node, so that it's impossible for
them to try and walk through a fence or wall that's created in this
fashion. This was tested with a pre-bump client connected against a
server running the new protocol.
These nodes connect to other nodes, and you can select which ones
those are by specifying node names (or group names) in the
connects_to string array:
connects_to = { "group:fence", "default:wood" }
By default, nodes do not connect to anything, allowing you to create
nodes that always have to be paired in order to connect. lua_api.txt
is updated to reflect the extension to the node_box API.
Example lua code needed to generate these nodes can be found here:
https://gist.github.com/sofar/b381c8c192c8e53e6062
2016-02-25 09:16:31 +01:00
|
|
|
*neighbors |= v;
|
|
|
|
}
|
2011-04-10 14:16:27 +02:00
|
|
|
|
2013-01-12 18:59:19 +01:00
|
|
|
collisionMoveResult collisionMoveSimple(Environment *env, IGameDef *gamedef,
|
2012-03-19 04:25:09 +01:00
|
|
|
f32 pos_max_d, const aabb3f &box_0,
|
|
|
|
f32 stepheight, f32 dtime,
|
2016-01-25 00:06:01 +01:00
|
|
|
v3f *pos_f, v3f *speed_f,
|
|
|
|
v3f accel_f, ActiveObject *self,
|
2013-06-14 14:04:46 +02:00
|
|
|
bool collideWithObjects)
|
2011-04-10 14:16:27 +02:00
|
|
|
{
|
2023-01-08 01:31:31 +01:00
|
|
|
#define PROFILER_NAME(text) (s_env ? ("Server: " text) : ("Client: " text))
|
2015-12-18 19:20:06 +01:00
|
|
|
static bool time_notification_done = false;
|
2013-01-12 18:59:19 +01:00
|
|
|
Map *map = &env->getMap();
|
2023-01-08 01:31:31 +01:00
|
|
|
ServerEnvironment *s_env = dynamic_cast<ServerEnvironment*>(env);
|
2019-08-13 19:56:55 +02:00
|
|
|
|
2024-04-20 15:11:25 +02:00
|
|
|
ScopeProfiler sp(g_profiler, PROFILER_NAME("collisionMoveSimple()"), SPT_AVG, PRECISION_MICRO);
|
2012-03-19 04:25:09 +01:00
|
|
|
|
2011-04-10 14:16:27 +02:00
|
|
|
collisionMoveResult result;
|
|
|
|
|
2012-03-19 04:25:09 +01:00
|
|
|
/*
|
|
|
|
Calculate new velocity
|
|
|
|
*/
|
2023-12-10 19:12:37 +01:00
|
|
|
if (dtime > DTIME_LIMIT) {
|
2015-12-18 19:20:06 +01:00
|
|
|
if (!time_notification_done) {
|
|
|
|
time_notification_done = true;
|
2023-12-10 19:12:37 +01:00
|
|
|
warningstream << "collisionMoveSimple: maximum step interval exceeded,"
|
2015-12-18 19:20:06 +01:00
|
|
|
" lost movement details!"<<std::endl;
|
|
|
|
}
|
2023-12-10 19:12:37 +01:00
|
|
|
dtime = DTIME_LIMIT;
|
2015-12-18 19:20:06 +01:00
|
|
|
} else {
|
|
|
|
time_notification_done = false;
|
2013-01-17 00:27:11 +01:00
|
|
|
}
|
2022-09-20 10:55:51 +02:00
|
|
|
|
2022-09-30 12:31:24 +02:00
|
|
|
v3f dpos_f = (*speed_f + accel_f * 0.5f * dtime) * dtime;
|
|
|
|
v3f newpos_f = *pos_f + dpos_f;
|
2016-01-25 00:06:01 +01:00
|
|
|
*speed_f += accel_f * dtime;
|
2012-03-19 04:25:09 +01:00
|
|
|
|
2022-09-20 10:55:51 +02:00
|
|
|
// If the object is static, there are no collisions
|
2022-09-30 12:31:24 +02:00
|
|
|
if (dpos_f == v3f())
|
2012-04-07 18:19:36 +02:00
|
|
|
return result;
|
|
|
|
|
2013-04-03 01:24:45 +02:00
|
|
|
// Limit speed for avoiding hangs
|
2016-01-25 00:06:01 +01:00
|
|
|
speed_f->Y = rangelim(speed_f->Y, -5000, 5000);
|
|
|
|
speed_f->X = rangelim(speed_f->X, -5000, 5000);
|
|
|
|
speed_f->Z = rangelim(speed_f->Z, -5000, 5000);
|
2013-04-03 01:24:45 +02:00
|
|
|
|
2020-05-14 19:28:27 +02:00
|
|
|
*speed_f = truncate(*speed_f, 10000.0f);
|
|
|
|
|
2011-04-10 14:16:27 +02:00
|
|
|
/*
|
2012-03-19 04:25:09 +01:00
|
|
|
Collect node boxes in movement range
|
2011-04-10 14:16:27 +02:00
|
|
|
*/
|
2012-03-19 04:25:09 +01:00
|
|
|
|
2024-04-23 20:23:31 +02:00
|
|
|
// cached allocation
|
|
|
|
thread_local std::vector<NearbyCollisionInfo> cinfo;
|
|
|
|
cinfo.clear();
|
|
|
|
|
|
|
|
{
|
2017-08-04 21:48:32 +02:00
|
|
|
v3f minpos_f(
|
|
|
|
MYMIN(pos_f->X, newpos_f.X),
|
2017-08-20 19:37:55 +02:00
|
|
|
MYMIN(pos_f->Y, newpos_f.Y) + 0.01f * BS, // bias rounding, player often at +/-n.5
|
2017-08-04 21:48:32 +02:00
|
|
|
MYMIN(pos_f->Z, newpos_f.Z)
|
|
|
|
);
|
|
|
|
v3f maxpos_f(
|
|
|
|
MYMAX(pos_f->X, newpos_f.X),
|
|
|
|
MYMAX(pos_f->Y, newpos_f.Y),
|
|
|
|
MYMAX(pos_f->Z, newpos_f.Z)
|
|
|
|
);
|
|
|
|
v3s16 min = floatToInt(minpos_f + box_0.MinEdge, BS) - v3s16(1, 1, 1);
|
|
|
|
v3s16 max = floatToInt(maxpos_f + box_0.MaxEdge, BS) + v3s16(1, 1, 1);
|
2012-03-19 04:25:09 +01:00
|
|
|
|
2024-04-23 20:23:31 +02:00
|
|
|
const auto *nodedef = gamedef->getNodeDefManager();
|
2015-08-18 12:05:24 +02:00
|
|
|
bool any_position_valid = false;
|
|
|
|
|
2024-04-23 20:23:31 +02:00
|
|
|
thread_local std::vector<aabb3f> nodeboxes;
|
|
|
|
|
2017-08-17 20:23:54 +02:00
|
|
|
v3s16 p;
|
2024-04-23 19:43:08 +02:00
|
|
|
for (p.Z = min.Z; p.Z <= max.Z; p.Z++)
|
2017-08-17 20:23:54 +02:00
|
|
|
for (p.Y = min.Y; p.Y <= max.Y; p.Y++)
|
2024-04-23 19:43:08 +02:00
|
|
|
for (p.X = min.X; p.X <= max.X; p.X++) {
|
2014-11-14 09:05:34 +01:00
|
|
|
bool is_position_valid;
|
2019-08-10 19:45:44 +02:00
|
|
|
MapNode n = map->getNode(p, &is_position_valid);
|
2014-11-14 09:05:34 +01:00
|
|
|
|
2018-02-24 16:57:34 +01:00
|
|
|
if (is_position_valid && n.getContent() != CONTENT_IGNORE) {
|
2012-03-19 04:25:09 +01:00
|
|
|
// Object collides into walkable nodes
|
2014-11-14 09:05:34 +01:00
|
|
|
|
2015-08-18 12:05:24 +02:00
|
|
|
any_position_valid = true;
|
Nodebox: Allow nodeboxes to "connect"
We introduce a new nodebox type "connected", and allow these nodes to
have optional nodeboxes that connect it to other connecting nodeboxes.
This is all done at scenedraw time in the client. The client will
inspect the surrounding nodes and if they are to be connected to,
it will draw the appropriate connecting nodeboxes to make those
connections.
In the node_box definition, we have to specify separate nodeboxes for
each valid connection. This allows us to make nodes that connect only
horizontally (the common case) by providing optional nodeboxes for +x,
-x, +z, -z directions. Or this allows us to make wires that can connect
up and down, by providing nodeboxes that connect it up and down (+y,
-y) as well.
The optional nodeboxes can be arrays. They are named "connect_top,
"connect_bottom", "connect_front", "connect_left", "connect_back" and
"connect_right". Here, "front" means the south facing side of the node
that has facedir = 0.
Additionally, a "fixed" nodebox list present will always be drawn,
so one can make a central post, for instance. This "fixed" nodebox
can be omitted, or it can be an array of nodeboxes.
Collision boxes are also updated in exactly the same fashion, which
allows you to walk over the upper extremities of the individual
node boxes, or stand really close to them. You can also walk up
node noxes that are small in height, all as expected, and unlike the
NDT_FENCELIKE nodes.
I've posted a screenshot demonstrating the flexibility at
http://i.imgur.com/zaJq8jo.png
In the screenshot, all connecting nodes are of this new subtype.
Transparent textures render incorrectly, Which I don't think is
related to this text, as other nodeboxes also have issues with this.
A protocol bump is performed in order to be able to send older clients
a nodeblock that is usable for them. In order to avoid abuse of users
we send older clients a "full-size" node, so that it's impossible for
them to try and walk through a fence or wall that's created in this
fashion. This was tested with a pre-bump client connected against a
server running the new protocol.
These nodes connect to other nodes, and you can select which ones
those are by specifying node names (or group names) in the
connects_to string array:
connects_to = { "group:fence", "default:wood" }
By default, nodes do not connect to anything, allowing you to create
nodes that always have to be paired in order to connect. lua_api.txt
is updated to reflect the extension to the node_box API.
Example lua code needed to generate these nodes can be found here:
https://gist.github.com/sofar/b381c8c192c8e53e6062
2016-02-25 09:16:31 +01:00
|
|
|
const ContentFeatures &f = nodedef->get(n);
|
2017-08-17 20:23:54 +02:00
|
|
|
|
|
|
|
if (!f.walkable)
|
2012-03-19 04:25:09 +01:00
|
|
|
continue;
|
2017-08-17 20:23:54 +02:00
|
|
|
|
2022-02-16 23:06:00 +01:00
|
|
|
// Negative bouncy may have a meaning, but we need +value here.
|
|
|
|
int n_bouncy_value = abs(itemgroup_get(f.groups, "bouncy"));
|
2012-03-19 04:25:09 +01:00
|
|
|
|
2024-04-23 20:23:31 +02:00
|
|
|
u8 neighbors = n.getNeighbors(p, map);
|
Nodebox: Allow nodeboxes to "connect"
We introduce a new nodebox type "connected", and allow these nodes to
have optional nodeboxes that connect it to other connecting nodeboxes.
This is all done at scenedraw time in the client. The client will
inspect the surrounding nodes and if they are to be connected to,
it will draw the appropriate connecting nodeboxes to make those
connections.
In the node_box definition, we have to specify separate nodeboxes for
each valid connection. This allows us to make nodes that connect only
horizontally (the common case) by providing optional nodeboxes for +x,
-x, +z, -z directions. Or this allows us to make wires that can connect
up and down, by providing nodeboxes that connect it up and down (+y,
-y) as well.
The optional nodeboxes can be arrays. They are named "connect_top,
"connect_bottom", "connect_front", "connect_left", "connect_back" and
"connect_right". Here, "front" means the south facing side of the node
that has facedir = 0.
Additionally, a "fixed" nodebox list present will always be drawn,
so one can make a central post, for instance. This "fixed" nodebox
can be omitted, or it can be an array of nodeboxes.
Collision boxes are also updated in exactly the same fashion, which
allows you to walk over the upper extremities of the individual
node boxes, or stand really close to them. You can also walk up
node noxes that are small in height, all as expected, and unlike the
NDT_FENCELIKE nodes.
I've posted a screenshot demonstrating the flexibility at
http://i.imgur.com/zaJq8jo.png
In the screenshot, all connecting nodes are of this new subtype.
Transparent textures render incorrectly, Which I don't think is
related to this text, as other nodeboxes also have issues with this.
A protocol bump is performed in order to be able to send older clients
a nodeblock that is usable for them. In order to avoid abuse of users
we send older clients a "full-size" node, so that it's impossible for
them to try and walk through a fence or wall that's created in this
fashion. This was tested with a pre-bump client connected against a
server running the new protocol.
These nodes connect to other nodes, and you can select which ones
those are by specifying node names (or group names) in the
connects_to string array:
connects_to = { "group:fence", "default:wood" }
By default, nodes do not connect to anything, allowing you to create
nodes that always have to be paired in order to connect. lua_api.txt
is updated to reflect the extension to the node_box API.
Example lua code needed to generate these nodes can be found here:
https://gist.github.com/sofar/b381c8c192c8e53e6062
2016-02-25 09:16:31 +01:00
|
|
|
|
2024-04-23 20:23:31 +02:00
|
|
|
nodeboxes.clear();
|
|
|
|
n.getCollisionBoxes(nodedef, &nodeboxes, neighbors);
|
2018-04-04 00:43:08 +02:00
|
|
|
|
|
|
|
// Calculate float position only once
|
|
|
|
v3f posf = intToFloat(p, BS);
|
2017-08-17 20:23:54 +02:00
|
|
|
for (auto box : nodeboxes) {
|
2018-04-04 00:43:08 +02:00
|
|
|
box.MinEdge += posf;
|
|
|
|
box.MaxEdge += posf;
|
2020-04-26 22:52:00 +02:00
|
|
|
cinfo.emplace_back(false, n_bouncy_value, p, box);
|
2012-03-19 04:25:09 +01:00
|
|
|
}
|
2016-01-09 23:07:46 +01:00
|
|
|
} else {
|
2018-02-24 16:57:34 +01:00
|
|
|
// Collide with unloaded nodes (position invalid) and loaded
|
|
|
|
// CONTENT_IGNORE nodes (position valid)
|
2012-09-01 11:58:37 +02:00
|
|
|
aabb3f box = getNodeBox(p, BS);
|
2020-04-26 22:52:00 +02:00
|
|
|
cinfo.emplace_back(true, 0, p, box);
|
2012-03-19 04:25:09 +01:00
|
|
|
}
|
|
|
|
}
|
2015-08-18 12:05:24 +02:00
|
|
|
|
|
|
|
// Do not move if world has not loaded yet, since custom node boxes
|
|
|
|
// are not available for collision detection.
|
2018-02-24 16:57:34 +01:00
|
|
|
// This also intentionally occurs in the case of the object being positioned
|
|
|
|
// solely on loaded CONTENT_IGNORE nodes, no matter where they come from.
|
2016-04-06 01:11:36 +02:00
|
|
|
if (!any_position_valid) {
|
|
|
|
*speed_f = v3f(0, 0, 0);
|
2015-08-18 12:05:24 +02:00
|
|
|
return result;
|
2016-04-06 01:11:36 +02:00
|
|
|
}
|
2015-08-18 12:05:24 +02:00
|
|
|
|
2024-04-23 20:23:31 +02:00
|
|
|
}
|
2012-03-19 04:25:09 +01:00
|
|
|
|
2024-04-23 20:23:31 +02:00
|
|
|
/*
|
|
|
|
Collect object boxes in movement range
|
|
|
|
*/
|
|
|
|
|
|
|
|
auto process_object = [] (ActiveObject *object) {
|
|
|
|
if (object && object->collideWithObjects()) {
|
|
|
|
aabb3f box;
|
|
|
|
if (object->getCollisionBox(&box))
|
|
|
|
cinfo.emplace_back(object, 0, box);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
if (collideWithObjects) {
|
|
|
|
// Calculate distance by speed, add own extent and 1.5m of tolerance
|
|
|
|
const f32 distance = speed_f->getLength() * dtime +
|
|
|
|
box_0.getExtent().getLength() + 1.5f * BS;
|
2013-01-12 18:59:19 +01:00
|
|
|
|
|
|
|
#ifndef SERVER
|
|
|
|
ClientEnvironment *c_env = dynamic_cast<ClientEnvironment*>(env);
|
2024-04-23 20:23:31 +02:00
|
|
|
if (c_env) {
|
2013-01-12 18:59:19 +01:00
|
|
|
std::vector<DistanceSortedActiveObject> clientobjects;
|
2018-08-05 22:28:41 +02:00
|
|
|
c_env->getActiveObjects(*pos_f, distance, clientobjects);
|
|
|
|
|
2017-08-17 20:23:54 +02:00
|
|
|
for (auto &clientobject : clientobjects) {
|
2018-08-05 22:28:41 +02:00
|
|
|
// Do collide with everything but itself and the parent CAO
|
|
|
|
if (!self || (self != clientobject.obj &&
|
|
|
|
self != clientobject.obj->getParent())) {
|
2024-04-23 20:23:31 +02:00
|
|
|
process_object(clientobject.obj);
|
2013-04-09 23:16:13 +02:00
|
|
|
}
|
2013-01-12 18:59:19 +01:00
|
|
|
}
|
|
|
|
|
2024-04-23 20:23:31 +02:00
|
|
|
// add collision with local player
|
2020-04-08 22:45:05 +02:00
|
|
|
LocalPlayer *lplayer = c_env->getLocalPlayer();
|
|
|
|
if (lplayer->getParent() == nullptr) {
|
|
|
|
aabb3f lplayer_collisionbox = lplayer->getCollisionbox();
|
|
|
|
v3f lplayer_pos = lplayer->getPosition();
|
|
|
|
lplayer_collisionbox.MinEdge += lplayer_pos;
|
|
|
|
lplayer_collisionbox.MaxEdge += lplayer_pos;
|
2024-04-23 20:23:31 +02:00
|
|
|
auto *obj = (ActiveObject*) lplayer->getCAO();
|
2020-04-26 22:52:00 +02:00
|
|
|
cinfo.emplace_back(obj, 0, lplayer_collisionbox);
|
2020-04-08 22:45:05 +02:00
|
|
|
}
|
|
|
|
}
|
2024-04-23 20:23:31 +02:00
|
|
|
else
|
2020-04-08 22:45:05 +02:00
|
|
|
#endif
|
2024-04-23 20:23:31 +02:00
|
|
|
if (s_env) {
|
|
|
|
// search for objects which are not us, or we are not its parent.
|
|
|
|
// we directly process the object in this callback to avoid useless
|
|
|
|
// looping afterwards.
|
|
|
|
auto include_obj_cb = [self, &process_object] (ServerActiveObject *obj) {
|
|
|
|
if (!obj->isGone() &&
|
|
|
|
(!self || (self != obj && self != obj->getParent()))) {
|
|
|
|
process_object(obj);
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
};
|
|
|
|
|
|
|
|
// nothing is put into this vector
|
|
|
|
std::vector<ServerActiveObject*> s_objects;
|
|
|
|
s_env->getObjectsInsideRadius(s_objects, *pos_f, distance, include_obj_cb);
|
|
|
|
}
|
|
|
|
}
|
2013-01-12 18:59:19 +01:00
|
|
|
|
2011-04-10 14:16:27 +02:00
|
|
|
/*
|
|
|
|
Collision detection
|
|
|
|
*/
|
2012-03-19 04:25:09 +01:00
|
|
|
|
2020-04-08 22:45:05 +02:00
|
|
|
f32 d = 0.0f;
|
2011-04-10 14:16:27 +02:00
|
|
|
|
2012-03-19 04:25:09 +01:00
|
|
|
int loopcount = 0;
|
|
|
|
|
2017-08-20 19:37:55 +02:00
|
|
|
while(dtime > BS * 1e-10f) {
|
2012-03-19 04:25:09 +01:00
|
|
|
// Avoid infinite loop
|
|
|
|
loopcount++;
|
2015-08-12 17:13:19 +02:00
|
|
|
if (loopcount >= 100) {
|
|
|
|
warningstream << "collisionMoveSimple: Loop count exceeded, aborting to avoid infiniite loop" << std::endl;
|
2012-03-19 04:25:09 +01:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
aabb3f movingbox = box_0;
|
2016-01-25 00:06:01 +01:00
|
|
|
movingbox.MinEdge += *pos_f;
|
|
|
|
movingbox.MaxEdge += *pos_f;
|
2012-03-19 04:25:09 +01:00
|
|
|
|
2019-06-10 13:00:35 +02:00
|
|
|
CollisionAxis nearest_collided = COLLISION_AXIS_NONE;
|
2012-03-19 04:25:09 +01:00
|
|
|
f32 nearest_dtime = dtime;
|
2016-02-20 09:44:22 +01:00
|
|
|
int nearest_boxindex = -1;
|
2012-03-19 04:25:09 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
Go through every nodebox, find nearest collision
|
|
|
|
*/
|
2016-01-09 23:07:46 +01:00
|
|
|
for (u32 boxindex = 0; boxindex < cinfo.size(); boxindex++) {
|
2018-04-04 00:43:08 +02:00
|
|
|
const NearbyCollisionInfo &box_info = cinfo[boxindex];
|
2016-03-01 11:15:08 +01:00
|
|
|
// Ignore if already stepped up this nodebox.
|
2016-01-09 23:07:46 +01:00
|
|
|
if (box_info.is_step_up)
|
2016-03-01 11:15:08 +01:00
|
|
|
continue;
|
|
|
|
|
2012-03-19 04:25:09 +01:00
|
|
|
// Find nearest collision of the two boxes (raytracing-like)
|
2020-04-08 22:45:05 +02:00
|
|
|
f32 dtime_tmp = nearest_dtime;
|
2019-06-10 13:00:35 +02:00
|
|
|
CollisionAxis collided = axisAlignedCollision(box_info.box,
|
2020-04-08 22:45:05 +02:00
|
|
|
movingbox, *speed_f, &dtime_tmp);
|
2012-03-19 04:25:09 +01:00
|
|
|
|
2015-08-12 17:13:19 +02:00
|
|
|
if (collided == -1 || dtime_tmp >= nearest_dtime)
|
2011-04-10 14:16:27 +02:00
|
|
|
continue;
|
2012-03-19 04:25:09 +01:00
|
|
|
|
|
|
|
nearest_dtime = dtime_tmp;
|
|
|
|
nearest_collided = collided;
|
|
|
|
nearest_boxindex = boxindex;
|
2011-04-10 14:16:27 +02:00
|
|
|
}
|
2012-03-19 04:25:09 +01:00
|
|
|
|
2019-06-10 13:00:35 +02:00
|
|
|
if (nearest_collided == COLLISION_AXIS_NONE) {
|
2012-03-19 04:25:09 +01:00
|
|
|
// No collision with any collision box.
|
2020-05-14 19:28:27 +02:00
|
|
|
*pos_f += truncate(*speed_f * dtime, 100.0f);
|
2012-03-19 04:25:09 +01:00
|
|
|
dtime = 0; // Set to 0 to avoid "infinite" loop due to small FP numbers
|
2015-08-12 17:13:19 +02:00
|
|
|
} else {
|
2012-03-19 04:25:09 +01:00
|
|
|
// Otherwise, a collision occurred.
|
2016-01-09 23:07:46 +01:00
|
|
|
NearbyCollisionInfo &nearest_info = cinfo[nearest_boxindex];
|
|
|
|
const aabb3f& cbox = nearest_info.box;
|
2020-04-08 22:45:05 +02:00
|
|
|
|
|
|
|
//movingbox except moved to the horizontal position it would be after step up
|
|
|
|
aabb3f stepbox = movingbox;
|
|
|
|
stepbox.MinEdge.X += speed_f->X * dtime;
|
|
|
|
stepbox.MinEdge.Z += speed_f->Z * dtime;
|
|
|
|
stepbox.MaxEdge.X += speed_f->X * dtime;
|
|
|
|
stepbox.MaxEdge.Z += speed_f->Z * dtime;
|
2012-03-19 04:25:09 +01:00
|
|
|
// Check for stairs.
|
2019-06-10 13:00:35 +02:00
|
|
|
bool step_up = (nearest_collided != COLLISION_AXIS_Y) && // must not be Y direction
|
2012-03-19 04:25:09 +01:00
|
|
|
(movingbox.MinEdge.Y < cbox.MaxEdge.Y) &&
|
|
|
|
(movingbox.MinEdge.Y + stepheight > cbox.MaxEdge.Y) &&
|
2020-04-08 22:45:05 +02:00
|
|
|
(!wouldCollideWithCeiling(cinfo, stepbox,
|
2012-03-19 04:25:09 +01:00
|
|
|
cbox.MaxEdge.Y - movingbox.MinEdge.Y,
|
|
|
|
d));
|
|
|
|
|
2012-09-01 11:58:37 +02:00
|
|
|
// Get bounce multiplier
|
2017-08-20 19:37:55 +02:00
|
|
|
float bounce = -(float)nearest_info.bouncy / 100.0f;
|
2012-09-01 11:58:37 +02:00
|
|
|
|
2012-03-19 04:25:09 +01:00
|
|
|
// Move to the point of collision and reduce dtime by nearest_dtime
|
2015-08-12 17:13:19 +02:00
|
|
|
if (nearest_dtime < 0) {
|
2020-04-08 22:45:05 +02:00
|
|
|
// Handle negative nearest_dtime
|
2015-08-12 17:13:19 +02:00
|
|
|
if (!step_up) {
|
2019-06-10 13:00:35 +02:00
|
|
|
if (nearest_collided == COLLISION_AXIS_X)
|
2016-01-25 00:06:01 +01:00
|
|
|
pos_f->X += speed_f->X * nearest_dtime;
|
2019-06-10 13:00:35 +02:00
|
|
|
if (nearest_collided == COLLISION_AXIS_Y)
|
2016-01-25 00:06:01 +01:00
|
|
|
pos_f->Y += speed_f->Y * nearest_dtime;
|
2019-06-10 13:00:35 +02:00
|
|
|
if (nearest_collided == COLLISION_AXIS_Z)
|
2016-01-25 00:06:01 +01:00
|
|
|
pos_f->Z += speed_f->Z * nearest_dtime;
|
2012-03-19 04:25:09 +01:00
|
|
|
}
|
2015-08-12 17:13:19 +02:00
|
|
|
} else {
|
2020-05-14 19:28:27 +02:00
|
|
|
*pos_f += truncate(*speed_f * nearest_dtime, 100.0f);
|
2012-03-19 04:25:09 +01:00
|
|
|
dtime -= nearest_dtime;
|
|
|
|
}
|
2015-07-20 23:30:43 +02:00
|
|
|
|
2012-09-01 11:58:37 +02:00
|
|
|
bool is_collision = true;
|
2016-01-09 23:07:46 +01:00
|
|
|
if (nearest_info.is_unloaded)
|
2012-09-01 11:58:37 +02:00
|
|
|
is_collision = false;
|
|
|
|
|
|
|
|
CollisionInfo info;
|
2020-04-26 22:52:00 +02:00
|
|
|
if (nearest_info.isObject())
|
2013-01-12 18:59:19 +01:00
|
|
|
info.type = COLLISION_OBJECT;
|
2016-03-01 11:15:08 +01:00
|
|
|
else
|
2013-01-12 18:59:19 +01:00
|
|
|
info.type = COLLISION_NODE;
|
2015-08-12 17:13:19 +02:00
|
|
|
|
2016-01-09 23:07:46 +01:00
|
|
|
info.node_p = nearest_info.position;
|
2020-04-26 22:52:00 +02:00
|
|
|
info.object = nearest_info.obj;
|
2024-05-05 13:28:59 +02:00
|
|
|
info.new_pos = *pos_f;
|
2016-01-25 00:06:01 +01:00
|
|
|
info.old_speed = *speed_f;
|
2018-11-22 22:47:15 +01:00
|
|
|
info.plane = nearest_collided;
|
2012-03-19 04:25:09 +01:00
|
|
|
|
|
|
|
// Set the speed component that caused the collision to zero
|
2015-08-12 17:13:19 +02:00
|
|
|
if (step_up) {
|
2012-03-19 04:25:09 +01:00
|
|
|
// Special case: Handle stairs
|
2016-01-09 23:07:46 +01:00
|
|
|
nearest_info.is_step_up = true;
|
2012-09-01 11:58:37 +02:00
|
|
|
is_collision = false;
|
2019-06-10 13:00:35 +02:00
|
|
|
} else if (nearest_collided == COLLISION_AXIS_X) {
|
2016-01-25 00:06:01 +01:00
|
|
|
if (fabs(speed_f->X) > BS * 3)
|
|
|
|
speed_f->X *= bounce;
|
2012-09-01 11:58:37 +02:00
|
|
|
else
|
2016-01-25 00:06:01 +01:00
|
|
|
speed_f->X = 0;
|
2012-03-19 04:25:09 +01:00
|
|
|
result.collides = true;
|
2019-06-10 13:00:35 +02:00
|
|
|
} else if (nearest_collided == COLLISION_AXIS_Y) {
|
2016-01-09 23:07:46 +01:00
|
|
|
if(fabs(speed_f->Y) > BS * 3)
|
2016-01-25 00:06:01 +01:00
|
|
|
speed_f->Y *= bounce;
|
2016-03-01 11:15:08 +01:00
|
|
|
else
|
2016-01-25 00:06:01 +01:00
|
|
|
speed_f->Y = 0;
|
2012-03-19 04:25:09 +01:00
|
|
|
result.collides = true;
|
2019-06-10 13:00:35 +02:00
|
|
|
} else if (nearest_collided == COLLISION_AXIS_Z) {
|
2016-01-25 00:06:01 +01:00
|
|
|
if (fabs(speed_f->Z) > BS * 3)
|
|
|
|
speed_f->Z *= bounce;
|
2012-09-01 11:58:37 +02:00
|
|
|
else
|
2016-01-25 00:06:01 +01:00
|
|
|
speed_f->Z = 0;
|
2012-03-19 04:25:09 +01:00
|
|
|
result.collides = true;
|
|
|
|
}
|
2012-09-01 11:58:37 +02:00
|
|
|
|
2016-01-25 00:06:01 +01:00
|
|
|
info.new_speed = *speed_f;
|
2017-08-20 19:37:55 +02:00
|
|
|
if (info.new_speed.getDistanceFrom(info.old_speed) < 0.1f * BS)
|
2012-09-01 11:58:37 +02:00
|
|
|
is_collision = false;
|
|
|
|
|
2015-08-12 17:13:19 +02:00
|
|
|
if (is_collision) {
|
2019-06-10 13:00:35 +02:00
|
|
|
info.axis = nearest_collided;
|
2024-04-23 20:23:31 +02:00
|
|
|
result.collisions.push_back(std::move(info));
|
2012-09-01 11:58:37 +02:00
|
|
|
}
|
2012-03-19 04:25:09 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-03-01 11:15:08 +01:00
|
|
|
/*
|
|
|
|
Final touches: Check if standing on ground, step up stairs.
|
|
|
|
*/
|
|
|
|
aabb3f box = box_0;
|
|
|
|
box.MinEdge += *pos_f;
|
|
|
|
box.MaxEdge += *pos_f;
|
2017-08-17 20:23:54 +02:00
|
|
|
for (const auto &box_info : cinfo) {
|
2016-01-09 23:07:46 +01:00
|
|
|
const aabb3f &cbox = box_info.box;
|
2016-03-01 11:15:08 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
See if the object is touching ground.
|
|
|
|
|
|
|
|
Object touches ground if object's minimum Y is near node's
|
|
|
|
maximum Y and object's X-Z-area overlaps with the node's
|
|
|
|
X-Z-area.
|
|
|
|
*/
|
2020-04-08 22:45:05 +02:00
|
|
|
|
2016-03-01 11:15:08 +01:00
|
|
|
if (cbox.MaxEdge.X - d > box.MinEdge.X && cbox.MinEdge.X + d < box.MaxEdge.X &&
|
|
|
|
cbox.MaxEdge.Z - d > box.MinEdge.Z &&
|
|
|
|
cbox.MinEdge.Z + d < box.MaxEdge.Z) {
|
2016-01-09 23:07:46 +01:00
|
|
|
if (box_info.is_step_up) {
|
|
|
|
pos_f->Y += cbox.MaxEdge.Y - box.MinEdge.Y;
|
2016-03-01 11:15:08 +01:00
|
|
|
box = box_0;
|
|
|
|
box.MinEdge += *pos_f;
|
|
|
|
box.MaxEdge += *pos_f;
|
|
|
|
}
|
2020-04-08 22:45:05 +02:00
|
|
|
if (std::fabs(cbox.MaxEdge.Y - box.MinEdge.Y) < 0.05f) {
|
2016-03-01 11:15:08 +01:00
|
|
|
result.touching_ground = true;
|
|
|
|
|
2020-04-26 22:52:00 +02:00
|
|
|
if (box_info.isObject())
|
2016-03-01 11:15:08 +01:00
|
|
|
result.standing_on_object = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-04-10 14:16:27 +02:00
|
|
|
return result;
|
|
|
|
}
|