ARRANGEMENTS

Submitted by:
APOORVA
SHARMA
Let L={L1,L2Ln} be a finite set of lines in the plane.
 THE ARRANGEMENT A(L) IS THE DECOMPOSITION OF THE PLANE INTO
FACES, EDGES AND VERTICES PRODUCED BY L.

vertices

face

edge
THE ARRANGEMENT A(L) IS SAID TO BE SIMPLE
IF
1) L DOES NOT CONTAIN ANY TWO PARALLEL LINES
NOR
2) ANY THREE LINES THROUGH THE SAME POINT.
COMPLEXITY The complexity of A(L) is O(n2)
Where n= no of Lines.
Specifically:
V n(n-1)/2
e n2
f (n2/2)+(n/2)+1
COMPLEXITY
The complexity o f A(L) is O(n2)
Where n= no of Lines.
Specifically:
V n(n-1)/2
e n2
f (n2/2)+(n/2)+1
 The complexity o f A(L) is O(n2)
Where n= no of lines.
COMPLEXITY Specifically:
V n(n-1)/2
e n2
f (n2/2)+(n/2)+1
Add lines incrementally

1+ =n(n+1)/2+1

Note: In this case the arrangement should be

simple.
 The complexity o f A(L) is O(n2)
Where n= no of lines
Specifically:
COMPLEXITY
V n(n-1)/2
e n2
f (n2/2)+(n/2)+1
Add lines incrementally

1+ =n(n+1)/2+1

Note: In this case the arrangement should be

simple.
HOW DO WE STORE AN ARRANGEMENT?

Data Type: doubly-connected edge-list (DCEL)

Vertex:
Coordinates, Incident Edge
Face:
an Edge
Half-Edges
Origin Vertex
Twin Edge
Incident Face
Next Edge, Prev Edge
CONSTRUCTING ARRANGEMENTS

Goal: Compute A(L) in bounding box in DCEL representation

plane sweep for line segment intersection

Faster- incremental construction

 INCREMENTAL CONSTRUCTION

Algorithm Construct Arrangement(L)

Input. Set L of n lines
Output. DCEL for A(L) in B(L)
1. Compute bounding box B(L)
2. Construct DCEL for subdivision
induced by B(L)
3. for i =1 to n
4. do insert li
 INCREMENTAL CONSTRUCTION
CONSTRUCT ARRANGEMENT ALGORITHM
Input: A set L of n lines in the plane
Output: DCEL for the subdivision induced by the part of A(L)
inside a bounding box
1. Compute a bounding box B(L) that contains all vertices of
A(L) in its interior
2. Construct the DCEL for the subdivision induced by B(L)
3. for i=1 to n
4. do Find the edge e on B(L) that contains the leftmost
intersection point of li and Ai
5. f = the bounded face incident to e
6. while f is not the face outside B(L)
7. do Split f, and set f to be the next intersected
face
INCREMENTAL CONSTRUCTION
FACE SPLIT:
APPLICATIONS

Elimination of hidden surfaces

(for n disjoint polygons in space, solved in O(n2) time by topological sweep)
Aspect graphs
Motion planning (visibility graphs)

And many more!... even for checking if 3 points are colinear

 SUMMARY

Compute arrangement of lines A(L).

Compute level of each vertex in A(L).
Use this to compute discrete measures in primal space.
We can determine how good a distribution of sample
points is in O(n2) time.