Learn More
In this paper, we study the weak point matching problem for a given set of n points and a class of equilateral triangles. The problem is to find the maximum car-dinality matching of the points using equilateral triangles such that each triangle contains exactly two points and each point lies at most in one triangle. Under the non-degeneracy assumption, we(More)
—Mobile users often connect through WiFi access points and frequently find themselves behind NATs that are built into common off-the-shelf home access points or enterprise wireless deployments. Punching a hole through the NATs to establish a P2P connection can be a challenging task for lay users. We present our system, ANT, that utilizes Audio signaling for(More)
The shape and center of mass of a part are crucial parameters to algorithms for planning automated manufacturing tasks. As industrial parts are generally manufactured to tolerances, the shape is subject to variations, which, in turn, also cause variations in the location of the center of mass. Planning algorithms should take into account both types of(More)
— Metrology, the theoretical and practical study of measurement, has applications in automated manufacturing, inspection, robotics, surveying, and healthcare. An important problem within metrology is how to interactively use a measuring device, or probe, to determine some geometric property of an unknown object; this problem is known as geometric probing.(More)
Industrial parts are manufactured to tolerances as no production process is capable of delivering perfectly identical parts. It is unacceptable that a plan for a manipulation task that was determined on the basis of a CAD model of a part fails on some manufactured instance of that part, and therefore it is crucial that the admitted shape variations are(More)
Let A = {a 1 } be the capacities of points in A and B. We define minimum limited capacity matching and call it MLC-matching that matches each point a i ∈ A to at least one and at most α i points in B and matches each b j ∈ B to at least one and at most β j points in A, for all i,j where 1 ≤ i ≤ s , 1 ≤ j ≤ r, such that sum of all the matching costs is(More)