71 search results - page 11 / 15 » Touring a sequence of polygons |
JAC
2008
13 years 9 months ago
2008
There are several systems consisting in an object that moves on the plane by following a given rule. It is frequently observed that these systems eventually fall into an unexplaine...
VCIP
2003
13 years 8 months ago
2003
This paper presents an approach to capture visual appearance of a real environment such as an interior of a room. We propose the method for generating arbitrary viewpoint images b...
JAIR
1998
13 years 7 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...
CDC
2008
IEEE
14 years 1 months 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...