The following pages link to Yan Gerard (Q265039):
Displayed 33 items.
- Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length (Q265042) (← links)
- Gift-wrapping based preimage computation algorithm (Q834263) (← links)
- (Q1603645) (redirect page) (← links)
- Periodic graphs and connectivity of the rational digital hyperplanes (Q1603646) (← links)
- The chords' problem (Q1603719) (← links)
- Recognition of digital polyhedra with a fixed number of faces is decidable in dimension 3 (Q1690410) (← links)
- (Q1827811) (redirect page) (← links)
- An elementary algorithm for digital arc segmentation (Q1827813) (← links)
- Efficiently testing digital convexity and recognizing digital convex polygons (Q2203347) (← links)
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces (Q2403743) (← links)
- Regular switching components (Q2422036) (← links)
- Some necessary clarifications about the chords' problem and the partial digest problem (Q2576888) (← links)
- Introduction to Digital Level Layers (Q3000688) (← links)
- Estimation of the Derivatives of a Digital Function with a Convergent Bounded Error (Q3000709) (← links)
- Recognition of Digital Hyperplanes and Level Layers with Forbidden Points (Q3003530) (← links)
- About the Maximum Cardinality of the Digital Cover of a Curve with a Given Length (Q3190061) (← links)
- Application of a discrete tomography algorithm to computerized tomography (Q3439211) (← links)
- About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness (Q3651622) (← links)
- (Q4263845) (← links)
- Analyse locale des droites discrètes. Généralisation et application à la connexité des plans discrets (Q4350939) (← links)
- (Q4471788) (← links)
- An Elementary Algorithm for Digital Arc Segmentation (Q4917111) (← links)
- Greedy and Local Search Heuristics to Build Area-Optimal Polygons (Q5102069) (← links)
- Efficient Algorithms to Test Digital Convexity (Q5237086) (← links)
- Convex Aggregation Problems in $$\mathbb {Z}^2$$ (Q5237088) (← links)
- Discrete Geometry for Computer Imagery (Q5316519) (← links)
- (Q5434311) (← links)
- Gift-Wrapping Based Preimage Computation Algorithm (Q5458898) (← links)
- Recognition of Digital Polyhedra with a Fixed Number of Faces (Q5739415) (← links)
- Reconstruction of Convex Sets from One or Two X-rays (Q6048184) (← links)
- On the longest flip sequence to untangle segments in the plane (Q6091152) (← links)
- Complexity results on untangling red-blue matchings (Q6101837) (← links)
- Shadoks Approach to Low-Makespan Coordinated Motion Planning (Q6163580) (← links)