Pages that link to "Item:Q2573245"
From MaRDI portal
The following pages link to An elementary digital plane recognition algorithm (Q2573245):
Displaying 20 items.
- An output-sensitive algorithm to compute the normal vector of a digital plane (Q265048) (← links)
- Gift-wrapping based preimage computation algorithm (Q834263) (← links)
- Digital planarity -- a review (Q869568) (← links)
- A generalized preimage for the digital analytical hyperplane recognition (Q1003708) (← links)
- Digitization scheme that assures faithful reconstruction of plane figures (Q1023427) (← links)
- Quasi-affine transformations: Tilings by reciprocal images (Q1366679) (← links)
- Detecting planar patches in an unorganised set of points in space (Q1599381) (← links)
- Recognition of digital polyhedra with a fixed number of faces is decidable in dimension 3 (Q1690410) (← links)
- An optimized framework for plane-probing algorithms (Q2203351) (← links)
- Two plane-probing algorithms for the computation of the normal vector to a digital plane (Q2403741) (← links)
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces (Q2403743) (← links)
- Recognition of Digital Hyperplanes and Level Layers with Forbidden Points (Q3003530) (← links)
- Digital Plane Recognition with Fewer Probes (Q5237084) (← links)
- Weak colored local rules for planar tilings (Q5242532) (← links)
- Discrete Geometry for Computer Imagery (Q5316536) (← links)
- Gift-Wrapping Based Preimage Computation Algorithm (Q5458898) (← links)
- An alternative definition for digital convexity (Q5925581) (← links)
- A new lattice-based plane-probing algorithm (Q6103064) (← links)
- A combinatorial technique for generation of digital plane using GCD (Q6150964) (← links)
- Delaunay property and proximity results of the L-algorithm for digital plane probing (Q6590086) (← links)
