Sciweavers

243 search results - page 30 / 49
» The Geometry of Strict Maximality
Sort
View
COCOA
2007
Springer
14 years 4 months ago
Fundamental Domains for Integer Programs with Symmetries
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
Eric J. Friedman
SIBGRAPI
2006
IEEE
14 years 3 months ago
Point set compression through BSP quantization
This work introduces a new compression scheme for point sets. This scheme relies on an adaptive binary space partition (BSP) which takes into account the geometric structure of the...
Alex Laier Bordignon, Thomas Lewiner, Hélio...
COMPGEOM
2006
ACM
14 years 3 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
ECML
2005
Springer
14 years 3 months ago
Fitting the Smallest Enclosing Bregman Ball
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learnin...
Richard Nock, Frank Nielsen
ICRA
1998
IEEE
100views Robotics» more  ICRA 1998»
14 years 2 months ago
Two Methods for Interpolating Rigid Body Motions
This paper investigates methods for computing a smooth motion that interpolates a given set of positions and orientations of a rigid body. To make the interpolation independent of...
Milos Zefran, Vijay Kumar