Lower Bound of Face Guards of Polyhedral Terrains

スポンサーリンク

概要

• 論文の詳細を見る

• We study the problem of determining the minimum number of face guards which cover the surface of a polyhedral terrain. We show that ⌊(2n-5)/7⌋ face guards are sometimes necessary to guard the surface of an n-vertex triangulated polyhedral terrain.

著者

• Iwamoto Chuzo

  Hiroshima Univ. Higashihiroshima‐shi Jpn

• Morita Kenichi

  Hiroshima Univ. Higashihiroshima‐shi Jpn

• Kishi Junichi

  The City Office of Hiroshima

• Morita Kenichi

  Hiroshima University, Graduate School of Engineering

関連論文

• Normal Forms for Uniquely Parsable Grammar Classes Forming the Deterministic Chomsky Hierarchy
• On the Non-existance of Rotation-Symmetric von Neumann Neighbor Number-Conserving Cellular Automata of Which the State Number is Less than Four
• A Recursive Padding Technique on Nondeterministic Cellular Automata
• Prefix Computations on Iterative Arrays with Sequential Input/Output Mode(Cellular Automata)
• A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function(Cellular Automata)
• Lower Bound of Face Guards of Polyhedral Terrains

スポンサーリンク