Hasil untuk "Drawing. Design. Illustration"

Stefano Chiarenza, Marta Salvatore

The coherence of built architecture often depends on a latent structural design whose essential role can govern architectural outcomes even when not overtly visible. Structural logic is either integrated into the building as a whole or concealed behind finished surfaces. However, this concealed structure often defines space and regulates formal relationships. Instead of viewing structure and form as opposites or as directly corresponding, it is more accurate to understand them as mutually influential, their relationship shaped by specific design choices. Every construction act creates an order, and every form manifests through its underlying structure, highlighting an ongoing interplay between these elements. [read more]

Andrea Siervo

En tiempos donde lo digital impregna cada aspecto de nuestra vida y donde la velocidad parece regir nuestra relación con el mundo, mi práctica artística apuesta por la pausa, la repetición y el contacto directo con el material. Es una investigación sobre lo siempre cambiante, donde la estabilidad y fluidez coexisten. Esta inclinación no nace de un rechazo a lo digital, sino de una profunda necesidad de equilibrio.

Simon van Wageningen, Tamara Mchedlidze, Alexandru C. Telea

Graph drawings are commonly used to visualize relational data. User understanding and performance are linked to the quality of such drawings, which is measured by quality metrics. The tacit knowledge in the graph drawing community about these quality metrics is that they are not always able to accurately capture the quality of graph drawings. In particular, such metrics may rate drawings with very poor quality as very good. In this work we make this tacit knowledge explicit by showing that we can modify existing graph drawings into arbitrary target shapes while keeping one or more quality metrics almost identical. This supports the claim that more advanced quality metrics are needed to capture the 'goodness' of a graph drawing and that we cannot confidently rely on the value of a single (or several) certain quality metrics.

Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson

We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an $n$-vertex planar graph and two planar straight-line drawings of the graph on an $O(n) \times O(n)$ grid. The planarity-preserving morph is composed of $O(n)$ linear morphs between successive pairs of drawings, each on an $O(n) \times O(n)$ grid with a constant number of bends per edge. The algorithm to compute the morph runs in $O(n^2)$ time on a word RAM model with standard arithmetic operations -- in particular no square roots or cube roots are required. The first step of the algorithm is to morph each input drawing to a planar orthogonal box drawing where vertices are represented by boxes and each edge is drawn as a horizontal or vertical segment. The second step is to morph between planar orthogonal box drawings. This is done by extending known techniques for morphing planar orthogonal drawings with point vertices.

Renato Bermúdez Dini, Edwin Culp-Morando

La disputa por las imágenes y la imaginación es uno de los terrenos más vitales en los que se juegan las prácticas de la resistencia política en la actualidad. Los violentos escenarios de precarización y extractivismo de la vida empobrecen la experiencia y dificultan su recuento y visibilización. Las imágenes parecen condenadas a estar al servicio del espectáculo mediático, a mostrar la victimización o a inundar el espacio visual de evidencias inconsecuentes. Sin embargo, lejos de renunciar a las imágenes por su superficialidad, las prácticas críticas pueden dar cuenta de ellas a través de las tensiones de sus superficies: de las apariencias y el aparecer, de la desaparición, de la conformación de evidencias, de la afectación, de la resonancia, de la fricción. El problema no es tanto que sobren imágenes, sino más bien que se ha debilitado la capacidad de imaginar (Bottici, 2018).

Carla Binucci, Aaron Büngener, Giuseppe Di Battista et al.

The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing. One of the most studied types of drawings in this area are the $k$-planar drawings $(k \geq 1)$, where each edge cannot cross more than $k$ times. We generalize $k$-planar drawings, by introducing the new family of min-$k$-planar drawings. In a min-$k$-planar drawing edges can cross an arbitrary number of times, but for any two crossing edges, one of the two must have no more than $k$ crossings. We prove a general upper bound on the number of edges of min-$k$-planar drawings, a finer upper bound for $k=3$, and tight upper bounds for $k=1,2$. Also, we study the inclusion relations between min-$k$-planar graphs (i.e., graphs admitting min-$k$-planar drawings) and $k$-planar graphs. In our setting we only allow simple drawings, that is, any two edges cross at most once, no two adjacent edges cross, and no three edges intersect at a common crossing point.

Janne Mascha Beuthel

Design researchers and practitioners continuously engage with humans in their work, which can translate into encountering personal stories, challenging questions, and facing expectations. The researcher can be torn between remaining ‘professional’, which is often connoted to being ‘neutral’, and engaging their own emotions, vulnerabilities, and insecurities. This paper presents a soma design process that was informed by the autobiographical experiences of the author. The result is a wearable artifact named ‘The Armor of a Researcher’. The artifact embodies somatic experiences of ‘doing research’ and ‘being a researcher’ during qualitative studies with participants. It is intended to be thought-provoking and points towards reflections on professionalism. Physical materials are assembled into a wearable form, which allows others to engage with them through their own bodies. Finally, themes that The Armor has evoked in others are described; these outline knowledge that the artifact puts forth to HCI.

