219 search results - page 26 / 44 » Drawing with Fat Edges |
COMBINATORICS
2006
13 years 7 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
GD
2006
Springer
13 years 11 months ago
2006
Springer
The crossing number cr(G) of a graph G is the minimum number of crossings over all drawings of G in the plane. In 1993, Richter and Thomassen [RT93] conjectured that there is a co...
BMCBI
2010
13 years 7 months ago
2010
Background: The aim of this study was to provide a framework for the analysis of visceral obesity and its determinants in women, where complex inter-relationships are observed amo...
NPAR
2006
ACM
14 years 1 months ago
2006
ACM
ROJECTPROJECT ABSTRACTABSTRACTABSTRACT After achieving real-time photorealistic rendering, the computer graphics community is beginning to turn its attention to non-photorealistic ...
NPAR
2000
ACM
13 years 12 months ago
2000
ACM
We present a new algorithm for rendering silhouette outlines of 3D polygonal meshes with stylized strokes. Rather than use silhouette edges of the model directly as the basis for ...