Michael A. Bekos is currently a postdoctoral researcher at the Algorithmic group of the Department of Computer Science of the University of TMichael A. Bekos is currently a postdoctoral researcher at the Algorithmic group of the Department of Computer Science of the University of Tübingen in Germany, while recently he was appointed as an assistant professor at the Department of Mathematics of the University of Ioannina in Greece. In 2009, he received a Ph.D. in Theoretical Computer Science from the National Technical University of Athens. His research interests primarily focus on the development of algorithms to solve problems mostly from the research areas of Map Labeling, Graph Drawing, and Graph Theory. His research work counts more than 100 peer-reviewed research papers, and among them more than 15 on various aspects of labeling.Benjamin Niedermann obtained his Ph.D. in Computer Science from the Karlsruhe Institute of Technology (KIT), Germany, in 2017. From 2017—2021, he wasa member of the research group Geoinformation at the University of Bonn. His research interests comprise the development of efficient algorithms in Computational Geometry, Computational Cartography, and Geoprocessing. One main focus of his research is label placement in figures, maps, and dynamic scenes. It includes mathematical models, the design of algorithms with provable guarantees, as well as the empirical evaluation of the algorithms in real-world scenarios.Martin Nöllenburg is a full professor in the Algorithms and Complexity Group at TU Wien, Vienna, Austria. He obtained a Ph.D. and habilitation degrees in Computer Science from the Karlsruhe Institute of Technology (KIT) in 2009 and 2015, respectively, and joined TU Wien as an assistant professor in 2015. His research interests include the engineering of graph and geometric algorithms, in particular for the visualization of networks and spatial data. He has published more than 140 peer-reviewed research papers, and among them more than 35 on various aspects of internal and external labeling algorithms.

• Bibliography.- Preface.- Acknowledgments.- Figure Credits.- Introduction.- A Unified Taxonomy.- Visual Aspects of External Labeling.- Labeling Techniques.- External Labelings with Straight-Line Leaders.- External Labelings with Polyline Leaders.- Conclusions and Outlook.- Bibliography.- Authors' Biographies.- Index .

Michael A. Bekos is currently a postdoctoral researcher at the Algorithmic group of the Department of Computer Science of the University of TMichael A. Bekos is currently a postdoctoral researcher at the Algorithmic group of the Department of Computer Science of the University of Tübingen in Germany, while recently he was appointed as an assistant professor at the Department of Mathematics of the University of Ioannina in Greece. In 2009, he received a Ph.D. in Theoretical Computer Science from the National Technical University of Athens. His research interests primarily focus on the development of algorithms to solve problems mostly from the research areas of Map Labeling, Graph Drawing, and Graph Theory. His research work counts more than 100 peer-reviewed research papers, and among them more than 15 on various aspects of labeling.Benjamin Niedermann obtained his Ph.D. in Computer Science from the Karlsruhe Institute of Technology (KIT), Germany, in 2017. From 2017—2021, he wasa member of the research group Geoinformation at the University of Bonn. His research interests comprise the development of efficient algorithms in Computational Geometry, Computational Cartography, and Geoprocessing. One main focus of his research is label placement in figures, maps, and dynamic scenes. It includes mathematical models, the design of algorithms with provable guarantees, as well as the empirical evaluation of the algorithms in real-world scenarios.Martin Nöllenburg is a full professor in the Algorithms and Complexity Group at TU Wien, Vienna, Austria. He obtained a Ph.D. and habilitation degrees in Computer Science from the Karlsruhe Institute of Technology (KIT) in 2009 and 2015, respectively, and joined TU Wien as an assistant professor in 2015. His research interests include the engineering of graph and geometric algorithms, in particular for the visualization of networks and spatial data. He has published more than 140 peer-reviewed research papers, and among them more than 35 on various aspects of internal and external labeling algorithms.

• Bibliography.- Preface.- Acknowledgments.- Figure Credits.- Introduction.- A Unified Taxonomy.- Visual Aspects of External Labeling.- Labeling Techniques.- External Labelings with Straight-Line Leaders.- External Labelings with Polyline Leaders.- Conclusions and Outlook.- Bibliography.- Authors' Biographies.- Index .

Michael A. Bekos is currently a postdoctoral researcher at the Algorithmic group of the Department of Computer Science of the University of TMichael A. Bekos is currently a postdoctoral researcher at the Algorithmic group of the Department of Computer Science of the University of Tübingen in Germany, while recently he was appointed as an assistant professor at the Department of Mathematics of the University of Ioannina in Greece. In 2009, he received a Ph.D. in Theoretical Computer Science from the National Technical University of Athens. His research interests primarily focus on the development of algorithms to solve problems mostly from the research areas of Map Labeling, Graph Drawing, and Graph Theory. His research work counts more than 100 peer-reviewed research papers, and among them more than 15 on various aspects of labeling.Benjamin Niedermann obtained his Ph.D. in Computer Science from the Karlsruhe Institute of Technology (KIT), Germany, in 2017. From 2017—2021, he wasa member of the research group Geoinformation at the University of Bonn. His research interests comprise the development of efficient algorithms in Computational Geometry, Computational Cartography, and Geoprocessing. One main focus of his research is label placement in figures, maps, and dynamic scenes. It includes mathematical models, the design of algorithms with provable guarantees, as well as the empirical evaluation of the algorithms in real-world scenarios.Martin Nöllenburg is a full professor in the Algorithms and Complexity Group at TU Wien, Vienna, Austria. He obtained a Ph.D. and habilitation degrees in Computer Science from the Karlsruhe Institute of Technology (KIT) in 2009 and 2015, respectively, and joined TU Wien as an assistant professor in 2015. His research interests include the engineering of graph and geometric algorithms, in particular for the visualization of networks and spatial data. He has published more than 140 peer-reviewed research papers, and among them more than 35 on various aspects of internal and external labeling algorithms.

• Bibliography.- Preface.- Acknowledgments.- Figure Credits.- Introduction.- A Unified Taxonomy.- Visual Aspects of External Labeling.- Labeling Techniques.- External Labelings with Straight-Line Leaders.- External Labelings with Polyline Leaders.- Conclusions and Outlook.- Bibliography.- Authors' Biographies.- Index .