The following pages link to Isabelle Sivignon (Q244974):
Displayed 32 items.
- Measure of circularity for parts of digital boundaries and its fast computation (Q733129) (← links)
- Finding a minimum medial axis of a discrete shape is NP-hard (Q952462) (← links)
- Minimum decomposition of a digital surface into digital plane segments is NP-hard (Q1003721) (← links)
- \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity (Q1731460) (← links)
- Decomposition of a three-dimensional discrete object surface into discrete plane pieces (Q1889582) (← links)
- Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity (Q2255825) (← links)
- Faithful polygonal representation of the convex and concave parts of a digital curve (Q2276012) (← links)
- On digital plane preimage structure (Q2573239) (← links)
- A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance (Q3000715) (← links)
- Algorithms for Fast Digital Straight Segments Union (Q3190094) (← links)
- Digital plane preimage structure (Q3438921) (← links)
- On Three Constrained Versions of the Digital Circular Arc Recognition Problem (Q3648770) (← links)
- What Does Digital Straightness Tell about Digital Convexity? (Q3651601) (← links)
- Hierarchical Discrete Medial Axis for Sphere-Tree Construction (Q3651603) (← links)
- (Q4419009) (← links)
- Digital Intersections: minimal carrier, connectivity, and periodicity properties (Q4826767) (← links)
- Optimal Covering of a Straight Line Applied to Discrete Convexity (Q4924454) (← links)
- Walking in the Farey Fan to Compute the Characteristics of a Discrete Straight Line Subsegment (Q4924456) (← links)
- Average Curve of n Digital Curves (Q5237094) (← links)
- Discrete Geometry for Computer Imagery (Q5316543) (← links)
- Duality and Geometry Straightness, Characterization and Envelope (Q5386005) (← links)
- Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification (Q5386042) (← links)
- Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard (Q5386070) (← links)
- Combinatorial Image Analysis (Q5465748) (← links)
- Representation of Imprecise Digital Objects (Q5739414) (← links)
- Discrete Geometry for Computer Imagery (Q5902433) (← links)
- Discrete Geometry for Computer Imagery (Q5902445) (← links)
- A note on the computation of the fraction of smallest denominator in between two irreducible fractions (Q5962530) (← links)
- Exact and optimal conversion of a hole-free 2\textsc{d} digital object into a union of balls in polynomial time (Q6103065) (← links)
- Maker-Breaker is solved in polynomial time on hypergraphs of rank 3 (Q6411981) (← links)
- (k-2)-linear connected components in hypergraphs of rank k (Q6443645) (← links)
- An update on the coin-moving game on the square grid (Q6443647) (← links)