Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Tristan Roussillon"'
Autor:
Tristan Roussillon
We introduce a multi-dimensional generalization of the Euclidean algorithm and show how it is related to digital geometry and especially to the generation and recognition of digital planes. We show how to associate with the steps of the algorithm geo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd675a5b8f007cbc91f43922dae97382
https://doi.org/10.21203/rs.3.rs-2481308/v1
https://doi.org/10.21203/rs.3.rs-2481308/v1
Publikováno v:
Journal of Mathematical Imaging and Vision
Journal of Mathematical Imaging and Vision, Springer Verlag, In press, ⟨10.1007/s10851-020-00965-6⟩
Journal of Mathematical Imaging and Vision, Springer Verlag, In press, ⟨10.1007/s10851-020-00965-6⟩
A plane-probing algorithm computes the normal vector of a digital plane from a starting point and a predicate “Is a point $${x}$$ in the digital plane?”. This predicate is used to probe the digital plane as locally as possible and decide on the f
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031198960
Plane-probing algorithms have become fundamental tools to locally capture arithmetical and geometrical properties of digital surfaces (boundaries of a connected set of voxels), and especially normal vector information. On a digital plane, the overall
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::67a7d653d107930560469a2bfb03ac0e
https://hal.archives-ouvertes.fr/hal-03758327
https://hal.archives-ouvertes.fr/hal-03758327
Autor:
Jocelyn Meyron, Tristan Roussillon
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031198960
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fed4540ade99e791b4ac400579a396a
https://doi.org/10.1007/978-3-031-19897-7_32
https://doi.org/10.1007/978-3-031-19897-7_32
Publikováno v:
21st IAPR International Conference on Discrete Geometry for Computer Imagery
21st IAPR International Conference on Discrete Geometry for Computer Imagery, Couprie M.; Cousty J.; Kenmochi Y.; Mustafa N., Mar 2019, Marne-la-Vallée, France. pp.380-393, ⟨10.1007/978-3-030-14085-4_30⟩
Discrete Geometry for Computer Imagery ISBN: 9783030140847
DGCI
21st IAPR International Conference on Discrete Geometry for Computer Imagery, Couprie M.; Cousty J.; Kenmochi Y.; Mustafa N., Mar 2019, Marne-la-Vallée, France. pp.380-393, ⟨10.1007/978-3-030-14085-4_30⟩
Discrete Geometry for Computer Imagery ISBN: 9783030140847
DGCI
We present a new plane-probing algorithm, i.e., an algorithm that computes the normal vector of a digital plane from a starting point and a predicate “Is a point \(\varvec{x}\) in the digital plane?”. This predicate is used to probe the digital p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d5a9b2c4bc64e84601d5e59d5692e38a
https://hal.archives-ouvertes.fr/hal-02087529/document
https://hal.archives-ouvertes.fr/hal-02087529/document
Publikováno v:
Journal of Mathematical Imaging and Vision
Journal of Mathematical Imaging and Vision, Springer Verlag, 2019, 61 (3), pp.359-379. ⟨10.1007/s10851-018-0839-4⟩
Journal of Mathematical Imaging and Vision, Springer Verlag, 2019, 61 (3), pp.359-379. ⟨10.1007/s10851-018-0839-4⟩
International audience; This article presents a novel discretization of the Laplace–Beltrami operator on digital surfaces.We adapt an existing convolution technique proposed by Belkin et al. [5] for triangular meshes to topological border of subset
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee2bcab603e30b3c4afbbb08070d25e5
https://hal.archives-ouvertes.fr/hal-01717849v3/document
https://hal.archives-ouvertes.fr/hal-01717849v3/document
Autor:
Kacper Pluta, David Cœurjolly, Pascal Romon, Yukiko Kenmochi, Tristan Roussillon, Victor Ostromoukhov
Publikováno v:
Journal of Mathematical Imaging and Vision
Journal of Mathematical Imaging and Vision, Springer Verlag, 2018, 60 (5), pp.707-716. ⟨10.1007/s10851-018-0785-1⟩
Journal of Mathematical Imaging and Vision, Springer Verlag, 2018, 60 (5), pp.707-716. ⟨10.1007/s10851-018-0785-1⟩
Submitted to Journal of Mathematical Imaging and Vision.; International audience; Digitized rotations on discrete spaces are usually defined as the composition of a Euclidean rotation and a rounding operator; they are in general not bijective. Nevert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::77b7c86a44c6d77857b7ae65ee9374fd
https://hal.archives-ouvertes.fr/hal-01540772v2/file/article.pdf
https://hal.archives-ouvertes.fr/hal-01540772v2/file/article.pdf
Publikováno v:
Journal of Mathematical Imaging and Vision
Journal of Mathematical Imaging and Vision, Springer Verlag, 2017, 59 (1), pp.23-39. ⟨10.1007/s10851-017-0704-x⟩
Journal of Mathematical Imaging and Vision, Springer Verlag, 2017, 59 (1), pp.23-39. ⟨10.1007/s10851-017-0704-x⟩
Digital planes are sets of integer points located between two parallel planes. We present a new algorithm that computes the normal vector of a digital plane given only a predicate “is a point x in the digital plane or not”. In opposition to class
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0660a48bac3a14ecfe513f5f639127ff
https://hal.archives-ouvertes.fr/hal-01621516
https://hal.archives-ouvertes.fr/hal-01621516
Publikováno v:
Discrete Geometry for Computer Imagery ISBN: 9783319662718
DGCI
20th International Conference on Discrete Geometry for Computer Imagery
20th International Conference on Discrete Geometry for Computer Imagery, Walter G. Kropatsch, Ines Janusch and Nicole M. Artner, Sep 2017, Vienna, Austria. pp.241--253
DGCI
20th International Conference on Discrete Geometry for Computer Imagery
20th International Conference on Discrete Geometry for Computer Imagery, Walter G. Kropatsch, Ines Janusch and Nicole M. Artner, Sep 2017, Vienna, Austria. pp.241--253
International audience; Many problems in image analysis, digital processing and shape optimization can be expressed as variational problems involving the discretization of the Laplace-Beltrami operator. Such discretizations have been widely studied f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4aa264a969f04b671dbb1fbefeef6556
https://doi.org/10.1007/978-3-319-66272-5_20
https://doi.org/10.1007/978-3-319-66272-5_20
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2016, 624, pp.73-88. ⟨10.1016/j.tcs.2015.11.021⟩
Theoretical Computer Science, Elsevier, 2016, 624, pp.73-88. ⟨10.1016/j.tcs.2015.11.021⟩
International audience; A digital plane is the set of integer points located between the parallel planes. We solve the following problem: how to compute the exact normal vector of a digital plane given only a predicate that answers the question “is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e168aec056610a36aadee622d79d8da6
https://hal.archives-ouvertes.fr/hal-01294966
https://hal.archives-ouvertes.fr/hal-01294966