A measure of \(Q\)-convexity for shape analysis
From MaRDI portal
Publication:2217378
DOI10.1007/s10851-020-00962-9zbMath1496.68350OpenAlexW3033272222MaRDI QIDQ2217378
Publication date: 29 December 2020
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-020-00962-9
Computational aspects related to convexity (52B55) Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- Efficient operations on discrete paths
- Shape retrieval using triangle-area representation and dynamic space warping
- Reconstruction of convex lattice sets from tomographic projections in quartic time
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections
- A new shape descriptor based on a \(Q\)-convexity measure
- A \(Q\)-convexity vector descriptor for image analysis
- Random generation of \(Q\)-convex sets
- A Measure of Directional Convexity Inspired by Binary Tomography
- Efficient Computation of the Outer Hull of a Discrete Path
- Salient and Reentrant Points of Discrete Sets
- Computing deviations from convexity in polygons
- Polygonal entropy: A convexity measure
- A Measure of Q-Convexity
This page was built for publication: A measure of \(Q\)-convexity for shape analysis