Raphaël Baroni, Bahar Aydemir

The aim of this study is to broaden the field of investigation of empirical research on the reading of comics by including aspects related to narrative rhythm and non-linear paths, while associating them with a narrative genre, in this case, the Franco-Belgian humorous comic strip. On the basis of this corpus, on one hand we are interested in the retrograde reading operations induced by visual gags in one page, and on the other hand, we investigate the impact of sequences that we call “chronophotographic”, the latter having received little attention until our study.

Carlos Alegria, Giordano Da Lozzo, Giuseppe Di Battista et al.

A rectangular drawing of a planar graph $G$ is a planar drawing of $G$ in which vertices are mapped to grid points, edges are mapped to horizontal and vertical straight-line segments, and faces are drawn as rectangles. Sometimes this latter constraint is relaxed for the outer face. In this paper, we study rectangular drawings in which the edges have unit length. We show a complexity dichotomy for the problem of deciding the existence of a unit-length rectangular drawing, depending on whether the outer face must also be drawn as a rectangle or not. Specifically, we prove that the problem is NP-complete for biconnected graphs when the drawing of the outer face is not required to be a rectangle, even if the sought drawing must respect a given planar embedding, whereas it is polynomial-time solvable, both in the fixed and the variable embedding settings, if the outer face is required to be drawn as a rectangle.

Fernando Domínguez

Historia y Memoria en piedra y bronce. El Monumento a la Bandera en la ciudad de Rosario. Gimenez, Carlos Gustavo, Navarro, Ángel y Van Deurs, Adriana. Buenos Aires, Argentina: Diseño, 2015, 188 páginas.

David Eppstein

We show that several types of graph drawing in the hyperbolic plane require features of the drawing to be separated from each other by sub-constant distances, distances so small that they can be accurately approximated by Euclidean distance. Therefore, for these types of drawing, hyperbolic geometry provides no benefit over Euclidean graph drawing.

Patrizio Angelini, Ignaz Rutter, Sandhya T P

We study the planar orthogonal drawing style within the framework of partial representation extension. Let $(G,H,Γ_H )$ be a partial orthogonal drawing, i.e., G is a graph, $H\subseteq G$ is a subgraph and $Γ_H$ is a planar orthogonal drawing of H. We show that the existence of an orthogonal drawing $Γ_G$ of $G$ that extends $Γ_H$ can be tested in linear time. If such a drawing exists, then there also is one that uses $O(|V(H)|)$ bends per edge. On the other hand, we show that it is NP-complete to find an extension that minimizes the number of bends or has a fixed number of bends per edge.

Andrea Giordano

The city of Padua is surveyed by technicians coordinated by Giovanni Valle, who elaborates, draws and ‘amends’, under the direction of Simone Stratico –whose role has not yet been clarified [1]– a map that was engraved in Rome, within 1784, by Giovanni Volpato. For technical reasons the huge surface of the drawing is transfered on 20 copper plates of various sizes [Ghironi, Mazzi 1985] becoming, in its original edition, one of the most important and famous maps of the city. Realized according to precise criteria of geometric measurement, it can be considered, therefore, a punctual record of the urban condition of Padua in the 18th century [Zaggia 2009]. For this reason, the map plays a role of great historical importance since it crystallizes the forma urbis of Padua before the wide nineteenth and twentieth century transformations (read more).

Aleix Carrió i Millà

Les dades aportades en aquest article en relació al pes econòmic del disseny situen aquesta disciplina en una dimensió amb possibilitats d'afrontar nous reptes, donat el seu fort increment -quantitatiu i qualitatiu- en aquests darrers anys. Alhora aquest creixement permet observar que, des de l'any 1986, en el disseny català hi ha hagut tres causes clau que expliquen els canvis disruptius que han capgirat el seu comportament i posicionament i que, conseqüentment, permeten entendre el procés de dissenyització en el qual ens trobem immersos. La suma d'aquests factors fa pensar en la bona posició en la qual es troba el món del disseny català per aprofitar amb èxit les expectatives de desenvolupament, innovació i canvi tecnològic que l'univers transmèdia comporta. Un espai on el disseny interdisciplinari hi pot aportar creativitat i centralitat.

Amir M. Mirzendehdel, Morad Behandish, Saigopal Nelaturi

We demonstrate an approach of exploring design spaces to simultaneously satisfy kinematics- and physics-based requirements. We present a classification of constraints and solvers to enable postponing optimization as far down the design workflow as possible. The solvers are organized into two broad classes of design space 'pruning' and 'exploration' by considering the types of constraints they can satisfy. We show that pointwise constraints define feasible design subspaces that can be represented and computed as first-class entities by their maximal feasible elements. The design space is pruned upfront by intersecting maximal elements, without premature optimization. To solve for other constraints, we apply topology optimization (TO), starting from the pruned feasible space. The optimization is steered by a topological sensitivity field (TSF) that measures the global changes in violation of constraints with respect to local topological punctures. The TSF for global objective functions is augmented with TSF for global constraints, and penalized/filtered to incorporate local constraints, including set constraints converted to differentiable (in)equality constraints. We demonstrate application of the proposed workflow to nontrivial examples in design and manufacturing. Among other examples, we show how to explore pruned design spaces via TO to simultaneously satisfy physics-based constraints (e.g., minimize compliance and mass) as well as kinematics-based constraints (e.g., maximize accessibility for machining).

