Tristan Roussillon

dblp:67/1093 · DBLP profile ↗
← Back
11ranked-venue papers
6as first author
1since 2021 · last 2024
0000-0003-2524-3685ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-authorTheory of computation · 4 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2024 Delaunay property and proximity results of the L-algorithm for digital plane probing
abstract
International audience
Jui-Ting Lu, Tristan Roussillon, Jacques-Olivier Lachaud, David Coeurjolly
Theor. Comput. Sci.2
2016 An output-sensitive algorithm to compute the normal vector of a digital plane
Jacques-Olivier Lachaud, Xavier Provençal, Tristan Roussillon
Theor. Comput. Sci.3
2015 Euclidean farthest-point Voronoi diagram of a digital edge
Tristan Roussillon
Discret. Appl. Math.1
2013 A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours
Antoine Vacavant, Tristan Roussillon, Bertrand Kerautret, Jacques-Olivier Lachaud
Comput. Vis. Image Underst.2
2013 Digital circles, spheres and hyperspheres: From morphological models to analytical characterizations and topological properties
Jean-Luc Toutant, Eric Andres, Tristan Roussillon
Discret. Appl. Math.3
2011 Accurate Curvature Estimation along Digital Contours with Maximal Digital Circular Arcs
Tristan Roussillon, Jacques-Olivier Lachaud
IWCIA1
2011 Unsupervised Polygonal Reconstruction of Noisy Contours by a Discrete Irregular Approach
Antoine Vacavant, Tristan Roussillon, Bertrand Kerautret
IWCIA2
2011 Faithful polygonal representation of the convex and concave parts of a digital curve
Tristan Roussillon, Isabelle Sivignon
Pattern Recognit.1
2010 Measure of circularity for parts of digital boundaries and its fast computation
Tristan Roussillon, Isabelle Sivignon, Laure Tougne
Pattern Recognit.1
2009 What Does Digital Straightness Tell about Digital Convexity?
Tristan Roussillon, Laure Tougne, Isabelle Sivignon
IWCIA1
2008 Robust decomposition of a digital curve into convex and concave parts
abstract
We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in discrete and computational geometry: convex hull computation and Pickpsilas formula.
Tristan Roussillon, Isabelle Sivignon, Laure Tougne
ICPR1