@article{cmolik-2020-tvcg, title = "Mixed Labeling: Integrating Internal and External Labels", author = "Ladislav \v{C}mol\'{i}k and V\'{a}clav Pavlovec and Hsiang-Yun Wu and Martin N\"{o}llenburg", year = "2020", abstract = "In this paper, we present an algorithm capable of mixed labeling of 2D and 3D objects. In mixed labeling, the given objects are labeled with both internal labels placed (at least partially) over the objects and external labels placed in the space around the objects and connected with the labeled objects with straight-line leaders. The proposed algorithm determines the position and type of each label based on the user-specified ambiguity threshold and eliminates overlaps between the labels, as well as between the internal labels and the straight-line leaders of external labels. The algorithm is a screen-space technique; it operates in an image where the 2D objects or projected 3D objects are encoded. In other words, we can use the algorithm whenever we can render the objects to an image, which makes the algorithm fit for use in many domains. The algorithm operates in real-time, giving the results immediately. Finally, we present results from an expert evaluation, in which a professional illustrator has evaluated the label layouts produced with the proposed algorithm.", month = sep, doi = "10.1109/TVCG.2020.3027368", journal = "IEEE Transactions on Visualization and Computer Graphics (TVCG)", volume = "x", pages = "1--14", URL = "https://www.cg.tuwien.ac.at/research/publications/2020/cmolik-2020-tvcg/", } @article{raidou_slicedice, title = "Slice and Dice: A PhysicalizationWorkflow for Anatomical Edutainment", author = "Renata Raidou and Eduard Gr\"{o}ller and Hsiang-Yun Wu", year = "2020", abstract = "During the last decades, anatomy has become an interesting topic in education—even for laymen or schoolchildren. As medical imaging techniques become increasingly sophisticated, virtual anatomical education applications have emerged. Still, anatomical models are often preferred, as they facilitate 3D localization of anatomical structures. Recently, data physicalizations (i.e., physical visualizations) have proven to be effective and engaging—sometimes, even more than their virtual counterparts. So far, medical data physicalizations involve mainly 3D printing, which is still expensive and cumbersome. We investigate alternative forms of physicalizations, which use readily available technologies (home printers) and inexpensive materials (paper or semi-transparent films) to generate crafts for anatomical edutainment. To the best of our knowledge, this is the first computer-generated crafting approach within an anatomical edutainment context. Our approach follows a cost-effective, simple, and easy-to-employ workflow, resulting in assemblable data sculptures (i.e., semi-transparent sliceforms). It primarily supports volumetric data (such as CT or MRI), but mesh data can also be imported. An octree slices the imported volume and an optimization step simplifies the slice configuration, proposing the optimal order for easy assembly. A packing algorithm places the resulting slices with their labels, annotations, and assembly instructions on a paper or transparent film of user-selected size, to be printed, assembled into a sliceform, and explored. We conducted two user studies to assess our approach, demonstrating that it is an initial positive step towards the successful creation of interactive and engaging anatomical physicalizations.", month = oct, journal = "Computer Graphics Forum (CGF)", volume = "x", pages = "1--12", keywords = "Data Physicalization, Life and Medical Sciences, Anatomical Education", URL = "https://www.cg.tuwien.ac.at/research/publications/2020/raidou_slicedice/", } @inproceedings{schindler_2020vis, title = "The Anatomical Edutainer", author = "Marwin Schindler and Hsiang-Yun Wu and Renata Raidou", year = "2020", abstract = "Physical visualizations (i.e., data representations by means of physical objects) have been used for many centuries in medical and anatomical education. Recently, 3D printing techniques started also to emerge. Still, other medical physicalizations that rely on affordable and easy-to-find materials are limited, while smart strategies that take advantage of the optical properties of our physical world have not been thoroughly investigated. We propose the Anatomical Edutainer, a workflow to guide the easy, accessible, and affordable generation of physicalizations for tangible, interactive anatomical edutainment. The Anatomical Edutainer supports 2D printable and 3D foldable physicalizations that change their visual properties (i.e., hues of the visible spectrum) under colored lenses or colored lights, to reveal distinct anatomical structures through user interaction.", month = oct, event = "IEEE Vis 2020", booktitle = "IEEE Vis Short Papers 2020", pages = "1--5", keywords = "Data Physicalization, Medical Visualization, Anatomical Education", URL = "https://www.cg.tuwien.ac.at/research/publications/2020/schindler_2020vis/", } @inproceedings{Iijima-2020-iV, title = "Visualization of Semantic Differential Studies with a Large Number of Images, Participants and Attributes", author = "Akari Iijima and Takayuki Itoh and Hsiang-Yun Wu and Nicolas Grossmann", year = "2020", abstract = "The Semantic Differential (SD) Method is a rating scale to measure the semantics. Attributes of SD are constructed by collecting the responses of participant’s impres- sions of the objects expressed through Likert scales representing multiple contrasting with some adjective pairs, for example, dark and bright, formal and casual, etc. Impression evaluation can be used as an index that reflects a human subjective feelings to some extent. Impression evaluations using the SD method consist of the responses of many participants, and therefore, the individual differences in the impressions of the participants greatly affect the content of the data. In this study, we propose a visualization system to analyze three aspects of SD, objects (images), participants, and attributes defined by adjective pairs. We visualize the impression evaluation data by applying dimension reduction so that, users can discover the trends and outliers of the data, such as images that are hard to judge or participants that act unpredictably. The system firstly visualizes the attributes or color distribution of the images by applying a dimensional reduction method to the impression or RGB values of each image. Then, our approach displays the average and median of each attribute near the images. This way, we can visualize the three aspects of objects, participants and attributes on a single screen and observe the relationships between image features and user impressions / attribute space. We introduce visualization examples of our system with the dataset inviting 21 participants who performed impression evaluations with 300 clothing images.", month = sep, event = "The 24th International Conference on Information Visualisation (iV2020)", booktitle = "Proceedings of the 24th International Conference on Information Visualisation (iV2020)", pages = "1--6", URL = "https://www.cg.tuwien.ac.at/research/publications/2020/Iijima-2020-iV/", } @inproceedings{Kuroko-2020-iV, title = "Visualization of Correlations between Places of Music Listening and Acoustic Features ", author = "Narumi Kuroko and Hayato Ohya and Takayuki Itoh and Nicolas Grossmann and Hsiang-Yun Wu", year = "2020", abstract = "Users often choose songs with respect to special situations and environments. We designed and developed a music recommendation method inspired by this fact. This method selects songs based on the distribution of acoustic features of the songs listened by a user at particular places that have higher ordinariness for the user. It is important to verify the relationship between the places where the songs are listened to and the acoustic features in this. Hence, we conducted the visualization to explore potential correlations between geographic locations and the music features of single users. In this paper, we designed an interactive visualization tool methods and results for the analysis of the relationship between the places and the acoustic features while listening to the songs.", month = sep, event = "The 24th International Conference on Information Visualisation (iV2020)", booktitle = "Proceedings of the 24th International Conference on Information Visualisation (iV2020)", pages = "1--6", URL = "https://www.cg.tuwien.ac.at/research/publications/2020/Kuroko-2020-iV/", } @inproceedings{Purchase-2020-gd, title = "The Turing Test for Graph Drawing Algorithms", author = "Helen C. Purchase and Daniel Archambault and Stephen Kobourov and Martin N\"{o}llenburg and Sergey Pupyrev and Hsiang-Yun Wu", year = "2020", abstract = "DoalgorithmsfordrawinggraphspasstheTuringTest?That is, are their outputs indistinguishable from graphs drawn by humans? We address this question through a human-centred experiment, focusing on ‘small’ graphs, of a size for which it would be reasonable for someone to choose to draw the graph manually. Overall, we find that hand-drawn layouts can be distinguished from those generated by graph drawing al- gorithms, although this is not always the case for graphs drawn by force- directed or multi-dimensional scaling algorithms, making these good can- didates for Turing Test success. We show that, in general, hand-drawn graphs are judged to be of higher quality than automatically generated ones, although this result varies with graph size and algorithm.", month = sep, event = "28th International Symposium on Graph Drawing and Network Visualization ", booktitle = "Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD2020)", pages = "1--16", URL = "https://www.cg.tuwien.ac.at/research/publications/2020/Purchase-2020-gd/", } @article{wu-2020-eurovis-star, title = "A Survey on Transit Map Layout – from Design, Machine, and Human Perspectives", author = "Hsiang-Yun Wu and Benjamin Niedermann and Shigeo Takahashi and Maxwell J. Roberts and Martin N\"{o}llenburg", year = "2020", abstract = "Transit maps are designed to present information for using public transportation systems, such as urban railways. Creating a transit map is a time-consuming process, which requires iterative information selection, layout design, and usability validation, and thus maps cannot easily be customised or updated frequently. To improve this, scientists investigate fully- or semi-automatic techniques in order to produce high quality transit maps using computers and further examine their corresponding usability. Nonetheless, the quality gap between manually-drawn maps and machine-generated maps is still large. To elaborate the current research status, this state-of-the-art report provides an overview of the transit map generation process, primarily from Design, Machine, and Human perspectives. A systematic categorisation is introduced to describe the design pipeline, and an extensive analysis of perspectives is conducted to support the proposed taxonomy. We conclude this survey with a discussion on the current research status, open challenges, and future directions.", month = may, journal = "Computer Graphics Forum", volume = "39", number = "3", issn = "1467-8659", doi = "10.1111/cgf.14030", pages = "28", pages = "619--646", keywords = "Computer Graphics and Computer-Aided Design", URL = "https://www.cg.tuwien.ac.at/research/publications/2020/wu-2020-eurovis-star/", } @inproceedings{Korpitsch-2020-wscg, title = "Simulated Annealing to Unfold 3D Meshes and Assign Glue Tabs", author = "Thorsten Korpitsch and Shigeo Takahashi and Eduard Gr\"{o}ller and Hsiang-Yun Wu", year = "2020", abstract = "3D mesh unfolding transforms a 3D mesh model into one or multiple 2D planar patches. The technique is widely used to fabricate papercrafts, where 3D objects can be reconstructed from printed paper or paper-like materials. The applicability, visual quality, and stability of such papercraft productions is still challenging since it requires a reasonable formulation of these factors. In this paper, we unfold a 3D mesh into a single connected 2D patch. We also introduce glue tabs as additional indicators in order to provide users with extra space to apply glue for better reconstruction quality. To improve space efficiency, we do not apply glue tabs on every edge, while still guaranteeing the stability of the constructed paper model. A minimum spanning tree (MST) describes possible unfoldings, whereas simulated annealing optimisation is used to find an optimal unfolding. Our approach allows us to unfold 3D triangular meshes into single 2D patches without shape distortions, and employing only a small number of glue tabs. A visual indicator scheme is also incorporated as a post-process to guide users during the model reconstruction process. Finally, we qualitatively evaluate the applicability of the presented approach in comparison to the conventional technique and the achieved results.", month = may, event = "WSCG 2020", booktitle = "Proceedings of the 28th International Conference in Central Europe on Computer Graphics", pages = "1--10", URL = "https://www.cg.tuwien.ac.at/research/publications/2020/Korpitsch-2020-wscg/", } @techreport{korpitsch-2020-cescg, title = "Optimising 3D Mesh Unfoldings with Additional Gluetabs using Simulated Annealing", author = "Thorsten Korpitsch and Hsiang-Yun Wu", year = "2020", abstract = "3D Mesh unfolding is a process of transforming a 3D mesh into one or several 2D planar patches. The technique is widely used to produce papercraft models, where 3D ob- jects can be reconstructed from printed paper or paper-like materials. Nonetheless, the reconstruction of such mod- els can be arduous. In this paper, we aim to unfold a 3D mesh into a single 2D patch and introduce Gluetabs as ad- ditional indicators and in order to give users extra space to apply glue for better reconstruction quality. To avoid unnecessary Gluetabs, we reduce their number, while still guaranteeing the stability of the constructed model. To achieve this, a minimum spanning tree (MST) is used to describe possible unfoldings, whereas simulated annealing optimisation is used to find an optimal unfolding without overlaps. We aim to unfold 3D triangular meshes into sin- gle 2D patches without applying shape distortions, while appropriately assigning a reasonable amount of Gluetabs. Moreover, we incorporate a visual indicator scheme as a post-process to guide users during the model reconstruc- tion process. Our quantitative evaluation suggests that the proposed approach produces fast results for meshes under 400 faces.", month = may, number = "TR-193-02-2020-2", booktitle = "CESCG ", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", institution = "Research Unit of Computer Graphics, Institute of Visual Computing and Human-Centered Technology, Faculty of Informatics, TU Wien ", note = "human contact: technical-report@cg.tuwien.ac.at", URL = "https://www.cg.tuwien.ac.at/research/publications/2020/korpitsch-2020-cescg/", } @WorkshopTalk{wu-2019-visworkshop, title = "Graph Models for Biological Pathway Visualization: State of the Art and Future Challenges", author = "Hsiang-Yun Wu and Martin N\"{o}llenburg and Ivan Viola", year = "2019", abstract = "The concept of multilayer networks has become recently integrated into complex systems modeling since it encapsulates a very general concept of complex relationships. Biological pathways are an exam- ple of complex real-world networks, where vertices represent biolog- ical entities, and edges indicate the underlying connectivity. For this reason, using multilayer networks to model biological knowledge allows us to formally cover essential properties and theories in the field, which also raises challenges in visualization. This is because, in the early days of pathway visualization research, only restricted types of graphs, such as simple graphs, clustered graphs, and others were adopted. In this paper, we revisit a heterogeneous definition of biological networks and aim to provide an overview to see the gaps between data modeling and visual representation. The contribution will, therefore, lie in providing guidelines and challenges of using multilayer networks as a unified data structure for the biological pathway visualization. ", month = oct, event = "Vis 2019 Workshop", location = "Canada", keywords = "Graph drawing, multilayer network, biological pathway", URL = "https://www.cg.tuwien.ac.at/research/publications/2019/wu-2019-visworkshop/", } @unknown{li-2019-gdc, title = "World map of recipes", author = "Guangping Li and Soeren Nickel and Martin N\"{o}llenburg and Ivan Viola and Hsiang-Yun Wu", year = "2019", abstract = "This poster visualises the Meal Ingredients dataset with 151 international food recipes and their corresponding ingredients. The underlying graph layout in the image is automatically generated using a new multi-level force-based algorithm developed by the authors, but not yet published. The background flags were added manually to identify the countries from the data set. The algorithm aims to untangle mutually nested subgraphs by harmonizing the available space for the labels and improving edge visibility by duplicating high-frequency ingredient nodes. Ingredients occurring in multiple countries also receive at least one node per country. The idea is inspired by map diagrams, which often show the semantics enclosed by country boundaries. In our diagram, countries are represented by octolinear polygons, and are placed next to each other if they share many ingredients in their recipes. The actual placement of the countries by the algorithm is entirely data driven. As we can see, this design naturally gathers countries that are located on the same continent, due to the accessibility of the ingredients. The names of recipes are visualized using textual labels with sharp corners, and they are enclosed by the country polygon they belong to. Contrarily, ingredients are represented by textual labels with rounded corners. Moreover, ingredients are visually classified into common (pink) and special (blue) ingredients based on their frequency in the dataset. For visually analyzing the data set, we can generate smoothed spanning trees along the boundaries of an (invisible) Voronoi diagram of all textual labels to connect identical nodes to visually integrate all copies of one ingredient. For example, we highlighted the ingredient "soy sauce", one of the most commonly used ingredients in Asia, to discover that it has spread to the UK as well. We can also perform visual queries for related recipes based on sharing rare ingredients. For example, the British dish "steak and kidney pie" is highlighted in green together with three blue spanning trees connecting all recipes related to that dish via at least one of its special (blue) ingredients.", month = sep, URL = "https://www.cg.tuwien.ac.at/research/publications/2019/li-2019-gdc/", } @inproceedings{Sbardellati-2019-vcbm, title = "Interactive Exploded Views for Molecular Structures", author = "Maximilian Sbardellati and Haichao Miao and Hsiang-Yun Wu and Eduard Gr\"{o}ller and Ivan Barisic and Ivan Viola", year = "2019", abstract = "We propose an approach to interactively create exploded views of molecular structures with the goal to help domain experts in their design process and provide them with a meaningful visual representation of component relationships. Exploded views are excellently suited to manage visual occlusion of structure components, which is one of the main challenges when visualizing complex 3D data. In this paper, we discuss four key parameters of an exploded view: explosion distance, direction, order, and the selection of explosion components. We propose two strategies, namely the structure-derived exploded view and the interactive free-form exploded view, for computing these four parameters systematically. The first strategy allows scientists to automatically create exploded views by computing the parameters from the given object structures. The second strategy further supports them to design and customize detailed explosion paths through user interaction. Our approach features the possibility to animate exploded views, to incorporate ease functions into these animations and to display the explosion path of components via arrows. Finally, we demonstrate three use cases with various challenges that we investigated in collaboration with a domain scientist. Our approach, therefore, provides interesting new ways of investigating and presenting the design layout and composition of complex molecular structures.", month = sep, event = "VCBM 2019", booktitle = "Proceedings of the 9th Eurographics Workshop on Visual Computing for Biology and Medicine", pages = "103--112", URL = "https://www.cg.tuwien.ac.at/research/publications/2019/Sbardellati-2019-vcbm/", } @unknown{wu-2019-vcbm, title = "Map of Metabolic Harmony", author = "Hsiang-Yun Wu and Martin N\"{o}llenburg and Ivan Viola", year = "2019", abstract = "As the human body is healthy when the metabolic harmony is maintained, the human metabolic pathways are interpretable when its visual representation is harmonized. We developed an automatic approach to hierarchically decompose the screen space to multiple functional regions and embed sub-pathways into their corresponding regions to unveil complex metabolite relationships.", month = sep, URL = "https://www.cg.tuwien.ac.at/research/publications/2019/wu-2019-vcbm/", } @article{mizuno-2019-eurovis, title = "Optimizing Stepwise Animation in Dynamic Set Diagrams", author = "Kazuyo Mizuno and Hsiang-Yun Wu and Shigeo Takahashi and Takeo Igarashi", year = "2019", abstract = "A set diagram represents the membership relation among data elements. It is often visualized as secondary information on top of primary information, such as the spatial positions of elements on maps and charts. Visualizing the temporal evolution of such set diagrams as well as their primary features is quite important; however, conventional approaches have only focused on the temporal behavior of the primary features and do not provide an effective means to highlight notable transitions within the set relationships. This paper presents an approach for generating a stepwise animation between set diagrams by decomposing the entire transition into atomic changes associated with individual data elements. The key idea behind our approach is to optimize the ordering of the atomic changes such that the synthesized animation minimizes unwanted set occlusions by considering their depth ordering and reduces the gaze shift between two consecutive stepwise changes. Experimental results and a user study demonstrate that the proposed approach effectively facilitates the visual identification of the detailed transitions inherent in dynamic set diagrams.", month = jul, journal = "Computer Graphics Forum", volume = "38", note = "Best Paper Honorable Mention at EuroVis 2019", doi = "https://doi.org/10.1111/cgf.13668", pages = "13--24", URL = "https://www.cg.tuwien.ac.at/research/publications/2019/mizuno-2019-eurovis/", } @inproceedings{maruyama-2019-iv, title = "Scale-Aware Cartographic Displacement Based on Constrained Optimization", author = "Ken Maruyama and Shigeo Takahashi and Hsiang-Yun Wu and Kazuo Misue and Masatoshi Arikawa", year = "2019", abstract = "Abstract—The consistent arrangement of map features in accordance with the map scale has recently been technically important in digital cartographic generalization. This is primarily due to the recent demand for informative mapping systems, especially for use in smartphones and tablets. However, such sophisticated generalization has usually been conducted manually by expert cartographers and thus results in a time-consuming and error-prone process. In this paper, we focus on the displacement process within cartographic generalization and formulate them as a constrained optimization problem to provide an associated algorithm implementation and its effective solution. We first identify the underlying spatial relationships among map features, such as points and lines, on each map scale as constraints and optimize the cost function that penalizes excessive displacement of the map features in terms of the map scale. Several examples are also provided to demonstrate that the proposed approach allows us to maintain consistent mapping regardless of changes to the map scale.", month = jul, event = " The 23th International Conference on Information Visualisation ", doi = "https://dx.doi.org/10.1109/IV.2019.00022", booktitle = "Proceedings of the 23th International Conference on Information Visualisation (iV2019)", pages = "74--80", keywords = "Cartographic generalization, displacement, constrained optimization, scale-aware mapping", URL = "https://www.cg.tuwien.ac.at/research/publications/2019/maruyama-2019-iv/", } @article{takahashi-2019-acdt, title = "Mental Map Preservation for Progressively Labeling Railway Networks", author = "Shigeo Takahashi and Ken Maruyama and Takamasa Kawagoe and Hsiang-Yun Wu and Kazuo Misue and Masatoshi Arikawa", year = "2019", abstract = "Schematizing railway networks for better readability is often achieved by aligning railway lines along the octilinear directions. However, such railway map layouts require further adjustment when placing station name labels. In this article, the authors present a novel approach to automating the placement of station names around the railway network while maximally respecting its original layout as the mental map. The key idea is to progressively annotate stations from congested central downtown areas to sparse rural areas. This is accomplished by introducing the sum of geodesic distances over the railway network to properly order the stations to be annotated first, and then elongating the line segments of the railway network while retaining their directions to spare enough labeling space around each station. Additional constraints are also introduced to restrict the aspect ratios of the region confined by the railway network for better preservation of the mental map.", month = jun, doi = "https://doi.org/10.4018/IJACDT.2019010103", journal = "International Journal of Art, Culture and Design Technologies", number = "1", volume = "8", pages = "31--50", keywords = "Geodesic Distances, Mental Maps, Mixed-Integer Programming, Progressive Annotation, Railway Maps, Schematic Layouts", URL = "https://www.cg.tuwien.ac.at/research/publications/2019/takahashi-2019-acdt/", } @article{wu-2019-bmc, title = "Metabopolis: Scalable Network Layout for Biological Pathway Diagrams in Urban Map Style", author = "Hsiang-Yun Wu and Martin N\"{o}llenburg and Filipa L. Sousa and Ivan Viola", year = "2019", abstract = "Background Biological pathways represent chains of molecular interactions in biological systems that jointly form complex dynamic networks. The network structure changes from the significance of biological experiments and layout algorithms often sacrifice low-level details to maintain high-level information, which complicates the entire image to large biochemical systems such as human metabolic pathways. Results Our work is inspired by concepts from urban planning since we create a visual hierarchy of biological pathways, which is analogous to city blocks and grid-like road networks in an urban area. We automatize the manual drawing process of biologists by first partitioning the map domain into multiple sub-blocks, and then building the corresponding pathways by routing edges schematically, to maintain the global and local context simultaneously. Our system incorporates constrained floor-planning and network-flow algorithms to optimize the layout of sub-blocks and to distribute the edge density along the map domain. We have developed the approach in close collaboration with domain experts and present their feedback on the pathway diagrams based on selected use cases. Conclusions We present a new approach for computing biological pathway maps that untangles visual clutter by decomposing large networks into semantic sub-networks and bundling long edges to create space for presenting relationships systematically.", month = may, doi = "http://doi.org/10.1186/s12859-019-2779-4", journal = "BMC Bioinformatics", number = "187", volume = "20", pages = "1--20", keywords = "Biological pathways, Graph drawing, Mapmetaphor, Orthogonallayout, Floorplanning, Edgerouting", URL = "https://www.cg.tuwien.ac.at/research/publications/2019/wu-2019-bmc/", } @misc{wu-2019-smwp, title = "Aspect-Ratio-Preserved Labeling on Metro Maps", author = "Hsiang-Yun Wu and Ken Maruyama and Takamasa Kawagoe and Kazuo Misue and Masatoshi Arikawa and Shigeo Takahashi", year = "2019", abstract = "For better readability, metro lines are often aligned along the octilinear directions. Predefined layouts, however, limit the feasibility of placing station name labels. In this paper, we present a novel approach to automating the placement of station names around a schematic network while maximally respecting its original layout as the mental map. The idea behind the proposed approach is to progressively annotate stations from congested central downtown areas to sparse rural areas by intro- ducing the sum of geodesic distances over the network to identify the proper order of stations to be annotated. Our approach elongates line segments of the network without changing their directions to spare labeling space around the station. Additional constraints are introduced to restrict the aspect ratios of the region confined by the metro network for better preservation of the mental map in the original schematic layout.", month = apr, event = "Schematic Mapping Workshop 2019", doi = "https://www.ac.tuwien.ac.at/files/pub/smw19-paper-5.pdf", Conference date = "Poster presented at Schematic Mapping Workshop 2019 (2019)", keywords = "Progressive Annotation, Geodesic Distances, Schematic Layout, Mental Maps, Mixed-Integer Programming", URL = "https://www.cg.tuwien.ac.at/research/publications/2019/wu-2019-smwp/", } @misc{vasileva-2019-smw, title = "OptiRoute: Interactive Maps for Wayfinding in a Complex Environment", author = "Elitza Vasileva and Hsiang-Yun Wu", year = "2019", abstract = "Visitors to amusement parks use mobile map appli- cations to decide where to go and to plan efficient routes. Such applications are especially helpful when visitors wish to avoid re-tracking their steps or visiting regions in the park several times. Visitors have limited time in the park, which typically covers a very large area, and the attractions have waiting times of varying duration. Time management is therefore important. In this paper, we propose a new visualization technique to support such route decision making, using an interactive environment. The main contribution of our system, OptiRoute, is the automatic computation of an optimal route between selected attractions as well as its effective visualization, which focuses on reducing visual clutter. This is achieved by improving the branch and bound route-finding algorithm, and introducing an intersection minimization algorithm for route representation. We demonstrate the feasibility of our approach through a case study of Tokyo Disneyland, in addition to a user study.", month = apr, note = "Best Poster Award", event = "schematic Mapping Workshop 2019", Conference date = "Poster presented at schematic Mapping Workshop 2019 (2019)", keywords = " Maps, Route finding, Wayfinding", URL = "https://www.cg.tuwien.ac.at/research/publications/2019/vasileva-2019-smw/", } @WorkshopTalk{wu-2019-smw, title = " A Survey on Computing Schematic Network Maps: The Challenge to Interactivity", author = "Hsiang-Yun Wu and Benjamin Niedermann and Shigeo Takahashi and Martin N\"{o}llenburg", year = "2019", abstract = "Schematic maps are in daily use to show the connec- tivity of subway systems and to facilitate travellers to plan their journeys effectively. This study surveys up-to-date algorithmic approaches in order to give an overview of the state of the art in schematic network mapping. The study investigates the hypothesis that the choice of algorithmic approach is often guided by the requirements of the mapping application. For example, an algorithm that computes globally optimal solutions for schematic maps is capable of producing results for printing, while it is not suitable for computing instant layouts due to its long running time. Our analysis and discussion, therefore, focus on the compu- tational complexity of the problem formulation and the running times of the schematic map algorithms, including algorithmic network layout techniques and station labeling techniques. The correlation between problem complexity and running time is then visually depicted using scatter plot diagrams. Moreover, since metro maps are common metaphors for data visualization, we also investigate online tools and application domains using metro map representations for analytics purposes, and finally summarize the potential future opportunities for schematic maps.", month = apr, doi = "https://www.ac.tuwien.ac.at/files/pub/smw19-position-5.pdf", event = "The 2nd Schematic Mapping Workshop 2019", location = "Vienna, Austria", keywords = "Metro Maps, Graph Drawing, Metaphors", URL = "https://www.cg.tuwien.ac.at/research/publications/2019/wu-2019-smw/", } @techreport{wu-2019-report, title = "From Cells to Atoms - Biological Information Visualization (in Chinese)", author = "Hsiang-Yun Wu and Haichao Miao and Ivan Viola", year = "2019", month = mar, number = "TR-193-02-2019-1", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", institution = "Research Unit of Computer Graphics, Institute of Visual Computing and Human-Centered Technology, Faculty of Informatics, TU Wien ", note = "human contact: technical-report@cg.tuwien.ac.at", URL = "https://www.cg.tuwien.ac.at/research/publications/2019/wu-2019-report/", } @article{YOGHOURDJIAN2019, title = "Exploring the limits of complexity: A survey of empirical studies ongraph visualisation", author = "Vahan Yoghourdjian and Daniel Archambault and Stephan Diehl and Tim Dwyer and Karsten Klein and Helen C. Purchase and Hsiang-Yun Wu", year = "2019", abstract = "For decades, researchers in information visualisation and graph drawing have focused on developing techniques for the layout and display of very large and complex networks. Experiments involving human participants have also explored the readability of different styles of layout and representations for such networks. In both bodies of literature, networks are frequently referred to as being ‘large’ or ‘complex’, yet these terms are relative. From a human-centred, experiment point-of-view, what constitutes ‘large’ (for example) depends on several factors, such as data complexity, visual complexity, and the technology used. In this paper, we survey the literature on human-centred experiments to understand how, in practice, different features and characteristics of node–link diagrams affect visual complexity.", month = jan, doi = "https://doi.org/10.1016/j.visinf.2018.12.006", issn = "2468-502X", journal = "Visual Informatics", number = "4", volume = "2", pages = "264--282", keywords = "Graph visualisation, Network visualisation, node–link diagrams, Evaluations, Empirical studies, Cognitive scalability", URL = "https://www.cg.tuwien.ac.at/research/publications/2019/YOGHOURDJIAN2019/", } @article{kouril-2018-LoL, title = "Labels on Levels: Labeling of Multi-Scale Multi-Instance and Crowded 3D Biological Environments", author = "David Kou\v{r}il and Ladislav \v{C}mol\'{i}k and Barbora Kozlikova and Hsiang-Yun Wu and Graham Johnson and David Goodsell and Arthur Olson and Eduard Gr\"{o}ller and Ivan Viola", year = "2019", abstract = "Labeling is intrinsically important for exploring and understanding complex environments and models in a variety of domains. We present a method for interactive labeling of crowded 3D scenes containing very many instances of objects spanning multiple scales in size. In contrast to previous labeling methods, we target cases where many instances of dozens of types are present and where the hierarchical structure of the objects in the scene presents an opportunity to choose the most suitable level for each placed label. Our solution builds on and goes beyond labeling techniques in medical 3D visualization, cartography, and biological illustrations from books and prints. In contrast to these techniques, the main characteristics of our new technique are: 1) a novel way of labeling objects as part of a bigger structure when appropriate, 2) visual clutter reduction by labeling only representative instances for each type of an object, and a strategy of selecting those. The appropriate level of label is chosen by analyzing the scene's depth buffer and the scene objects' hierarchy tree. We address the topic of communicating the parent-children relationship between labels by employing visual hierarchy concepts adapted from graphic design. Selecting representative instances considers several criteria tailored to the character of the data and is combined with a greedy optimization approach. We demonstrate the usage of our method with models from mesoscale biology where these two characteristics-multi-scale and multi-instance-are abundant, along with the fact that these scenes are extraordinarily dense.", month = jan, journal = "IEEE Transactions on Visualization and Computer Graphics", volume = "25", note = "SciVis Best Paper Honorable Mention", doi = "10.1109/TVCG.2018.2864491", pages = "977--986", keywords = "labeling, multi-scale data, multi-instance data", URL = "https://www.cg.tuwien.ac.at/research/publications/2019/kouril-2018-LoL/", } @talk{wu-2018-prague, title = "Progressive Annotation of Schematic Railway Maps", author = "Hsiang-Yun Wu", year = "2018", month = dec, event = "Czech Technical University", location = "Czech Technical University", URL = "https://www.cg.tuwien.ac.at/research/publications/2018/wu-2018-prague/", } @techreport{wu-2018-shonan, title = "Lost in Translation: Alignment of Mental Representations for Visual Analytics, Reimagining the Mental Map and Drawing Stability (NII Shonan Meeting Seminar 127)", author = "Daniel Archambault and Jessie Kennedy and Tatiana von Landesberger and Mark McCann and Fintan McGee and Benjamin Renoust and Hsiang-Yun Wu", year = "2018", month = dec, number = "TR-193-02-2018-1", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", institution = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", note = "human contact: technical-report@cg.tuwien.ac.at", URL = "https://www.cg.tuwien.ac.at/research/publications/2018/wu-2018-shonan/", } @talk{wu-2018-dagstuhl, title = "Geometry and Data Representation", author = "Hsiang-Yun Wu", year = "2018", month = oct, event = "Dagstuhl Seminar 18442", location = "Dagstuhl Seminar 18442", URL = "https://www.cg.tuwien.ac.at/research/publications/2018/wu-2018-dagstuhl/", } @inproceedings{8564188, title = "Progressive Annotation of Schematic Railway Maps", author = "Yuka Yoshida and Ken Maruyama and Takamasa Kawagoe and Hsiang-Yun Wu and Masatoshi Arikawa and Shigeo Takahashi", year = "2018", abstract = "Octilinear network layouts are commonly used as the schematic representation of railway maps due to their enhanced readability. However, it is often time-consuming to place station names on such railway maps by trial and error, especially within the limited labeling space around interchange stations. This paper presents a progressive approach to placing station names around stations in schematic railway maps for better automation of map labeling processes. The idea behind our approach is to annotate stations in dense downtown areas around the interchange stations first and then those in sparse rural areas. This is achieved by introducing the sum of geodesic distances over the railway network to identify the proper order in which to annotate stations. In the actual annotation process, we increase the labeling space around the railway network when necessary by progressively stretching railway line segments while retaining their original directions, which allows us to respect the original schematic layout as much as possible. We present several experimental results to demonstrate the effectiveness of the proposed approach, together with a discussion on parameter tuning in our formulation.", month = jul, event = "The 22nd International Conference Information Visualisation (IV)", doi = "10.1109/iV.2018.00070", booktitle = "Proceedings of the 22nd International Conference Information Visualisation (IV)", pages = "373-378", keywords = "Rail transportation;Layout;Labeling;Spacestations;Optimization;Programming;Visualization;Progressive annotation,geodesic distances, schematic layouts, railway maps, mixed-integerprogramming", URL = "https://www.cg.tuwien.ac.at/research/publications/2018/8564188/", } @misc{wu-2018-metabo, title = "A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways", author = "Hsiang-Yun Wu and Martin N\"{o}llenburg and Ivan Viola", year = "2018", abstract = "This poster abstract presents a visual comparison between three hand-drawn and one machine-generated human metabolic pathway diagrams. The human metabolic pathways, which describe significant biochemical reactions in the human body, have been increasingly investigated due to the development of analysis processes and are compiled into pathway diagrams to provide an overview of reaction in the human body. This complex network includes about 5,000 metabolites and 7,500 reactions, which are hierarchically nested and difficult to visualize. We collect and analyze well-known human metabolic pathway diagrams, and summarize the design choices of these diagrams, respectively. Together with a machine-generated diagram, we can understand the visual complexity of three hand-drawn and one machine-generated diagrams. ", month = jun, event = "EuroVis", Conference date = "Poster presented at EuroVis (2018-06-04--2018-06-08)", URL = "https://www.cg.tuwien.ac.at/research/publications/2018/wu-2018-metabo/", } @inproceedings{An-2018-CHI, title = "Thermorph: Democratizing 4D Printing of Self-Folding Materials and Interfaces", author = "Byoungkwon An and Ye Tao and Jianzhe Gu and Tingyu Cheng and Xiang 'Anthony' Chen and Xiaoxiao Zhang and Wei Zhao and Youngwook Do and Shigeo Takahashi and Hsiang-Yun Wu and Teng Zhang and Lining Yao", year = "2018", month = apr, event = "CHI 2018", booktitle = "CHI 2018", URL = "https://www.cg.tuwien.ac.at/research/publications/2018/An-2018-CHI/", } @misc{wu-2018-story, title = "The Travel of a Metabolite", author = "Hsiang-Yun Wu and Martin N\"{o}llenburg and Ivan Viola", year = "2018", abstract = "Biological pathways are chains of molecule interactions and reactions in biological systems that jointly form complex, hierarchical networks. Although several pathway layout algorithms have been investigated, biologists still prefer to use hand-drawn ones, due to their high visual quality relied on domain knowledge. In this project, we propose a visualization for computing metabolic pathway maps that restrict the grouping structure defined by biologists to rectangles and apply orthogonal-style edge routing to simplify edge orientation. This idea is inspired by concepts from urban planning, where we consider reactions as city blocks and built up roads to connect identical metabolites occurred in multiple categories. We provide a story to present how glucose is broken down to phosphoenolpyruvate to release energy, which is often stored in adenosine triphosphate (ATP) in a human body. Finally, we demonstrate ATP is also utilized to synthesize urea to eliminate the toxic ammonia in our body.", month = apr, note = "submitted to PacificVis 2018 Data Story Telling Contest", URL = "https://www.cg.tuwien.ac.at/research/publications/2018/wu-2018-story/", } @article{wu-2018-JVLC, title = "Overlap-Free Labeling of Clustered Networks Based on Voronoi Tessellation", author = "Hsiang-Yun Wu and Shigeo Takahashi and Rie Ishida", year = "2018", month = feb, journal = "Journal of Visual Languages & Computing", number = "44", URL = "https://www.cg.tuwien.ac.at/research/publications/2018/wu-2018-JVLC/", } @techreport{wu-2017-dagstuhl, title = "Mapifying the Genome, Scalable Set Visualizations (Dagstuhl Seminar 17332)", author = "Radu Jianu and Martin Krzywinski and Luana Micallef and Hsiang-Yun Wu", year = "2018", number = "TR-193-02-2018-2", address = "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria", institution = "Institute of Computer Graphics and Algorithms, Vienna University of Technology ", note = "human contact: technical-report@cg.tuwien.ac.at", URL = "https://www.cg.tuwien.ac.at/research/publications/2018/wu-2017-dagstuhl/", }