12 search results - page 2 / 3 » Discrepancy with respect to convex polygons |
121
click to vote
IWPEC
2004
Springer
15 years 7 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
99
Voted
IOR
2008
15 years 1 months ago
2008
A facility has to be located within a given region taking two criteria of equity and efficiency into account. Equity is sought by minimizing the inequality in the inhabitant-facil...
113
click to vote
ALGORITHMICA
1998
15 years 1 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
113
click to vote
WADS
2005
Springer
15 years 7 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
113
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...