256 search results - page 13 / 52 » Short trees in polygons |
VVS
1998
IEEE
14 years 26 days ago
1998
IEEE
In this paper, we describe a technique to animate volumes using a volumetric skeleton. The skeleton is computed from the actual volume, based on a reversible thinning procedure us...
FOCS
1991
IEEE
14 years 4 days ago
1991
IEEE
A polygon with two distinguished vertices, s and g, is called a street iff the two boundary chains from s to g are mutually weakly visible. For a mobile robot with on-board vision...
COMPGEOM
2005
ACM
13 years 10 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...
WSCG
2003
13 years 10 months ago
2003
Real-time rendering of vegetation is one of the most important challenges in outdoor scenes. This is due to the vast amount of polygons that are used to model vegetable species. M...
ISVLSI
2005
IEEE
14 years 2 months ago
2005
IEEE
Mesh interconnect can be efficiently utilized while tree networks encourage the short routing distances. In this paper, we present the property analysis of a cluster-based interc...