Sciweavers

131 search results - page 1 / 27
» On the Maximum Number of Translates in a Point Set
Sort
View
DCG
2010
65views more  DCG 2010»
13 years 5 months ago
On the Maximum Number of Translates in a Point Set
Bernardo M. Ábrego, Silvia Fernández...
CCCG
2007
13 years 7 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
SODA
1996
ACM
121views Algorithms» more  SODA 1996»
13 years 7 months ago
Optimal Placement of Convex Polygons to Maximize Point Containment
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
Matthew Dickerson, Daniel Scharstein
CCCG
2003
13 years 7 months ago
On the Number of Pseudo-Triangulations of Certain Point Sets
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double...
Oswin Aichholzer, David Orden, Francisco Santos, B...
GECCO
2010
Springer
180views Optimization» more  GECCO 2010»
13 years 9 months ago
Comparison of NEWUOA with different numbers of interpolation points on the BBOB noisy testbed
In this paper, we study the performances of the NEW Unconstrained Optimization Algorithm (NEWUOA) with different numbers of interpolation points. NEWUOA is a trust region method, ...
Raymond Ros