default search action
Tristan Roussillon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Jui-Ting Lu
, Tristan Roussillon, Jacques-Olivier Lachaud, David Coeurjolly:
Delaunay property and proximity results of the L-algorithm for digital plane probing. Theor. Comput. Sci. 1011: 114719 (2024) - [c18]Tristan Roussillon
Decomposition of Rational Discrete Planes. DGMM 2024: 54-66 - 2023
- [j12]Tristan Roussillon:
Combinatorial Generation of Planar Sets. J. Math. Imaging Vis. 65(5): 702-717 (2023) - 2022
- [c17]Jui-Ting Lu
A New Lattice-Based Plane-Probing Algorithm. DGMM 2022: 366-381 - [c16]Jocelyn Meyron, Tristan Roussillon:
Approximation of Digital Surfaces by a Hierarchical Set of Planar Patches. DGMM 2022: 409-421 - 2020
- [j11]Jacques-Olivier Lachaud, Jocelyn Meyron, Tristan Roussillon
An Optimized Framework for Plane-Probing Algorithms. J. Math. Imaging Vis. 62(5): 718-736 (2020)
2010 – 2019
- 2019
- [j10]Thomas Caissard
Laplace-Beltrami Operator on Digital Surfaces. J. Math. Imaging Vis. 61(3): 359-379 (2019) - [c15]Tristan Roussillon, Jacques-Olivier Lachaud:
Digital Plane Recognition with Fewer Probes. DGCI 2019: 380-393 - 2018
- [j9]Kacper Pluta
Characterization of Bijective Digitized Rotations on the Hexagonal Grid. J. Math. Imaging Vis. 60(5): 707-716 (2018) - 2017
- [j8]Jacques-Olivier Lachaud, Xavier Provençal, Tristan Roussillon
Two Plane-Probing Algorithms for the Computation of the Normal Vector to a Digital Plane. J. Math. Imaging Vis. 59(1): 23-39 (2017) - [c14]Thomas Caissard, David Coeurjolly
Heat Kernel Laplace-Beltrami Operator on Digital Surfaces. DGCI 2017: 241-253 - [c13]Antoine Vacavant, Bertrand Kerautret, Tristan Roussillon, Fabien Feschet:
Reconstructions of Noisy Digital Contours with Maximal Primitives Based on Multi-scale/Irregular Geometric Representation and Generalized Linear Programming. DGCI 2017: 291-303 - 2016
- [j7]Jacques-Olivier Lachaud, Xavier Provençal
An output-sensitive algorithm to compute the normal vector of a digital plane. Theor. Comput. Sci. 624: 73-88 (2016) - [c12]Jacques-Olivier Lachaud, Xavier Provençal, Tristan Roussillon:
Computation of the Normal Vector to a Digital Plane by Sampling Significant Points. DGCI 2016: 194-205 - 2015
- [j6]Tristan Roussillon:
Euclidean farthest-point Voronoi diagram of a digital edge. Discret. Appl. Math. 183: 118-129 (2015) - 2014
- [c11]Guillaume Damiand, Tristan Roussillon, Christine Solnon:
2D Topological Map Isomorphism for Multi-Label Simple Transformation Definition. DGCI 2014: 39-50 - [c10]Tristan Roussillon:
An Arithmetical Characterization of the Convex Hull of Digital Straight Segments. DGCI 2014: 150-161 - 2013
- [j5]Antoine Vacavant, Tristan Roussillon, Bertrand Kerautret, Jacques-Olivier Lachaud:
A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours. Comput. Vis. Image Underst. 117(4): 438-450 (2013) - [j4]Jean-Luc Toutant, Eric Andres, Tristan Roussillon:
Digital circles, spheres and hyperspheres: From morphological models to analytical characterizations and topological properties. Discret. Appl. Math. 161(16-17): 2662-2677 (2013) - 2011
- [j3]Tristan Roussillon, Isabelle Sivignon:
Faithful polygonal representation of the convex and concave parts of a digital curve. Pattern Recognit. 44(10-11): 2693-2700 (2011) - [c9]Eric Andres, Tristan Roussillon:
Analytical Description of Digital Circles. DGCI 2011: 235-246 - [c8]Tristan Roussillon, Jacques-Olivier Lachaud:
Delaunay Properties of Digital Straight Segments. DGCI 2011: 308-319 - [c7]Tristan Roussillon, Jacques-Olivier Lachaud:
Accurate Curvature Estimation along Digital Contours with Maximal Digital Circular Arcs. IWCIA 2011: 43-55 - [c6]Antoine Vacavant, Tristan Roussillon, Bertrand Kerautret:
Unsupervised Polygonal Reconstruction of Noisy Contours by a Discrete Irregular Approach. IWCIA 2011: 398-409 - 2010
- [j2]Tristan Roussillon, Isabelle Sivignon, Laure Tougne:
Measure of circularity for parts of digital boundaries and its fast computation. Pattern Recognit. 43(1): 37-46 (2010)
2000 – 2009
- 2009
- [b1]Tristan Roussillon:
Algorithmes d'extraction de modèles géométriques discrets pour la représentation robuste des formes. (Recognition algorithms of digital geometric patterns for robust shape representation). Lumière University Lyon 2, France, 2009 - [j1]Tristan Roussillon, Hervé Piégay, Isabelle Sivignon, Laure Tougne
Automatic computation of pebble roundness using digital imagery and discrete geometry. Comput. Geosci. 35(10): 1992-2000 (2009) - [c5]Tristan Roussillon, Laure Tougne, Isabelle Sivignon:
On Three Constrained Versions of the Digital Circular Arc Recognition Problem. DGCI 2009: 34-45 - [c4]Tristan Roussillon, Laure Tougne, Isabelle Sivignon:
What Does Digital Straightness Tell about Digital Convexity? IWCIA 2009: 43-55 - 2008
- [c3]Tristan Roussillon, Isabelle Sivignon, Laure Tougne:
Robust decomposition of a digital curve into convex and concave parts. ICPR 2008: 1-4 - [c2]Tristan Roussillon, Isabelle Sivignon, Laure Tougne:
Test and Measure of Circularity for Digital Curves. IPCV 2008: 518-524 - 2007
- [c1]Tristan Roussillon, Laure Tougne
Computation of Binary Objects Sides Number using Discrete Geometry, Application to Automatic Pebbles Shape Analysis. ICIAP 2007: 763-768
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: