52 search results - page 10 / 11 » Decomposing a simple polygon into pseudo-triangles and conve... |
SIROCCO
2001
13 years 9 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
—Target shape matching can be used as a quick and easy surrogate task when evaluating optimization algorithms intended for computationally expensive tasks, such as turbine blade ...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— The vibratory bowl feeder remains the most common approach to the automated feeding (orienting) of industrial parts. We study the algorithmic design of devices on the b...
DCG
2006
13 years 7 months ago
2006
Abstract. Hyperbolic area is characterized as the unique continuous isometry invariant simple valuation on convex polygons in H2 . We then show that continuous isometry invariant s...
CA
1998
IEEE
13 years 11 months ago
1998
IEEE
We present a new approach for establishing correspondence between two homeomorphic 3D polyhedral models. The user can specify corresponding feature pairs on the polyhedra with a s...