2013 IEEE Pacific Visualization Symposium (PacificVis)最新文献_第4页

Visualizing linear neighborhoods in non-linear vector fields 可视化非线性向量场中的线性邻域

2013 IEEE Pacific Visualization Symposium (PacificVis) Pub Date : 2013-02-01 DOI: 10.1109/PacificVis.2013.6596152

Stefan Koch, Alexander Wiebel, Jens Kasten, M. Hlawitschka

引用次数: 2

FlexGD: A flexible force-directed model for graph drawing FlexGD:用于图形绘制的柔性力导向模型

2013 IEEE Pacific Visualization Symposium (PacificVis) Pub Date : 2013-02-01 DOI: 10.1109/PacificVis.2013.6596148

Anne-Marie Kermarrec, Afshin Moin

引用次数: 5

On the faithfulness of graph visualizations 论图形可视化的准确性

2013 IEEE Pacific Visualization Symposium (PacificVis) Pub Date : 2012-09-19 DOI: 10.1007/978-3-642-36763-2_55

Q. Nguyen, P. Eades, Seok-Hee Hong

引用次数: 47

Circular-arc cartograms 圆弧变形图

2013 IEEE Pacific Visualization Symposium (PacificVis) Pub Date : 2011-12-20 DOI: 10.1109/PacificVis.2013.6596121

Jan-Hinrich Kämper, S. Kobourov, M. Nöllenburg

{"title":"Circular-arc cartograms","authors":"Jan-Hinrich Kämper, S. Kobourov, M. Nöllenburg","doi":"10.1109/PacificVis.2013.6596121","DOIUrl":"https://doi.org/10.1109/PacificVis.2013.6596121","url":null,"abstract":"We present a new circular-arc cartogram model in which countries are drawn as polygons with circular arcs instead of straight-line segments. Given a political map and values associated with each country in the map, a cartogram is a distorted map in which the areas of the countries are proportional to the corresponding values. In the circular-arc cartogram model straight-line segments can be replaced by circular arcs in order to modify the areas of the polygons, while the corners of the polygons remain fixed. The countries in circular-arc cartograms have the aesthetically pleasing appearance of clouds or snowflakes, depending on whether their edges are bent outwards or inwards. This makes it easy to determine whether a country has grown or shrunk, just by its overall shape. We show that determining whether a given map and given area-values can be realized as a circular-arc cartogram is an NP-hard problem. Next we describe a heuristic method for constructing circular-arc cartograms, which uses a max-flow computation on the dual graph of the map, along with a computation of the straight skeleton of the underlying polygonal decomposition. Our method is implemented and produces cartograms that, while not yet perfectly accurate, achieve many of the desired areas in our real-world examples.","PeriodicalId":179865,"journal":{"name":"2013 IEEE Pacific Visualization Symposium (PacificVis)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131545711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18