default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSébastien Fourey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c11]Sébastien Fourey, David Tschumperlé, David Revoy:
A Fast and Efficient Semi-guided Algorithm for Flat Coloring Line-arts. VMV 2018: 1-9- 2010
- [c10]Sébastien Fourey, Luc Brun
:
Efficient Encoding of n-D Combinatorial Pyramids. ICPR 2010: 1036-1039
2000 – 2009
- 2009
- [j6]Sébastien Fourey, Rémy Malgouyres:
Normals estimation for digital surfaces based on convolutions. Comput. Graph. 33(1): 2-10 (2009) - [c9]Sébastien Fourey, Luc Brun:
A First Step toward Combinatorial Pyramids in n-D Spaces. GbRPR 2009: 304-313 - [c8]Sébastien Fourey, Luc Brun:
Connecting Walks and Connecting Dart Sequences in n-D Combinatorial Pyramids. IWCIA Special Track on Applications 2009: 109-122 - 2008
- [c7]Sébastien Fourey, Rémy Malgouyres:
Normals and Curvature Estimation for Digital Surfaces Based on Convolutions. DGCI 2008: 287-298 - [c6]Rémy Malgouyres, Florent Brunet, Sébastien Fourey:
Binomial Convolutions and Derivatives Estimation from Noisy Discretizations. DGCI 2008: 370-379 - 2004
- [j5]Sébastien Fourey, Gabor T. Herman, T. Yung Kong, Azriel Rosenfeld:
Preface. Discret. Appl. Math. 139(1-3): 1-3 (2004) - [j4]Sébastien Fourey, T. Yung Kong, Gabor T. Herman:
Generic axiomatized digital surface-structures. Discret. Appl. Math. 139(1-3): 65-93 (2004) - [c5]Sébastien Fourey:
Simple Points and Generic Axiomatized Digital Surface-Structures. IWCIA 2004: 307-317 - 2003
- [j3]Sébastien Fourey, Rémy Malgouyres:
A concise characterization of 3D simple points. Discret. Appl. Math. 125(1): 59-80 (2003) - 2002
- [j2]Sébastien Fourey, Rémy Malgouyres:
Intersection number and topology preservation within digital surfaces. Theor. Comput. Sci. 283(1): 109-150 (2002) - 2001
- [j1]Sébastien Fourey, Rémy Malgouyres:
A Digital Linking Number for Discrete Curves. Int. J. Pattern Recognit. Artif. Intell. 15(7): 1053-1074 (2001) - [c4]Sébastien Fourey, T. Yung Kong, Gabor T. Herman:
Generic axiomatized digital surface-structures. IWCIA 2001: 73-92 - [c3]Sébastien Fourey, Gabor T. Herman, T. Yung Kong:
Preface. IWCIA 2001: 430-431 - [e1]Sébastien Fourey, Gabor T. Herman, T. Yung Kong:
8th International Workshop on Combinatorial Image Analysis, IWCIA 2001, Philadelphia, PA, USA, August 23-24, 2001. Electronic Notes in Theoretical Computer Science 46, Elsevier 2001 [contents] - 2000
- [b1]Sébastien Fourey:
Nombre d'intersection et d'entrelacement de courbes discrètes et application à la caractérisation de la préservation de la topologie en imagerie. (Intersection and linking numbers of digital curves and application to the characterization of topology preservation in computer imagery). University of Caen Normandy, France, 2000 - [c2]Sébastien Fourey, Rémy Malgouyres:
A Concise Characterization of 3D Simple Points. DGCI 2000: 27-36
1990 – 1999
- 1999
- [c1]Sébastien Fourey, Rémy Malgouyres:
Intersection Number of Paths Lying on a Digital Surface and a New Jordan Theorem. DGCI 1999: 104-117
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 2025-01-09 13:20 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:
