Skip to content

Commit d430f82

Browse files
authored
Update README.md
1 parent dcd21d1 commit d430f82

File tree

1 file changed

+4
-4
lines changed

1 file changed

+4
-4
lines changed

README.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
# TriangleMeshDistance
22
Header only, single file, simple and efficient C++11 library to compute the signed distance function to a triangle mesh.
33

4-
The distance computation to the triangle collection is accelerated with a sphere bounding volume hierarchy. The signed of the distance is resolved with the method presented in *"Generating Signed Distance Fields From Triangle Meshes"* by Bærentzen, Andreas & Aanæs, Henrik. (2002).
4+
The distance computation to the triangle collection is accelerated with a sphere bounding volume hierarchy. The sign of the distance is resolved with the method presented in *"Generating Signed Distance Fields From Triangle Meshes"* by Bærentzen, Andreas & Aanæs, Henrik. (2002).
55

66
## Example
77
```cpp
@@ -27,6 +27,6 @@ std::cout << "Nearest triangle index: " << result.triangle_id << std::endl;
2727
2828
2929
## What you need to know about TriangleMeshDistance
30-
- `TriangleMeshDistance` keeps a copy of the vertex and triangle data passed as input.
31-
- Additionally, the pseudonormals required to compute signed distances are calculated and stored at building time.
32-
- `TriangleMeshDistance` can be declared empty and constructed multiple times with different meshes. This can potentially reuse memory allocations.
30+
- `TriangleMeshDistance` keeps a copy of the vertex and triangle data.
31+
- The pseudonormals required to compute signed distances are calculated and stored at building time.
32+
- `TriangleMeshDistance` can be declared empty and constructed multiple times with different meshes. If the new mesh needs less memory than the curent one, memory allocations will be avoided.

0 commit comments

Comments
 (0)