Sciweavers

1672 search results - page 124 / 335
» Tightness problems in the plane
Sort
View
SODA
2004
ACM
127views Algorithms» more  SODA 2004»
15 years 7 months ago
An optimal randomized algorithm for maximum Tukey depth
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
Timothy M. Chan
BMVC
1998
15 years 7 months ago
3D Trajectories from a Single Viewpoint using Shadows
We consider the problem of obtaining the 3D trajectory of a ball from a sequence of images taken with a camera which is possibly rotating and zooming (but not translating). Techni...
Ian D. Reid, A. North
CORR
2010
Springer
54views Education» more  CORR 2010»
15 years 6 months ago
Polynomial integration on regions defined by a triangle and a conic
We present an efficient solution to the following problem, of relevance in a numerical optimization scheme: calculation of integrals of the type ZZ T {f0} 12 dx dy for quadratic p...
David Sevilla, Daniel Wachsmuth
EJC
2010
15 years 5 months ago
Perfect matchings with restricted intersection in cubic graphs
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
Tomás Kaiser, André Raspaud
JMIV
2008
268views more  JMIV 2008»
15 years 5 months ago
A Fast Marching Method for the Area Based Affine Distance
In this paper we consider the problem of computing the area-based affine distance for a convex domain in the plane. Since this affine distance satisfies a non-homogeneous Monge-Amp...
Moacyr A. H. B. da Silva, Ralph Teixeira, Sin&eacu...