4074 search results - page 48 / 815 » Defining Computational Aesthetics |
GD
2000
Springer
13 years 11 months ago
2000
Springer
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graph...
GD
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We introduce the concept of subdivision drawings of hypergraphs. In a subdivision drawing each vertex corresponds uniquely to a face of a planar subdivision and, for each...
CGF
2010
13 years 7 months ago
2010
We study the combined problem of approximating a surface by a quad mesh (or quad-dominant mesh) which on the one hand has planar faces, and which on the other hand is aestheticall...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
: User’s perception of product, by essence subjective, is a major topic in marketing and industrial design. Many methods, based on users’ tests, are used so as to characterise ...
JGAA
2000
13 years 7 months ago
2000
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...