The Maximum-Level Vertex in an Arrangement of Lines

Cited by: 0|Views35

Abstract:

Let $L$ be a set of $n$ lines in the plane, not necessarily in general position. We present an efficient algorithm for finding all the vertices of the arrangement $A(L)$ of maximum level, where the level of a vertex $v$ is the number of lines of $L$ that pass strictly below $v$. The problem, posed in Exercise~8.13 in de Berg etal [BCKO0...More

Code:

Data:

Full Text
Bibtex
Your rating :
0

 

Tags
Comments