67 search results - page 7 / 14 » Approximate convex decomposition of polygons |
160
click to vote
CDC
2008
IEEE
16 years 5 days ago
2008
IEEE
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
147
click to vote
SSDBM
2000
IEEE
15 years 10 months ago
2000
IEEE
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
157
click to vote
ICRA
2008
IEEE
16 years 4 days ago
2008
IEEE
— This paper discusses the grasp planning of a multifingered hand attached at the tip of a robotic arm. By using the convex models and the new approximation method of the fricti...
138
click to vote
ICCSA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
174
click to vote
TSMC
2008
15 years 5 months ago
2008
In this paper, we propose a geometric approach to the theory of evidence based on convex geometric interpretations of its two key notions of belief function (b.f.) and Dempster...