985 search results - page 94 / 197 » Piercing Convex Sets |
153
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
164
click to vote
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
141
click to vote
ICIP
2003
IEEE
15 years 9 months ago
2003
IEEE
We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation ca...
104
click to vote
LATIN
2010
Springer
15 years 9 months ago
2010
Springer
We explore the revenue capabilities of truthful, monotone (“fair”) allocation and pricing functions for resource-constrained auction mechanisms within a general framework that ...
125
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— The task in control allocation is to determine how to generate a specified generalized force from a redundant set of control effectors where the associated actuator control in...