1387 search results - page 14 / 278 » Convexity in Discrete Space |
114
click to vote
ICRA
2007
IEEE
15 years 8 months ago
2007
IEEE
— We introduce a method for constructing provably safe smooth feedback laws for car-like robots in obstaclecluttered polygonal environments. The robot is taken to be a point with...
113
click to vote
ICRA
2002
IEEE
15 years 6 months ago
2002
IEEE
We present a new algorithm that enables a convex shaped robot to explore an unknown planar workspace, i.e., an unknown configuration space diffeomorphic to SE(2). This new algor...
ICPR
2008
IEEE
16 years 2 months ago
2008
IEEE
We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in d...
124
click to vote
IMR
2003
Springer
15 years 7 months ago
2003
Springer
In this paper we tackle the problem of tetrahedralization by breaking non-convex polyhedra into convex subpolyhedra, tetrahedralizing these convex subpolyhedra and merging them to...
102
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...