Brimkov, B.[Boris]
* 2008: Offset Approach to Defining 3D Digital Lines
* 2009: Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD
* 2013: Memory Efficient Shortest Path Algorithms for Cactus Graphs
* 2017: On Sets of Line Segments Featuring a Cactus Structure
* 2020: On Connectedness of Discretized Sets
Brimkov, V.E.[Valentin E.]
* 2002: Object Discretizations in Higher Dimensions
* 2004: Curves, Hypersurfaces, and Good Pairs of Adjacency Relations
* 2005: Number of Gaps in Binary Pictures, The
* 2006: Computational Aspects of Digital Plane and Hyperplane Recognition
* 2006: Counting Gaps in Binary Pictures
* 2006: On the Notion of Dimension in Digital Spaces
* 2006: Polyhedrization of Discrete Convex Volumes
* 2007: Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model
* 2008: Border and Surface Tracing: Theoretical Foundations
* 2008: Linear Time Constant-Working Space Algorithm for Computing the Genus of a Digital Object
* 2008: Offset Approach to Defining 3D Digital Lines
* 2008: Scaling of Plane Figures That Assures Faithful Digitization
* 2009: Advances in combinatorial image analysis
* 2009: Combining ubiquitous direction-sensitive digitizing with a multimedia electronic dictionary for enhanced understanding
* 2009: Digitization scheme that assures faithful reconstruction of plane figures
* 2009: Guest editorial: Contemporary challenges in combinatorial image analysis
* 2009: Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD
* 2009: On the Convex Hull of the Integer Points in a Bi-circular Region
* 2009: Theoretical Issues of Cluster Pattern Interfaces
* 2010: Connectedness of Offset Digitizations in Higher Dimensions
* 2010: Digital Stars and Visibility of Digital Objects
* 2010: Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments
* 2011: Complexity and Approximability Issues in Combinatorial Image Analysis
* 2012: Digital Geometry Algorithms
* 2013: On Connectedness of Discretized Objects
* 2014: Knapsack Intersection Graphs and Efficient Computation of Their Maximal Cliques
* 2014: On Intersection Graphs of Convex Polygons
* 2014: Parallel Algorithms for Combinatorial Pattern Matching
* 2015: On the Connectivity and Smoothness of Discrete Spherical Circles
* 2020: Dealing with Noise in Cluster Pattern Interface
* 2020: On Connectedness of Discretized Sets
31 for Brimkov, V.E.
Brimley, G.[Gary]
* 2008: adaptive QIM- and SVD-based digital image watermarking scheme in the wavelet domain, An