diff --git a/examples/models/models_loading.c b/examples/models/models_loading.c
index 4bce2a79..d2ee1814 100644
--- a/examples/models/models_loading.c
+++ b/examples/models/models_loading.c
@@ -25,6 +25,127 @@
 ********************************************************************************************/
 
 #include "raylib.h"
+float sqr(float a) {return a*a;}
+Vector3 GetClosestPoint(Mesh *mesh, Vector3 const queryPoint, float maxDist)
+{
+  Vector3 return_value = { 0.f, 0.f, 0.f };
+
+  float smallestDist = -1;
+#if 0 // 1st version : check each points
+  for (int i = 0; i < mesh->vertexCount; ++i)
+  {
+    float dist = sqr(mesh->vertices[i * 3] - queryPoint.x)
+      + sqr(mesh->vertices[i * 3 + 1] - queryPoint.y)
+      + sqr(mesh->vertices[i * 3 + 2] - queryPoint.z);
+
+    if (smallestDist < 0
+	|| dist < smallestDist)
+    {
+      smallestDist = dist;
+      return_value.x = mesh->vertices[i * 3];
+      return_value.y = mesh->vertices[i * 3 + 1];
+      return_value.z = mesh->vertices[i * 3 + 2];
+    }
+  }
+#elif 0 // 2nd version: check the _triangles_ (but wrong)
+  for (int i = 0; i < mesh->triangleCount; ++i)
+  {
+    Vector3 v1 = { mesh->vertices[i * 9], mesh->vertices[i * 9 + 1], mesh->vertices[i * 9 + 2] };
+    Vector3 v2 = { mesh->vertices[(i * 3 + 1) * 3], mesh->vertices[(i * 3 + 1) * 3 + 1], mesh->vertices[(i * 3 + 1) * 3 + 2] };
+    Vector3 v3 = { mesh->vertices[(i * 3 + 2) * 3], mesh->vertices[(i * 3 + 2) * 3 + 1], mesh->vertices[(i * 3 + 2) * 3 + 2] };
+
+    Vector3 localQueryPoint = { queryPoint.x - v1.x, queryPoint.y - v1.y, queryPoint.z - v1.z };
+    Vector3 v2_v1 = { v2.x - v1.x, v2.y - v1.y, v2.z - v1.z };
+    float qpOnV2 = localQueryPoint.x * v2_v1.x + localQueryPoint.y * v2_v1.y + localQueryPoint.z * v2_v1.z;
+    Vector3 v3_v1 = { v3.x - v1.x, v3.y - v1.y, v3.z - v1.z };
+    float qpOnV3 = localQueryPoint.x * v3_v1.x + localQueryPoint.y * v3_v1.y + localQueryPoint.z * v3_v1.z;
+
+    int onIt = qpOnV2 < ( 1.f - qpOnV3 )
+      && (qpOnV3 > 0) && (qpOnV3 < 1) && (qpOnV2 > 0) && (qpOnV2 < 1);
+    float dist;
+    if (onIt)
+    {
+      // Vector3 cross_v1_v2 = { v2_v1.x * v3_v1.y, v2_v1.y * v3_v1.z, v2_v1.z * v2_v1.x };
+      Vector3 localV2 = { v2_v1.x * qpOnV2, v2_v1.y * qpOnV2, v2_v1.z * qpOnV2 };
+      Vector3 localV3 = { v3_v1.x * qpOnV3, v2_v1.y * qpOnV3, v2_v1.z * qpOnV3 };
+
+      Vector3 projected =
+      {
+	localV2.x + localV3.x + v1.x,
+	localV2.y + localV3.y + v1.y,
+	localV2.z + localV3.z + v1.z
+      };
+
+      dist = sqr(projected.x - queryPoint.x)
+	+ sqr(projected.y - queryPoint.y)
+	+ sqr(projected.z - queryPoint.z);
+
+      if (smallestDist < 0
+	  || dist < smallestDist)
+      {
+	smallestDist = dist;
+	return_value = projected;
+      }
+    } else { // It's one of the three:
+      for(int j = 0; j < 3; ++j)
+      {
+	Vector3 v = { mesh->vertices[(i * 3 + j) * 3], mesh->vertices[(i * 3 + j) * 3 + 1], mesh->vertices[(i * 3 + j) * 3 + 2] };
+	
+	dist = sqr(v.x - queryPoint.x)
+	  + sqr(v.y - queryPoint.y)
+	  + sqr(v.z - queryPoint.z);
+	if (smallestDist < 0
+	    || dist < smallestDist)
+	{
+	  smallestDist = dist;
+	  return_value = v;
+	}	
+      }
+    }
+  }
+#else // check each segment of a triangle // Still wrong: the correct answer is a mix of the two, however this should work
+      // along edges and it doesn't.
+      // I think my maths are wrong and I should normalize the triangle edges.
+  for (int i = 0; i < mesh->triangleCount; ++i)
+  {
+    for(int j = 0; j < 3; ++j)
+    {
+      Vector3 v1 = { mesh->vertices[(i * 3 + j) * 3], mesh->vertices[(i * 3 + j) * 3 + 1], mesh->vertices[(i * 3 + j) * 3 + 2] };
+      Vector3 v2 = {
+	mesh->vertices[(i * 3 + (j + 1) % 3) * 3],
+	mesh->vertices[(i * 3 + (j + 1) % 3) * 3 + 1],
+	mesh->vertices[(i * 3 + (j + 1) % 3) * 3 + 2] };
+      Vector3 v2_v1 = { v2.x - v1.x, v2.y - v1.y, v2.z - v1.z };
+      Vector3 localQueryPoint = { queryPoint.x - v1.x, queryPoint.y - v1.y, queryPoint.z - v1.z };
+      float qpOnV2 = localQueryPoint.x * v2_v1.x + localQueryPoint.y * v2_v1.y + localQueryPoint.z * v2_v1.z;
+
+      if (qpOnV2 < 0)
+	qpOnV2 = 0.;
+      if (qpOnV2 > 1)
+	qpOnV2 = 1.;
+
+      Vector3 localV2 = { v2_v1.x * qpOnV2, v2_v1.y * qpOnV2, v2_v1.z * qpOnV2 };
+      Vector3 projected = {
+	localV2.x + v1.x,
+	localV2.y + v1.y,
+	localV2.z + v1.z
+      };
+
+      float dist = sqr(projected.x - queryPoint.x)
+	+ sqr(projected.y - queryPoint.y)
+	+ sqr(projected.z - queryPoint.z);
+	
+      if (smallestDist < 0
+	  || dist < smallestDist)
+      {
+	smallestDist = dist;
+	return_value = projected;
+      }
+    }
+  }
+#endif
+  return return_value;
+}
 
 //------------------------------------------------------------------------------------
 // Program main entry point
@@ -123,7 +244,13 @@ int main(void)
             BeginMode3D(camera);
 
                 DrawModel(model, position, 1.0f, WHITE);        // Draw 3d model with texture
+		// It's fine to ignore the transform of the model it's always at 0,0 in this example.
 
+		Vector3 closestPoint = GetClosestPoint(&model.meshes[0], camera.position, 10.);
+		Vector3 closestPointUp = { closestPoint.x, closestPoint.y + 10.f, closestPoint.z };
+		
+		DrawLine3D(closestPoint, closestPointUp, GREEN);
+		
                 DrawGrid(20, 10.0f);         // Draw a grid
 
                 if (selected) DrawBoundingBox(bounds, GREEN);   // Draw selection box
@@ -150,4 +277,4 @@ int main(void)
     //--------------------------------------------------------------------------------------
 
     return 0;
-}
\ No newline at end of file
+}