Skip to content

/ bepuphysics2

Permalink
master

bepuphysics2/Demos/Demos/CustomVoxelCollidableDemo.cs

Go to file
 
 
Cannot retrieve contributors at this time
465 lines (421 sloc) 30.7 KB
Raw Blame
using BepuUtilities;
using DemoRenderer;
using BepuPhysics;
using BepuPhysics.Collidables;
using System.Numerics;
using DemoContentLoader;
using BepuPhysics.CollisionDetection;
using BepuPhysics.CollisionDetection.CollisionTasks;
using BepuPhysics.Trees;
using BepuUtilities.Memory;
using BepuUtilities.Collections;
using System.Runtime.CompilerServices;
using DemoRenderer.UI;
using DemoUtilities;
using System;
using BepuPhysics.CollisionDetection.SweepTasks;
namespace Demos.Demos
{
//There are a variety of types related to collision pairs designed to work with particular interfaces.
//We don't want to make a bunch of special cases, so we'll implement some of the interfaces.
//Note that we don't just use ICompoundShape, even though that would lessen the amount of special case work needed-
//ICompoundShape is designed to work in a more general case where every child may have a unique shape.
//Meshes and voxel sets don't behave this way- all children are a single type, hence 'homogeneous'.
struct Voxels : IHomogeneousCompoundShape<Box, BoxWide>
{
//Type ids should be unique across all shape types in a simulation.
public int TypeId => 12;
//Using an object space tree isn't necessarily ideal for a highly regular data like voxels.
//We're using it here since it exists already and a voxel-specialized version doesn't.
//If you wanted maximum efficiency for some specific use case- like a world containing
//~infinite numbers of voxels with very fast modifications- then you may want to consider an alternative.
//(The tree based version could still work if the data was organized into streamed chunks instead of
//a single giant collidable, but it probably won't match a specialized structure that takes
//advantage of regular voxel grids' unique properties.)
public Tree Tree;
/// <summary>
/// List of the voxels in the voxel set by three dimensional index.
/// </summary>
public QuickList<Vector3> VoxelIndices;
/// <summary>
/// Size of each individual voxel. Updating this value requires updating the tree leaf bounds and refitting.
/// </summary>
public Vector3 VoxelSize;
public int ChildCount => VoxelIndices.Count;
public Voxels(QuickList<Vector3> voxelIndices, Vector3 voxelSize, BufferPool pool)
{
VoxelIndices = voxelIndices;
VoxelSize = voxelSize;
Tree = new Tree(pool, voxelIndices.Count);
//Could stackalloc here, but the assumption is that there could be quite a few voxels.
//Quite possible to overflow the stack, so we instead resort to heap allocation.
pool.Take(voxelIndices.Count, out Buffer<BoundingBox> bounds);
for (int i = 0; i < voxelIndices.Count; ++i)
{
ref var voxel = ref voxelIndices[i];
ref var voxelBounds = ref bounds[i];
//Note that the voxel scale is baked into the tree. That's different than the Mesh, which allows sharing the same tree across different scaled shapes.
//You could do something similar with the voxel set if you wanted to; check ou tthe Mesh for an example.
voxelBounds.Min = voxel * VoxelSize;
voxelBounds.Max = voxelBounds.Min + VoxelSize;
}
Tree.SweepBuild(pool, bounds);
pool.Return(ref bounds);
}
public ShapeBatch CreateShapeBatch(BufferPool pool, int initialCapacity, Shapes shapeBatches)
{
//Shapes types are responsible for informing the shape system how to create a batch for them.
//Convex shapes will return a ConvexShapeBatch<TShape>, compound shapes a CompoundShapeBatch<TShape>,
//and then we have the HomogeneousCompoundShapeBatch... I don't love this name, but it just means
//that every child of the compound shape has the same type. So a mesh is a 'homogeneous compound'
//because its children are all triangles. Likewise, a voxel set is too, because every child is just a box.
return new HomogeneousCompoundShapeBatch<Voxels, Box, BoxWide>(pool, initialCapacity);
}
public void ComputeBounds(in Quaternion orientation, out Vector3 min, out Vector3 max)
{
Matrix3x3.CreateFromQuaternion(orientation, out var basis);
min = new Vector3(float.MaxValue);
max = new Vector3(float.MinValue);
for (int i = 0; i < VoxelIndices.Count; ++i)
{
var localVoxelPosition = (VoxelIndices[i] + new Vector3(0.5f)) * VoxelSize;
Matrix3x3.Transform(localVoxelPosition, basis, out var rotatedPosition);
min = Vector3.Min(rotatedPosition, min);
max = Vector3.Max(rotatedPosition, max);
}
//All children have the same shape and orientation, so we can simply expand the centroids bounding box.
var box = new Box(VoxelSize.X, VoxelSize.Y, VoxelSize.Z);
box.ComputeBounds(orientation, out var childLocalMin, out var childLocalMax);
min += childLocalMin;
max += childLocalMax;
}
unsafe struct HitLeafTester<T> : IRayLeafTester where T : IShapeRayHitHandler
{
public QuickList<Vector3> VoxelIndices;
public Vector3 VoxelSize;
public Box VoxelShape;
public T HitHandler;
public Matrix3x3 Orientation;
public RayData OriginalRay;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public unsafe void TestLeaf(int leafIndex, RayData* ray, float* maximumT)
{
ref var voxelIndex = ref VoxelIndices[leafIndex];
//Note that you could make use of the voxel grid's regular structure to save some work dealing with orientations.
if (VoxelShape.RayTest(new RigidPose((voxelIndex + new Vector3(0.5f)) * VoxelSize), ray->Origin, ray->Direction, out var t, out var normal) && t <= *maximumT)
{
//Bring the ray normal back into world space.
Matrix3x3.Transform(normal, Orientation, out normal);
//Use the original ray to avoid leaking the fact that we were working in local space.
HitHandler.OnRayHit(OriginalRay, ref *maximumT, t, normal, leafIndex);
}
}
}
/// <summary>
/// Casts a ray against the voxels. Executes a callback for every test candidate and every hit.
/// </summary>
/// <typeparam name="TRayHitHandler">Type of the callback to execute for every test candidate and hit.</typeparam>
/// <param name="pose">Pose of the voxels during the ray test.</param>
/// <param name="ray">Ray to test against the voxels.</param>
/// <param name="maximumT">Maximum length of the ray in units of the ray direction length.</param>
/// <param name="hitHandler">Callback to execute for every hit.</param>
public unsafe void RayTest<TRayHitHandler>(in RigidPose pose, in RayData ray, ref float maximumT, ref TRayHitHandler hitHandler) where TRayHitHandler : struct, IShapeRayHitHandler
{
HitLeafTester<TRayHitHandler> leafTester;
leafTester.VoxelIndices = VoxelIndices;
leafTester.VoxelSize = VoxelSize;
leafTester.VoxelShape = new Box(VoxelSize.X, VoxelSize.Y, VoxelSize.Z);
leafTester.HitHandler = hitHandler;
Matrix3x3.CreateFromQuaternion(pose.Orientation, out leafTester.Orientation);
leafTester.OriginalRay = ray;
Matrix3x3.TransformTranspose(ray.Origin - pose.Position, leafTester.Orientation, out var localOrigin);
Matrix3x3.TransformTranspose(ray.Direction, leafTester.Orientation, out var localDirection);
Tree.RayCast(localOrigin, localDirection, ref maximumT, ref leafTester);
//The leaf tester could have mutated the hit handler; copy it back over.
hitHandler = leafTester.HitHandler;
}
//Some shapes take advantage of multiple simultaneous incoming rays to perform batch execution.
//That can improve performance quite a bit in some cases. We don't bother taking advantage of it here, but you could add it if you wanted!
/// <summary>
/// Casts a bunch of rays against the voxels at the same time, executing a callback for every test candidate and every hit.
/// </summary>
/// <typeparam name="TRayHitHandler">Type of the callback to execute for every ray test candidate and every hit.</typeparam>
/// <param name="pose">Pose of the voxels during the ray test.</param>
/// <param name="rays">Set of rays to cast against the voxels.</param>
/// <param name="hitHandler">Callbacks to execute.</param>
public unsafe void RayTest<TRayHitHandler>(in RigidPose pose, ref RaySource rays, ref TRayHitHandler hitHandler) where TRayHitHandler : struct, IShapeRayHitHandler
{
HitLeafTester<TRayHitHandler> leafTester;
leafTester.VoxelIndices = VoxelIndices;
leafTester.VoxelSize = VoxelSize;
leafTester.VoxelShape = new Box(VoxelSize.X, VoxelSize.Y, VoxelSize.Z);
leafTester.HitHandler = hitHandler;
Matrix3x3.CreateFromQuaternion(pose.Orientation, out leafTester.Orientation);
Matrix3x3.Transpose(leafTester.Orientation, out var inverseOrientation);
for (int i = 0; i < rays.RayCount; ++i)
{
rays.GetRay(i, out var ray, out var maximumT);
leafTester.OriginalRay = *ray;
Matrix3x3.Transform(ray->Origin - pose.Position, inverseOrientation, out var localOrigin);
Matrix3x3.Transform(ray->Direction, inverseOrientation, out var localDirection);
Tree.RayCast(localOrigin, localDirection, ref *maximumT, ref leafTester);
}
//The leaf tester could have mutated the hit handler; copy it back over.
hitHandler = leafTester.HitHandler;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public void GetLocalChild(int childIndex, out Box childShape)
{
var halfSize = VoxelSize * 0.5f;
childShape.HalfWidth = halfSize.X;
childShape.HalfHeight = halfSize.Y;
childShape.HalfLength = halfSize.Z;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public void GetPosedLocalChild(int childIndex, out Box childShape, out RigidPose childPose)
{
GetLocalChild(childIndex, out childShape);
childPose = new RigidPose((VoxelIndices[childIndex] + new Vector3(0.5f)) * VoxelSize);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public void GetLocalChild(int childIndex, ref BoxWide shapeWide)
{
//This function provides a reference to a lane in an AOSOA structure.
//We are to fill in the first lane and ignore the others.
var halfSize = VoxelSize * 0.5f;
GatherScatter.GetFirst(ref shapeWide.HalfWidth) = halfSize.X;
GatherScatter.GetFirst(ref shapeWide.HalfHeight) = halfSize.Y;
GatherScatter.GetFirst(ref shapeWide.HalfLength) = halfSize.Z;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public unsafe void FindLocalOverlaps<TOverlaps, TSubpairOverlaps>(ref Buffer<OverlapQueryForPair> pairs, BufferPool pool, Shapes shapes, ref TOverlaps overlaps)
where TOverlaps : struct, ICollisionTaskOverlaps<TSubpairOverlaps>
where TSubpairOverlaps : struct, ICollisionTaskSubpairOverlaps
{
//Just traverse every child against the tree sequentially.
//This sequentializes a whole lot of cache misses. You could probably get some benefit out of traversing all pairs 'simultaneously'- that is,
//using the fact that we have lots of independent queries to ensure the CPU always has something to do. But for the sake of this demo, we'll do it the simple way.
//All this enumerator does is take an overlap reported by the GetOverlaps function and add it to the overlaps list.
ShapeTreeOverlapEnumerator<TSubpairOverlaps> enumerator;
enumerator.Pool = pool;
for (int i = 0; i < pairs.Length; ++i)
{
ref var pair = ref pairs[i];
ref var voxelsSet = ref Unsafe.AsRef<Voxels>(pair.Container);
enumerator.Overlaps = Unsafe.AsPointer(ref overlaps.GetOverlapsForPair(i));
voxelsSet.Tree.GetOverlaps(pair.Min, pair.Max, ref enumerator);
}
}
public unsafe void FindLocalOverlaps<TOverlaps>(in Vector3 min, in Vector3 max, in Vector3 sweep, float maximumT, BufferPool pool, Shapes shapes, void* overlaps) where TOverlaps : ICollisionTaskSubpairOverlaps
{
//Similar to the non-swept FindLocalOverlaps function above, this just adds the overlaps to the provided collection.
//Some unfortunate loss of type information due to some language limitations around generic pointers- pretend the overlaps pointer has type TOverlaps*.
//It will when C# allows it.
ShapeTreeSweepLeafTester<TOverlaps> enumerator;
enumerator.Pool = pool;
enumerator.Overlaps = overlaps;
Tree.Sweep(min, max, sweep, maximumT, ref enumerator);
}
public void Dispose(BufferPool pool)
{
Tree.Dispose(pool);
VoxelIndices.Dispose(pool);
}
}
//"Continuations" tell the collision batcher what to do with the collision detection results after completing a batch.
//For simple convex-convex pairs in the usual narrow phase pipeline, they just report the manifold for constraint generation.
//For more complex types like compounds, there may be multiple subpairs, each with their own contact manifold.
//Those manifolds are combined in a postprocessing step. For most compounds, this is a "NonconvexReduction".
//There is also a "MeshReduction" which is a bit more involved- it tries to smooth out collisions at the boundaries of triangles to avoid bumps during sliding.
//For our voxel set, we'll just use the NonconvexReduction despite the fact that it'll allow bumps at shape boundaries during sliding.
//(I'll leave boundary smoothing for voxels as a not-easy exercise for the highly motivated reader.)
public struct ConvexVoxelsContinuations : IConvexCompoundContinuationHandler<NonconvexReduction>
{
public CollisionContinuationType CollisionContinuationType => CollisionContinuationType.NonconvexReduction;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public ref NonconvexReduction CreateContinuation<TCallbacks>(
ref CollisionBatcher<TCallbacks> collisionBatcher, int childCount, in BoundsTestedPair pair, in OverlapQueryForPair pairQuery, out int continuationIndex)
where TCallbacks : struct, ICollisionCallbacks
{
return ref collisionBatcher.NonconvexReductions.CreateContinuation(childCount, collisionBatcher.Pool, out continuationIndex);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public static unsafe void GetChildData<TCallbacks>(ref CollisionBatcher<TCallbacks> collisionBatcher, ref NonconvexReductionChild continuationChild,
in BoundsTestedPair pair, int shapeTypeA, int childIndexB, out RigidPose childPoseB, out int childTypeB, out void* childShapeDataB)
where TCallbacks : struct, ICollisionCallbacks
{
ref var voxels = ref Unsafe.AsRef<Voxels>(pair.B);
ref var voxelIndex = ref voxels.VoxelIndices[childIndexB];
var localPosition = (voxelIndex + new Vector3(0.5f)) * voxels.VoxelSize;
QuaternionEx.TransformWithoutOverlap(localPosition, pair.OrientationB, out childPoseB.Position);
childPoseB.Orientation = Quaternion.Identity;
childTypeB = Box.Id;
//The collision batcher accumulates pairs to process by pointer, since in almost every other case the shape data is available by pointer already.
//But in the voxel set case, we don't actually have an explicit shape (or a secondary storage location as we have in MeshReductions).
//We can't just allocate a shape on the stack and return a pointer to it- the data needs to be valid until the collision batcher flushes that type batch.
//Fortunately, the collision batcher exposes a handy per-pair-type heap allocated memory blob that we can use to store the shape data.
//When the collision batcher flushes, it'll automatically get cleaned up.
var halfSize = voxels.VoxelSize * 0.5f;
//This reinterprets the vector3 as a Box to copy into the cache, which is a bit gross.
//The shape cache doesn't actually have any type information- it's just strategically placed memory.
//In other words, we're just giving a place for these 12 bytes to live until the flush.
collisionBatcher.CacheShapeB(shapeTypeA, childTypeB, Unsafe.AsPointer(ref halfSize), 12, out childShapeDataB);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public unsafe void ConfigureContinuationChild<TCallbacks>(
ref CollisionBatcher<TCallbacks> collisionBatcher, ref NonconvexReduction continuation, int continuationChildIndex, in BoundsTestedPair pair, int shapeTypeA, int childIndexB,
out RigidPose childPoseB, out int childTypeB, out void* childShapeDataB)
where TCallbacks : struct, ICollisionCallbacks
{
ref var continuationChild = ref continuation.Children[continuationChildIndex];
GetChildData(ref collisionBatcher, ref continuationChild, pair, shapeTypeA, childIndexB, out childPoseB, out childTypeB, out childShapeDataB);
//Collision processors expect data to be provided in a specific order. The flip mask is used to make sure we're giving the data in the proper order.
//The collision batcher also takes into account the flip mask when reporting collision data through callbacks to preserve original user order.
if (pair.FlipMask < 0)
{
continuationChild.ChildIndexA = childIndexB;
continuationChild.ChildIndexB = 0;
continuationChild.OffsetA = childPoseB.Position;
continuationChild.OffsetB = default;
}
else
{
continuationChild.ChildIndexA = 0;
continuationChild.ChildIndexB = childIndexB;
continuationChild.OffsetA = default;
continuationChild.OffsetB = childPoseB.Position;
}
}
}
public unsafe struct CompoundVoxelsContinuations<TCompoundA> : ICompoundPairContinuationHandler<NonconvexReduction>
where TCompoundA : ICompoundShape
{
public CollisionContinuationType CollisionContinuationType => CollisionContinuationType.NonconvexReduction;
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public ref NonconvexReduction CreateContinuation<TCallbacks>(
ref CollisionBatcher<TCallbacks> collisionBatcher, int totalChildCount, ref Buffer<ChildOverlapsCollection> pairOverlaps, ref Buffer<OverlapQueryForPair> pairQueries, in BoundsTestedPair pair, out int continuationIndex)
where TCallbacks : struct, ICollisionCallbacks
{
return ref collisionBatcher.NonconvexReductions.CreateContinuation(totalChildCount, collisionBatcher.Pool, out continuationIndex);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public unsafe void GetChildAData<TCallbacks>(ref CollisionBatcher<TCallbacks> collisionBatcher, ref NonconvexReduction continuation, in BoundsTestedPair pair, int childIndexA,
out RigidPose childPoseA, out int childTypeA, out void* childShapeDataA)
where TCallbacks : struct, ICollisionCallbacks
{
ref var compoundA = ref Unsafe.AsRef<TCompoundA>(pair.A);
ref var compoundChildA = ref compoundA.GetChild(childIndexA);
Compound.GetRotatedChildPose(compoundChildA.LocalPose, pair.OrientationA, out childPoseA);
childTypeA = compoundChildA.ShapeIndex.Type;
collisionBatcher.Shapes[childTypeA].GetShapeData(compoundChildA.ShapeIndex.Index, out childShapeDataA, out _);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public unsafe void ConfigureContinuationChild<TCallbacks>(
ref CollisionBatcher<TCallbacks> collisionBatcher, ref NonconvexReduction continuation, int continuationChildIndex, in BoundsTestedPair pair, int childIndexA, int childTypeA, int childIndexB, in RigidPose childPoseA,
out RigidPose childPoseB, out int childTypeB, out void* childShapeDataB)
where TCallbacks : struct, ICollisionCallbacks
{
ref var continuationChild = ref continuation.Children[continuationChildIndex];
ConvexVoxelsContinuations.GetChildData(ref collisionBatcher, ref continuationChild, pair, childTypeA, childIndexB, out childPoseB, out childTypeB, out childShapeDataB);
if (pair.FlipMask < 0)
{
continuationChild.ChildIndexA = childIndexB;
continuationChild.ChildIndexB = childIndexA;
continuationChild.OffsetA = childPoseB.Position;
continuationChild.OffsetB = childPoseA.Position;
}
else
{
continuationChild.ChildIndexA = childIndexA;
continuationChild.ChildIndexB = childIndexB;
continuationChild.OffsetA = childPoseA.Position;
continuationChild.OffsetB = childPoseB.Position;
}
}
}
public class CustomVoxelCollidableDemo : Demo
{
Voxels voxels;
StaticHandle handle;
public unsafe override void Initialize(ContentArchive content, Camera camera)
{
camera.Position = new Vector3(-40, 40, -40);
camera.Yaw = MathHelper.Pi * 3f / 4;
camera.Pitch = MathHelper.Pi * 0.05f;
//The PositionFirstTimestepper is the simplest timestepping mode, but since it integrates velocity into position at the start of the frame, directly modified velocities outside of the timestep
//will be integrated before collision detection or the solver has a chance to intervene. That's fine in this demo. Other built-in options include the PositionLastTimestepper and the SubsteppingTimestepper.
//Note that the timestepper also has callbacks that you can use for executing logic between processing stages, like BeforeCollisionDetection.
Simulation = Simulation.Create(BufferPool, new DemoNarrowPhaseCallbacks(), new DemoPoseIntegratorCallbacks(new Vector3(0, -10, 0)), new PositionFirstTimestepper());
//The narrow phase must be notified about the existence of the new collidable type. For every pair type we want to support, a collision task must be registered.
//All of the default engine types are registered upon simulation creation by a call to DefaultTypes.CreateDefaultCollisionTaskRegistry.
Simulation.NarrowPhase.CollisionTaskRegistry.Register(new ConvexCompoundCollisionTask<Sphere, Voxels, ConvexCompoundOverlapFinder<Sphere, SphereWide, Voxels>, ConvexVoxelsContinuations, NonconvexReduction>());
Simulation.NarrowPhase.CollisionTaskRegistry.Register(new ConvexCompoundCollisionTask<Capsule, Voxels, ConvexCompoundOverlapFinder<Capsule, CapsuleWide, Voxels>, ConvexVoxelsContinuations, NonconvexReduction>());
Simulation.NarrowPhase.CollisionTaskRegistry.Register(new ConvexCompoundCollisionTask<Box, Voxels, ConvexCompoundOverlapFinder<Box, BoxWide, Voxels>, ConvexVoxelsContinuations, NonconvexReduction>());
Simulation.NarrowPhase.CollisionTaskRegistry.Register(new ConvexCompoundCollisionTask<Triangle, Voxels, ConvexCompoundOverlapFinder<Triangle, TriangleWide, Voxels>, ConvexVoxelsContinuations, NonconvexReduction>());
Simulation.NarrowPhase.CollisionTaskRegistry.Register(new ConvexCompoundCollisionTask<Cylinder, Voxels, ConvexCompoundOverlapFinder<Cylinder, CylinderWide, Voxels>, ConvexVoxelsContinuations, NonconvexReduction>());
Simulation.NarrowPhase.CollisionTaskRegistry.Register(new ConvexCompoundCollisionTask<ConvexHull, Voxels, ConvexCompoundOverlapFinder<ConvexHull, ConvexHullWide, Voxels>, ConvexVoxelsContinuations, NonconvexReduction>());
Simulation.NarrowPhase.CollisionTaskRegistry.Register(new CompoundPairCollisionTask<Compound, Voxels, CompoundPairOverlapFinder<Compound, Voxels>, CompoundVoxelsContinuations<Compound>, NonconvexReduction>());
Simulation.NarrowPhase.CollisionTaskRegistry.Register(new CompoundPairCollisionTask<BigCompound, Voxels, CompoundPairOverlapFinder<BigCompound, Voxels>, CompoundVoxelsContinuations<BigCompound>, NonconvexReduction>());
//Note that this demo excludes mesh-voxels and voxels-voxels pairs. Those get a little more complicated since there's some gaps in the pre-built helpers.
//If you wanted to make your own, look into the various types related to meshes. They're a good starting point, although I'm not exactly happy with the complexity of the
//current design. They might receive some significant changes- keep that in mind if you create anything which depends heavily on their current implementation.
//To support sweep tests, we must also register sweep tasks. No extra work is required to support these; the interface implementation on the shape is good enough.
Simulation.NarrowPhase.SweepTaskRegistry.Register(new ConvexHomogeneousCompoundSweepTask<Sphere, SphereWide, Voxels, Box, BoxWide, ConvexCompoundSweepOverlapFinder<Sphere, Voxels>>());
Simulation.NarrowPhase.SweepTaskRegistry.Register(new ConvexHomogeneousCompoundSweepTask<Capsule, CapsuleWide, Voxels, Box, BoxWide, ConvexCompoundSweepOverlapFinder<Capsule, Voxels>>());
Simulation.NarrowPhase.SweepTaskRegistry.Register(new ConvexHomogeneousCompoundSweepTask<Box, BoxWide, Voxels, Box, BoxWide, ConvexCompoundSweepOverlapFinder<Box, Voxels>>());
Simulation.NarrowPhase.SweepTaskRegistry.Register(new ConvexHomogeneousCompoundSweepTask<Triangle, TriangleWide, Voxels, Box, BoxWide, ConvexCompoundSweepOverlapFinder<Triangle, Voxels>>());
Simulation.NarrowPhase.SweepTaskRegistry.Register(new ConvexHomogeneousCompoundSweepTask<Cylinder, CylinderWide, Voxels, Box, BoxWide, ConvexCompoundSweepOverlapFinder<Cylinder, Voxels>>());
Simulation.NarrowPhase.SweepTaskRegistry.Register(new ConvexHomogeneousCompoundSweepTask<ConvexHull, ConvexHullWide, Voxels, Box, BoxWide, ConvexCompoundSweepOverlapFinder<ConvexHull, Voxels>>());
Simulation.NarrowPhase.SweepTaskRegistry.Register(new CompoundHomogeneousCompoundSweepTask<Compound, Voxels, Box, BoxWide, CompoundPairSweepOverlapFinder<Compound, Voxels>>());
Simulation.NarrowPhase.SweepTaskRegistry.Register(new CompoundHomogeneousCompoundSweepTask<BigCompound, Voxels, Box, BoxWide, CompoundPairSweepOverlapFinder<BigCompound, Voxels>>());
//Supporting voxels-mesh and voxels-voxels would again require a bit more effort, though a bit less than the collision task equivalents would.
var widthInVoxels = 40;
var heightInVoxels = 30;
var voxelIndices = new QuickList<Vector3>(widthInVoxels * heightInVoxels * widthInVoxels, BufferPool);
for (int i = 0; i < widthInVoxels; ++i)
{
for (int j = 0; j < heightInVoxels; ++j)
{
for (int k = 0; k < widthInVoxels; ++k)
{
//Create some sine wave based noise for a slightly interesting environment.
var octave0 = MathF.Cos((i + 78) * 0.8f) + MathF.Cos((j + 37) * 0.8f) + MathF.Cos((k + 131) * 0.8f);
var octave1 = MathF.Cos((i + 59) * 0.4f) + MathF.Cos((j + 100) * 0.4f) + MathF.Cos((k + 131) * 0.4f);
var octave2 = MathF.Cos((i + 43) * 0.1f) + MathF.Cos((j + 200) * 0.1f) + MathF.Cos((k + 281) * 0.1f);
var octave3 = MathF.Cos((i + 647) * 0.025f) + MathF.Cos((j + 1553) * 0.025f) + MathF.Cos((k + 53) * 0.025f);
var density = octave0 + octave1 + octave2 + octave3;
if (density > 0)
voxelIndices.AllocateUnsafely() = new Vector3(i, j, k);
}
}
}
voxels = new Voxels(voxelIndices, new Vector3(1, 1, 1), BufferPool);
handle = Simulation.Statics.Add(new StaticDescription(new Vector3(0, 0, 0), new CollidableDescription(Simulation.Shapes.Add(voxels), 0.1f)));
var random = new Random(5);
var shapeToDrop = new Box(1, 1, 1);
shapeToDrop.ComputeInertia(1, out var shapeToDropInertia);
var descriptionToDrop = BodyDescription.CreateDynamic(new Vector3(), shapeToDropInertia, new CollidableDescription(Simulation.Shapes.Add(shapeToDrop), 0.1f), new BodyActivityDescription(0.01f));
for (int i = 0; i < 4096; ++i)
{
descriptionToDrop.Pose.Position = new Vector3(15 + 10 * (float)random.NextDouble(), 45 + 150 * (float)random.NextDouble(), 15 + 10 * (float)random.NextDouble());
Simulation.Bodies.Add(descriptionToDrop);
}
Simulation.Statics.Add(new StaticDescription(new Vector3(0, -0.5f, 0), new CollidableDescription(Simulation.Shapes.Add(new Box(300, 1, 300)), 0.1f)));
}
public override unsafe void Render(Renderer renderer, Camera camera, Input input, TextBuilder text, Font font)
{
//The renderer doesn't have a super flexible drawing system, so we'll instead just directly add the voxel shapes. Not super efficient, but it works!
var shape = new Box(voxels.VoxelSize.X, voxels.VoxelSize.Y, voxels.VoxelSize.Z);
var shapeDataPointer = &shape;
ref var voxelsPose = ref Simulation.Statics.Poses[Simulation.Statics.HandleToIndex[handle.Value]];
for (int i = 0; i < voxels.ChildCount; ++i)
{
var localPose = new RigidPose((voxels.VoxelIndices[i] + new Vector3(0.5f)) * voxels.VoxelSize);
Compound.GetRotatedChildPose(localPose, voxelsPose.Orientation, out var childPose);
childPose.Position += voxelsPose.Position;
renderer.Shapes.AddShape(shapeDataPointer, Box.Id, Simulation.Shapes, ref childPose, new Vector3(0.8f, 0.2f, 0.2f));
}
base.Render(renderer, camera, input, text, font);
}
}
}
You can’t perform that action at this time.