Pierre Poulin

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Anthony Pajot

> Home > Persons > Pierre Poulin

Publications

2011
[j13]
- view
  authority control:
- export record
  dblp key:
  - journals/cgf/PajotBPP11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cgf/PajotBPP11
Anthony Pajot, Loïc Barthe, Mathias Paulin, Pierre Poulin:
Combinatorial Bidirectional Path-Tracing for Efficient Hybrid CPU/GPU Rendering. Comput. Graph. Forum 30(2): 315-324 (2011)
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/tvcg/PajotBPP11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tvcg/PajotBPP11
Anthony Pajot, Loïc Barthe, Mathias Paulin, Pierre Poulin:
Representativity for Robust and Adaptive Multiple Importance Sampling. IEEE Trans. Vis. Comput. Graph. 17(8): 1108-1121 (2011)
2010
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/cgf/GourmelPPBP10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cgf/GourmelPPBP10
Olivier Gourmel, Anthony Pajot, Mathias Paulin, Loïc Barthe, Pierre Poulin:
Fitted BVH for Fast Raytracing of Metaballs. Comput. Graph. Forum 29(2): 281-288 (2010)
2009
[c38]
- view
  authority control:
- export record
  dblp key:
  - conf/siggraph/GourmelPBPP09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/siggraph/GourmelPBPP09
Olivier Gourmel, Anthony Pajot, Loïc Barthe, Mathias Paulin, Pierre Poulin:
BVH for efficient raytracing of dynamic metaballs on GPU. SIGGRAPH Talks 2009

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.