2022 - Research.com Mathematics in Switzerland Leader Award
2006 - Member of Academia Europaea
2005 - German National Academy of Sciences Leopoldina - Deutsche Akademie der Naturforscher Leopoldina – Nationale Akademie der Wissenschaften Informatics
1998 - ACM Fellow For orignial contributions in geometric and combinatorial algorithms and for bringing together discrete mathematics and algorithmics.
His main research concerns Combinatorics, Discrete mathematics, Computational geometry, Set and Data structure. He is interested in Binary logarithm, which is a field of Combinatorics. His Discrete mathematics study integrates concerns from other disciplines, such as Simplex, Range searching and Combinatorial complexity.
His work carried out in the field of Computational geometry brings together such families of science as Range and Plane. His Set research is multidisciplinary, relying on both Space and Structure. While the research belongs to areas of Data structure, Emo Welzl spends his time largely on the problem of Time complexity, intersecting his research to questions surrounding Range, Linear space, Hypersphere and VC dimension.
Combinatorics, Discrete mathematics, Plane, Upper and lower bounds and General position are his primary areas of study. Emo Welzl is studying Binary logarithm, which is a component of Combinatorics. The various areas that he examines in his Discrete mathematics study include Computational geometry and Point set.
His studies in Plane integrate themes in fields like Line and Finite set. His General position research also works with subjects such as
Emo Welzl mainly focuses on Combinatorics, Discrete mathematics, General position, Order type and Planar graph. He interconnects Point and Plane in the investigation of issues within Combinatorics. His work on Satisfiability as part of general Discrete mathematics study is frequently linked to Sampling, therefore connecting diverse disciplines of science.
His biological study spans a wide range of topics, including Extreme point and Convex hull, Regular polygon. Emo Welzl usually deals with Convex hull and limits it to topics linked to Polytope and Binary logarithm. His study in Order type is interdisciplinary in nature, drawing from both Characterization and Spatial network.
His primary areas of investigation include Combinatorics, Discrete mathematics, General position, Upper and lower bounds and Spanning tree. His study in the field of Euclidean shortest path is also linked to topics like Yen's algorithm. Emo Welzl specializes in Discrete mathematics, namely Planar graph.
His research in General position tackles topics such as Order type which are related to areas like Antipodal point, Extreme point, Regular polygon and Distribution. The study incorporates disciplines such as Minimum degree spanning tree, Plane, Point set and Linear algebra in addition to Upper and lower bounds. His research in Spanning tree intersects with topics in 1-planar graph, Spatial network, Dual graph and Graph.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
ź-nets and simplex range queries
David Haussler;Emo Welzl.
Discrete and Computational Geometry (1987)
ź-nets and simplex range queries
David Haussler;Emo Welzl.
Discrete and Computational Geometry (1987)
A subexponential bound for linear programming
Jirí Matousek;Micha Sharir;Micha Sharir;Emo Welzl.
Algorithmica (1996)
A subexponential bound for linear programming
Jirí Matousek;Micha Sharir;Micha Sharir;Emo Welzl.
Algorithmica (1996)
Combinatorial complexity bounds for arrangements of curves and spheres
Kenneth L. Clarkson;Herbert Edelsbrunner;Leonidas J. Guibas;Micha Sharir.
Discrete and Computational Geometry (1990)
Combinatorial complexity bounds for arrangements of curves and spheres
Kenneth L. Clarkson;Herbert Edelsbrunner;Leonidas J. Guibas;Micha Sharir.
Discrete and Computational Geometry (1990)
Constructing the visibility graph for n-line segments in O(n2) time
Emo Welzl.
Information Processing Letters (1985)
Constructing the visibility graph for n-line segments in O(n2) time
Emo Welzl.
Information Processing Letters (1985)
Congruence, similarity, and symmetries of geometric objects
H. Alt;K. Mehlhorn;H. Wagener;E. Welzl.
symposium on computational geometry (1987)
Congruence, similarity, and symmetries of geometric objects
H. Alt;K. Mehlhorn;H. Wagener;E. Welzl.
symposium on computational geometry (1987)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Tel Aviv University
Institute of Science and Technology Austria
Charles University
Alfréd Rényi Institute of Mathematics
Max Planck Institute for Informatics
Duke University
Freie Universität Berlin
Leiden University
Princeton University
University of Leicester
University of Cambridge
Purdue University West Lafayette
Ben-Gurion University of the Negev
Masaryk University
University of KwaZulu-Natal
Rice University
University of the Ryukyus
Centre national de la recherche scientifique, CNRS
University of California, San Francisco
Federal University of Sao Paulo
Leiden University
University of Queensland
University of Nebraska–Lincoln
Mayo Clinic
University of Worcester
Pompeu Fabra University