Skip to content

Commit 102779d

Browse files
committed
Update getting_started.rst
1 parent fb4cf67 commit 102779d

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

docs/source/tutorial/getting_started.rst

+3-3
Original file line numberDiff line numberDiff line change
@@ -60,7 +60,7 @@ The sizes of ``edges`` and ``faces`` are ``#E x 2`` and ``#F x 3`` respectively
6060
Collisions
6161
----------
6262

63-
Now that we have a collision mesh, we can compute the collision barrier potential. To do this we first need to build the set of active collisions (``Collisions``).
63+
Now that we have a collision mesh, we can compute the collision barrier potential. To do this we first need to build the set of active collisions (``NormalCollisions``).
6464

6565
To start we need the current positions of the ``vertices``. For this tutorial, let us use squash the bunny has to 1% of its original height.
6666

@@ -92,7 +92,7 @@ We will use a value of :math:`\hat{d} = 10^{-3}`.
9292

9393
const double dhat = 1e-3;
9494

95-
ipc::Collisions collisions;
95+
ipc::NormalCollisions collisions;
9696
collisions.build(collision_mesh, vertices, dhat);
9797

9898
.. md-tab-item:: Python
@@ -101,7 +101,7 @@ We will use a value of :math:`\hat{d} = 10^{-3}`.
101101
102102
dhat = 1e-3
103103
104-
collisions = ipctk.Collisions()
104+
collisions = ipctk.NormalCollisions()
105105
collisions.build(collision_mesh, vertices, dhat)
106106
107107
This will automatically use a spatial data structure to perform a broad-phase culling and then perform a narrow-phase culling by computing distances (discarding any collision candidates with a distance :math:`> \hat{d}`).

0 commit comments

Comments
 (0)