• Publications
  • Influence
Advances in Neural Information Processing Systems (NIPS)
  • 441
  • 56
A Novel Type of Skeleton for Polygons
TLDR
A new internal structure for simple polygons, the straight skeleton, is introduced and discussed. Expand
  • 225
  • 21
Understanding and using linear programming
TLDR
What Is It, and What For?.- Examples.- Integer Programming and LP Relaxation.- Theory of Linear Programming. Expand
  • 299
  • 15
  • PDF
A Novel Type of Skeleton for Polygons
TLDR
A new internal structure for simple polygons, the straight skeleton, is introduced. Expand
  • 133
  • 11
  • PDF
Fast and Robust Smallest Enclosing Balls
TLDR
I describe a C++ program for computing the smallest enclosing ball of a point set in d-dimensional space, using floating-point arithmetic only. Expand
  • 175
  • 9
  • PDF
Coresets for polytope distance
TLDR
We prove asymptotically matching upper and lower bounds on the size of coresets, stating that µ-coresets of size (1+o(1)) E*/µ do always exist as µ-0, and that this is best possible. Expand
  • 62
  • 9
  • PDF
Fast Smallest-Enclosing-Ball Computation in High Dimensions
TLDR
We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. Expand
  • 111
  • 6
  • PDF
A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization
TLDR
We provide the first theoretical analysis of multiple pricing , a heuristic used in the simplex method for linear programming in order to reduce a large problem to few small ones. Expand
  • 47
  • 5
  • PDF
Optimization of Convex Functions with Random Pursuit
We consider unconstrained randomized optimization of convex objective functions. We analyze the Random Pursuit algorithm, which iteratively computes an approximate solution to the optimizationExpand
  • 41
  • 5
  • PDF
...
1
2
3
4
5
...