Joachim Spoerhase

Joachim Spoerhase

Auto-generated profile, based on publicly available information

Joachim Spoerhase

University of Liverpool United Kingdom

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 October 2012 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
MFMartin Fink
Martin Fink
JHJan-Henrik Haunert
Jan-Henrik Haunert
ASAndré Schulz
André Schulz
JSJoachim Spoerhase
Joachim Spoerhase
AWAlexander Wolff
Alexander Wolff
In this paper, we investigate the problem of labeling point sites in focus regions of maps or diagrams. This problem occurs, for example, when the user of a mapping service wants to see the names of restaurants or other POIs in a crowded downtown area but keep the overview over a larger area. Our approach is to place the labels at the boundary of the focus region and connect each site with its label by a linear connection, which is called a leader. In this way, we move labels from the focus region to the less valuable context region surrounding it. In order to make the leader layout well readable, we present algorithms that rule out crossings between leaders and optimize other characteristics such as total leader length and distance between labels. This yields a new variant of the boundary labeling problem, which has been studied in the literature. Other than in traditional boundary labeling, where leaders are usually schematized polylines, we focus on leaders that are either straight-line segments or Bezier curves. Further, we present algorithms that, given the sites, find a position of the focus region that optimizes the above characteristics. We also consider a variant of the problem where we have more sites than space for labels. In this situation, we assume that the sites are prioritized by the user. Alternatively, we take a new facility-location perspective which yields a clustering of the sites. We label one representative of each cluster. If the user wishes, we apply our approach to the sites within a cluster, giving details on demand.

1 September 2007 in European Journal of Operational Research
Verified
Journal Article
Closed access
HNH. Noltemeier
H. Noltemeier
JSJ. Spoerhase
J. Spoerhase
HWH.-C. Wirth
H.-C. Wirth

1 September 2015
Verified
Conference Paper
Closed access
SLStanislav Lange
Stanislav Lange
SGSteffen Gebert
Steffen Gebert
JSJoachim Spoerhase
Joachim Spoerhase
PRPiotr Rygielski
Piotr Rygielski
TZThomas Zinner
Thomas Zinner
PTPhuoc Tran-Gia
Phuoc Tran-Gia
The Software Defined Networking (SDN) concept introduces a paradigm shift in the networking world towards an externalized control plane which is logically centralized. When designing an SDN-based WAN architecture, it is of vital importance to find a feasible solution to the controller placement problem, i.e., to decide where to position a limited amount of resources within the network. In addition to time-independent constraints regarding aspects like scalability, resilience, and control plane communication delays, dynamically changing network conditions like traffic patterns or bandwidth demands need to be considered as well. Consequently, such dynamic environments call for a regular and fast recalculation of placements in order to adapt to the current situation in a timely manner. While an exhaustive evaluation of all possible solutions can be performed within a practically feasible time frame for small and medium-sized networks, such an approach is out of scope for large problem instances which have significantly higher time and memory requirements. Therefore, this work investigates a specialized heuristic, which takes into account a particular set of optimization objectives and returns solutions representing the possible trade-offs between them. Due to its low computation time and acceptable margin of error, this heuristic can be employed by automatic decision systems operating in dynamic environments.

16 October 2013 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
MFMartin Fink
Martin Fink
JHJan-Henrik Haunert
Jan-Henrik Haunert
JSJoachim Spoerhase
Joachim Spoerhase
AWAlexander Wolff
Alexander Wolff
Scatter plots are diagrams that visualize two-dimensional data as sets of points in the plane. They allow users to detect correlations and clusters in the data. Whether or not a user can accomplish these tasks highly depends on the aspect ratio selected for the plot, i.e., the ratio between the horizontal and the vertical extent of the diagram. We argue that an aspect ratio is good if the Delaunay triangulation of the scatter plot at this aspect ratio has some nice geometric property, e.g., a large minimum angle or a small total edge length. More precisely, we consider the following optimization problem. Given a set Q of points in the plane, find a scale factor s such that scaling the x-coordinates of the points in Q by s and the y-coordinates by 1=s yields a point set P(s) that optimizes a property of the Delaunay triangulation of P(s), over all choices of s. We present an algorithm that solves this problem efficiently and demonstrate its usefulness on real-world instances. Moreover, we discuss an empirical test in which we asked 64 participants to choose the aspect ratios of 18 scatter plots. We tested six different quality measures that our algorithm can optimize. In conclusion, minimizing the total edge length and minimizing what we call the 'uncompactness' of the triangles of the Delaunay triangulation yielded the aspect ratios that were most similar to those chosen by the participants in the test.

1 November 2009 in Theoretical Computer Science
Verified
Journal Article
Closed access
JSJ. Spoerhase
J. Spoerhase
HWH.-C. Wirth
H.-C. Wirth

1 January 2014
Verified
Book Chapter
Closed access
PDF file
PKPhilipp Kindermann
Philipp Kindermann
ASAndré Schulz
André Schulz
JSJoachim Spoerhase
Joachim Spoerhase
AWAlexander Wolff
Alexander Wolff