1

A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance
I. Sivignon
PDF Cite
What Does Digital Straightness Tell About Digital Convexity
T. Roussillon, L. Tougne, I. Sivignon
PDF Cite
On Three Constrained Versions of the Digital Circular Arc Recognition Problem
T. Roussillon, I. Sivignon, L. Tougne
PDF Cite
Hierarchical Discrete Medial Axis for Sphere-Tree Construction
A. Broutta, D. Coeurjolly, I. Sivignon
PDF Cite
Measure of Straight Lines and its Applications in Digital Geometry
D. Coeurjolly, I. Sivignon
PDF Cite
Robust Decomposition of a Digital Curve into Convex and Concave Parts
T. Roussillon, I. Sivignon, L. Tougne
PDF Cite
Test and Measure of Circularity for Digital Curves.
T. Rousillon, I. Sivignon, L. Tougne
PDF Cite
Computation of Binary Objects Sides Number using Discrete Geometry, Application to Automatic Pebbles Shape Analysis
T. Roussillon, L. Tougne, I. Sivignon
PDF Cite
Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard
I. Sivignon, D. Coeurjolly
PDF Cite
Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification
D. Coeurjolly, D. Dupont, L. Jospin, I. Sivignon
PDF Cite