Sciweavers

COMPGEOM
2008
ACM
14 years 10 months ago
The complexity of the outer face in arrangements of random segments
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sh...