| [6] |
Rémy Malgouyres and Sébastien Fourey.
Strong surfaces, surface skelettons and image superimposition.
In Proceedings of the SPIE, Vision Geometry VII,
volume 3454, pages 16—27, San Diego, U.S.A., 1998.
[doi]
|
| [7] |
Sébastien Fourey and Rémy Malgouyres.
Intersection number and topology preservation within digital surfaces.
In Proceedings of the Sixth International Workshop on Parallel
Image Processing and Analysis (IWPIPA'99), pages 138—158,
Madras, India, January 1999.
|
| [8] |
Sébastien Fourey and Rémy Malgouyres.
Intersection number of paths lying on a digital surface and a new jordan theorem.
In Proceedings of the 8th International Conference Discrete Geometry
for Computer Imagery (DGCI'99),
volume 1568 of Lecture Notes in Computer Science, pages 104—117.
Springer, March 1999. Marne la Vallée, France.
[doi]
[hal-00338931] [BibTeX] [PDF] [Springer PDF]
|
| [9] |
Sébastien Fourey and Rémy Malgouyres.
A digital linking number for discrete curves.
In Proceedings of the 7th International Workshop on Combinatorial Image Analysis (IWCIA'00),
pages 59—77. Université de Caen, July 2000.
|
| [10] |
Sébastien Fourey and Rémy Malgouyres.
A concise characterization of 3d simple points.
In Proceedings of the 9th International Conference Discrete
Geometry for Computer Imagery (DGCI'00),
volume 1953 of Lecture notes in Computer Sciences,
pages 27—36, Uppsala, Sweden, 2000. Springer.
[doi]
[hal-00338931] [BibTeX] [PDF] [Springer PDF]
|
| [11] |
Sébastien Fourey, T. Yung Kong, and Gabor T. Herman.
Generic axiomatized digital surface-structures.
volume 46 of Electronic Notes in Theoretical Computer Science.
Elsevier Science Publishers, August 2001.
[doi]
|
| [12] |
Sébastien Fourey.
Simple points and generic axiomatized digital surface-structures.
In Proceedings of the 10th International Workshop on Combinatorial Image Analysis (IWCIA 2004),
volume 3322 of Lecture notes in Computer Sciences,
pages 307—317, Auckland, New Zealand, 2004. Springer.
[doi]
[hal-00338931] [BibTeX] [PDF] |
| [13] |
Sébastien Fourey and Rémy Malgouyres.
Normals and curvature estimation for digital surfaces based on convolutions.
In Discrete Geometry for Computer Imagery (DGCI 2008),
volume 4992 of Lecture notes in Computer Sciences,
pages 287—298, Lyon, France, 2008. Springer.
[doi]
[hal-00338931] [BibTeX] [PDF] [Springer PDF]
|
| [14] |
Rémy Malgouyres, Florent Brunet, and Sébastien Fourey.
Binomial convolutions and derivatives estimation from noisy discretizations.
In Discrete Geometry for Computer Imagery (DGCI 2008),
volume 4992 of Lecture notes in Computer Sciences,
pages 370—379, Lyon, France, 2008. Springer.
[doi]
[hal-00338931] [BibTeX] |
| [15] |
Sébastien Fourey and Luc Brun.
A first step toward combinatorial pyramids in n-D spaces.
In Graph-based Representations in Pattern Recognition,
volume 5534 of Lecture notes in Computer Sciences,
pages 304—313, Venice, Italy, 2009. Springer.
[doi]
[hal-00338931] [BibTeX] [PDF] |
| [16] |
Sébastien Fourey and Luc Brun.
Connecting walks and connecting dart sequences for n-D combinatorial pyramids.
In Progress in Combinatorial Image Analysis, Proceedings of the 13th International
Workshop on Combinatorial Image Analysis (IWCIA'09), pages 109—122,
Cancun, Mexico, 2009. Research Publishing Services.
[hal-00338931] [BibTeX] [PDF]
|
| [17] |
Sébastien Fourey and Luc Brun.
Efficient encoding of n-D combinatorial pyramids.
In Proceedings of the 20th International Conference on Pattern Recognition (ICPR'2010), pages 1036—1039, Istanbul, Turkey, 2010.
[doi]
[hal-00338931] [BibTeX] [PDF] |
| [18] |
Sébastien Fourey, David Tschumperlé, and David Revoy.
A Fast and Efficient Semi-guided Algorithm for Flat Coloring Line-arts.
In Vision, Modeling & Visualization, VMV 2018, pages 1—9, Stuttgart, Germany, October 10-12, 2018.
[doi]
[hal-00338931] [BibTeX] [PDF] |
