triangulation

I'm looking for a library or a paper that describes how to determine if one triangular mesh intersects another. Interestingly I am coming up empty. If there is some way to do it in CGAL, it is eluding me. It seems like it clearly should be possible, because triangle intersection is possible and because each mesh contains a finite number of triangles. But I assume there must be a better way to do it than the obvious O(n*m) approach where one mesh has n triangles and the other has m triangles. The way we usually do it using CGAL is with CGAL::box_intersection_d . You can make it by mixing this

I want to find the coordinate of an unknown node which lie somewhere in the space which has its reference distance away from 3 or more nodes which all of them have known coordinate. This problem is exactly like Trilateration as described here Trilateration . However, I don't understand the part about "Preliminary and final computations" (refer to the wikipedia site). I don't get where I could find P1, P2 and P3 just so I can put to those equation? Thanks Trilateration is the process of finding the center of the area of intersection of three spheres. The center point and radius of each of the

What would be the best way to triangulate a wireless network passively. Are there tools available? Algorithms? Libraries? My goal would be to create a relative map of various objects that sends or receive signals using signal strength (DB's), signal/noise ratio, signal phase, etc. from a few location points. With enough sampling, i'm guessing it would be possible to create a good 2d/3d map. I'm searching for stuff in any language / platform. Some keywords: wi-fi site survey, visualization, coverage, location, positioning Thinking about using kismet to gather the data and then process it. Maybe

I need to understand how Wifi triangulation basically works. The scene is as portrayed in above diagram. Inorder to implement wifi triangulation, I need a minimum of 3 Wifi hotspots and their positions. The setup: 1. For simplicity, let's assume I have a 1 sq-Km by 1 sq-Km area, and I have 3 Wifi hotspots in this area. The coordinate system is as follows: 1 corner of the square area is (0,0,0), and the diagonally furthest corner will have coordinates (1,1,1). All position determination is to be done relative to this coordinate system alone (for simplicity, I don't want global xyz coordinates).

I'm trying to implement one of active appearance models (AMM) and on one of the steps I need to get triangulated mesh of a face , e.g.: Delaunay triangulation seems to be a good fit for this task (correct me if there are better options), and OpenCV has C API for it . But is there C++ API for Delaunay triangulation? Of course if is not a big deal to write a wrapper for C version if there's really no C++ API, but it's possible that's just lack of my knowledge of API, and not the API itself. In this case I will definitely prefer native OpenCV implementation. Andrey Kamaev OpenCV has C++ API for