Torsten Ueckerdt

Papers

Total Citations

H-Index

About

Torsten Ueckerdt is a leading figure in discrete mathematics and computational geometry, whose work bridges the gap between abstract combinatorial structures and real-world applications in rigidity theory and structural mechanics. His research focuses on the combinatorial and geometric properties of planar graphs, particularly Laman graphs, which are central to understanding minimally rigid bar-and-joint frameworks. In his highly cited 2013 paper, Ueckerdt introduced three novel combinatorial structures for planar Laman graphs, providing powerful new tools for analyzing rigidity in robotics, molecular chemistry, and polymer physics. This work, with over 120 citations, has become a cornerstone for researchers studying the intersection of graph theory and mechanical systems. Beyond rigidity, Ueckerdt has made significant contributions to graph drawing, planar embeddings, and the theory of geometric graphs. His ability to distill complex geometric constraints into elegant combinatorial models has made his research highly influential, inspiring further advances in both theoretical computer science and applied engineering.