#
15th IAPR International Conference, DGCI 2009, Montréal, Canada, September 30 - October 2, 2009. Proceedings

Lecture Notes in Computer Science > Discrete Geometry for Computer Imagery > Discrete and Combinatorial Tools for Image Segmentation and Analysis > 132-143

Lecture Notes in Computer Science > Discrete Geometry for Computer Imagery > Discrete and Combinatorial Tools for Image Segmentation and Analysis > 144-155

Lecture Notes in Computer Science > Discrete Geometry for Computer Imagery > Discrete and Combinatorial Tools for Image Segmentation and Analysis > 156-167

Lecture Notes in Computer Science > Discrete Geometry for Computer Imagery > Discrete and Combinatorial Tools for Image Segmentation and Analysis > 168-179

Lecture Notes in Computer Science > Discrete Geometry for Computer Imagery > Discrete and Combinatorial Tools for Image Segmentation and Analysis > 180-192

Lecture Notes in Computer Science > Discrete Geometry for Computer Imagery > Discrete and Combinatorial Tools for Image Segmentation and Analysis > 193-202

Lecture Notes in Computer Science > Discrete Geometry for Computer Imagery > Discrete and Combinatorial Tools for Image Segmentation and Analysis > 203-216

Lecture Notes in Computer Science > Discrete Geometry for Computer Imagery > Discrete and Combinatorial Topology > 217-228

*i.e.*images defined on ℤ

^{2}) such procedures are usually based on the notion of simple point. By opposition to the case of spaces of higher dimensions (

*i.e.*ℤ

^{ n },

*n*≥ 3), it was proved in the 80’s that the exclusive use...

Lecture Notes in Computer Science > Discrete Geometry for Computer Imagery > Discrete and Combinatorial Topology > 229-239

Lecture Notes in Computer Science > Discrete Geometry for Computer Imagery > Discrete and Combinatorial Topology > 240-251

*n*-gon is highlighted. We introduce a simple combinatorial value called

*Hamming-distance*, which is a lower bound for the the number of

*flips*– a local transformation on tilings – necessary to link two tilings. We prove that the flip-distance between two tilings is equal to the Hamming-distance for

*n*≤ 4. We also show, by providing...

Lecture Notes in Computer Science > Discrete Geometry for Computer Imagery > Discrete and Combinatorial Topology > 252-262

Lecture Notes in Computer Science > Discrete Geometry for Computer Imagery > Discrete and Combinatorial Topology > 263-274

Lecture Notes in Computer Science > Discrete Geometry for Computer Imagery > Discrete and Combinatorial Topology > 275-287