Sciweavers

985 search results - page 18 / 197
» Piercing Convex Sets
Sort
View
CCCG
2007
13 years 9 months ago
On the Number of Empty Pseudo-Triangles in Point Sets
We analyze the minimum and maximum number of empty pseudo-triangles defined by any planar point set. We consider the cases where the three convex vertices are fixed and where th...
Marc J. van Kreveld, Bettina Speckmann
GD
2004
Springer
14 years 1 months ago
Long Alternating Paths in Bicolored Point Sets
Given n red and n blue points in convex position in the plane, we show that there exists a noncrossing alternating path of length n + c n log n . We disprove a conjecture of Erd˝o...
Jan Kyncl, János Pach, Géza Tó...
JGO
2008
98views more  JGO 2008»
13 years 7 months ago
Duality for almost convex optimization problems via the perturbation approach
Abstract. We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from th...
Radu Ioan Bot, Gábor Kassay, Gert Wanka
PAMI
2012
11 years 10 months ago
Face Recognition Using Sparse Approximated Nearest Points between Image Sets
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
Yiqun Hu, Ajmal S. Mian, Robyn A. Owens
COMGEO
2004
ACM
13 years 7 months ago
Convexity minimizes pseudo-triangulations
The number of minimum pseudo-triangulations is minimized for point sets in convex position. 2004 Elsevier B.V. All rights reserved.
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasse...