default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDidier Arquès
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j29]Venceslas Biri, Didier Arquès, Sylvain Michelin:
Real Time Rendering of Atmospheric Lighting and Volumetric Shadows. J. WSCG 14(1-3): 65-72 (2006)- [j28]Vincent Nozick, Sylvain Michelin, Didier Arquès:
Real-time Plane-sweep with Local Strategy. J. WSCG 14(1-3): 121-128 (2006) - 2005
- [j27]Didier Arquès, Anne Micheli:
Generalized Dyck equations and multilabel trees. Discret. Math. 298(1-3): 18-38 (2005) - [c13]Vincent Nozick, Sylvain Michelin, Didier Arquès:
Image-Based Rendering using Plane-Sweeping Modelisation. MVA 2005: 468-471 - [c12]Didier Arquès, Venceslas Biri, O. Derpierre:
A new formulation of differential radiosity and a rendering application. WSCG (Short Papers) 2005: 177-180 - 2004
- [j26]Jocelyn Marchadier, Didier Arquès, Sylvain Michelin:
Thinning grayscale well-composed images. Pattern Recognit. Lett. 25(5): 581-590 (2004) - 2003
- [j25]Didier Arquès, Anne Micheli:
A generalization of the language of ukasiewicz coding rooted planar hypermaps. Theor. Comput. Sci. 307(2): 221-239 (2003) - [c11]Venceslas Biri, Sylvain Michelin, Didier Arquès:
Dynamic Radiosity using Higher Order Functions Bases and Temporal Coherence. WSCG 2003 - 2002
- [j24]Didier Arquès, Anne Micheli:
Enumeration of multi-colored rooted maps. Discret. Math. 256(3): 541-556 (2002) - [c10]Jocelyn Marchadier, Didier Arquès, Sylvain Michelin:
Thinning Grayscale Well-Composed Images: A New Approach for Topological Coherent Image Segmentation. DGCI 2002: 360-371 - 2001
- [c9]Didier Arquès, Venceslas Biri, Sylvain Michelin:
A new mathematical development for radiosity animation with Galerkin method. CA 2001: 201-256 - 2000
- [j23]Didier Arquès, Jean François Béraud:
Rooted maps on orientable surfaces, Riccati's equation and continued fractions. Discret. Math. 215: 1-12 (2000) - [j22]Didier Arquès, Alain Giorgetti:
Une bijection géométrique entre une famille d'hypercartes et une famille de polygones énumérées par la série de Schröder. Discret. Math. 217(1-3): 17-32 (2000) - [j21]Didier Arquès, Eric Felgines, Sylvain Michelin, Karine Zampieri:
Realistic rendering with turbulent flows. Comput. Animat. Virtual Worlds 11(2): 95-104 (2000) - [j20]Didier Arquès, Alain Giorgetti:
Counting rooted maps on a surface. Theor. Comput. Sci. 234(1-2): 255-272 (2000) - [j19]Didier Arquès, Jean François Béraud:
Le Schéma de carte et ses applications. Theor. Comput. Sci. 246(1-2): 151-194 (2000) - [c8]P. Lecocq, Andras Kemeny, Sylvain Michelin, Didier Arquès:
Mathematical Approximation for Real-Time Lighting Rendering Through Participating Media. PG 2000: 400-401 - [c7]Isabelle Icart, Didier Arquès:
A Physically-Based BRDF Model for Multilayer Systems with Uncorrelated Rough Boundaries. Rendering Techniques 2000: 353-364 - [c6]Didier Arquès, Sylvain Michelin, Benoît Piranda:
Overlapping Radiosity: Using a New Function Base with Local Disk Support. WSCG 2000
1990 – 1999
- 1999
- [j18]Isabelle Icart, Didier Arquès:
An approach to geometrical and optical simulation of soap froth. Comput. Graph. 23(3): 405-418 (1999) - [j17]Didier Arquès, Alain Giorgetti
:
Énumération des cartes pointées sur une surface orientable de genre quelconque en fonction des nombres de sommets et de faces. J. Comb. Theory B 77(1): 1-24 (1999) - [c5]Isabelle Icart, Didier Arquès:
An Illumination Model for a System of Isotropic Substrate - Isotropic Thin Film with Identical Rough Boundaries. Rendering Techniques 1999: 261-272 - 1997
- [j16]Didier Arquès, Jean François Béraud:
Énumération des cartes pointées sur la bouteille de Klein. RAIRO Theor. Informatics Appl. 31(4): 385-409 (1997) - 1996
- [c4]Didier Arquès, Sylvain Michelin:
Proximity Radiosity: Exploiting Coherence to Accelerate Form Factor Computations. Rendering Techniques 1996: 143-152 - 1995
- [j15]Didier Arquès, Sylvain Michelin:
A New Radiosity Approach for Regular Objects: Application to Ruled Surfaces. Comput. Graph. Forum 14(3): 299-310 (1995) - [j14]Didier Arquès, Olivier Grange:
A Fast Scan-Line Algorithm For Topological Filling Of Well-Nested Objects in 2.5D Digital Pictures. Theor. Comput. Sci. 147(1&2): 211-248 (1995) - [c3]Didier Arquès, Christian J. Michel:
A Prossible Code in the Genetic Code. STACS 1995: 640-651 - 1994
- [j13]Didier Arquès, Olivier Grange:
Digital topology in 2.5 D: An application to topological filling of well-nested objects. Comput. Graph. 18(3): 373-393 (1994) - [j12]P. Ris, Didier Arquès:
Parallel Ray Tracing Based upon a Multilevel Topological Knowledge Acquisition of the Scene. Comput. Graph. Forum 13(3): 221-232 (1994) - 1993
- [j11]Sylvain Michelin, G. Maffies, Didier Arquès, J. C. Grossetie:
Form Factor Calculation: a New Expression with Implementations on a Parallel T.Node Computer. Comput. Graph. Forum 12(3): 421-432 (1993) - [j10]Didier Arquès, Isabelle Jacques:
Classification des cartes pointées de genre 1 et relation fonctionelle associée. Theor. Comput. Sci. 117(1&2): 45-65 (1993) - 1992
- [j9]Didier Arquès, Christian J. Michel, K. Orieux:
Analysis of gene evolution: the software AGE. Comput. Appl. Biosci. 8(1): 5-14 (1992) - 1991
- [j8]Didier Arquès, Isabelle Jacques:
Solides non organisés: definition, implantation et plongement. RAIRO Theor. Informatics Appl. 25: 219-246 (1991)
1980 – 1989
- 1989
- [j7]Didier Arquès:
Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données. Discret. Appl. Math. 24(1-3): 3-23 (1989) - 1988
- [j6]Didier Arquès, Jean Françon, M. T. Guichet, P. Guichet:
Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach. Theor. Comput. Sci. 58: 3-16 (1988) - 1987
- [j5]Didier Arquès:
Relations fonctionnelles et dénombrement des cartes pointées sur le tore. J. Comb. Theory B 43(3): 253-274 (1987) - [j4]Didier Arquès:
Hypercartes pointées sur le tore: Décompositions et dénombrements. J. Comb. Theory B 43(3): 275-286 (1987) - 1986
- [j3]Didier Arquès:
Les hypercartes planaires sont des arbres tres bien etiquetes. Discret. Math. 58(1): 11-24 (1986) - [j2]Didier Arquès:
Dénombrements de Chemins Dans -Real 2 Soumis A Contraintes. RAIRO Theor. Informatics Appl. 20(4): 473-482 (1986) - [c2]Didier Arquès, Jean Françon, M. T. Guichet, P. Guichet:
Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach. ICALP 1986: 11-20 - 1985
- [j1]Didier Arquès:
Une relation fonctionnelle nouvelle sur les cartes planaires pointées. J. Comb. Theory B 39(1): 27-42 (1985) - 1984
- [c1]Didier Arquès, Jean Françon:
Arbres Bien Etiquetes et Fractions Multicontinues. CAAP 1984: 51-62
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-06-10 20:26 CEST 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:
