Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Guillaume Damiand"'
Publikováno v:
Algorithms, Vol 11, Iss 7, p 105 (2018)
We propose a new strategy for the parallelization of mesh processing algorithms. Our main contribution is the definition of distributed combinatorial maps (called n-dmaps), which allow us to represent the topology of big meshes by splitting them into
Externí odkaz:
https://doaj.org/article/089faa8e55804c5e9f0dd1a22b1fde1f
Autor:
Guillaume Damiand, Vincent Nivoliers
Publikováno v:
Computers & Graphics. 106:187-199
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::630710c6e635c456856c2e1422a5c8eb
https://doi.org/10.1016/j.cag.2022.06.008
https://doi.org/10.1016/j.cag.2022.06.008
Autor:
Guillaume Damiand, Florence Zara
Publikováno v:
Pattern Recognition Letters
Pattern Recognition Letters, Elsevier, 2020, 129, pp.48-55. ⟨10.1016/j.patrec.2019.11.009⟩
Pattern Recognition Letters, Elsevier, 2020, 129, pp.48-55. ⟨10.1016/j.patrec.2019.11.009⟩
International audience; Image pyramids are employed for years in digital image processing. They permit to store and use different scales/levels of details of an image. To represent all the topological information of the different levels, combinatoria
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::14ee36312c0efc71c82d75a4eb8b121d
https://doi.org/10.1016/j.patrec.2019.11.009
https://doi.org/10.1016/j.patrec.2019.11.009
Publikováno v:
The Visual Computer
The Visual Computer, Springer Verlag, 2020, 36 (4), pp.809-825. ⟨10.1007/s00371-019-01663-0⟩
Visual Computer
Visual Computer, Springer Verlag, 2020, 36 (4), pp.809-825. ⟨10.1007/s00371-019-01663-0⟩
The Visual Computer, 2020, 36 (4), pp.809-825. ⟨10.1007/s00371-019-01663-0⟩
The Visual Computer, Springer Verlag, 2020, 36 (4), pp.809-825. ⟨10.1007/s00371-019-01663-0⟩
Visual Computer
Visual Computer, Springer Verlag, 2020, 36 (4), pp.809-825. ⟨10.1007/s00371-019-01663-0⟩
The Visual Computer, 2020, 36 (4), pp.809-825. ⟨10.1007/s00371-019-01663-0⟩
Mass-spring systems (MSS) simulating elastic materials obey constraints known in elasticity as the Cauchy relations, restricting the Poisson ratio of isotropic systems to be exactly $$\nu =1/4$$. We remind that this limitation is intrinsic to centros
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::781ea4cd1a58c998c387b9e9cd4313a7
https://doi.org/10.1007/s00371-019-01663-0
https://doi.org/10.1007/s00371-019-01663-0
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
Pattern Recognition Letters
Pattern Recognition Letters, Elsevier, 2020, 131, pp.314-321. ⟨10.1016/j.patrec.2020.01.018⟩
instname
Pattern Recognition Letters
Pattern Recognition Letters, Elsevier, 2020, 131, pp.314-321. ⟨10.1016/j.patrec.2020.01.018⟩
International audience; Filtration simplification consists of simplifying a given filtration while simultaneously controlling the perturbation in the associated persistence diagrams. In this paper, we propose a filtration simplification algorithm for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::021c39bec60b02eb028a3ef418ad86b8
Publikováno v:
Computers and Graphics
Computers and Graphics, Elsevier, 2018, 74, pp.161-170. ⟨10.1016/j.cag.2018.05.017⟩
Computers & Graphics
Computers and Graphics, Elsevier, 2018, 74, pp.161-170. ⟨10.1016/j.cag.2018.05.017⟩
Computers & Graphics
International audience; A useful example of a Planar Face Complex (PFC) is a connected network of streets, each modeled by a zero-thickness curve. The union of these decomposes the plane into faces that may be topologically complex. The previously pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::771b764a07b7c9906e8a64fe5b12cbea
https://hal.archives-ouvertes.fr/hal-01838454/file/irpfc.pdf
https://hal.archives-ouvertes.fr/hal-01838454/file/irpfc.pdf
Publikováno v:
Algorithms
Algorithms, MDPI, 2018, 11 (7), pp.1-20. ⟨10.3390/a11070105⟩
Volume 11
Issue 7
Algorithms, Vol 11, Iss 7, p 105 (2018)
Algorithms, MDPI, 2018, 11 (7), pp.1-20. ⟨10.3390/a11070105⟩
Volume 11
Issue 7
Algorithms, Vol 11, Iss 7, p 105 (2018)
International audience; We propose a new strategy for the parallelization of mesh processing algorithms. Our main contribution is the definition of distributed combinatorial maps (called n-dmaps), which allow us to represent the topology of big meshe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b34a815c5275260bf467796e242838b3
https://hal.archives-ouvertes.fr/hal-01844433/document
https://hal.archives-ouvertes.fr/hal-01844433/document
Publikováno v:
22nd European Society of Biomechanics Congress (ESB 2016)
22nd European Society of Biomechanics Congress (ESB 2016), Jul 2016, Lyon, France
HAL
22nd European Society of Biomechanics Congress (ESB 2016), Jul 2016, Lyon, France
HAL
International audience; Computer-based medicine has been largely developed in recent years for helping surgery, diagnosis and treatment [1]. Unfortunately, from a mechanical standpoint, modeling complex materials such as soft tissues is still a chall
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7ecd50eb1c9e96aadd35075fb455538e
https://hal.science/hal-01320714
https://hal.science/hal-01320714
Autor:
Guillaume Damiand, Rocio Gonzalez-Diaz
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
Computational Topology in Image Context ISBN: 9783319394404
CTIC
Computational Topology in Image Context
Computational Topology in Image Context, Jun 2016, Marseille, France. pp.53-64, ⟨10.1007/978-3-319-39441-1_6⟩
instname
Computational Topology in Image Context ISBN: 9783319394404
CTIC
Computational Topology in Image Context
Computational Topology in Image Context, Jun 2016, Marseille, France. pp.53-64, ⟨10.1007/978-3-319-39441-1_6⟩
In this paper, we propose a method to compute, in parallel, the homology groups of closed meshes (i.e., orientable 2D manifolds without boundary) represented by combinatorial maps. Our experiments illustrate the interest of our approach which is real
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2686b58ce9c2031e7b6273197c13cfb
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2011, 412 (15), pp.1392-1405. ⟨10.1016/j.tcs.2010.10.029⟩
Theoretical Computer Science, Elsevier, 2011, 412 (15), pp.1392-1405. ⟨10.1016/j.tcs.2010.10.029⟩
International audience; In this paper, we address the problem of computing canonical representations of n-dimensional combinatorial maps and of using them for efficiently searching for a map in a database. We define two combinatorial map signatures:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd17f5164325e0e41d641ee7275e334a
https://doi.org/10.1016/j.tcs.2010.10.029
https://doi.org/10.1016/j.tcs.2010.10.029