Obstacle Numbers of Planar Graphs
| Autor: | John Gimbel, Patrice Ossona de Mendez, Pavel Valtr |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Physics
Mathematics::Number Theory Visibility graph 0102 computer and information sciences 02 engineering and technology 01 natural sciences Graph Planar graph Vertex (geometry) Computer Science::Robotics Combinatorics symbols.namesake 010201 computation theory & mathematics Obstacle 0202 electrical engineering electronic engineering information engineering symbols 020201 artificial intelligence & image processing General position |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783319739144 Graph Drawing |
| DOI: | 10.1007/978-3-319-73915-1_6 |
| Popis: | Given finitely many connected polygonal obstacles \(O_1,\dots ,O_k\) in the plane and a set P of points in general position and not in any obstacle, the visibility graph of P with obstacles \(O_1,\dots ,O_k\) is the (geometric) graph with vertex set P, where two vertices are adjacent if the straight line segment joining them intersects no obstacle. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|