12 search results - page 2 / 3 » Watchman route in a simple polygon with a rubberband algorit... |
IVC
2007
13 years 6 months ago
2007
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
DGCI
2005
Springer
13 years 11 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
ICRA
2005
IEEE
13 years 11 months ago
2005
IEEE
— We describe VIsolate (Voronoi Isolate), a system which performs geometric computations associated with toolpath planning for mechanical etch (also called isolation routing) of ...
ICCSA
2004
Springer
13 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...
SIROCCO
2001
13 years 7 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...