Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Complexity of the Outer Face in Arrangements of Random Segments
 

Summary: The Complexity of the Outer Face in Arrangements of
Random Segments

Noga Alon Dan Halperin Oren Nechushtan Micha Sharir
School of Computer Science
Tel-Aviv University, Israel
{nogaa,danha,theoren,michas}@post.tau.ac.il
ABSTRACT
We investigate the complexity of the outer face in arrange-
ments of line segments of a fixed length in the plane, drawn
uniformly at random within a square. We derive upper
bounds on the expected complexity of the outer face, and es-
tablish a certain phase transition phenomenon during which
the expected complexity of the outer face drops sharply as
a function of the total number of segments. In particular
we show that up till the phase transition the complexity of
the outer face is almost linear in n, and that after the phase
transition, the complexity of the outer face is roughly pro-
portional to

  

Source: Alon, Noga - School of Mathematical Sciences, Tel Aviv University

 

Collections: Mathematics