50 search results - page 2 / 10 » Computational Experience with an Interior Point Cutting Plan... |
162
click to vote
WADS
2009
Springer
15 years 11 months ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
136
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...
163
click to vote
SIAMJO
2010
14 years 11 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
125
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We propose a novel multivariate uniformity criterion for testing uniformity of point density in an arbitrary dimensional point pattern . An unsupervised, nonparametric data cluste...
134
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...