Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains

DOI10.1007/BF02570710MaRDI QIDQ1900971zbMATH OpenFDO

Authors Yanyan Li

Publication date 8 April 1996

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/131406

zbMATH Keywords

adjacency matrixpolynomial-time algorithmsimple polygonvisibility graphweak Bruhat ordermaximal chainspersistencystaircase polygonspersistent graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of representation theory (05E10) Combinatorics of partially ordered sets (06A07)

Recommendations

• A note on the combinatorial structure of the visibility graph in simple polygons
• VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
• On the number of visibility graphs of simple polygons
• scientific article; zbMATH DE number 434872
• Some results on visibility graphs
• A characterization of visibility graphs for pseudo-polygons
• A note on rectilinear and polar visibility graphs
• Visibility graphs of 2-spiral polygons (extended abstract)
• Visibility graphs and oriented matroids
• A P-Completeness Result for Visibility Graphs of Simple Polygons

Cites work

• scientific article; zbMATH DE number 434872 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 3895080 (Why is no real title available?)
• scientific article; zbMATH DE number 3216275 (Why is no real title available?)
• A unified approach to visibility representations of planar graphs
• DISTANCE VISIBILITY GRAPHS
• Generalized quadrangles associated with \(G_ 2(\)q)
• Recognizing visibility graphs of spiral polygons
• Semispaces of configurations, cell complexes of arrangements
• The Weak Bruhat Order of $\text{S}_\Sigma $, Consistent Sets, and Catalan Numbers
• Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
• VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
• Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains

Cited in

(12)

• VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
• Characterizing and recognizing the visibility graph of a funnel-shaped polygon
• Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
• A fast shortest path algorithm on terrain-like graphs
• ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES
• Reconstructing generalized staircase polygons with uniform step length
• Reconstructing generalized staircase polygons with uniform step length
• Persistent graphs and cyclic polytope triangulations
• Parameterized Analysis of Art Gallery and Terrain Guarding
• On recognizing and characterizing visibility graphs of simple polygons
• Coloring polygon visibility graphs and their generalizations
• Visibility graphs of towers

This page was built for publication: Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900971)