Personal tools
You are here: Home Projects Internal Projects The Complexity of the Outer Face in Arrangements of Random Segments
« May 2017 »
May
SuMoTuWeThFrSa
123456
78910111213
14151617181920
21222324252627
28293031
Log in


Forgot your password?
 

The Complexity of the Outer Face in Arrangements of Random Segments

square during
Outer face segments randomly generated in a square.

Abstract

  We investigate the complexity of the outer face in arrangements of line segments of a fixed length l in the plane, drawn uniformly at random within a square. We derive upper bounds on the expected complexity of the outer face, and establish 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 proportional to sqrt(n). Our study is motivated by the analysis of a practical point-location algorithm (so-called walk-along- a-line point-location algorithm) and indeed, it explains experimental observations of the behavior of the algorithm on arrangements of random segments.

 

Illustrations

The following illustrations demonstrate phase transition in the number of outer face segments randomly generated in a disc/square.

  1. Almost all of the outer face segments are near the boundary.
  2. The outer face segments appear both inside and on the boundary.
  3. Almost all the segments are on the outer face.
Movies showing the full transition can be downloaded below.
 
disc before disc during disc after
Phase transition in the number of outer face segments randomly generated in a disc.

 

square before square during square after
Phase transition in the number of outer face segments randomly generated in a square.

Movies

Movies demonstrating the full transition illustrated above are available for download:

  • Disc Movie [avi]
  • Square Movie [avi]

Links

Contact

Oren Nechushtan http://www.cs.tau.ac.il/~theoren theoren@post.tau.ac.il
Dan Halperin http://acg.cs.tau.ac.il/danhalperin danha@post.tau.ac.il
Document Actions