default search action
Bernard Péroche
Person information
- affiliation: LIRS Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
- [c11]Jean-Dominique Gascuel, Nicolas Holzschuch, Gabriel Fournier, Bernard Péroche:
Fast non-linear projections using graphics hardware. SI3D 2008: 107-114 - 2007
- [j22]Benjamin Segovia, Jean-Claude Iehl, Bernard Péroche:
Metropolis Instant Radiosity. Comput. Graph. Forum 26(3): 425-434 (2007) - 2006
- [c10]Benjamin Segovia, Jean-Claude Iehl, Richard Mitanchey, Bernard Péroche:
Non-interleaved Deferred Shading of Interleaved Sample Patterns. Graphics Hardware 2006: 53-60 - [c9]Benjamin Segovia, Jean-Claude Iehl, Richard Mitanchey, Bernard Péroche:
Bidirectional Instant Radiosity. Rendering Techniques 2006: 389-397 - 2005
- [j21]Gabriel Fournier, Bernard Péroche:
Speeding up global illumination computations using programmable GPUs. Simul. Model. Pract. Theory 13(8): 727-740 (2005) - [c8]Gabriel Fournier, Bernard Péroche:
Multi-mesh Caching and Hardware Sampling for Progressive and Interactive Rendering. WSCG (Full Papers) 2005: 63-70 - 2004
- [j20]Jean-Philippe Farrugia, Bernard Péroche:
A Progressive Rendering Algorithm Using an Adaptive Perceptually Based Image Metric. Comput. Graph. Forum 23(3): 605-614 (2004) - [c7]Jean-Philippe Farrugia, Stéphane Albin, Bernard Péroche:
A Perceptual Adaptive Metric for Computer Graphics. WSCG (Posters) 2004: 49-52 - [c6]Rodolphe Crespin, Bernard Péroche:
Light Vectors for a Moving Observer. WSCG 2004: 89-96 - 2003
- [j19]Jean-Claude Iehl, Bernard Péroche:
Towards perceptual control of physically based spectral rendering. Comput. Graph. 27(5): 747-762 (2003) - [c5]Stéphane Albin, Bernard Péroche:
Directionally Dependent Light Sources. WSCG 2003 - 2002
- [j18]Stéphane Albin, Gilles Rougeron, Bernard Péroche, Alain Trémeau:
Quality image metrics for synthetic images based on perceptual color differences. IEEE Trans. Image Process. 11(9): 961-971 (2002) - 2001
- [j17]Xavier Serpaggi, Bernard Peroche:
An Adaptive Method for Indirect Illumination Using Light Vectors. Comput. Graph. Forum 20(3): 268-277 (2001) - 2000
- [j16]N. Noé, Bernard Peroche:
Hierarchical Reconstruction of BRDFs using Locally Supported Functions. Comput. Graph. Forum 19(2): 173-184 (2000) - [j15]Jean-Claude Iehl, Bernard Péroche:
An Adaptive Spectral Rendering with a Perceptual Control. Comput. Graph. Forum 19(3): 291-300 (2000) - [e1]Bernard Peroche, Holly E. Rushmeier:
Proceedings of the Eurographics Workshop on Rendering Techniques 2000, Brno, Czech Republic, June 26-28, 2000. Eurographics, Springer 2000, ISBN 3-211-83535-0 [contents]
1990 – 1999
- 1999
- [j14]Jacques Zaninetti, Pierre Boy, Bernard Peroche:
An Adaptive Method for Area Light Sources and Daylight in Ray Tracing. Comput. Graph. Forum 18(3): 139-150 (1999) - 1998
- [j13]Gilles Rougeron, Bernard Péroche:
Color Fidelity in Computer Graphics: A Survey. Comput. Graph. Forum 17(1): 3-16 (1998) - [j12]Jacques Zaninetti, Xavier Serpaggi, Bernard Peroche:
A Vector Approach for Global Illumination in Ray Tracing. Comput. Graph. Forum 17(3): 149-158 (1998) - 1997
- [c4]Gilles Rougeron, Bernard Péroche:
An Adaptive Representation of Spectral Data for Reflectance Computations. Rendering Techniques 1997: 127-138 - 1996
- [j11]Abdelfata Nahed, Bernard Peroche:
A 2 1/2 -D hierarchical model based on planar maps. Comput. Graph. 20(1): 115-123 (1996) - 1994
- [j10]Mohand Ourabah Benouamer, Dominique Michelucci, Bernard Peroche:
Error-free boundary evaluation based on a lazy rational arithmetic: a detailed implementation. Comput. Aided Des. 26(6): 403-416 (1994) - [j9]Bernard Peroche, Christine Virlouvet:
Minimally 4-edge# -connected graphs. Discret. Math. 125(1-3): 289-299 (1994) - 1993
- [j8]Pascale Roudier, Bernard Peroche, M. Perrin:
Landscapes Synthesis Achieved through Erosion and Deposition Process Simulation. Comput. Graph. Forum 12(3): 375-383 (1993) - [c3]Mohand Ourabah Benouamer, Dominique Michelucci, Bernard Peroche:
Error-free boundary evaluation using lazy rational arithmetic: a detailed implementation. Solid Modeling and Applications 1993: 115-126 - 1991
- [j7]Djamchid Ghazanfarpour, Bernard Peroche:
A high-quality filtering using forward texture mapping. Comput. Graph. 15(4): 569-577 (1991)
1980 – 1989
- 1989
- [c2]Djamchid Ghazanfarpour, Bernard Péroche:
Anti-Aliasing by Successive Steps with a Z-Buffer. Eurographics 1989 - 1987
- [j6]A. Nakayama, Bernard Péroche:
Linear arboricity of digraphs. Networks 17(1): 39-53 (1987) - [c1]Djamchid Ghazanfarpour, Bernard Péroche:
A Fast Antialiasing Method with a Z-Buffer. Eurographics 1987 - 1984
- [j5]Bernard Péroche:
NP-completeness of some problems of partitioning and covering in graphs. Discret. Appl. Math. 8(2): 195-208 (1984) - [j4]Jean-Claude Bermond, Jean-Luc Fouquet, Michel Habib, Bernard Péroche:
On linear k-arboricity. Discret. Math. 52(2-3): 123-132 (1984) - [j3]Hikoe Enomoto, Bernard Péroche:
The linear arboricity of some regular graphs. J. Graph Theory 8(2): 309-324 (1984) - 1983
- [j2]Bernard Péroche:
On several sorts of connectivity. Discret. Math. 46(3): 267-277 (1983) - 1982
- [j1]Michel Habib, Bernard Péroche:
Some problems about linear arboricity. Discret. Math. 41(2): 219-220 (1982)
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 12:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint