Pages that link to "Item:Q1827813"
From MaRDI portal
The following pages link to An elementary algorithm for digital arc segmentation (Q1827813):
Displaying 18 items.
- Topological relations between separating circles (Q387873) (← links)
- On covering a digital disc with concentric circles in \(\mathbb Z^2\) (Q393104) (← links)
- Measure of circularity for parts of digital boundaries and its fast computation (Q733129) (← links)
- Number-theoretic interpretation and construction of a digital circle (Q947123) (← links)
- Digitization scheme that assures faithful reconstruction of plane figures (Q1023427) (← links)
- Determining digital circularity using integer intervals (Q1932889) (← links)
- Efficiently testing digital convexity and recognizing digital convex polygons (Q2203347) (← links)
- Fast circular arc segmentation based on approximate circularity and cuboid graph (Q2251258) (← links)
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces (Q2403743) (← links)
- Digital circles, spheres and hyperspheres: from morphological models to analytical characterizations and topological properties (Q2444559) (← links)
- Recognition of Digital Hyperplanes and Level Layers with Forbidden Points (Q3003530) (← links)
- Segmentation of Discrete Curves into Fuzzy Segments (Q3438932) (← links)
- On Three Constrained Versions of the Digital Circular Arc Recognition Problem (Q3648770) (← links)
- Multiscale Discrete Geometry (Q3648778) (← links)
- Ellipse Detection with Elemental Subsets (Q3648781) (← links)
- Digital Geometry in Image-Based Metrology (Q4648745) (← links)
- Separability and Tight Enclosure of Point Sets (Q4648754) (← links)
- Digital Straightness, Circularity, and Their Applications to Image Analysis (Q4648755) (← links)
