Hi Michael,

> Ok, but how do you want me to implement the "nearest neighbor GeomObject method" without running into these very same issues?

Since I don’t know much of anything about the data structures that hold the model in memory, I only have an approximate idea of how one might implement a nearest neighbor method. I infer from your question though that you'd approach it in a way similar to the intersection of the line and other objects. The image I had was of the vector acting like a sort of laser "probe" which would only illuminate the object being intersected: an intersect with a priority. In other words, the vector in the intersect operation acts to select the objects rather than the intersect returning all intersections across all objects within the set. The distance component of the vector would further limit the set of objects. The method would ultimately return the object closest to the vector's origin.

The "cut closest to the curve" part of your idea might be along similar lines.

--Larry