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… (More)
Wikipedia

Related topics

Related topics

16 relations
Bounding sphereComputational geometryComputational learning theoryData structure
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Order compression schemes
Sample compression schemes are schemes for “encoding” a set of examples in a small subset of examples. The long-standing open… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2012
Highly Cited
2012
AffectAura: an intelligent system for emotional memory
We present AffectAura, an emotional prosthetic that allows users to reflect on their emotional states over long periods of time… (More)
  • figure 2
  • figure 3
  • figure 4
  • table 1
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A deterministic subexponential algorithm for solving parity games
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
An Affective Model of Interplay between Emotions and Learning: Reengineering Educational Pedagogy - Building a Learning Companion
There is an interplay between emotions and learning, but this interaction is far more complex than previous theories have… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Geometry Helps in Bottleneck Matching and Related Problems
Let A and B be two sets of n objects in \reals d , and let Match be a (one-to-one) matching between A and B . Let min(Match… (More)
  • 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
We propose a combinatorial approach to plan noncolliding motions for a polygonal bar-and-joint framework. Our approach yields… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications
Partitioning a multi-dimensional data set into rectangular partitions subject to certain constraints is an important problem that… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
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… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
On Geometric Optimization with Few Violated Constraints
We investigate the problem of finding the best solution satisfying all but k of the given constraints, for an abstract class of… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Optimal Binary Space Partitions for Orthogonal Objects
A binary space parWon, or BSP, is a scheme for recursively dividing a configuration of objects by hyperplanes until all objects… (More)
Is this relevant?