Optimal conditions for connectedness of discretized sets
From MaRDI portal
Publication:2156309
DOI10.1007/S10878-020-00691-0OpenAlexW3119742886MaRDI QIDQ2156309FDOQ2156309
Authors: Boris Brimkov, Valentin E. 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
discrete geometryconnectivity controlconnected setgeometric featuresdiscrete connectivityoffset discretization
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear Programming in Linear Time When the Dimension Is Fixed
- Topological properties of Hausdorff discretization, and comparison to other discretization schemes.
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Shape and topology preserving multi-valued image pyramids for multi-resolution skeletonization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Connectivity in Digital Pictures
- Discrete linear objects in dimension n: the standard model
- Fundamentals of computer graphics.
- Genus formula for generalized offset curves
- On topology preservation of mixed operators in triangular, square, and hexagonal grids
- On connectedness of discretized sets
- Arcs and Curves in Digital Pictures
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- A topological characterization of thinning
- Three-Dimensional Digital Line Segments
- ELIMINATING EXTRANEOUS SOLUTIONS IN CURVE AND SURFACE OPERATIONS
- Simplifying curve skeletons in volume images
- Connectedness of offset digitizations in higher dimensions
- 2D parallel thinning and shrinking based on sufficient conditions for topology preservation
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Optimal conditions for connectedness of discretized sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2156309)
