19 citations · 20 across the 5 of their papers we have counts for
3 papers · 1 filter
Optimal conditions for connectedness of discretized sets
Boris Brimkov, Valentin E. Brimkov
Constructing a discretization of a given set is a major problem in various theoretical and applied disciplines. An offset discretization of a set is obtained by taking the inte…
Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique
Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer +5
We study the {\sc Clique} problem in classes of intersection graphs of convex sets in the plane. The problem is known to be NP-complete in convex-set intersection graphs and straig…
An explicit formula for the number of tunnels in digital objects
Valentin Brimkov, Angelo Maimone, Giorgio Nordo
An important concept in digital geometry for computer imagery is that of tunnel. In this paper we obtain a formula for the number of tunnels as a function of the number of the obje…