192 search results - page 1 / 39 » Cut Points in PEG |
ICRA
2010
IEEE
13 years 3 months ago
2010
IEEE
This paper presents a probing-based method for probabilistic localization in automated robotic assembly. We consider peg-in-hole problems in which a needle-like peg has a single p...
CGI
2001
IEEE
13 years 8 months ago
2001
IEEE
30 digitization devices produce very large sets of 3 0 points sampled from the suqaces of the objects being scanned. A mesh construction procedure needs to be:upplied to derive po...
EOR
2010
13 years 2 months ago
2010
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
SIAMJO
2000
13 years 4 months ago
2000
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...