947 search results - page 69 / 190 » Discrete Geometry |
COMPGEOM
1991
ACM
15 years 1 months ago
1991
ACM
We describe methods for triangulating polygonal regions of the plane so that no triangle has a large angle. Our main result is that a polygon with n sides can be triangulated with...
COMPGEOM
1991
ACM
15 years 1 months ago
1991
ACM
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
DGCI
2009
Springer
15 years 1 months ago
2009
Springer
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
CJCDGCGT
2005
Springer
14 years 11 months ago
2005
Springer
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
We consider the existence and efficient construction of bounded curvature paths traversing constant-width regions of the plane, called corridors. We make explicit a width threshol...