Steven S. Skiena. Problems in geometric probing. Algorithmica, 4(4):599--605, 1989.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....queries to learn this class using O(log n) equivalence queries. Their algorithm returns a hypothesis consisting of a description of the vertices and edges of the polygon. Computational geometry researchers have looked at the slightly related problem of geometric probing (for example see [35]) Geometric probing studies how to identify, verify or determine some property of an unknown geometrical object using a measuring device known as a probe. In one special case of geometric probing the aim is to construct (or learn) an unknown convex polygon given a point inside the polygon along ....

S. Skiena. Problems in geometric probing. Algorithmica, 4:599--605, 1989.

....probe entails choosing an angle , then determining the oriented supporting line ( for the object. Generally, the sensor returns the location of the line in space, but not the location of the contact point of the object on the line. For a survey of algorithmic probing problems and results see [Skiena 1989]. Both finger and line probes constitute types of active tactile sensing. In each case, a robot actively moves a finger or palm around an object, touching it at various locations. Lindenbaum and Bruckstein 1992] use parallel line probes and parallel finger probes to reconstruct convex polygons; ....

Skiena, S. S. 1989. Problems in Geometric Probing.

....studied recently by computational geometers. The early work was in the area of finger probes where an object is identified by shooting a ray from infinity until it contacts the object s boundary [4, 5] The probing paradigm was generalized by Skiena and others to include other classes of probes [6, 16, 17, 18]. We consider another version of the probing paradigm that seems to be relevant to computer vision. We assume that a single polygonal object P , called the target, has been translated to an unknown position within a bounding rectangular region, called the image. We assume that there is a local ....

S. S. Skiena. Problems in geometric probing. Algorithmica, 4:599--605, 1989.

....by many algorithms but are often unavailable. Geometric probing can be used to generate such models. Probing hardware includes touch probes, light beams, scanline and raster cameras. Depending on the application and sensor, the probing strategy may compute convex hull, line hull or ray hull. See [134] for a review. More work is needed on online probing strategies that include models of probe and control uncertainty. The problem of probing to minimize error turns out to be dual to grasping, so the algorithms mentioned there are directly relevant. 5. Part Orienting: Algorithmic approaches to ....

Skiena, S.S. Problems in geometric probing, Algorithmica 4 (1989), 599--605.

....studied recently by computational geometers. The early work was in the area of finger probes where an object is identified by shooting a ray from infinity until it contacts the object s boundary [4, 5] The probing paradigm was generalized by Skiena and others to include other classes of probes [6, 14, 15, 16]. We consider another version of the probing paradigm that seems to be relevant to computer vision. We assume that a single polygonal object P , called the target , has been translated to an unknown position within a bounding rectangular region, called the image. We assume that there is a local ....

S. S. Skiena. Problems in geometric probing. Algorithmica, 4:599--605, 1989.

....the concept of geometric probing [9] Under the Cole Yap model of probing, 4 Belleville [2] proves that the problem of determining whether K probes are sufficient to identify a polygon from among a set is NP hard. A complete description of results on geometric probing appear in [29] Skiena [30] provides a summary of the basic results and open problems in this area. However, some of the basic assumptions common in geometric probing are quite unrealistic in practice. Some examples of such assumptions are that the part is not disturbed by the probes, the probes are accurate (travel in ....

S. S. Skiena. Problems in geometric probing. Algorithmica, pages 599--605, 1989.

....solve the problem of learning DNF. Observe that the class considered by Frazier et al. is a generalization of the class of DNF formulas in which all variables only appear negated. Computational geometry researchers have looked at the slightly related problem of geometric probing (for example see [32]) Here one aims to construct (or learn) an unknown convex polygon given a point inside the polygon along with the ability to make a probe in which the algorithm can shoot a ray in a specified direction to find out the location where the ray hits the polygon. Note that using a binary search ....

S. Skiena. Problems in geometric probing. Algorithmica, 4:599--605, 1989.

No context found.

StevenS.Skiena, "Problems in Geometric Probing," Algorithmica 4 pp. 599-605 (1989).

No context found.

Steven S. Skiena. Problems in geometric probing. Algorithmica, 4(4):599--605, 1989.

No context found.

#34. Steven S. Skiena #1989# Problems in geometric probing, Algorithmica

No context found.

Steven S. Skiena [1989] Problems in geometric probing, Algorithmica 4, 599--605.

No context found.

Skiena, S. S. 1989. Problems in Geometric Probing. Algorithmica. 4(4):599--605.

No context found.

S. S. Skiena, "Problems in Geometric Probing", Algorithmica, No. 4, 1989, pp. 599-605.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC