Digital Level Layers for Digital Curve Decomposition and Vectorization

Autor: Laurent Provot, Yan Gerard, Fabien Feschet

Publikováno v: Image Processing On Line, Vol 4, Pp 169-186 (2014)

The purpose of this paper is to present Digital Level Layers and show the motivations for working with such analytical primitives in the framework of Digital Geometry. We first compare their properties to morphological and topological counterparts, a

Externí odkaz: https://doaj.org/article/7439f8e983004d1fa169a6f81fbe0293

On the Longest Flip Sequence to Untangle Segments in the Plane

Autor: Guilherme D. da Fonseca, Yan Gerard, Bastien Rivier

Publikováno v: Lecture Notes in Computer Science book series
WALCOM 17th International Conference and Workshops on Algorithms and Computation
WALCOM 17th International Conference and Workshops on Algorithms and Computation, Mar 2023, Hsinchu, Taiwan. pp.102-112, ⟨10.1007/978-3-031-27051-2_10⟩
WALCOM: Algorithms and Computation ISBN: 9783031270505

International audience; A set of segments in the plane may form a Euclidean TSP tour or a matching, among others. Optimal TSP tours as well as minimum weight perfect matchings have no crossing segments, but several heuristics and approximation algori

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce8a31ffd1cef34c30049145aa39ecd6
https://hal.science/hal-04051496/file/On_the_Longest_Flip_Sequence_to_Untangle_Segments_in_the_Plane_FGR22.pdf

Shadoks Approach to Low-Makespan Coordinated Motion Planning

Autor: Loïc Crombez, Guilherme D. da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso

Publikováno v: ACM Journal of Experimental Algorithmics
ACM Journal of Experimental Algorithmics, 2022, 27, pp.1-17. ⟨10.1145/3524133⟩

This paper describes the heuristics used by the Shadoks team for the CG:SHOP 2021 challenge. This year's problem is to coordinate the motion of multiple robots in order to reach their targets without collisions and minimizing the makespan. It is a cl

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42de14dd0df8f4a4fe9b40abe8571b06
https://hal.science/hal-04051506

Complexity Results on Untangling Red-Blue Matchings

Autor: Arun Kumar Das, Sandip Das, Guilherme D. da Fonseca, Yan Gerard, Bastien Rivier

Publikováno v: LATIN 2022: Theoretical Informatics ISBN: 9783031206238

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::59b97600a30d6196ba60c1420b5a854f
https://doi.org/10.1007/978-3-031-20624-5_44

Regular switching components

Autor: Yan Gerard

Publikováno v: Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2019, Special issue of TCS devoted to the memory of Maurice Nivat, ⟨10.1016/j.tcs.2019.01.010⟩
Theoretical Computer Science, 2019, Special issue of TCS devoted to the memory of Maurice Nivat, ⟨10.1016/j.tcs.2019.01.010⟩

We consider a problem of Discrete Tomography which consists of reconstructing a finite lattice set S ⊂ Z 2 from given horizontal and vertical X-rays (i.e. with prescribed numbers of points in each row and column). Without additional requirements, t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a24947a09a9e987cd27b3f585d91fdca
https://doi.org/10.1016/j.tcs.2019.01.010