5 papers · 1 filter
Finding Regions of Maximum Circularity in Plane Geometric Graphs
Jan-Henrik Haunert, Joshua Marc Könen, Heiko Röglin +1
A problem that occurs in different applications in geographical information science is to generate compact regions from areas on a map. This is important, e.g., in the context of e…
Reconstructing the Dynamic Sea Surface from Tide Gauge Records Using Optimal Data-Dependent Triangulations
Alina Nitzke, Benjamin Niedermann, Luciana Fenoglio-Marc +2
Reconstructions of sea level prior to the satellite altimeter era are usually derived from tide gauge records; however most algorithms for this assume that modes of sea level varia…
Zoomless Maps: External Labeling Methods for the Interactive Exploration of Dense Point Sets at a Fixed Map Scale
Sven Gedicke, Annika Bonerath, Benjamin Niedermann +1
Visualizing spatial data on small-screen devices such as smartphones and smartwatches poses new challenges in computational cartography. The current interfaces for map exploration…
Balanced Independent and Dominating Sets on Colored Interval Graphs
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute +2
We study two new versions of independent and dominating set problems on vertex-colored interval graphs, namely -Balanced Independent Set (-BIS) and -Balanced Dominating Se…
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze +2
Point-set embeddings and large-angle crossings are two areas of graph drawing that independently have received a lot of attention in the past few years. In this paper, we consider…