2 Search Results for "Takahashi, Shigeo"

Document
DOI: 10.4230/LIPIcs.GD.2025.40
An Algorithm for Accurate and Simple-Looking Metaphorical Maps

Authors: Eleni Katsanou, Tamara Mchedlidze, Antonios Symvonis, and Thanos Tolias

Published in: LIPIcs, Volume 357, 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025)

Abstract
Metaphorical maps or contact representations are visual representations of vertex-weighted graphs that rely on the geographic map metaphor. The vertices are represented by countries, the weights by the areas of the countries, and the edges by contacts/boundaries among them. The accuracy with which the weights are mapped to areas and the simplicity of the polygons representing the countries are the two classical optimization goals for metaphorical maps. Mchedlidze & Schnorr [Mchedlidze and Schnorr, 2022] presented a force-based algorithm that creates metaphorical maps that balance between these two optimization goals. Their maps look visually simple, but the accuracy of the maps is far from optimal - the countries' areas can vary up to 30% compared to required. In this paper, we provide a multi-fold extension of the algorithm in [Mchedlidze and Schnorr, 2022]. More specifically: 1) Towards improving accuracy: We introduce the notion of region stiffness and suggest a technique for varying the stiffness based on the current pressure of map regions. 2) Towards maintaining simplicity: We introduce a weight coefficient to the pressure force exerted on each polygon point based on whether the corresponding point appears along a narrow passage. 3) Towards generality: We cover, in contrast to [Mchedlidze and Schnorr, 2022], non-triangulated graphs. This is done by either generating points where more than three regions meet or by introducing holes in the metaphorical map. We perform an extended experimental evaluation that, among other results, reveals that our algorithm is able to construct metaphorical maps with nearly perfect area accuracy with a little sacrifice in their simplicity.
Cite as

Eleni Katsanou, Tamara Mchedlidze, Antonios Symvonis, and Thanos Tolias. An Algorithm for Accurate and Simple-Looking Metaphorical Maps. In 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 357, pp. 40:1-40:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{katsanou_et_al:LIPIcs.GD.2025.40,
  author =	{Katsanou, Eleni and Mchedlidze, Tamara and Symvonis, Antonios and Tolias, Thanos},
  title =	{{An Algorithm for Accurate and Simple-Looking Metaphorical Maps}},
  booktitle =	{33rd International Symposium on Graph Drawing and Network Visualization (GD 2025)},
  pages =	{40:1--40:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-403-1},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{357},
  editor =	{Dujmovi\'{c}, Vida and Montecchiani, Fabrizio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2025.40},
  URN =		{urn:nbn:de:0030-drops-250268},
  doi =		{10.4230/LIPIcs.GD.2025.40},
  annote =	{Keywords: Metaphorical maps, contact representation, accuracy (cartographic error), simplicity (polygon complexity), force directed algorithm}
}
Document
DOI: 10.4230/DFU.Vol2.SciViz.2011.346
Previewing Volume Decomposition Through Optimal Viewpoints

Authors: Shigeo Takahashi, Issei Fujishiro, Yuriko Takeshima, and Chongke Bi

Published in: Dagstuhl Follow-Ups, Volume 2, Scientific Visualization: Interactions, Features, Metaphors (2011)

Abstract
Understanding a volume dataset through a 2D display is a complex task because it usually contains multi-layered inner structures that inevitably cause undesirable overlaps when projected onto the display. This requires us to identify feature subvolumes embedded in the given volume and then visualize them on the display so that we can clarify their relative positions. This article therefore introduces a new feature-driven approach to previewing volumes that respects both the 3D nested structures of the feature subvolumes and their 2D arrangement in the projection by minimizing their occlusions. The associated process begins with tracking the topological transitions of isosurfaces with respect to the scalar field, in order to decompose the given volume dataset into feature components called interval volumes while extracting their nested structures. The volume dataset is then projected from the optimal viewpoint that archives the best balanced visibility of the decomposed components. The position of the optimal viewpoint is updated each time when we peel off an outer component with our interface by calculating the sum of the viewpoint optimality values for the remaining components. Several previewing examples are demonstrated to illustrate that the present approach can offer an effective means of traversing volumetric inner structures both in an interactive and automatic fashion with the interface.
Cite as

Shigeo Takahashi, Issei Fujishiro, Yuriko Takeshima, and Chongke Bi. Previewing Volume Decomposition Through Optimal Viewpoints. In Scientific Visualization: Interactions, Features, Metaphors. Dagstuhl Follow-Ups, Volume 2, pp. 346-359, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InCollection{takahashi_et_al:DFU.Vol2.SciViz.2011.346,
  author =	{Takahashi, Shigeo and Fujishiro, Issei and Takeshima, Yuriko and Bi, Chongke},
  title =	{{Previewing Volume Decomposition Through Optimal Viewpoints}},
  booktitle =	{Scientific Visualization: Interactions, Features, Metaphors},
  pages =	{346--359},
  series =	{Dagstuhl Follow-Ups},
  ISBN =	{978-3-939897-26-2},
  ISSN =	{1868-8977},
  year =	{2011},
  volume =	{2},
  editor =	{Hagen, Hans},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DFU.Vol2.SciViz.2011.346},
  URN =		{urn:nbn:de:0030-drops-33062},
  doi =		{10.4230/DFU.Vol2.SciViz.2011.346},
  annote =	{Keywords: Interval volumes, viewpoint selection, feature-driven approach, volume peeling, nested structures}
}
  • Refine by Type
  • 2 Document/PDF
  • 1 Document/HTML

  • Refine by Publication Year
  • 1 2025
  • 1 2011

  • Refine by Author
  • 1 Bi, Chongke
  • 1 Fujishiro, Issei
  • 1 Katsanou, Eleni
  • 1 Mchedlidze, Tamara
  • 1 Symvonis, Antonios
  • Show More...

  • Refine by Series/Journal
  • 1 LIPIcs
  • 1 DFU

  • Refine by Classification
  • 1 Mathematics of computing → Graph algorithms
  • 1 Mathematics of computing → Graph theory
  • 1 Theory of computation → Graph algorithms analysis

  • Refine by Keyword
  • 1 Interval volumes
  • 1 Metaphorical maps
  • 1 accuracy (cartographic error)
  • 1 contact representation
  • 1 feature-driven approach
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact