DeepAI AI Chat

Minimizing Visible Edges in Polyhedra

08/20/2022

∙

by Csaba D. Tóth, et al.

∙

JAIST

∙

Universidad Nacional Autonoma de Mexico

∙

California State University, Northridge

∙

∙

We prove that, given a polyhedron 𝒫 in ℝ^3, every point in ℝ^3 that does not see any vertex of 𝒫 must see eight or more edges of 𝒫; this bound is tight. More generally, this remains true if 𝒫 is any finite arrangement of internally disjoint polygons in ℝ^3.

Csaba D. Tóth
36 publications
Jorge Urrutia
13 publications
Giovanni Viglietta
14 publications

page 1

page 2

page 3

page 4

∙ 06/24/2020

Guarding Quadrangulations and Stacked Triangulations with Edges

Let G = (V,E) be a plane graph. A face f of G is guarded by an edge vw ∈...

0 Paul Jungeblut, et al. ∙

∙ 08/25/2021

On the number of edges of separated multigraphs

We prove that the number of edges of a multigraph G with n vertices is a...

0 Jacob Fox, et al. ∙

∙ 04/23/2019

Hierarchical b-Matching

A matching of a graph is a subset of edges no two of which share a commo...

0 Yuval Emek, et al. ∙

∙ 08/19/2020

Augmenting Geometric Graphs with Matchings

We study noncrossing geometric graphs and their disjoint compatible geom...

0 Alexander Pilz, et al. ∙

∙ 10/17/2017

A tight Erdős-Pósa function for wheel minors

Let W_t denote the wheel on t+1 vertices. We prove that for every intege...

0 Pierre Aboulker, et al. ∙

∙ 08/18/2017

Optimally Guarding 2-Reflex Orthogonal Polyhedra by Reflex Edge Guards

We study the problem of guarding an orthogonal polyhedron having reflex ...

0 Giovanni Viglietta, et al. ∙