Aesthetic Characteristics

Author(s):  
Zhirong Zhu
2020 ◽  
Vol 2020 (2) ◽  
pp. 243-248
Author(s):  
Posatskyi B. ◽  
◽  
Mazur T. ◽  
Korol E. ◽  
◽  
...  

The article substantiates the relevance and considered methodological approaches to the architectural and landscape organization of road space as a set of measures aimed at improving its visual and aesthetic characteristics


Author(s):  
Anette Stenslund

In recent decades, research has paid attention to the atmospheric ways computer-generated imagery (CGI) marks the experience of future urban design. What has been addressed in the generic abbreviation CGI has, however, exclusively concerned visualisations that communicate with stakeholders beyond designers and architects. Based on fieldwork within an urban design lab, the paper differentiates among the range of CGI used by urban designers. Focusing on collage, which forms one kind of CGI that has received scant attention in scholarly literature, I demonstrate its key function as an epistemological in-house work-in-progress tool that helps designers to refine their vision and to identify the atmosphere of future urban spaces. Based on New Aesthetics, collaging atmosphere is characterised by a physiognomic approach to urban space that selectively addresses aesthetic characteristics. Hence, the paper tackles a discussion that points towards cautious handling of the communicative scope of collages that can be well complemented by other types of CGI before entering a constructive dialogue with clients.


Author(s):  
Martín A. Pucheta ◽  
Nicolás E. Ulrich ◽  
Alberto Cardona

The graph layout problem arises frequently in the conceptual stage of mechanism design, specially in the enumeration process where a large number of topological solutions must be analyzed. Two main objectives of graph layout are the avoidance or minimization of edge crossings and the aesthetics. Edge crossings cannot be always avoided by force-directed algorithms since they reach a minimum of the energy in dependence with the initial position of the vertices, often randomly generated. Combinatorial algorithms based on the properties of the graph representation of the kinematic chain can be used to find an adequate initial position of the vertices with minimal edge crossings. To select an initial layout, the minimal independent loops of the graph can be drawn as circles followed by arcs, in all forms. The computational cost of this algorithm grows as factorial with the number of independent loops. This paper presents a combination of two algorithms: a combinatorial algorithm followed by a force-directed algorithm based on spring repulsion and electrical attraction, including a new concept of vertex-to-edge repulsion to improve aesthetics and minimize crossings. Atlases of graphs of complex kinematic chains are used to validate the results. The layouts obtained have good quality in terms of minimization of edge crossings and maximization of aesthetic characteristics.


Sign in / Sign up

Export Citation Format

Share Document