4 search results - page 1 / 1 » Combinatorial Complexity of Translating a Box in Polyhedral ... |
COMPGEOM
1993
ACM
13 years 9 months ago
1993
ACM
COMGEO
1998
ACM
13 years 5 months ago
1998
ACM
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
COMPGEOM
1995
ACM
13 years 9 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...