Optimal conditions for connectedness of discretized sets

DOI10.1007/S10878-020-00691-0OpenAlexW3119742886MaRDI QIDQ2156309

Valentin E. Brimkov, Boris Brimkov

Publication date: 18 July 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.03053

zbMATH Keywords

discrete geometryconnectivity controlconnected setgeometric featuresdiscrete connectivityoffset discretization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• On topology preservation of mixed operators in triangular, square, and hexagonal grids
• A topological characterization of thinning
• Genus formula for generalized offset curves
• Topological properties of Hausdorff discretization, and comparison to other discretization schemes.
• A compact piecewise-linear Voronoi diagram for convex sites in the plane
• On connectedness of discretized sets
• Connectedness of Offset Digitizations in Higher Dimensions
• 2D Parallel Thinning and Shrinking Based on Sufficient Conditions for Topology Preservation
• ELIMINATING EXTRANEOUS SOLUTIONS IN CURVE AND SURFACE OPERATIONS
• Three-Dimensional Digital Line Segments
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Linear Programming in Linear Time When the Dimension Is Fixed
• Simplifying curve skeletons in volume images
• Discrete linear objects in dimension n: the standard model
• Shape and topology preserving multi-valued image pyramids for multi-resolution skeletonization
• Connectivity in Digital Pictures
• Arcs and Curves in Digital Pictures

This page was built for publication: Optimal conditions for connectedness of discretized sets