Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

GD
1994
Springer

favoriteEmaildiscussreport

98views Computer Graphics» more GD 1994»

Visibility Graphs and Oriented Matroids

13 years 8 months ago

Visibility Graphs and Oriented Matroids

Download www.mgvis.com

We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank 3 oriented matroid can be constructed in polynomial time, which if affinely coordinatizable yields a simple polygon whose visibility graph is isomorphic to the given graph.

James Abello, Krishna Kumar

Real-time Traffic

Computer Graphics | GD 1994 | Necessary Conditions | Simple Polygon | Visibility Graph |

claim paper

Related Content

» Cubic time recognition of cocircuit graphs of uniform oriented matroids

» A characterization of cocircuit graphs of uniform oriented matroids

» Generation of Oriented Matroids A Graph Theoretical Approach

» A New Formalism to Characterize Contact States Involving Articulated Polyhedral Objects

» The positive Bergman complex of an oriented matroid

» On the Cocircuit Graph of an Oriented Matroid

» Oriented Visibility Graphs Lowcomplexity Planning in Realtime Environments

» Oriented Visibility for Multiview Reconstruction

» Applications of Parameterized stOrientations in Graph Drawing Algorithms

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1994
Where	GD
Authors	James Abello, Krishna Kumar

Comments (0)