Robert Carroll

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 Maneesh Agrawala

> Home > Persons > Robert Carroll

Publications

2011
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/tog/CarrollRA11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tog/CarrollRA11
Robert Carroll, Ravi Ramamoorthi, Maneesh Agrawala:
Illumination decomposition for material recoloring with consistent interreflections. ACM Trans. Graph. 30(4): 43 (2011)
2010
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/tog/CarrollAA10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tog/CarrollAA10
Robert Carroll, Aseem Agarwala, Maneesh Agrawala:
Image warps for artistic perspective manipulation. ACM Trans. Graph. 29(4): 127:1-127:9 (2010)
2009
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/tog/CarrollAA09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tog/CarrollAA09
Robert Carroll, Maneesh Agrawala, Aseem Agarwala:
Optimizing content-preserving projections for wide-angle images. ACM Trans. Graph. 28(3): 43 (2009)
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/tog/FattalCA09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tog/FattalCA09
Raanan Fattal, Robert Carroll, Maneesh Agrawala:
Edge-based image coarsening. ACM Trans. Graph. 29(1): 6:1-6:11 (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.