Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Emo Welzl

Known as: Emmerich Welzl, Welzl 
Emmerich (Emo) Welzl (born 4 August 1958 in Linz, Austria) is a computer scientist known for his research in computational geometry. He is a… Expand
Wikipedia

Related topics

Related topics

17 relations
Bounding sphereComputational geometryComputational learning theoryData structure
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
New Lower Bounds for epsilon-Nets
Following groundbreaking work by Haussler and Welzl (1987), the use of small epsilon-nets has become a standard technique for… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Measuring emotions in students learning and performance: The Achievement Emotions Questionnaire (AE
Abstract Aside from test anxiety scales, measurement instruments assessing students’ achievement emotions are largely lacking… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Geometric Range Searching and Its Relatives
About ten years ago, the eld of range searching, especially simplex range searching, was wide open. At that time, neither e cient… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2005
2005
Maximizing a Voronoi Region: the Convex Case
Given a set S of s points in the plane, where do we place a new point, p, in order to maximize the area of its region in the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
Multicolour Discrepancies
In this article we introduce combinatorial multicolour discrepancies and generalize several classical results from $2$-colour… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Geometry Helps in Bottleneck Matching and Related Problems
Abstract. Let A and B be two sets of n objects in \realsd , and let Match be a (one-to-one) matching between A and B . Let min… Expand
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A combinatorial approach to planar non-colliding robot arm motion planning
  • I. Streinu
  • Proceedings 41st Annual Symposium on Foundations…
  • 2000
    • Corpus ID: 9420124
We propose a combinatorial approach to plan noncolliding motions for a polygonal bar-and-joint framework. Our approach yields… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Handbook of Discrete and Computational Geometry, Second Edition
COMBINATORIAL AND DISCRETE GEOMETRY Finite Point Configurations, J. Pach Packing and Covering, G. Fejes Toth Tilings, D… Expand
Is this relevant?
1996
1996
The igneous geochemistry and tectonic setting of metabasites from the emo metamorphics, Papua New Guinea; A record of the evolution and destruction of a backarc basin
SummaryMetabasites from the Emo Metamorphics, occurring as thrust sheets beneath the Papuan ophiolite of Papua New Guinea, fall… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Improvements on bottleneck matching and related problems using geometry
Let A and B be two sets of n objects in R d. we propose to use bottleneck mat chtng as a convenient way for measuring the… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE