# Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains.

K. Kumar; J. Abello; O. Egecioglu

Discrete & computational geometry (1995)

- Volume: 14, Issue: 3, page 331-358
- ISSN: 0179-5376; 1432-0444/e

## Access Full Article

top## How to cite

topKumar, K., Abello, J., and Egecioglu, O.. "Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains.." Discrete & computational geometry 14.3 (1995): 331-358. <http://eudml.org/doc/131406>.

@article{Kumar1995,

author = {Kumar, K., Abello, J., Egecioglu, O.},

journal = {Discrete & computational geometry},

keywords = {staircase polygons; simple polygon; visibility graph; persistency; adjacency matrix; maximal chains; weak Bruhat order; polynomial-time algorithm; persistent graphs},

number = {3},

pages = {331-358},

title = {Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains.},

url = {http://eudml.org/doc/131406},

volume = {14},

year = {1995},

}

TY - JOUR

AU - Kumar, K.

AU - Abello, J.

AU - Egecioglu, O.

TI - Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains.

JO - Discrete & computational geometry

PY - 1995

VL - 14

IS - 3

SP - 331

EP - 358

KW - staircase polygons; simple polygon; visibility graph; persistency; adjacency matrix; maximal chains; weak Bruhat order; polynomial-time algorithm; persistent graphs

UR - http://eudml.org/doc/131406

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.