Alan Arroyo, Martin Derka, Irene Parada

Simple drawings of graphs are those in which each pair of edges share at most one point, either a common endpoint or a proper crossing. In this paper we study the problem of extending a simple drawing $D(G)$ of a graph $G$ by inserting a set of edges from the complement of $G$ into $D(G)$ such that the result is a simple drawing. In the context of rectilinear drawings, the problem is trivial. For pseudolinear drawings, the existence of such an extension follows from Levi's enlargement lemma. In contrast, we prove that deciding if a given set of edges can be inserted into a simple drawing is NP-complete. Moreover, we show that the maximization version of the problem is APX-hard. We also present a polynomial-time algorithm for deciding whether one edge $uv$ can be inserted into $D(G)$ when $\{u,v\}$ is a dominating set for the graph $G$.

Guido Brückner, Nadine Davina Krisam, Tamara Mchedlidze

We introduce and study level-planar straight-line drawings with a fixed number $λ$ of slopes. For proper level graphs, we give an $O(n \log^2 n / \log \log n)$-time algorithm that either finds such a drawing or determines that no such drawing exists. Moreover, we consider the partial drawing extension problem, where we seek to extend an immutable drawing of a subgraph to a drawing of the whole graph, and the simultaneous drawing problem, which asks about the existence of drawings of two graphs whose restrictions to their shared subgraph coincide. We present $O(n^{4/3} \log n)$-time and $O(λ n^{10/3} \log n)$-time algorithms for these respective problems on proper level-planar graphs. We complement these positive results by showing that testing whether non-proper level graphs admit level-planar drawings with $λ$ slopes is $\textsf{NP}$-hard even in restricted cases.

Kazuo Misue, Katsuya Akasaka

A partial edge drawing (PED) of a graph is a variation of a node-link diagram. PED draws a link, which is a partial visual representation of an edge, and reduces visual clutter of the node-link diagram. However, more time is required to read a PED to infer undrawn parts. The authors propose a morphing edge drawing (MED), which is a PED that changes with time. In MED, links morph between partial and complete drawings; thus, a reduced load for estimation of undrawn parts in a PED is expected. Herein, a formalization of MED is shown based on a formalization of PED. Then, requirements for the scheduling of morphing are specified. The requirements inhibit morphing from crossing and shorten the overall time for morphing the edges. Moreover, an algorithm for a scheduling method implemented by the authors is illustrated and the effectiveness of PED from a reading time viewpoint is shown through an experimental evaluation.

Andrés Valencia-Escobar, Alejandro Zuleta, Yuliana Areiza et al.

La madera, entendido como un material sostenible, se usa desde finales del siglo xviii para fabricar marcos de bicicletas y durante los últimos diez años su uso se ha incrementado. Sin embargo, no existen aún referencias científicas o comerciales de proyectos de bicicletas plegables de madera. Con base en esto, se propone un proyecto que busca diseñar una bicicleta plegable de madera que se pueda integrar a una estrategia de movilidad sostenible. Metodológicamente, se siguieron cuatro fases: Información, Formalización, Conformación y Validación. Se hizo un análisis de las características de modelos de bicicletas plegables existentes, se definieron los requerimientos de diseño, el patrón geométrico y el patrón estructural para el marco; se seleccionaron la madera y los componentes estándar y se diseñó el mecanismo de plegado. Se utilizaron prototipos a diferentes escalas para pruebas de ajuste dimensional con componentes y pruebas básicas de manejo para determinar maniobrabilidad y factores de ajuste ergonómico. Por último, se validó el comportamiento mecánico con un análisis por elementos finitos. Como resultado se obtuvo el diseño de un marco plegable en madera de teca compuesto por tres sistemas estructurales integrados, reforzados con insertos metálicos internos, basado en un triángulo trasero, una elipse central y un voladizo frontal.

Patrizio Angelini, Michael A. Bekos, Walter Didimo et al.

A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, in which each edge is either a horizontal or a vertical segment. These drawings have several properties that improve human readability and support network routing. We address the problem of testing whether a planar rectilinear representation, i.e., a plane graph with specified vertex angles, admits vertex coordinates that define a greedy drawing. We provide a characterization, a linear-time testing algorithm, and a full generative scheme for universal greedy rectilinear representations, i.e., those for which every drawing is greedy. For general greedy rectilinear representations, we give a combinatorial characterization and, based on it, a polynomial-time testing and drawing algorithm for a meaningful subset of instances.