83 search results - page 5 / 17 » Acute Triangulations of Polygons |
SIROCCO
2001
13 years 9 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...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...
AAAI
2007
13 years 10 months ago
2007
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
MOC
2000
13 years 7 months ago
2000
Abstract. We study the convergence properties of the cascadic conjugategradient method (CCG-method), which can be considered as a multilevel method without coarse-grid correction. ...
COMGEO
2002
ACM
13 years 7 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...