Related references
Note: Only part of the references are listed.
Article
Computer Science, Theory & Methods
Ortho-polygon visibility representations of 3-connected 1-plane graphs
Giuseppe Liotta et al.
Summary: The paper explores the concept of ortho-polygon visibility representation (OPVR) in embedded graphs, introduces the notion of vertex complexity, and demonstrates that a vertex complexity of 5 is always sufficient in 3-connected 1-plane graphs, while sometimes a complexity of 4 may be required.
THEORETICAL COMPUTER SCIENCE (2021)
Article
Computer Science, Software Engineering
Ortho-polygon Visibility Representations of Embedded Graphs
Emilio Di Giacomo et al.
ALGORITHMICA (2018)
Article
Computer Science, Theory & Methods
A general notion of visibility graphs
M Develin et al.
DISCRETE & COMPUTATIONAL GEOMETRY (2003)
Share Paper
