4 search results - page 1 / 1 » Minimal Enclosing Parallelogram with Application |
COMPGEOM
1995
ACM
13 years 9 months ago
1995
ACM
CCCG
2010
13 years 6 months ago
2010
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vector...
COMGEO
2004
ACM
13 years 5 months ago
2004
ACM
We investigate the problem of finding a minimal volume parallelepiped enclosing a given set of n threedimensional points. We give two mathematical properties of these parallelepip...
ECML
2005
Springer
13 years 11 months ago
2005
Springer
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...