346 search results - page 11 / 70 » Isodiametric Problems for Polygons |
CCCG
2007
13 years 8 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
COMPGEOM
2004
ACM
14 years 24 days ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
CW
2003
IEEE
14 years 20 days ago
2003
IEEE
This paper presents work in progress and continues a project devoted to developing shape modeling system based on implementation of radial based function (RBF) technology. In this...
ICRA
2002
IEEE
14 years 9 days ago
2002
IEEE
In this paper we present an approach to obstacle avoidance and local path planning for polygonal robots. It decomposes the task into a model stage and a planning stage. The model ...
COMPGEOM
2004
ACM
14 years 24 days ago
2004
ACM
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...