%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.86",
%%%     date            = "27 April 2012",
%%%     time            = "11:51:52 MDT",
%%%     filename        = "tog.bib",
%%%     address         = "University of Utah
%%%                        Department of Mathematics, 110 LCB
%%%                        155 S 1400 E RM 233
%%%                        Salt Lake City, UT 84112-0090
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     FAX             = "+1 801 581 4148",
%%%     URL             = "http://www.math.utah.edu/~beebe",
%%%     checksum        = "00225 59650 295731 2854163",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is a COMPLETE BibTeX bibliography for
%%%                        ACM Transactions on Graphics (CODEN ATGRDF,
%%%                        ISSN 0730-0301 (print), 1557-7368
%%%                        (electronic)), covering all journal issues
%%%                        from 1982 -- date.
%%%
%%%                        At version 1.86, the COMPLETE journal
%%%                        coverage looked like this:
%%%
%%%                             1982 (  20)    1993 (  17)    2004 ( 104)
%%%                             1983 (  15)    1994 (  20)    2005 ( 133)
%%%                             1984 (  17)    1995 (  19)    2006 ( 115)
%%%                             1985 (  15)    1996 (  16)    2007 ( 128)
%%%                             1986 (  16)    1997 (  15)    2008 ( 166)
%%%                             1987 (  18)    1998 (  12)    2009 ( 185)
%%%                             1988 (  15)    1999 (  14)    2010 ( 175)
%%%                             1989 (  22)    2000 (  13)    2011 ( 191)
%%%                             1990 (  28)    2001 (  10)    2012 (  17)
%%%                             1991 (  20)    2002 (  81)
%%%                             1992 (  25)    2003 ( 106)
%%%
%%%                             Article:       1748
%%%
%%%                             Total entries: 1748
%%%
%%%                        The journal Web page can be found at:
%%%
%%%                            http://www.acm.org/pubs/tog
%%%
%%%                        The journal table of contents page is at:
%%%
%%%                            http://www.acm.org/pubs/tog/TOC.html
%%%
%%%                        The article and Web site searcher is at:
%%%
%%%                            http://www.acm.org/pubs/tog/search.html
%%%
%%%                        The ACM Portal database site for the journal is at:
%%%
%%%                            http://portal.acm.org/browse_dl.cfm?idx=J778
%%%
%%%                        Qualified subscribers can retrieve the full
%%%                        text of recent articles in PDF form.
%%%
%%%                        The initial draft was extracted from the ACM
%%%                        Computing Archive CD ROM for the 1980s, with
%%%                        manual corrections and additions from
%%%                        bibliographies in the TeX User Group
%%%                        collection, the author's personal
%%%                        bibliography files, the OCLC Contents1st
%%%                        database, and a very large computer science
%%%                        bibliography collection on ftp.ira.uka.de in
%%%                        /pub/bibliography to which many people of
%%%                        have contributed.  The snapshot of this
%%%                        collection was taken on 5-May-1994, and it
%%%                        consists of 441 BibTeX files, 2,672,675
%%%                        lines, 205,289 entries, and 6,375
%%%                        <at>String{} abbreviations, occupying 94.8MB
%%%                        of disk space.  Where multiple sources of a
%%%                        particular entry existed, field values have
%%%                        been manually merged to preserve maximal
%%%                        information.
%%%
%%%                        The ACM maintains Web pages with journal
%%%                        tables of contents for 1985--1995 at
%%%                        http://www.acm.org/pubs/toc.  That data has
%%%                        been automatically converted to BibTeX
%%%                        form, corrected for spelling and page
%%%                        number errors, and merged into this file.
%%%
%%%                        ACM copyrights explicitly permit abstracting
%%%                        with credit, so article abstracts, keywords,
%%%                        and subject classifications have been
%%%                        included in this bibliography wherever
%%%                        available.  Article reviews have been
%%%                        omitted, until their copyright status has
%%%                        been clarified.
%%%
%%%                        bibsource keys in the bibliography entries
%%%                        below indicate the entry originally came
%%%                        from the computer science bibliography
%%%                        archive, even though it has likely since
%%%                        been corrected and updated.
%%%
%%%                        URL keys in the bibliography point to
%%%                        World Wide Web locations of additional
%%%                        information about the entry.
%%%
%%%                        BibTeX citation tags are uniformly chosen
%%%                        as name:year:abbrev, where name is the
%%%                        family name of the first author or editor,
%%%                        year is a 4-digit number, and abbrev is a
%%%                        3-letter condensation of important title
%%%                        words. Citation tags were automatically
%%%                        generated by software developed for the
%%%                        BibNet Project.
%%%
%%%                        In this bibliography, entries are sorted in
%%%                        publication order, using ``bibsort -byvolume.''
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility."
%%%     }
%%% ====================================================================

@Preamble{"\input bibnames.sty"}

%%% ====================================================================
%%% Acknowledgement abbreviations:

@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|http://www.math.utah.edu/~beebe/|"}

@String{ack-pb =    "Preston Briggs,
                     Tera Computer Company,
                     2815 Eastlake East,
                     Seattle, WA 98102,
                     USA,
                     Tel: +1 206 325-0800,
                     e-mail: \path|preston@tera.com|"}

%%% ====================================================================
%%% Journal abbreviations:

@String{j-TOG                   = "ACM Transactions on Graphics"}

%%% ====================================================================
%%% Bibliography entries:

@Article{Bergeron:1982:ATG,
  author =       "R. D. Bergeron",
  title =        "{Editor}'s Introduction",
  journal =      j-TOG,
  volume =       "1",
  number =       "1",
  pages =        "1--4",
  month =        jan,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 13 17:25:58 MDT 1994",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  info =         "Association for Computing Machinery, 11 West 42nd St.,
                 New York, NY, 10036. Published quarterly. Vol. 1, No. 1
                 (Jan. 1982). Annual subscription: 24 members, US\$65
                 nonmembers. Single copies: US\$10 members, US\$20
                 nonmembers ISSN 0730-03010",
  review =       "ACM CR 39358",
  subject =      "I.3 Computing Methodologies, COMPUTER GRAPHICS,
                 General",
}

@Article{Fuchs:1982:GEI,
  author =       "Henry Fuchs",
  title =        "{Guest Editor}'s Introduction",
  journal =      j-TOG,
  volume =       "1",
  number =       "1",
  pages =        "5--6",
  month =        jan,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 13 17:25:58 MDT 1994",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Cook:1982:RMC,
  author =       "R. L. Cook and K. E. Torrance",
  title =        "A Reflectance Model for Computer Graphics",
  journal =      j-TOG,
  volume =       "1",
  number =       "1",
  pages =        "7--24",
  month =        jan,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:11 2012",
  bibsource =    "Graphics/imager/imager.82.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I37 reflected light and color; shading; TOG",
}

@Article{Sechrest:1982:VPR,
  author =       "S. Sechrest and D. P. Greenberg",
  title =        "A Visible Polygon Reconstruction Algorithm",
  journal =      j-TOG,
  volume =       "1",
  number =       "1",
  pages =        "25--42",
  month =        jan,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/82.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I35 polygon reconstruction algorithm",
}

@Article{Whitted:1982:STD,
  author =       "T. Whitted and D. M. Weimer",
  title =        "A Software Testbed for the Development of 3{D} Raster
                 Graphics Systems",
  journal =      j-TOG,
  volume =       "1",
  number =       "1",
  pages =        "43--57",
  month =        jan,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:08:29 1994",
  bibsource =    "Graphics/siggraph/82.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I34 software testbed and I37 3-D shaded display",
}

@Article{Feiner:1982:ESC,
  author =       "Steven Feiner and Sandor Nagy and Andries van Dam",
  title =        "An experimental system for creating and presenting
                 interactive graphical documents",
  journal =      j-TOG,
  volume =       "1",
  number =       "1",
  pages =        "59--77",
  month =        jan,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 31 06:38:49 2003",
  bibsource =    "Graphics/imager/imager.82.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I34 interactive graphical documents",
}

@Article{Krogh:1982:AAP,
  author =       "F. T. Krogh",
  title =        "{ACM} Algorithms Policy",
  journal =      j-TOG,
  volume =       "1",
  number =       "1",
  pages =        "78--81",
  month =        jan,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Anonymous:1982:IA,
  author =       "Anonymous",
  title =        "Information for Authors",
  journal =      j-TOG,
  volume =       "1",
  number =       "1",
  pages =        "82--84",
  month =        jan,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:51:22 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Potmesil:1982:SIG,
  author =       "M. Potmesil and I. Chakravarty",
  title =        "Synthetic Image Generation with a Lens and Aperture
                 Camera Model",
  journal =      j-TOG,
  volume =       "1",
  number =       "2",
  pages =        "85--108",
  month =        apr,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.82.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I33 camera model; ray tracing effects; TOG",
}

@Article{Garrett:1982:GPU,
  author =       "M. T. Garrett and J. D. Foley",
  title =        "Graphics Programming Using a Database System with
                 Dependency Declarations",
  journal =      j-TOG,
  volume =       "1",
  number =       "2",
  pages =        "109--128",
  month =        apr,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/82.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I34 software support and I35 specification of
                 dependencies",
}

@Article{Hubschman:1982:FFC,
  author =       "H. Hubschman and S. W. Zucker",
  title =        "Frame-to-frame coherence and the hidden surface
                 computation: constraints for a convex world",
  journal =      j-TOG,
  volume =       "1",
  number =       "2",
  pages =        "129--162",
  month =        apr,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.82.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I37 frame-to-frame coherence",
}

@Article{VanWyk:1982:HLL,
  author =       "Christopher J. {Van Wyk}",
  title =        "A High-Level Language for Specifying Pictures",
  journal =      j-TOG,
  volume =       "1",
  number =       "2",
  pages =        "163--182",
  month =        apr,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tog.bib;
                 Misc/beebe.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Baecker:1982:SPR,
  author =       "R. M. Baecker",
  title =        "Sizing and Positioning Rectangles",
  journal =      j-TOG,
  volume =       "1",
  number =       "2",
  pages =        "184--185",
  month =        apr,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.82.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I36 Input Technique",
}

@Article{Evans:1982:R,
  author =       "Peter P. Tanner and Kenneth B. Evans",
  title =        "The Rack",
  journal =      j-TOG,
  volume =       "1",
  number =       "2",
  pages =        "186--188",
  month =        apr,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 6 16:39:10 1996",
  bibsource =    "Graphics/siggraph/82.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I37 Input Techniques",
}

@Article{Bergeron:1982:EI,
  author =       "R. Daniel Bergeron",
  title =        "{Editor}'s Introduction",
  journal =      j-TOG,
  volume =       "1",
  number =       "3",
  pages =        "189--189",
  month =        jul,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 16:39:30 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Guibas:1982:LBM,
  author =       "L. J. Guibas and J. Stolfi",
  title =        "A language for bitmap manipulation",
  journal =      j-TOG,
  volume =       "1",
  number =       "3",
  pages =        "191--214",
  month =        jul,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 13 17:25:58 MDT 1994",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; languages; standardization",
  review =       "ACM CR 39952",
  subject =      "D.3 Software, PROGRAMMING LANGUAGES, Language
                 Classifications \\ I.3.4 Computing Methodologies,
                 COMPUTER GRAPHICS, Graphics Utilities, Graphics
                 packages \\ I.3.4 Computing Methodologies, COMPUTER
                 GRAPHICS, Graphics Utilities, Picture description
                 languages \\ I.3.4 Computing Methodologies, COMPUTER
                 GRAPHICS, Graphics Utilities, Software support \\ I.3.6
                 Computing Methodologies, COMPUTER GRAPHICS, Methodology
                 and Techniques, Languages \\ I.4.0 Computing
                 Methodologies, IMAGE PROCESSING, General, Image
                 processing software",
}

@Article{Turkowski:1982:AAT,
  author =       "K. Turkowski",
  title =        "Anti-Aliasing through the Use of Coordinate
                 Transformations",
  journal =      j-TOG,
  volume =       "1",
  number =       "3",
  pages =        "215--234",
  month =        jul,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:07:27 1994",
  bibsource =    "Graphics/imager/imager.82.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I35 anti-aliasing convolution",
}

@Article{Blinn:1982:GAS,
  author =       "James F. Blinn",
  title =        "A Generalization of Algebraic Surface Drawing",
  journal =      j-TOG,
  volume =       "1",
  number =       "3",
  pages =        "235--256",
  month =        jul,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.82.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  annote =       "ray tracing ``blobby'' models: finding roots of sums
                 of Gaussians",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "blob; I33 light reflection; I33 realism clouds; model
                 visible; root finding; TOG",
}

@Article{Sproull:1982:UPT,
  author =       "R. F. Sproull",
  title =        "Using program transformations to derive line-drawing
                 algorithms",
  journal =      j-TOG,
  volume =       "1",
  number =       "4",
  pages =        "259--273",
  month =        oct,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.82.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I33 display algorithms",
}

@Article{Anderson:1982:HLE,
  author =       "D. P. Anderson",
  title =        "Hidden Line Elimination in Projected Grid Surfaces",
  journal =      j-TOG,
  volume =       "1",
  number =       "4",
  pages =        "274--288",
  month =        oct,
  year =         "1982",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/82.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I37 hidden line algorithms",
}

@Article{Pavlidis:1983:CFC,
  author =       "Theodosios Pavlidis",
  title =        "Curve Fitting with Conic Splines",
  journal =      j-TOG,
  volume =       "2",
  number =       "1",
  pages =        "1--31",
  month =        jan,
  year =         "1983",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.83.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I35 B{\'e}zier polynomials; I35 splines",
}

@Article{Sproull:1983:D,
  author =       "R. F. Sproull and I. E. Sutherland and A. Thomson and
                 S. Gupta and C. Minter",
  title =        "The 8 by 8 display",
  journal =      j-TOG,
  volume =       "2",
  number =       "1",
  pages =        "32--56",
  month =        jan,
  year =         "1983",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.83.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "frame-buffer; I32 display system",
}

@Article{Carlbom:1983:QAV,
  author =       "I. Carlbom and J. Michener",
  title =        "Quantitative Analysis of Vector Graphics System
                 Performance",
  journal =      j-TOG,
  volume =       "2",
  number =       "1",
  pages =        "57--88",
  month =        jan,
  year =         "1983",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/83.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I32 system performance evaluations and I36 addressing
                 schemes",
}

@Article{Tanner:1983:GEI,
  author =       "Peter P. Tanner",
  title =        "Guest Editor Introduction",
  journal =      j-TOG,
  volume =       "2",
  number =       "2",
  pages =        "89--89",
  month =        apr,
  year =         "1983",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 16:44:13 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Reeves:1983:PST,
  author =       "W. T. Reeves",
  title =        "Particle Systems -- a Technique for Modeling a Class
                 of Fuzzy Objects",
  journal =      j-TOG,
  volume =       "2",
  number =       "2",
  pages =        "91--108",
  month =        apr,
  year =         "1983",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/83.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I35 particle systems and I35 fuzzy objects and I37
                 aliasing and I37 clouds and I37 fire and I35 particle
                 systems and I37 temporal antialiasing and I37 water",
}

@Article{Barsky:1983:LCB,
  author =       "Brian A. Barsky and John C. Beatty",
  title =        "Local Control of Bias and Tension in Beta-splines",
  journal =      j-TOG,
  volume =       "2",
  number =       "2",
  pages =        "109--134",
  month =        apr,
  year =         "1983",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:10:04 1994",
  bibsource =    "Graphics/imager/imager.83.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also published in SIGGRAPH '83 Conference Proceedings
                 (Vol. 17, No. 3).",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; CAD/CAM; curves and surfaces; design and
                 modeling; differential geometry; I35 splines",
}

@Article{Pike:1983:GOB,
  author =       "R. Pike",
  title =        "Graphics in overlapping bitmap layers",
  journal =      j-TOG,
  volume =       "2",
  number =       "2",
  pages =        "135--160",
  month =        apr,
  year =         "1983",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.83.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bit blit; I33 asynchronous windows; I35 low-level
                 graphics primitives; I36 bitmap layers",
}

@Article{Kajiya:1983:NTR,
  author =       "James T. Kajiya",
  title =        "New Techniques for Ray Tracing Procedurally Defined
                 Objects",
  journal =      j-TOG,
  volume =       "2",
  number =       "3",
  pages =        "161--181",
  month =        jul,
  year =         "1983",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:12:20 1994",
  bibsource =    "Graphics/ray.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "Also appeared in SIGGRAPH '83 Proceedings, and in
                 Tutorial: Computer Graphics: Image Synthesis, Computer
                 Society Press, Washington, 1988, pp. 168--188.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "fractal; object intersection; prism; ray tracing;
                 surfaces of revolution",
}

@Article{Prosser:1983:IMG,
  author =       "Colin J. Prosser and Alistair C. Kilgour",
  title =        "An Integer Method for the Graphical Output of Conic
                 Sections",
  journal =      j-TOG,
  volume =       "2",
  number =       "3",
  pages =        "182--191",
  month =        jul,
  year =         "1983",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 6 16:45:56 1996",
  bibsource =    "Graphics/siggraph/83.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I35 conic section definitions and I35 curve
                 generation",
}

@Article{Lane:1983:AFR,
  author =       "J. M. Lane and R. Magedson and M. Rarick",
  title =        "An Algorithm for Filling Regions on Graphics Display
                 Devices",
  journal =      j-TOG,
  volume =       "2",
  number =       "3",
  pages =        "192--196",
  month =        jul,
  year =         "1983",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:13:47 1994",
  bibsource =    "Graphics/siggraph/83.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I35 shaded polygons; I37 filling algorithms",
}

@Article{Anderson:1983:TRP,
  author =       "D. P. Anderson",
  title =        "Techniques for Reducing Pen Plotting Time",
  journal =      j-TOG,
  volume =       "2",
  number =       "3",
  pages =        "197--212",
  month =        jul,
  year =         "1983",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/83.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I35 quadtrees and I36 plot minimisation",
}

@Article{Anonymous:1983:IA,
  author =       "Anonymous",
  title =        "Information for Authors",
  journal =      j-TOG,
  volume =       "2",
  number =       "3",
  pages =        "213--216",
  month =        jul,
  year =         "1983",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:51:22 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Burt:1983:MSA,
  author =       "P. J. Burt and E. H. Adelson",
  title =        "A multiresolution spline with application to image
                 mosaics",
  journal =      j-TOG,
  volume =       "2",
  number =       "4",
  pages =        "217--236",
  month =        oct,
  year =         "1983",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.83.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I33 Image Mosaics; I35 Multiresolution Splines; I35
                 Splines",
}

@Article{McIlroy:1983:BAC,
  author =       "M. McIlroy",
  title =        "Best Approximate Circles on Integer Grids",
  journal =      j-TOG,
  volume =       "2",
  number =       "4",
  pages =        "237--263",
  month =        oct,
  year =         "1983",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:14:04 1994",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; theory; verification",
  review =       "ACM CR 8502-0147",
  subject =      "I.3 Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation \\ F.2.2 Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Geometrical problems and computations",
}

@Article{Dunlavey:1983:EPF,
  author =       "M. R. Dunlavey",
  title =        "Efficient Polygon-Filling Algorithms for Raster
                 Displays",
  journal =      j-TOG,
  volume =       "2",
  number =       "4",
  pages =        "264--273",
  month =        oct,
  year =         "1983",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/83.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I37 Filling Algorithm",
}

@Article{Liang:1984:NCM,
  author =       "Y.-D. Liang and B. A. Barsky",
  title =        "A New Concept and Method for Line Clipping",
  journal =      j-TOG,
  volume =       "3",
  number =       "1",
  pages =        "1--22",
  month =        jan,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:22:24 1994",
  bibsource =    "Graphics/siggraph/84.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I33 Line Clipping",
}

@Article{Lantz:1984:SGD,
  author =       "K. A. Lantz and W. I. Nowicki",
  title =        "Structured Graphics for Distributed Systems",
  journal =      j-TOG,
  volume =       "3",
  number =       "1",
  pages =        "23--51",
  month =        jan,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.84.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I32 distributed systems; I32 workstations; I36 user
                 interfaces",
}

@Article{Weghorst:1984:ICM,
  author =       "Hank Weghorst and Gary Hooper and Donald P.
                 Greenberg",
  title =        "Improved Computational Methods for Ray Tracing",
  journal =      j-TOG,
  volume =       "3",
  number =       "1",
  pages =        "52--69",
  month =        jan,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.84.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  annote =       "discussion of bounding volumes, hierarchical
                 structures and the ``item buffer'' \\ This paper
                 describes algorithmic procedures that have been
                 implemented to reduce the computational expense of
                 producing ray-traced images. The selection of bounding
                 volumes is examined to reduce the computational cost of
                 the ray-intersection test. The use of object coherence,
                 which relies on a hierarchical description of the
                 environment, is then presented. Finally, since the
                 building of the ray-intersection trees is such a large
                 portion of the computation, a method using image
                 coherence is described. This visible-surface
                 preprocessing method, which is dependent upon the
                 creation of an ``item buffer,'' takes advantage of {\em
                 a priori} image formation. Examples that indicate the
                 efficiency of these techniques for a variety of
                 representative environments are presented.",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bounding volume; I35 Ray Tracing",
}

@Article{Levy:1984:VSG,
  author =       "H. M. Levy",
  title =        "{Vax} Station: {A} General-Purpose Raster Graphics
                 Architecture",
  journal =      j-TOG,
  volume =       "3",
  number =       "1",
  pages =        "70--83",
  month =        jan,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.84.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I32 raster graphics architecture; I32 workstations",
}

@Article{Edahiro:1984:NPL,
  author =       "M. Edahiro and I. Kokubo and Ta. Asano",
  title =        "A new point-location algorithm and its practical
                 efficiency: comparison with existing algorithms",
  journal =      j-TOG,
  volume =       "3",
  number =       "2",
  pages =        "86--109",
  month =        apr,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:17:50 1994",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/84.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bucketing; computational complexity; computational
                 geometry; implementing algorithms; multidimensional
                 search; planar graphs; point location; VLSI design",
}

@Article{Ghosh:1984:BTA,
  author =       "P. K. Ghosh and S. P. Mudur",
  title =        "The Bush-Trajectory Approach to Figure Specification:
                 Some Algebraic Solutions",
  journal =      j-TOG,
  volume =       "3",
  number =       "2",
  pages =        "110--134",
  month =        apr,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.84.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I37 figure specification",
}

@Article{Chazelle:1984:TSC,
  author =       "B. Chazelle and J. Incerpi",
  title =        "Triangulation and shape-complexity",
  journal =      j-TOG,
  volume =       "3",
  number =       "2",
  pages =        "135--152",
  month =        apr,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/84.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "decomposition; divide-and-conquer; polygons; simple;
                 triangulation",
  oldlabel =     "geom-1055",
}

@Article{Fournier:1984:TSP,
  author =       "A. Fournier and D. Y. Montuno",
  title =        "Triangulating Simple Polygons and Equivalent
                 Problems",
  journal =      j-TOG,
  volume =       "3",
  number =       "2",
  pages =        "153--174",
  month =        apr,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.84.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also, DGP Technical Memo DGP84--4.",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational geometry; decomposition; scan
                 conversion; trapezoid",
}

@Article{Olsen:1984:PAU,
  author =       "Dan R. {Olsen, Jr.}",
  title =        "Pushdown automata for user interface management",
  journal =      j-TOG,
  volume =       "3",
  number =       "3",
  pages =        "177--203",
  month =        jul,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/84.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "automata; graphical device handling; interaction",
}

@Article{Goldman:1984:MCC,
  author =       "Ronald N. Goldman",
  title =        "Markov Chains and Computer-Aided Geometric Design:
                 Part {I} - Problems and Constraints",
  journal =      j-TOG,
  volume =       "3",
  number =       "3",
  pages =        "204--222",
  month =        jul,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:20:34 1994",
  bibsource =    "Graphics/siggraph/84.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "probability distribution; stochastic process",
}

@Article{vanWijk:1984:RTO,
  author =       "Jarke J. van Wijk",
  title =        "Ray Tracing Objects Defined By Sweeping Planar Cubic
                 Splines",
  journal =      j-TOG,
  volume =       "3",
  number =       "3",
  pages =        "223--237",
  month =        jul,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 13:10:45 1996",
  bibsource =    "Graphics/imager/imager.84.bib;
                 Graphics/siggraph/85.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  annote =       "ray tracing prisms, cones, and surfaces of revolution
                 \\ The crucial step in a program based on ray tracing
                 is the calculation of the intersection of a line with
                 an object. In this paper, algorithms are presented for
                 performing this calculation for objects defined by
                 sweeping a planar cubic spline through space.
                 Translational, rotational, and conic sweeping are
                 treated. Besides solutions for the exact calculation,
                 rectangle tests for improving efficiency are given.
                 Possible extensions and improvements are discussed.",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cones; I37 ray-tracing and I35 sweeping planar cubic
                 splines; object intersection; prisms; ray tracing
                 intersect sweep; spline; surfaces of revolution; TOG",
}

@Article{Anonymous:1984:IA,
  author =       "Anonymous",
  title =        "Information for Authors",
  journal =      j-TOG,
  volume =       "3",
  number =       "3",
  pages =        "238--240",
  month =        jul,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 13:10:43 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Forrest:1984:GEI,
  author =       "Robin Forrest and Leo Guibas and Jurg Nievergelt",
  title =        "{Guest Editor}'s Introduction to Special Issue on
                 Computational Geometry",
  journal =      j-TOG,
  volume =       "3",
  number =       "4",
  pages =        "241--243",
  month =        oct,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 16:50:37 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tor:1984:CDS,
  author =       "S. B. Tor and A. E. Middleditch",
  title =        "Convex Decomposition of Simple Polygons",
  journal =      j-TOG,
  volume =       "3",
  number =       "4",
  pages =        "244--265",
  month =        oct,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.84.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "complexity; geometric modeling; geometrical convexity;
                 I35 convex decomposition; point set operations;
                 polygons; region decomposition",
}

@Article{Boissonnat:1984:GST,
  author =       "Jean-Daniel Boissonnat",
  title =        "Geometric structures for three-dimensional shape
                 representation",
  journal =      j-TOG,
  volume =       "3",
  number =       "4",
  pages =        "266--286",
  month =        oct,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.84.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "$k-d$ tree; computational geometry; Delaunay
                 triangulation; polyhedra",
}

@Article{Lee:1984:AFE,
  author =       "Y. T. Lee and A. de Pennington and N. K. Shaw",
  title =        "Automatic finite-element mesh generation from
                 geometric models --- {A} point-based approach",
  journal =      j-TOG,
  volume =       "3",
  number =       "4",
  pages =        "287--311",
  month =        oct,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.84.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational geometry; CSG; finite-element analysis;
                 geometric modeling; mesh construction; point
                 distribution",
}

@Article{Badler:1984:WC,
  author =       "Norman I. Badler and Tamar E. Granor",
  title =        "The window controller",
  journal =      j-TOG,
  volume =       "3",
  number =       "4",
  pages =        "312--315",
  month =        oct,
  year =         "1984",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/84.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Field:1985:ILI,
  author =       "Dan Field",
  title =        "Incremental Linear Interpolation",
  journal =      j-TOG,
  volume =       "4",
  number =       "1",
  pages =        "1--11",
  month =        jan,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:29:02 1994",
  bibsource =    "Graphics/siggraph/85.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/3976.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Bresenham's algorithm; digital differential analyzer;
                 scan conversion",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation. {\bf G.1.0}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, General, Error analysis.
                 {\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display
                 algorithms.",
}

@Article{Goldman:1985:MCC,
  author =       "R. N. Goldman",
  title =        "Markov Chains and Computer Aided Geometric Design {II}
                 --- Examples and Subdivision Matrices",
  journal =      j-TOG,
  volume =       "4",
  number =       "1",
  pages =        "12--40",
  month =        jan,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.85.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/3974.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design; I37 Markov processes; I37 stochastic
                 processes; probability distribution; stochastic
                 process; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Geometrical problems and computations. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD).",
}

@Article{Ayala:1985:ORM,
  author =       "D. Ayala and P. Brunet and R. Juan and I. Navazo",
  title =        "Object representation by means of nonminimal division
                 quadtrees and octrees",
  journal =      j-TOG,
  volume =       "4",
  number =       "1",
  pages =        "41--59",
  month =        jan,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.85.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/3975.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; geometric modeling",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Modeling
                 packages. {\bf I.3.3}: Computing Methodologies,
                 COMPUTER GRAPHICS, Picture/Image Generation, Display
                 algorithms.",
}

@Article{Woo:1985:LTA,
  author =       "T. C. Woo and S. Y. Shin",
  title =        "A Linear Time Algorithm for Triangulating a
                 Point-Visible Polygon",
  journal =      j-TOG,
  volume =       "4",
  number =       "1",
  pages =        "60--69",
  month =        jan,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 6 16:58:51 1996",
  bibsource =    "Graphics/siggraph/85.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational geometry; triangulation",
}

@Article{Anonymous:1985:AI,
  author =       "Anonymous",
  title =        "Author Index",
  journal =      j-TOG,
  volume =       "4",
  number =       "1",
  pages =        "71--72",
  month =        jan,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 15:42:46 1996",
  bibsource =    "Graphics/siggraph/85.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Guibas:1985:PMG,
  author =       "Leonidas Guibas and Jorge Stolfi",
  title =        "Primitives for the manipulation of general
                 subdivisions and computation of {Voronoi} diagrams",
  journal =      j-TOG,
  volume =       "4",
  number =       "2",
  pages =        "74--123",
  month =        apr,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:30:45 1994",
  bibsource =    "Graphics/imager/imager.85.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "closest point; computational topology; convex hull;
                 data structuring; Delaunay diagrams; design of
                 algorithms; Euler operators; geometric primitives;
                 nearest neighbors; planar graphs; point location;
                 representation of polyhedra; triangulations",
}

@Article{Nishita:1985:SMP,
  author =       "T. Nishita and I. Okamura and E. Nakamae",
  title =        "Shading Models for Point and Linear Sources",
  journal =      j-TOG,
  volume =       "4",
  number =       "2",
  pages =        "124--146",
  month =        apr,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 02:08:52 1994",
  bibsource =    "Graphics/imager/imager.85.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I37 shading models; lighting simulation; luminous
                 intensity distribution",
}

@Article{VanAken:1985:CDA,
  author =       "J. {Van Aken} and M. Novak",
  title =        "Curve-Drawing Algorithms for Raster Displays",
  journal =      j-TOG,
  volume =       "4",
  number =       "2",
  pages =        "147--169",
  month =        apr,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.85.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  annote =       "Corrections in TOG 1987 vol.6 no.1, p.80",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "I35 curve drawing algorithms",
}

@Article{Cohen:1985:ADR,
  author =       "Elaine Cohen and Tom Lyche and Larry L. Schumaker",
  title =        "Algorithms for degree-raising of splines",
  journal =      j-TOG,
  volume =       "4",
  number =       "3",
  pages =        "171--181",
  month =        jul,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.85.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "B-spline; subdivision",
}

@Article{Samet:1985:SCP,
  author =       "Hanan Samet and Robert E. Webber",
  title =        "Storing a collection of polygons using quadtrees",
  journal =      j-TOG,
  volume =       "4",
  number =       "3",
  pages =        "182--222",
  month =        jul,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.85.bib;
                 Graphics/siggraph/82.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "geographic information; hierarchical data structures;
                 line representations; map overlay; polygonal
                 representations",
}

@Article{Goldman:1985:IEV,
  author =       "Ronald N. Goldman",
  title =        "Illicit expressions in vector algebra",
  journal =      j-TOG,
  volume =       "4",
  number =       "3",
  pages =        "223--243",
  month =        jul,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.85.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "vector geometry",
}

@Article{Anonymous:1985:CP,
  author =       "Anonymous",
  title =        "Call for Papers",
  journal =      j-TOG,
  volume =       "4",
  number =       "3",
  pages =        "244--244",
  month =        jul,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 15:44:00 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Robertson:1985:ASS,
  author =       "Philip K. Robertson and John F. O'Callaghan",
  title =        "The Application of Scene Synthesis Techniques to the
                 Display of Multidimensional Image Data",
  journal =      j-TOG,
  volume =       "4",
  number =       "4",
  pages =        "247--274",
  month =        oct,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:33:57 1994",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See corrigenda \cite{Robertson:1987:CAS}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/6117.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; I30 picture processing; I37 realism; I37
                 scene synthesis; theory",
  review =       "ACM CR 8704-0311",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation. {\bf H.1.2}:
                 Information Systems, MODELS AND PRINCIPLES,
                 User/Machine Systems.",
}

@Article{Patterson:1985:PTP,
  author =       "Richard R. Patterson",
  title =        "Projective Transformations of the Parameter of a
                 {Bernstein}-{B{\'e}zier} Curve",
  journal =      j-TOG,
  volume =       "4",
  number =       "4",
  pages =        "276--290",
  month =        oct,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:33:07 1994",
  bibsource =    "Graphics/siggraph/86.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See corrigendum \cite{Patterson:1987:CTP}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/6119.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design; I35 Bernstein--B{\'e}zier curve; I35
                 projective transformations; theory",
  review =       "ACM CR 8704-0312",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Geometrical problems and computations.",
}

@Article{Bronsvoort:1985:RTG,
  author =       "Willem F. Bronsvoort and Fopke Klok",
  title =        "Ray Tracing Generalized Cylinders",
  journal =      j-TOG,
  volume =       "4",
  number =       "4",
  pages =        "291--303",
  month =        oct,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:27:04 1994",
  bibsource =    "Graphics/imager/imager.85.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See corrigendum \cite{Bronsvoort:1987:CTG}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/6118.html",
  acknowledgement = ack-nhfb,
  annote =       "An algorithm is presented for ray tracing generalized
                 cylinders, that is, objects defined by sweeping a
                 two-dimensional contour along a three-dimensional
                 trajectory. The contour can be any ``well-behaved''
                 curve in the sense that it is continuous, and that the
                 points where the tangent is horizontal or vertical can
                 be determined; the trajectory can be any spline curve.
                 First a definition is given of generalized cylinders in
                 terms of the Frenet frame of the trajectory. Then the
                 main problem in ray tracing these objects, the
                 computation of the intersection points with a ray, is
                 reduced to the problem of intersecting two
                 two-dimensional curves. This problem is solved by a
                 subdivision algorithm. The three-dimensional normal at
                 the intersection point closest to the eye point,
                 necessary to perform the shading, is obtained by
                 transforming the two-dimensional normal at the
                 corresponding intersection point of the two
                 two-dimensional curves. In this way it is possible to
                 obtain highly realistic images for a very broad class
                 of objects.",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; Frenet frame; human factors; I37
                 ray tracing; object intersection; solid modeling;
                 splines; theory",
  review =       "ACM CR 8708-0703",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Modeling
                 packages. {\bf I.3.7}: Computing Methodologies,
                 COMPUTER GRAPHICS, Three-Dimensional Graphics and
                 Realism, Color, shading, shadowing, and texture. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD). {\bf I.3.7}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism, Visible
                 line/surface algorithms.",
}

@Article{Mantyla:1986:BOT,
  author =       "Martti Mantyla",
  title =        "{Boolean} operations of 2-manifolds through vertex
                 neighborhood classification",
  journal =      j-TOG,
  volume =       "5",
  number =       "1",
  pages =        "1--29",
  month =        jan,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:47:29 1994",
  bibsource =    "Graphics/imager/imager.86.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/7530.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; set operations; shape operations; solid
                 modeling",
  review =       "ACM CR 8707-0610",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Geometric algorithms, languages, and systems. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD). {\bf F.2.2}:
                 Theory of Computation, ANALYSIS OF ALGORITHMS AND
                 PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Geometrical problems and computations.",
}

@Article{Meyer:1986:EEC,
  author =       "Gary W. Meyer and Holly E. Rushmeier and Michael F.
                 Cohen and Donald P. Greenberg and Kenneth E. Torrance",
  title =        "An Experimental Evaluation of Computer Graphics
                 Imagery",
  journal =      j-TOG,
  volume =       "5",
  number =       "1",
  pages =        "30--50",
  month =        jan,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:47:53 1994",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/7920.html",
  acknowledgement = ack-nhfb,
  annote =       "side-by-side test of reality vs. a radiosity image",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "experimentation; human factors; measurement;
                 verification",
  review =       "ACM CR 8707-0608",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Viewing algorithms.
                 {\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques, Ergonomics. {\bf
                 I.3.7}: Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism, Color, shading,
                 shadowing, and texture. {\bf I.4.8}: Computing
                 Methodologies, IMAGE PROCESSING, Scene Analysis,
                 Photometry. {\bf I.2.10}: Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Vision and Scene
                 Understanding, Intensity, color, photometry, and
                 thresholding.",
}

@Article{Cook:1986:SSC,
  author =       "Robert L. Cook",
  title =        "Stochastic Sampling in Computer Graphics",
  journal =      j-TOG,
  volume =       "5",
  number =       "1",
  pages =        "51--72",
  month =        jan,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:39:28 1994",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See remarks \cite{Pavlidis:1990:RCS,Wold:1990:RCS}.
                 Also in Tutorial: Computer Graphics: Image Synthesis,
                 Computer Society Press, Washington, 1988, pp.
                 283--304.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/8927.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; antialiasing; depth of field; filtering;
                 image synthesis; Monte Carlo integration; motion blur;
                 raster graphics; ray tracing; stochastic sampling",
  review =       "ACM CR 8709-0784",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Viewing algorithms.
                 {\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Probabilistic algorithms (including Monte
                 Carlo).",
}

@Article{Foley:1986:GEIa,
  author =       "James Foley",
  title =        "{Guest Editor}'s Introduction: Special Issue on User
                 Interface Software",
  journal =      j-TOG,
  volume =       "5",
  number =       "2",
  pages =        "75--78",
  month =        apr,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 17:02:57 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Scheifler:1986:XWS,
  author =       "Robert W. Scheifler and Jim Gettys",
  title =        "The {X} Window System",
  journal =      j-TOG,
  volume =       "5",
  number =       "2",
  pages =        "79--109",
  month =        apr,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:51:29 1994",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/24053.html",
  acknowledgement = ack-nhfb,
  annote =       "An overview of the X Window System is presented,
                 focusing on the system substrate and the low-level
                 facilities provided to build applications and to manage
                 the desktop. The system provides high-performance,
                 high-level, device-independent graphics. A hierarchy of
                 resizable, overlapping windows allows a wide variety of
                 application and user interfaces to be built easily.
                 Network-transparent access to the display provides an
                 important degree of functional separation, without
                 significantly affecting performance, which is crucial
                 to building applications for a distributed environment.
                 To a reasonable extent, desktop management can be
                 custom-tailored to individual environments, without
                 modifying the base system and typically without
                 affecting applications.",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "communication management; computer graphics;
                 computer-communication networks; design; device
                 independence; distributed applications; distributed
                 systems; distributed/network graphics; experimentation;
                 graphics packages; graphics systems; graphics
                 utilities; human factors; interaction techniques;
                 methodology and techniques; models and principles;
                 network communication; network protocols; operating
                 systems; protocol architecture; software support;
                 standardization; terminal management; user/machine
                 systems; virtual terminals; window managers; window
                 systems",
  review =       "ACM CR 8803-0219",
  subject =      "{\bf I.3.2}: Computing Methodologies, COMPUTER
                 GRAPHICS, Graphics Systems, Distributed/network
                 graphics. {\bf D.4.4}: Software, OPERATING SYSTEMS,
                 Communications Management, Terminal management. {\bf
                 H.1.2}: Information Systems, MODELS AND PRINCIPLES,
                 User/Machine Systems, Human factors. {\bf I.3.4}:
                 Computing Methodologies, COMPUTER GRAPHICS, Graphics
                 Utilities, Graphics packages. {\bf I.3.4}: Computing
                 Methodologies, COMPUTER GRAPHICS, Graphics Utilities,
                 Software support. {\bf I.3.6}: Computing Methodologies,
                 COMPUTER GRAPHICS, Methodology and Techniques, Device
                 independence. {\bf I.3.6}: Computing Methodologies,
                 COMPUTER GRAPHICS, Methodology and Techniques,
                 Interaction techniques.",
}

@Article{Mackinlay:1986:ADG,
  author =       "Jock Mackinlay",
  title =        "Automating the Design of Graphical Presentations of
                 Relational Information",
  journal =      j-TOG,
  volume =       "5",
  number =       "2",
  pages =        "110--141",
  month =        apr,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:46:30 1994",
  bibsource =    "Graphics/siggraph/86.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/22950.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; applications and expert systems;
                 artificial intelligence; automatic generation;
                 composition algebra; computer graphics; design; device
                 independence; effectiveness; ergonomics;
                 expressiveness; graphic design; human factors; human
                 information processing; information presentation;
                 information storage and retrieval; languages;
                 methodology and techniques; models and principles;
                 presentation tool; software engineering; systems and
                 software; theory; tools and techniques; user interface;
                 user interfaces; user/machine systems",
  subject =      "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
                 Techniques, User interfaces. {\bf H.1.2}: Information
                 Systems, MODELS AND PRINCIPLES, User/Machine Systems,
                 Human information processing. {\bf H.3.4}: Information
                 Systems, INFORMATION STORAGE AND RETRIEVAL, Systems and
                 Software. {\bf I.2.1}: Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Applications and Expert
                 Systems. {\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques, Device
                 independence. {\bf I.3.6}: Computing Methodologies,
                 COMPUTER GRAPHICS, Methodology and Techniques,
                 Ergonomics.",
}

@Article{Barth:1986:OAG,
  author =       "Paul S. Barth",
  title =        "An Object-Oriented Approach to Graphical Interfaces",
  journal =      j-TOG,
  volume =       "5",
  number =       "2",
  pages =        "142--172",
  month =        apr,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:37:27 1994",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/22951.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computer graphics; design; extensible languages;
                 graphical constraints; graphical interfaces; graphics
                 utilities; language classifications; languages;
                 methodology and techniques; object-oriented graphics;
                 programming languages; software reusability; software
                 support",
  review =       "ACM CR 8803-0185",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications. {\bf I.3.6}: Computing Methodologies,
                 COMPUTER GRAPHICS, Methodology and Techniques,
                 Languages. {\bf I.3.4}: Computing Methodologies,
                 COMPUTER GRAPHICS, Graphics Utilities, Software
                 support. {\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques, GROW. {\bf
                 D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Extensible languages.",
}

@Article{Foley:1986:GEIb,
  author =       "James Foley",
  title =        "{Guest Editor}'s Introduction: Special Issue on User
                 Interface Software",
  journal =      j-TOG,
  volume =       "5",
  number =       "3",
  pages =        "175--178",
  month =        jul,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 17:04:13 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hill:1986:SCC,
  author =       "Ralph D. Hill",
  title =        "Supporting Concurrency, Communication, and
                 Synchronization in Human-Computer Interaction -- the
                 {Sassafras} {UIMS}",
  journal =      j-TOG,
  volume =       "5",
  number =       "3",
  pages =        "179--210",
  month =        jul,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:44:29 1994",
  bibsource =    "Graphics/siggraph/86.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/24055.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computer graphics; concurrency; design;
                 experimentation; human factors; information systems;
                 interaction techniques; languages; message passing;
                 methodology and techniques; software engineering; tools
                 and techniques; user interface management systems; user
                 interfaces; user/machine systems",
  review =       "ACM CR 8712-0990",
  subject =      "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
                 Techniques, Sassafras. {\bf I.3.6}: Computing
                 Methodologies, COMPUTER GRAPHICS, Methodology and
                 Techniques, Languages. {\bf I.3.6}: Computing
                 Methodologies, COMPUTER GRAPHICS, Methodology and
                 Techniques, Interaction techniques. {\bf H.1.2}:
                 Information Systems, MODELS AND PRINCIPLES,
                 User/Machine Systems, Human factors. {\bf H.1.2}:
                 Information Systems, MODELS AND PRINCIPLES,
                 User/Machine Systems, UIMS.",
}

@Article{Henderson:1986:RUM,
  author =       "D. Austin {Henderson, Jr.} and Stuart K. Card",
  title =        "Rooms: the Use of Multiple Virtual Workspaces to
                 Reduce Space Contention in a Window-Based Graphical
                 User Interface",
  journal =      j-TOG,
  volume =       "5",
  number =       "3",
  pages =        "211--243",
  month =        jul,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:42:58 1994",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/24056.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bounded locality interval; computer graphics; design;
                 desktop; ergonomics; human factors; human information
                 processing; interaction techniques; locality set;
                 methodology and technique; models and principles;
                 operating systems; project views; resource contention;
                 rooms; storage management; theory; user/machine
                 systems; virtual memory; virtual workspace windows;
                 window manager; working set",
  subject =      "{\bf D.4.2}: Software, OPERATING SYSTEMS, Storage
                 Management, Virtual memory. {\bf H.1.2}: Information
                 Systems, MODELS AND PRINCIPLES, User/Machine Systems,
                 Human factors. {\bf H.1.2}: Information Systems, MODELS
                 AND PRINCIPLES, User/Machine Systems, Human information
                 processing. {\bf I.3.6}: Computing Methodologies,
                 COMPUTER GRAPHICS, Methodology and Techniques,
                 Ergonomics. {\bf I.3.6}: Computing Methodologies,
                 COMPUTER GRAPHICS, Methodology and Techniques,
                 Interaction techniques.",
}

@Article{Green:1986:STD,
  author =       "Mark Green",
  title =        "A Survey of Three Dialogue Models",
  journal =      j-TOG,
  volume =       "5",
  number =       "3",
  pages =        "244--275",
  month =        jul,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:41:43 1994",
  bibsource =    "Graphics/siggraph/86.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/24057.html",
  acknowledgement = ack-nhfb,
  annote =       "A dialogue model is an abstract model that is used to
                 describe the structure of the dialogue between a user
                 and an interactive computer system. Dialogue models
                 form the basis of the notations that are used in user
                 interface management systems (UIMS). In this paper
                 three classes of dialogue models are investigated.
                 These classes are transition networks, grammars, and
                 events. Formal definitions of all three models are
                 presented, along with algorithms for converting the
                 notations into an executable form. It is shown that the
                 event model has the greatest descriptive power.
                 Efficient algorithms for converting from the transition
                 diagram and grammar models to the event model are
                 presented. The implications of these results for the
                 design and implementation of UIMSs are also
                 discussed.",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; automata; computation by abstract devices;
                 computer graphics; design; dialogue models; human
                 factors; human-computer interaction; languages;
                 methodology and techniques; models of computation;
                 software engineering; theory; tools and techniques;
                 user interface management; user interfaces",
  subject =      "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
                 Techniques, User interfaces. {\bf F.1.1}: Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES, Models of
                 Computation, Automata. {\bf I.3.6}: Computing
                 Methodologies, COMPUTER GRAPHICS, Methodology and
                 Techniques, Interaction techniques.",
}

@Article{Anonymous:1986:IA,
  author =       "Anonymous",
  title =        "Information for Authors",
  journal =      j-TOG,
  volume =       "5",
  number =       "3",
  pages =        "276--278",
  month =        jul,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 17:06:48 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Foley:1986:GEIc,
  author =       "James Foley",
  title =        "{Guest Editor}'s Introduction: Special Issue on User
                 Interface Software",
  journal =      j-TOG,
  volume =       "5",
  number =       "4",
  pages =        "279--282",
  month =        oct,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 17:04:13 1996",
  bibsource =    "Graphics/siggraph/86.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Jacob:1986:SLD,
  author =       "Robert J. K. Jacob",
  title =        "A Specification Language for Direct-Manipulation User
                 Interfaces",
  journal =      j-TOG,
  volume =       "5",
  number =       "4",
  pages =        "283--317",
  month =        oct,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 13 17:25:58 MDT 1994",
  bibsource =    "Graphics/siggraph/86.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/27624.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design; direct manipulation; human factors; languages;
                 logics and meanings of programs; models and principles;
                 software engineering; specification language;
                 specification techniques; specifying and verifying and
                 reasoning about programs; state transition diagram;
                 tools and techniques; user interfaces; user-interface
                 management system (UIMS); user/machine systems",
  review =       "ACM CR 8804-0266",
  subject =      "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
                 Techniques, User interfaces. {\bf H.1.2}: Information
                 Systems, MODELS AND PRINCIPLES, User/Machine Systems,
                 Human factors. {\bf F.3.1}: Theory of Computation,
                 LOGICS AND MEANINGS OF PROGRAMS, Specifying and
                 Verifying and Reasoning about Programs, Specification
                 techniques. {\bf D.2.1}: Software, SOFTWARE
                 ENGINEERING, Requirements/Specifications, Languages.",
}

@Article{Olsen:1986:MMI,
  author =       "Dan R. {Olsen, Jr.}",
  title =        "{MIKE}: The Menu Interaction Kontrol Environment",
  journal =      j-TOG,
  volume =       "5",
  number =       "4",
  pages =        "318--344",
  month =        oct,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:49:36 1994",
  bibsource =    "Graphics/siggraph/86.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/28868.html",
  acknowledgement = ack-nhfb,
  annote =       "A User Interface Management System (UIMS) called MIKE
                 that does not use the syntactic specifications found in
                 most UIMSs is described. Instead, MIKE provides a
                 default syntax that is automatically generated from the
                 definition of the semantic commands that the
                 interaction is to support. The default syntax is
                 refined using an interface editor that allows
                 modification of the presentation of the interface. It
                 is shown how active pictures can be created by adding
                 action expressions to the viewports of MIKE's windowing
                 system. The implications of MIKE's command-based
                 dialogue description are discussed in terms of
                 extensible interfaces, device and dialogue-style
                 independence, and system support functions.",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computer graphics; design; dialogue design tools;
                 human factors; human-computer interfaces; interaction
                 techniques; methodologies; methodology and techniques;
                 miscellaneous; rapid prototyping; software engineering;
                 UIMS; user interface management systems",
  review =       "ACM CR 8803-0183",
  subject =      "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
                 Techniques, User interfaces. {\bf D.2.m}: Software,
                 SOFTWARE ENGINEERING, Miscellaneous, Rapid prototyping.
                 {\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques, Interaction
                 techniques. {\bf H.1.2}: Information Systems, MODELS
                 AND PRINCIPLES, User/Machine Systems, Human factors.
                 {\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
                 Techniques, MIKE. {\bf D.2.10}: Software, SOFTWARE
                 ENGINEERING, Design, Methodologies.",
}

@Article{Borning:1986:CTB,
  author =       "Alan Borning and Robert Duisberg",
  title =        "Constraint-Based Tools for Building User Interfaces",
  journal =      j-TOG,
  volume =       "5",
  number =       "4",
  pages =        "345--374",
  month =        oct,
  year =         "1986",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:38:23 1994",
  bibsource =    "Graphics/siggraph/86.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/29354.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; animation; computer graphics; consistency
                 of multiple views; constraint satisfaction;
                 constraints; graphical programming; language
                 classifications; languages; methodology and techniques;
                 miscellaneous; nonprocedural languages; object-oriented
                 programming; programming languages; rapid prototyping;
                 software engineering; temporal constraints; tools and
                 techniques; user interfaces; user-interface management
                 systems",
  subject =      "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
                 Techniques, User interfaces. {\bf D.2.m}: Software,
                 SOFTWARE ENGINEERING, Miscellaneous, Rapid prototyping.
                 {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Nonprocedural languages. {\bf I.3.6}:
                 Computing Methodologies, COMPUTER GRAPHICS, Methodology
                 and Techniques, Languages. {\bf I.3.7}: Computing
                 Methodologies, COMPUTER GRAPHICS, Three-Dimensional
                 Graphics and Realism, Animation.",
}

@Article{Foley:1987:WBS,
  author =       "Thomas A. Foley",
  title =        "Weighted Bicubic Spline Interpolation to Rapidly
                 Varying Data",
  journal =      j-TOG,
  volume =       "6",
  number =       "1",
  pages =        "1--18",
  month =        jan,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 09:07:21 1994",
  bibsource =    "Graphics/imager/imager.87.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/27626.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; bivariate interpolation; computer-aided
                 design",
  review =       "ACM CR 8803-0220",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Spline and piecewise polynomial
                 interpolation.",
}

@Article{McKenna:1987:WOH,
  author =       "Michael McKenna",
  title =        "Worst-case optimal hidden-surface removal",
  journal =      j-TOG,
  volume =       "6",
  number =       "1",
  pages =        "19--28",
  month =        jan,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:58:09 1994",
  bibsource =    "Graphics/siggraph/87.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/27627.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; arrangements of lines; complexity theory;
                 computer graphics; design; design of algorithms;
                 geometric complexity; hidden line/surface elimination;
                 hidden-line removal; performance; plane-sweep; theory;
                 topological sweep; verification; visibility; visibility
                 algorithm; visibility polyhedron",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Visible line/surface algorithms. {\bf F.2.2}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Computations on discrete structures. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems.",
}

@Article{Nasri:1987:PSM,
  author =       "Ahmad H. Nasri",
  title =        "Polyhedral subdivision methods for free-form
                 surfaces",
  journal =      j-TOG,
  volume =       "6",
  number =       "1",
  pages =        "29--73",
  month =        jan,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:59:23 1994",
  bibsource =    "Graphics/imager/imager.87.bib;
                 Graphics/siggraph/85.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/27628.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; B-spline; design; polyhedral subdivision",
  review =       "ACM CR 8802-0120",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.3}: Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation, Display algorithms. {\bf
                 F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems.",
}

@Article{Ressler:1987:IGT,
  author =       "Sanford Ressler",
  title =        "The Incrementor: a Graphical Technique for
                 Manipulating Parameters",
  journal =      j-TOG,
  volume =       "6",
  number =       "1",
  pages =        "74--78",
  month =        jan,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/87.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/214381.html",
  acknowledgement = ack-nhfb,
  annote =       "To visually organize a set of variables and to change
                 the values of those variables.",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design; human factors",
  subject =      "{\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques, Interaction
                 techniques. {\bf H.5.2}: Information Systems,
                 INFORMATION INTERFACES AND PRESENTATION, User
                 Interfaces, Input devices and strategies. {\bf H.5.2}:
                 Information Systems, INFORMATION INTERFACES AND
                 PRESENTATION, User Interfaces, Interaction styles.",
}

@Article{Patterson:1987:CTP,
  author =       "Richard R. Patterson",
  title =        "Corrigendum: ``{Projective Transformations of the
                 Parameter of a {Bernstein}-{B{\'e}zier} Curve}''",
  journal =      j-TOG,
  volume =       "6",
  number =       "1",
  pages =        "79--79",
  month =        jan,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 17:10:41 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See \cite{Patterson:1985:PTP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Cohen:1987:NLB,
  author =       "Elaine Cohen",
  title =        "A new local basis for designing with tensioned
                 splines",
  journal =      j-TOG,
  volume =       "6",
  number =       "2",
  pages =        "81--122",
  month =        apr,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 02:22:05 1994",
  bibsource =    "Graphics/imager/imager.87.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/31337.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; B-splines; beta-splines; CAGD; convex hull
                 property; geometric continuity; knot insertion;
                 nu-splines; theory; variation diminishing property;
                 visual continuity",
  review =       "ACM CR 8807-0544",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling.
                 {\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation.",
}

@Article{Schwarz:1987:ECR,
  author =       "Michael W. Schwarz and William B. Cowan and John C.
                 Beatty",
  title =        "An Experimental Comparison of {RGB}, {YIQ}, {LAB},
                 {HSV}, and Opponent Color Models",
  journal =      j-TOG,
  volume =       "6",
  number =       "2",
  pages =        "123--158",
  month =        apr,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:00:43 1994",
  bibsource =    "Graphics/imager/imager.87.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/31338.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "color matching; colour; experimentation; human
                 factors",
  review =       "ACM CR 8808-0634",
  subject =      "{\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques, Ergonomics. {\bf
                 I.3.6}: Computing Methodologies, COMPUTER GRAPHICS,
                 Methodology and Techniques, Interaction techniques.
                 {\bf I.3.1}: Computing Methodologies, COMPUTER
                 GRAPHICS, Hardware architecture, Raster display
                 devices.",
}

@Article{Hill:1987:ADR,
  author =       "Ralph D. Hill",
  title =        "Adaptive {2-D} Rotation Control",
  journal =      j-TOG,
  volume =       "6",
  number =       "2",
  pages =        "159--161",
  month =        apr,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:53:59 1994",
  bibsource =    "Graphics/siggraph/87.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  annote =       "To rotate objects rapidly and precisely to multiples
                 of 90 degrees, yet allow accurate selection of
                 arbitrary rotations.",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Robertson:1987:CAS,
  author =       "Philip K. Robertson and John F. O'Callaghan",
  title =        "Corrigenda: ``{The Application of Scene Synthesis
                 Techniques to the Display of Multidimensional Image
                 Data}''",
  journal =      j-TOG,
  volume =       "6",
  number =       "2",
  pages =        "162--162",
  month =        apr,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 13:13:04 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See \cite{Robertson:1985:ASS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Fournier:1987:GEI,
  author =       "A. Fournier and W. T. Reeves",
  title =        "{Guest Editors}' Introduction",
  journal =      j-TOG,
  volume =       "6",
  number =       "3",
  pages =        "165--166",
  month =        jul,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/87.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lewis:1987:GSS,
  author =       "J. P. Lewis",
  title =        "Generalized Stochastic Subdivision",
  journal =      j-TOG,
  volume =       "6",
  number =       "3",
  pages =        "167--190",
  month =        jul,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:56:51 1994",
  bibsource =    "Graphics/imager/imager.87.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/35069.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; color; fractals; modeling of natural
                 phenomena; shading; shadowing; stochastic
                 interpolation; stochastic models; texture synthesis;
                 waves",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation. {\bf I.3.7}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism, Color, shading,
                 shadowing, and texture. {\bf G.3}: Mathematics of
                 Computing, PROBABILITY AND STATISTICS, Probabilistic
                 algorithms (including Monte Carlo).",
}

@Article{Tso:1987:MRW,
  author =       "Pauline Y. Ts'o and Brian A. Barsky",
  title =        "Modeling and Rendering Waves: Wave-Tracing Using
                 Beta-Splines and Reflective and Refractive Texture
                 Mapping",
  journal =      j-TOG,
  volume =       "6",
  number =       "3",
  pages =        "191--214",
  month =        jul,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:01:29 1994",
  bibsource =    "Graphics/imager/imager.87.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/35070.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; Fresnel; hydrodynamics; wave
                 refraction; waves",
  review =       "ACM CR 8809-0721",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation. {\bf I.3.7}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism.",
}

@Article{Klassen:1987:MEA,
  author =       "R. Victor Klassen",
  title =        "Modeling the Effect of the Atmosphere on Light",
  journal =      j-TOG,
  volume =       "6",
  number =       "3",
  pages =        "215--237",
  month =        jul,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:55:32 1994",
  bibsource =    "Graphics/imager/imager.87.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/35071.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; fog; image synthesis; lighting
                 interaction; model atmosphere; natural sky simulation;
                 scattering; theory",
  review =       "ACM CR 8807-0543",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation. {\bf I.3.7}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism.",
}

@Article{Bronsvoort:1987:CTG,
  author =       "Willem F. Bronsvoort and Fopke Klok",
  title =        "Corrigendum: ``{Ray Tracing Generalized Cylinders}''",
  journal =      j-TOG,
  volume =       "6",
  number =       "3",
  pages =        "238--239",
  month =        jul,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 17:15:30 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See \cite{Bronsvoort:1985:RTG}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/214383.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; human factors; theory",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling.
                 {\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD).",
}

@Article{Anonymous:1987:IA,
  author =       "Anonymous",
  title =        "Information for Authors",
  journal =      j-TOG,
  volume =       "6",
  number =       "3",
  pages =        "240--242",
  month =        jul,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 17:17:45 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Knuth:1987:DHD,
  author =       "Donald E. Knuth",
  title =        "Digital Halftones by Dot Diffusion",
  journal =      j-TOG,
  volume =       "6",
  number =       "4",
  pages =        "245--273",
  month =        oct,
  year =         "1987",
  CODEN =        "ATGRDF",
  DOI =          "http://dx.doi.org/10.1145/35039.35040",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Mar 23 15:03:38 2002",
  bibsource =    "Graphics/imager/imager.87.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/35040.html",
  abstract =     "This paper describes a technique for approximating
                 real-valued pixels by two-valued pixels. The new
                 method, called dot diffusion, appears to avoid some
                 deficiencies of other commonly used techniques. It
                 requires approximately the same total number of
                 arithmetic operations as the Floyd-Steinberg method of
                 adaptive grayscale, and it is well suited to parallel
                 computation; but it requires more buffers and more
                 complex program logic than other methods when
                 implemented sequentially. A smooth variant of the
                 method may prove to be useful in high-resolution
                 printing.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; bilevel display; constrained average; edge
                 enhancement; error diffusion; facsimiles;
                 Floyd-Steinberg method; minimized average error; Mona
                 Lisa; ordered dither; parallel computing; printing",
  review =       "ACM CR 8808-0633",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.4.1}: Computing Methodologies, IMAGE PROCESSING,
                 Digitization, Quantization. {\bf I.4.3}: Computing
                 Methodologies, IMAGE PROCESSING, Enhancement, Grayscale
                 manipulation.",
}

@Article{Miller:1987:GAN,
  author =       "James R. Miller",
  title =        "Geometric Approaches to Nonplanar Quadric Surface
                 Intersection Curves",
  journal =      j-TOG,
  volume =       "6",
  number =       "4",
  pages =        "274--307",
  month =        oct,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:58:48 1994",
  bibsource =    "Graphics/imager/imager.87.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/35041.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; boundary evaluation; performance;
                 reliability; solid modeling",
  review =       "ACM CR 8807-0545",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems. {\bf J.6}: Computer
                 Applications, COMPUTER-AIDED ENGINEERING,
                 Computer-aided design (CAD).",
}

@Article{Kamada:1987:ETH,
  author =       "Tomihisa Kamada and Satoru Kawai",
  title =        "An enhanced treatment of hidden lines",
  journal =      j-TOG,
  volume =       "6",
  number =       "4",
  pages =        "308--323",
  month =        oct,
  year =         "1987",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:54:50 1994",
  bibsource =    "Graphics/imager/imager.87.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/35042.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; attribute binding; dotted hidden lines;
                 hidden line/surface removal; viewing transformation",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Viewing algorithms.
                 {\bf I.3.4}: Computing Methodologies, COMPUTER
                 GRAPHICS, Graphics Utilities, Graphics packages. {\bf
                 I.3.7}: Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism, Visible
                 line/surface algorithms.",
}

@Article{DeRose:1988:GCS,
  author =       "Tony D. DeRose and Brian A. Barsky",
  title =        "Geometric Continuity, Shape Parameters, and Geometric
                 Constructions for {Catmull}-{Rom} Splines",
  journal =      j-TOG,
  volume =       "7",
  number =       "1",
  pages =        "1--41",
  month =        jan,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:06:05 1994",
  bibsource =    "Graphics/imager/imager.88.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/42265.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; approximation; B-spline; B{\'e}zier
                 curves; computer-aided geometric design; curves and
                 surfaces; design",
  review =       "ACM CR 8811-0884",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD). {\bf G.1.1}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Spline and piecewise polynomial
                 interpolation. {\bf F.2.2}: Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Nonnumerical Algorithms and Problems, Geometrical
                 problems and computations. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Geometric algorithms,
                 languages, and systems.",
}

@Article{DeFloriani:1988:HBM,
  author =       "Leila {De Floriani} and Bianca Falcidieno",
  title =        "A hierarchical boundary model for solid object
                 representation",
  journal =      j-TOG,
  volume =       "7",
  number =       "1",
  pages =        "42--60",
  month =        jan,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 13 17:25:58 MDT 1994",
  bibsource =    "Graphics/imager/imager.88.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/46164.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; hierarchical data structures;
                 solid modeling boundary representation; tree graphs",
  review =       "ACM CR 8903-0165",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD).",
}

@Article{Veenstra:1988:LDO,
  author =       "Jack Veenstra and Narendra Ahuja",
  title =        "Line drawings of octree-represented objects",
  journal =      j-TOG,
  volume =       "7",
  number =       "1",
  pages =        "61--75",
  month =        jan,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:11:13 1994",
  bibsource =    "Graphics/imager/imager.88.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/42189.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; hidden line removal; three-dimensional
                 representation",
  review =       "ACM CR 8810-0807",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation.",
}

@Article{Bleser:1988:CSR,
  author =       "Teresa W. Bleser and John L. Sibert and J. Patrick
                 McGee",
  title =        "Charcoal Sketching: Returning Control to the Artist",
  journal =      j-TOG,
  volume =       "7",
  number =       "1",
  pages =        "76--81",
  month =        jan,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:02:54 1994",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/42230.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design; drawing; human factors",
  review =       "ACM CR 8902-0091",
  subject =      "{\bf J.5}: Computer Applications, ARTS AND HUMANITIES,
                 Arts, fine and performing. {\bf B.4.2}: Hardware,
                 INPUT/OUTPUT AND DATA COMMUNICATIONS, Input/Output
                 Devices.",
}

@Article{Ball:1988:CTP,
  author =       "A. A. Ball and D. J. T. Storry",
  title =        "Conditions for Tangent Plane Continuity Over
                 Recursively Generated {B}-Spline Surfaces",
  journal =      j-TOG,
  volume =       "7",
  number =       "2",
  pages =        "83--102",
  month =        apr,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:02:06 1994",
  bibsource =    "Graphics/imager/imager.88.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/42459.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; discrete Fourier transform;
                 nonrectangular topologies; recursive subdivision;
                 theory",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Smoothing. {\bf G.1.1}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Spline and piecewise polynomial
                 interpolation. {\bf G.1.3}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Numerical Linear Algebra,
                 Eigenvalues. {\bf I.3.5}: Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Geometric algorithms, languages, and systems.
                 {\bf J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD).",
}

@Article{Fournier:1988:PFB,
  author =       "Alain Fournier and Donald Fussell",
  title =        "On the Power of the Frame Buffer",
  journal =      j-TOG,
  volume =       "7",
  number =       "2",
  pages =        "103--128",
  month =        apr,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 13 17:25:58 MDT 1994",
  bibsource =    "Graphics/imager/imager.88.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/42460.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; complexity; shadow; visibility",
  review =       "ACM CR 8902-0088",
  subject =      "{\bf I.3.1}: Computing Methodologies, COMPUTER
                 GRAPHICS, Hardware architecture, Raster display
                 devices. {\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling.
                 {\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Color, shading, shadowing, and texture. {\bf I.3.7}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism, Visible
                 line/surface algorithms.",
}

@Article{Zyda:1988:DAC,
  author =       "Michael J. Zyda",
  title =        "A Decomposable Algorithm for Contour Surface Display
                 Generation",
  journal =      j-TOG,
  volume =       "7",
  number =       "2",
  pages =        "129--148",
  month =        apr,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:12:34 1994",
  bibsource =    "Graphics/imager/imager.88.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/42461.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; contour surface display generation;
                 contouring; contouring tree",
  review =       "ACM CR 8811-0883",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling.
                 {\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Visible line/surface algorithms.",
}

@Article{Gaudet:1988:MEH,
  author =       "Severin Gaudet and Richard Hobson and Pradeep Chilka
                 and Thomas Calvert",
  title =        "Multiprocessor Experiments for High Speed Ray
                 Tracing",
  journal =      j-TOG,
  volume =       "7",
  number =       "3",
  pages =        "151--179",
  month =        jul,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 13 17:25:58 MDT 1994",
  bibsource =    "Graphics/imager/imager.88.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/44480.html",
  acknowledgement = ack-nhfb,
  annote =       "Good review of previous work. They classify space into
                 shells (bounding volumes), starting from the parent
                 shell (the scene) to the leaf nodes (primitives). They
                 divide processing into three major tasks which are easy
                 to schedule and pipeline, and then define a processor
                 called a PERT (Pipelined Engine for Ray Tracing) which
                 can support these tasks and work either separately or
                 in parallel. A powerful, flexible system. \\ New
                 single- and multiprocessor models for ray tracing are
                 presented. Important features are (1) the use of custom
                 VLSI building blocks, (2) the use of a modified
                 hierarchical data-structure-based ray tracing algorithm
                 with three disjoint data sets, and (3) scene access
                 through adaptive information broadcasting. A modular
                 design is presented that permits incremental
                 performance enhancement up to two orders of magnitude
                 over conventional minicomputers or workstations. Ray
                 tracing is a surprisingly good application for a shared
                 bus architecture because of the computational
                 complexity of intersecting light rays with graphics
                 objects.",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "adaptive broadcasting; algorithms; bounding volume;
                 design; hardware; parallel processing; VLSI systems
                 design",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Color, shading, shadowing, and texture. {\bf C.1.2}:
                 Computer Systems Organization, PROCESSOR ARCHITECTURES,
                 Multiple Data Stream Architectures (Multiprocessors),
                 Parallel processors. {\bf C.1.2}: Computer Systems
                 Organization, PROCESSOR ARCHITECTURES, Multiple Data
                 Stream Architectures (Multiprocessors), Pipeline
                 processors. {\bf C.3}: Computer Systems Organization,
                 SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS,
                 Microprocessor/microcomputer applications. {\bf I.3.3}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation, Display algorithms. {\bf
                 I.3.7}: Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism, Animation.",
}

@Article{Duce:1988:FSS,
  author =       "D. A. Duce and E. V. C. Fielding and L. S. Marshall",
  title =        "Formal Specification of a Small Example Based on
                 {GKS}",
  journal =      j-TOG,
  volume =       "7",
  number =       "3",
  pages =        "180--197",
  month =        jul,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 13 17:25:58 MDT 1994",
  bibsource =    "Graphics/imager/imager.88.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/44481.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "abstract data type; bundled attributes; constructive
                 specification; design; implicit regeneration; standard;
                 standardization; verification",
  review =       "ACM CR 8904-0267",
  subject =      "{\bf I.3.4}: Computing Methodologies, COMPUTER
                 GRAPHICS, Graphics Utilities. {\bf I.3.4}: Computing
                 Methodologies, COMPUTER GRAPHICS, Graphics Utilities,
                 GKS. {\bf D.2.1}: Software, SOFTWARE ENGINEERING,
                 Requirements/Specifications. {\bf F.3.1}: Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS,
                 Specifying and Verifying and Reasoning about Programs,
                 Specification techniques.",
}

@Article{DeRose:1988:CBS,
  author =       "Tony D. DeRose",
  title =        "Composing {B{\'e}zier} simplexes",
  journal =      j-TOG,
  volume =       "7",
  number =       "3",
  pages =        "198--221",
  month =        jul,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:05:15 1994",
  bibsource =    "Graphics/imager/imager.88.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/44482.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; B{\'e}zier curves; computer-aided
                 geometric design; free-form deformations; geometric
                 continuity; triangular B{\'e}zier surface patches",
  subject =      "I.3.5 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Curve,
                 surface, solid, and object representations \\ J.6
                 Computer Applications, COMPUTER-AIDED ENGINEERING,
                 Computer-aided design (CAD)",
}

@Article{Anonymous:1988:IA,
  author =       "Anonymous",
  title =        "Information for Authors",
  journal =      j-TOG,
  volume =       "7",
  number =       "3",
  pages =        "222--224",
  month =        jul,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 17:19:55 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Olsen:1988:CST,
  author =       "Dan Olsen",
  title =        "Call for Submissions to the {TOG} Interactive
                 Techniques Notebook",
  journal =      j-TOG,
  volume =       "7",
  number =       "4",
  pages =        "227--228",
  month =        oct,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/88.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Beatty:1988:VAT,
  author =       "John C. Beatty",
  title =        "A Video Adjunct to {\em Transactions on Graphics}",
  journal =      j-TOG,
  volume =       "7",
  number =       "4",
  pages =        "229--230",
  month =        oct,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 17:22:18 1996",
  bibsource =    "Graphics/siggraph/88.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Westmore:1988:WGF,
  author =       "Richard J. Westmore",
  title =        "A Window-Based Graphics Frame Store Architecture",
  journal =      j-TOG,
  volume =       "7",
  number =       "4",
  pages =        "233--248",
  month =        oct,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:11:56 1994",
  bibsource =    "Graphics/imager/imager.88.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/46166.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "2D graphics; bit-mapped frame stores; design; VLSI;
                 window graphics; WSI",
  review =       "ACM CR 8903-0163",
  subject =      "{\bf I.3.1}: Computing Methodologies, COMPUTER
                 GRAPHICS, Hardware architecture, Raster display
                 devices. {\bf C.1.3}: Computer Systems Organization,
                 PROCESSOR ARCHITECTURES, Other Architecture Styles,
                 Cellular architecture. {\bf C.5.4}: Computer Systems
                 Organization, COMPUTER SYSTEM IMPLEMENTATION, VLSI
                 Systems. {\bf B.4.2}: Hardware, INPUT/OUTPUT AND DATA
                 COMMUNICATIONS, Input/Output Devices, Image display.
                 {\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques, Interaction
                 techniques.",
}

@Article{Stone:1988:CGM,
  author =       "Maureen C. Stone and William B. Cowan and John C.
                 Beatty",
  title =        "Color Gamut Mapping and the Printing of Digital Color
                 Images",
  journal =      j-TOG,
  volume =       "7",
  number =       "4",
  pages =        "249--292",
  month =        oct,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:10:33 1994",
  bibsource =    "Graphics/imager/imager.88.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/48045.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; color; color correction; color printing;
                 color reproduction; experimentation",
  review =       "ACM CR 8906-0410",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Color, shading, shadowing, and texture. {\bf I.3.4}:
                 Computing Methodologies, COMPUTER GRAPHICS, Graphics
                 Utilities. {\bf I.4.3}: Computing Methodologies, IMAGE
                 PROCESSING, Enhancement. {\bf I.4.1}: Computing
                 Methodologies, IMAGE PROCESSING, Digitization.",
}

@Article{Posch:1989:CA,
  author =       "K. C. Posch and W. D. Fellner",
  title =        "The Circle-Brush Algorithm",
  journal =      j-TOG,
  volume =       "8",
  number =       "1",
  pages =        "1--24",
  month =        jan,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 13 17:25:58 MDT 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/49156.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; brushing; design; performance; raster
                 graphics",
  review =       "ACM CR 8907-0500",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.1}: Computing Methodologies, COMPUTER
                 GRAPHICS, Hardware architecture, Raster display
                 devices.",
}

@Article{Middleditch:1989:IAL,
  author =       "A. E. Middleditch and T. W. Stacey and S. B. Tor",
  title =        "Intersection Algorithms for Lines and Circles",
  journal =      j-TOG,
  volume =       "8",
  number =       "1",
  pages =        "25--40",
  month =        jan,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:48:55 1996",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See corrigenda \cite{Baker:1994:CAL}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/49157.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "circle intersection; computation errors; computational
                 geometry; computer-aided drawing; line intersection;
                 measurement",
  review =       "ACM CR 8909-0683",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Geometric algorithms, languages, and systems. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD).",
}

@Article{Cheng:1989:PBS,
  author =       "Fuhua Cheng and Ardeshir Goshtasby",
  title =        "A Parallel {B}-spline Surface Fitting Algorithm",
  journal =      j-TOG,
  volume =       "8",
  number =       "1",
  pages =        "41--50",
  month =        jan,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:13:43 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/214377.html",
  acknowledgement = ack-nhfb,
  annote =       "Support different surface types. Because surface
                 fitting appears to be a O(nm) problem, attacking the
                 problem in parallel can make B-splines more
                 supportable. See also [Yang 87], [Schnieder 87].",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cyclic reduction; interpolation; recursive doubling;
                 uniform cubic B-spline",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Geometric algorithms,
                 languages, and systems.",
}

@Article{Rossignac:1989:AZC,
  author =       "Jaroslaw R. Rossignac and Herbert B. Voelcker",
  title =        "Active Zones in {CSG} for Accelerating Boundary
                 Evaluation, Redundancy Elimination, Interference
                 Detection, and Shading Algorithms",
  journal =      j-TOG,
  volume =       "8",
  number =       "1",
  pages =        "51--87",
  month =        jan,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:24:40 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/51123.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; boolean algebra; boundary evaluation;
                 design; performance; representation simplification;
                 solid modeling; theory",
  review =       "ACM CR 8909-0665 8909-0664",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Geometrical problems and
                 computations. {\bf B.6.3}: Hardware, LOGIC DESIGN,
                 Design Aids, Optimization. {\bf G.2.2}: Mathematics of
                 Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.
                 {\bf I.1.1}: Computing Methodologies, ALGEBRAIC
                 MANIPULATION, Expressions and Their Representation,
                 Simplification of expressions. {\bf I.3.3}: Computing
                 Methodologies, COMPUTER GRAPHICS, Picture/Image
                 Generation, Display algorithms. {\bf I.3.7}: Computing
                 Methodologies, COMPUTER GRAPHICS, Three-Dimensional
                 Graphics and Realism, Color, shading, shadowing, and
                 texture. {\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Visible line/surface algorithms. {\bf J.6}: Computer
                 Applications, COMPUTER-AIDED ENGINEERING,
                 Computer-aided design (CAD).",
}

@Article{Farin:1989:CCO,
  author =       "Gerald Farin",
  title =        "Curvature continuity and offsets for piecewise
                 conics",
  journal =      j-TOG,
  volume =       "8",
  number =       "2",
  pages =        "89--99",
  month =        apr,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:15:15 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/62056.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; conic sections; design; offset curves;
                 rational B{\'e}zier curves",
  review =       "ACM CR 9005-0426",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Spline and piecewise polynomial
                 interpolation. {\bf J.7}: Computer Applications,
                 COMPUTERS IN OTHER SYSTEMS, Publishing. {\bf I.7.2}:
                 Computing Methodologies, TEXT PROCESSING, Document
                 Preparation.",
}

@Article{Joe:1989:MRC,
  author =       "Barry Joe",
  title =        "Multiple-knot and rational cubic beta-splines",
  journal =      j-TOG,
  volume =       "8",
  number =       "2",
  pages =        "100--120",
  month =        apr,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 13 17:25:58 MDT 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/62055.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; computer-aided geometric design; geometric
                 continuity; rational curves and surfaces",
  review =       "ACM CR 8910-0754",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Spline and piecewise polynomial
                 interpolation.",
}

@Article{Mallet:1989:DSI,
  author =       "Jean-Laurent Mallet",
  title =        "Discrete smooth interpolation",
  journal =      j-TOG,
  volume =       "8",
  number =       "2",
  pages =        "121--144",
  month =        apr,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 13 17:25:58 MDT 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/62057.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; grid; splines; theory",
  review =       "ACM CR 8908-0560",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Interpolation formulas. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Smoothing. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Curve, surface, solid,
                 and object representations.",
}

@Article{Bartels:1989:GEIa,
  author =       "Richard H. Bartels and Ronald N. Goldman",
  title =        "{Guest Editors}' Introduction: Special Issue on
                 Computer-Aided Geometric Design",
  journal =      j-TOG,
  volume =       "8",
  number =       "3",
  pages =        "145--146",
  month =        jul,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Stone:1989:GCP,
  author =       "Maureen C. Stone and Tony D. DeRose",
  title =        "A geometric characterization of parametric cubic
                 curves",
  journal =      j-TOG,
  volume =       "8",
  number =       "3",
  pages =        "147--163",
  month =        jul,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 13 17:25:58 MDT 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77056.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; B{\'e}zier curves; design; spline curves",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Spline and piecewise polynomial
                 interpolation.",
}

@Article{Filip:1989:BPS,
  author =       "Daniel J. Filip",
  title =        "Blending Parametric Surfaces",
  journal =      j-TOG,
  volume =       "8",
  number =       "3",
  pages =        "164--173",
  month =        jul,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 13 17:25:58 MDT 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77057.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; computer-aided geometric design; geometric
                 continuity; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Spline and piecewise polynomial
                 interpolation.",
}

@Article{Farouki:1989:APD,
  author =       "R. T. Farouki and C. A. Neff and M. A. O'Connor",
  title =        "Automatic Parsing of Degenerate Quadric-Surface
                 Intersections",
  journal =      j-TOG,
  volume =       "8",
  number =       "3",
  pages =        "174--203",
  month =        jul,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Sep 07 12:33:14 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77058.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; degenerate intersections; discriminant;
                 multivariate polynomial factorization; projecting cone;
                 quadric surfaces; rational parameterizations; Segre
                 characteristic; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.1.2}: Computing Methodologies, ALGEBRAIC
                 MANIPULATION, Algorithms, Algebraic algorithms.",
}

@Article{Loop:1989:MGB,
  author =       "Charles T. Loop and Tony D. DeRose",
  title =        "A multisided generalization of {B{\'e}zier} surfaces",
  journal =      j-TOG,
  volume =       "8",
  number =       "3",
  pages =        "204--234",
  month =        jul,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:19:31 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77059.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; computer-aided geometric design; design;
                 tensor product B{\'e}zier surfaces; theory; triangular
                 B{\'e}zier surface patches",
  review =       "ACM CR 9007-0610",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING.",
}

@Article{Peters:1989:LGH,
  author =       "J{\"o}rg Peters",
  title =        "Local Generalized {Hermite} Interpolation by Quartic
                 {$C^2$} Space Curves",
  journal =      j-TOG,
  volume =       "8",
  number =       "3",
  pages =        "235--242",
  month =        jul,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:21:42 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77060.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; C2 space curves; geometric smoothness;
                 intersection of osculating planes; local interpolation
                 scheme; theory",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Curve, surface, solid,
                 and object representations.",
}

@Article{Prautzsch:1989:RTB,
  author =       "Hartmut Prautzsch",
  title =        "A Round Trip to {B}-Splines Via {De Casteljau}",
  journal =      j-TOG,
  volume =       "8",
  number =       "3",
  pages =        "243--254",
  month =        jul,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:23:17 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77061.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; B-spline control points; B{\'e}zier
                 curves; B{\'e}zier points; De Casteljau's construction;
                 differentiating; knot insertion; recurrence relation;
                 theory",
  review =       "ACM CR 9007-0596",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Curve, surface, solid,
                 and object representations. {\bf G.1.2}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Approximation.",
}

@Article{Anonymous:1989:IA,
  author =       "Anonymous",
  title =        "Information for Authors",
  journal =      j-TOG,
  volume =       "8",
  number =       "3",
  pages =        "255--257",
  month =        jul,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:51:22 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bartels:1989:GEIb,
  author =       "Richard H. Bartels and Ronald N. Goldman",
  title =        "{Guest Editors}' Introduction",
  journal =      j-TOG,
  volume =       "8",
  number =       "4",
  pages =        "261--261",
  month =        oct,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Warren:1989:BAS,
  author =       "J. Warren",
  title =        "Blending algebraic surfaces",
  journal =      j-TOG,
  volume =       "8",
  number =       "4",
  pages =        "263--278",
  month =        oct,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 09:07:27 1994",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77270.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; geometric continuity; ideals;
                 theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Interpolation formulas. {\bf G.1.1}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Smoothing. {\bf G.1.2}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Approximation. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD).",
}

@Article{Rockwood:1989:DMI,
  author =       "A. P. Rockwood",
  title =        "The Displacement Method for Implicit Blending Surfaces
                 in Solid Models",
  journal =      j-TOG,
  volume =       "8",
  number =       "4",
  pages =        "279--297",
  month =        oct,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 13 17:25:58 MDT 1994",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77271.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algebraic distance; design; geometric modeling;
                 implicit surfaces; sculptured surfaces; solid modeling;
                 theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.6.3}: Computing Methodologies, SIMULATION AND
                 MODELING, Applications.",
}

@Article{Chuang:1989:LIA,
  author =       "J. H. Chuang and C. M. Hoffmann",
  title =        "On local implicit approximation and its applications",
  journal =      j-TOG,
  volume =       "8",
  number =       "4",
  pages =        "298--324",
  month =        oct,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:14:15 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77272.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; curve/surface approximation; design;
                 implicitization; linear systems; resultant
                 computations; substitution; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Spline and piecewise polynomial
                 approximation. {\bf G.1.2}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Approximation, Linear
                 approximation. {\bf G.1.3}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Numerical Linear Algebra, Linear
                 systems (direct and iterative methods).",
}

@Article{Abhyankar:1989:APR,
  author =       "Shreeram S. Abhyankar and Chanderjit J. Bajaj",
  title =        "Automatic parameterization of rational curves and
                 surfaces {IV}: algebraic space curves",
  journal =      j-TOG,
  volume =       "8",
  number =       "4",
  pages =        "325--334",
  month =        oct,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:13:12 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77273.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; computer-aided design; design; parametric
                 curves; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems. {\bf F.2.1}: Theory
                 of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Numerical Algorithms and Problems,
                 Computations on polynomials. {\bf I.1.2}: Computing
                 Methodologies, ALGEBRAIC MANIPULATION, Algorithms. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Smoothing. {\bf G.1.1}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Interpolation, Spline
                 and piecewise polynomial interpolation. {\bf J.6}:
                 Computer Applications, COMPUTER-AIDED ENGINEERING,
                 Computer-aided design (CAD).",
}

@Article{Hohmeyer:1989:RCP,
  author =       "M. E. Hohmeyer and B. A. Barsky",
  title =        "Rational continuity: parametric, geometric, and
                 {Frenet} frame continuity of rational curves",
  journal =      j-TOG,
  volume =       "8",
  number =       "4",
  pages =        "335--359",
  month =        oct,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:17:47 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77274.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; B-splines; beta-constraints; beta-splines;
                 B{\'e}zier curves; computer-aided geometric design;
                 continuity; design; geometric continuity; jet spaces;
                 NURBs; parametric continuity; rational B-splines;
                 rational splines; reparameterization; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Spline and piecewise polynomial
                 interpolation. {\bf J.6}: Computer Applications,
                 COMPUTER-AIDED ENGINEERING, Computer-aided design
                 (CAD). {\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Smoothing.",
}

@Article{Said:1989:GBC,
  author =       "H. B. Said",
  title =        "A Generalized Ball Curve and its Recursive Algorithm",
  journal =      j-TOG,
  volume =       "8",
  number =       "4",
  pages =        "360--371",
  month =        oct,
  year =         "1989",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 13 17:25:58 MDT 1994",
  bibsource =    "Graphics/imager/imager.89.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77275.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; Bernstein polynomials; B{\'e}zier curves;
                 computer-aided geometric design; curves and surfaces;
                 design; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems. {\bf J.6}: Computer
                 Applications, COMPUTER-AIDED ENGINEERING,
                 Computer-aided design (CAD). {\bf F.2.1}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Numerical Algorithms and Problems,
                 Computations on polynomials.",
}

@Article{Rushmeier:1990:ERM,
  author =       "Holly E. Rushmeier and Kenneth E. Torrance",
  title =        "Extending the Radiosity Method to Include Specularly
                 Reflecting and Translucent Materials",
  journal =      j-TOG,
  volume =       "9",
  number =       "1",
  pages =        "1--27",
  month =        jan,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77636.html",
  acknowledgement = ack-nhfb,
  annote =       "An extension to the radiosity method is presented that
                 rigorously accounts for the presence of a small number
                 of specularly reflecting surfaces in an otherwise
                 diffuse scene, and for the presence of a small number
                 of specular or ideal diffuse transmitter. The
                 relationship between the extended method and earlier
                 radiosity and ray-tracing methods is outlined. It is
                 shown that all three methods are based on the same
                 general equation of radiative transfer. A simple
                 superposition of the earlier radiosity and ray-tracing
                 methods in order to account for specular behavior is
                 shown to be physically inconsistent, as the methods are
                 based on different assumptions. Specular behavior is
                 correctly included in the present method. The extended
                 radiosity method and example images are presented.",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "backward form factor; forward form factor; global
                 illumination; image synthesis; radiosity; ray tracing",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation. {\bf I.3.7}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism.",
}

@Article{Nicholl:1990:PGT,
  author =       "Robin A. Nicholl and Tina M. Nicholl",
  title =        "Performing Geometric Transformations by Program
                 Transformation",
  journal =      j-TOG,
  volume =       "9",
  number =       "1",
  pages =        "28--40",
  month =        jan,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77637.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "geometric algorithms; geometric transformation;
                 program equivalences; program transformation",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Hierarchy and geometric transformations. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Curve,
                 surface, solid, and object representations. {\bf
                 D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
                 Techniques.",
}

@Article{Joe:1990:KIB,
  author =       "Barry Joe",
  title =        "Knot Insertion for Beta-Spline Curves and Surfaces",
  journal =      j-TOG,
  volume =       "9",
  number =       "1",
  pages =        "41--65",
  month =        jan,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77638.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "B-splines; beta-splines; computer-aided geometric
                 design; discrete B-splines; discrete beta-splines;
                 geometric continuity; knot refinement; subdivision",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Spline and piecewise polynomial
                 interpolation.",
}

@Article{Edelsbrunner:1990:SST,
  author =       "Herbert Edelsbrunner and Ernst Peter Mucke",
  title =        "Simulation of Simplicity: {A} Technique to Cope with
                 Degenerate Cases in Geometric Algorithms",
  journal =      j-TOG,
  volume =       "9",
  number =       "1",
  pages =        "66--104",
  month =        jan,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77639.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational geometry; degenerate data; determinants;
                 implementation; perturbation; programming tool;
                 symbolic computation",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Geometric algorithms, languages, and systems. {\bf
                 F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Geometrical problems and computations. {\bf
                 F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Sorting and searching. {\bf G.4}: Mathematics
                 of Computing, MATHEMATICAL SOFTWARE, Reliability and
                 robustness.",
}

@Article{Day:1990:IAF,
  author =       "A. M. Day",
  title =        "The Implementation of an Algorithm to Find the Convex
                 Hull of a Set of Three-Dimensional Points",
  journal =      j-TOG,
  volume =       "9",
  number =       "1",
  pages =        "105--132",
  month =        jan,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:40:34 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77640.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "convex hull; divide and conquer; edge structure;
                 implementation; tetrahedron; triangulation",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Geometric algorithms, languages, and systems. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Curve,
                 surface, solid, and object representations. {\bf E.1}:
                 Data, DATA STRUCTURES.",
}

@Article{Henry:1990:MI,
  author =       "Tyson R. Henry and Scott E. Hudson",
  title =        "Multidimensional Icons",
  journal =      j-TOG,
  volume =       "9",
  number =       "1",
  pages =        "133--137",
  month =        jan,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77641.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design",
  subject =      "{\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques, Interaction
                 techniques. {\bf D.2.2}: Software, SOFTWARE
                 ENGINEERING, Tools and Techniques, User interfaces.
                 {\bf D.2.6}: Software, SOFTWARE ENGINEERING,
                 Programming Environments, Interactive.",
}

@Article{Glassner:1990:TDV,
  author =       "Andrew S. Glassner",
  title =        "A Two-Dimensional View Controller",
  journal =      j-TOG,
  volume =       "9",
  number =       "1",
  pages =        "138--141",
  month =        jan,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77642.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design; human factors",
  subject =      "{\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques, Interaction
                 techniques. {\bf K.8}: Computing Milieux, PERSONAL
                 COMPUTING. {\bf I.3.3}: Computing Methodologies,
                 COMPUTER GRAPHICS, Picture/Image Generation.",
}

@Article{Anonymous:1990:FCA,
  author =       "Anonymous",
  title =        "Five-Year Cumulative Author Index",
  journal =      j-TOG,
  volume =       "9",
  number =       "1",
  pages =        "142--144",
  month =        jan,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 17:30:09 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bartels:1990:GEI,
  author =       "Richard H. Bartels and Ronald N. Goldman",
  title =        "{Guest Editors}' Introduction",
  journal =      j-TOG,
  volume =       "9",
  number =       "2",
  pages =        "145--146",
  month =        apr,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Abhyankar:1990:IIA,
  author =       "Shreeram S. Abhyankar and Srinivasan Chandrasekar and
                 Vijaya Chandru",
  title =        "Improper Intersection of Algebraic Curves",
  journal =      j-TOG,
  volume =       "9",
  number =       "2",
  pages =        "147--159",
  month =        apr,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78957.html",
  acknowledgement = ack-nhfb,
  annote =       "Special issue on Computer-Aided design --- Part III",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algebraic geometry; Bezout's theorem; curve
                 intersections; space curves",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD).",
}

@Article{Dyn:1990:BSS,
  author =       "Nira Dyn and David Levin and John A. Gregory",
  title =        "A Butterfly Subdivision Scheme for Surface
                 Interpolation with Tension Control",
  journal =      j-TOG,
  volume =       "9",
  number =       "2",
  pages =        "160--169",
  month =        apr,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78958.html",
  acknowledgement = ack-nhfb,
  annote =       "Special issue on Computer-Aided design --- Part III",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "general triangulation; subdivision scheme; surface
                 interpolation; tension control",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation. {\bf J.6}: Computer Applications,
                 COMPUTER-AIDED ENGINEERING, Computer-aided design
                 (CAD).",
}

@Article{Brunet:1990:SRO,
  author =       "Pere Brunet and Isabel Navazo",
  title =        "Solid Representation and Operation Using Extended
                 Octrees",
  journal =      j-TOG,
  volume =       "9",
  number =       "2",
  pages =        "170--197",
  month =        apr,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 Graphics/siggraph/90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78959.html",
  acknowledgement = ack-nhfb,
  annote =       "Special issue on Computer-Aided design --- Part III",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; computer-aided geometric design; design;
                 geometric modeling; octrees; solid modeling",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Modeling packages. {\bf I.3.7}: Computing
                 Methodologies, COMPUTER GRAPHICS, Three-Dimensional
                 Graphics and Realism, Visible line/surface algorithms.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Geometrical problems and computations.",
}

@Article{Lasser:1990:TRT,
  author =       "Dieter Lasser",
  title =        "Two Remarks on Tau-Splines",
  journal =      j-TOG,
  volume =       "9",
  number =       "2",
  pages =        "198--211",
  month =        apr,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78960.html",
  acknowledgement = ack-nhfb,
  annote =       "Special issue on Computer-Aided design --- Part III",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; B-spline curves; B{\'e}zier curves;
                 B{\'e}zier representations; convex hull property;
                 design; geometric continuity; nu-splines; positivity;
                 tau-splines; theory; variation-diminishing property",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Spline and piecewise polynomial
                 interpolation.",
}

@Article{Ferguson:1990:CSI,
  author =       "David R. Ferguson and Thomas A. Grandine",
  title =        "On the Construction of Surface Interpolating Curves:
                 {I}. {A} Method for Handling Nonconstant Parameter
                 Curves",
  journal =      j-TOG,
  volume =       "9",
  number =       "2",
  pages =        "212--225",
  month =        apr,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78961.html",
  acknowledgement = ack-nhfb,
  annote =       "Special issue on Computer-Aided design --- Part III",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; boolean sum surface; curve interpolation;
                 design; linear equations; nullspace; singular value
                 decomposition; tensor product spline",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf G.1.3}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Linear systems (direct and iterative methods).
                 {\bf J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD).",
}

@Article{Ware:1990:RCG,
  author =       "Colin Ware and William Cowan",
  title =        "The {RGYB} Color Geometry",
  journal =      j-TOG,
  volume =       "9",
  number =       "2",
  pages =        "226--232",
  month =        apr,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See corrigenda \cite{Ware:1991:CRC}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78962.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Color, shading, shadowing, and texture. {\bf I.3.1}:
                 Computing Methodologies, COMPUTER GRAPHICS, Hardware
                 architecture, Raster display devices.",
}

@Article{Pavlidis:1990:RCS,
  author =       "Theo Pavlidis",
  title =        "Re: Comments on ``{Stochastic Sampling in Computer
                 Graphics}''",
  journal =      j-TOG,
  volume =       "9",
  number =       "2",
  pages =        "233--236",
  month =        apr,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See \cite{Cook:1986:SSC,Wold:1990:RCS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wold:1990:RCS,
  author =       "Erling Wold and Kim Pepard",
  title =        "Re: Comments on ``{Stochastic Sampling in Computer
                 Graphics}''",
  journal =      j-TOG,
  volume =       "9",
  number =       "2",
  pages =        "237--243",
  month =        apr,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:36:55 1994",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See \cite{Cook:1986:SSC,Pavlidis:1990:RCS}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Anonymous:1990:C,
  author =       "Anonymous",
  title =        "Corrigendum",
  journal =      j-TOG,
  volume =       "9",
  number =       "2",
  pages =        "244--244",
  month =        apr,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 17:32:13 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Levoy:1990:ERT,
  author =       "Marc Levoy",
  title =        "Efficient Ray Tracing of Volume Data",
  journal =      j-TOG,
  volume =       "9",
  number =       "3",
  pages =        "245--261",
  month =        jul,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78965.html",
  acknowledgement = ack-nhfb,
  annote =       "{\em Volume Rendering} is a technique for visualizing
                 sampled scalar or vector fields of three spatial
                 dimensions without fitting geometric primitives to the
                 data. A subset of these techniques generates images by
                 computing 2-D projections of a colored semitransparent
                 volume, where the color and opacity at each point are
                 derived from the data using local operators. Since all
                 voxels participate in the generation of each image,
                 rendering time grows linearly with the size of the
                 dataset. This paper presents a front-to-back
                 image-order volume-rendering algorithm and discusses
                 two techniques for improving its performance. The first
                 technique employs a pyramid of binary volumes to encode
                 spatial coherence present in the data, and the second
                 technique uses an opacity threshold to adaptively
                 terminate ray tracing. Although the actual time saved
                 depends on the data, speedups of an order of magnitude
                 have been observed for datasets of useful size and
                 complexity. Examples from two applications are given:
                 medical imaging and molecular graphics.",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; hierarchical spatial enumeration;
                 medical imaging; molecular graphics; octree;
                 performance; ray tracing; scientific visualization;
                 volume rendering; volume visualization; voxel",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.7}: Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism, Visible
                 line/surface algorithms.",
}

@Article{Hobby:1990:RNC,
  author =       "John D. Hobby",
  title =        "Rasterization of Nonparametric Curves",
  journal =      j-TOG,
  volume =       "9",
  number =       "3",
  pages =        "262--277",
  month =        jul,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78966.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algebraic curves; algorithms; rasterization; scan
                 conversion; theory",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Geometric algorithms, languages, and systems.",
}

@Article{Preparata:1990:CAV,
  author =       "Franco P. Preparata and Jeffrey Scott Vitter and
                 Mariette Yvinec",
  title =        "Computation of the Axial View of a Set of Isothetic
                 Parallelepipeds",
  journal =      j-TOG,
  volume =       "9",
  number =       "3",
  pages =        "278--300",
  month =        jul,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78967.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; amortized analysis; axial view;
                 computational geometry; contracted binary trees;
                 design; hidden line elimination; scene sensitive;
                 segment trees",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Visible line/surface algorithms.",
}

@Article{Joe:1990:QBS,
  author =       "Barry Joe",
  title =        "Quartic Beta-Splines",
  journal =      j-TOG,
  volume =       "9",
  number =       "3",
  pages =        "301--337",
  month =        jul,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78968.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; arc-length continuity; beta-splines;
                 computer-aided geometric design; design; discrete
                 beta-splines; geometric continuity; knot insertion;
                 rational curves; shape parameters",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Curve, surface, solid,
                 and object representations.",
}

@Article{Guitard:1990:CSE,
  author =       "Richard Guitard and Colin Ware",
  title =        "A Color Sequence Editor",
  journal =      j-TOG,
  volume =       "9",
  number =       "3",
  pages =        "338--341",
  month =        jul,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Anonymous:1990:IA,
  author =       "Anonymous",
  title =        "Information for Authors",
  journal =      j-TOG,
  volume =       "9",
  number =       "3",
  pages =        "342--344",
  month =        jul,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:51:22 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lamming:1990:SMI,
  author =       "Michael G. Lamming and Warren L. Rhodes",
  title =        "A Simple Method for Improved Color Printing of Monitor
                 Images",
  journal =      j-TOG,
  volume =       "9",
  number =       "4",
  pages =        "345--375",
  month =        oct,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See corrigenda \cite{Lamming:1991:CSM}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/88567.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; color printing; design; device independent
                 color; performance; video to print; WYSIWYG color",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation. {\bf I.3.4}:
                 Computing Methodologies, COMPUTER GRAPHICS, Graphics
                 Utilities.",
}

@Article{Rokne:1990:FLS,
  author =       "J. G. Rokne and Brian Wyvill and Xiaolin Wu",
  title =        "Fast Line Scan-Conversion",
  journal =      j-TOG,
  volume =       "9",
  number =       "4",
  pages =        "376--388",
  month =        oct,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/88572.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; incremental curve generation; line
                 generators",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display
                 algorithms.",
}

@Article{Dobkin:1990:CTP,
  author =       "David P. Dobkin and Silvio V. F. Levy and William P.
                 Thurston and Allan R. Wilks",
  title =        "Contour Tracing by Piecewise Linear Approximations",
  journal =      j-TOG,
  volume =       "9",
  number =       "4",
  pages =        "389--423",
  month =        oct,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/88575.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; contour tracing; Coxeter triangulations;
                 simplicial continuation; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Geometric algorithms, languages, and systems.",
}

@Article{Ball:1990:ICV,
  author =       "A. A. Ball and D. J. T. Storry",
  title =        "An Investigation of Curvature Variations Over
                 Recursively Generated {B}-Spline Surfaces",
  journal =      j-TOG,
  volume =       "9",
  number =       "4",
  pages =        "424--437",
  month =        oct,
  year =         "1990",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/90.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/88580.html",
  abstract =     "The continuity properties of recursively generated
                 B-spline surfaces over an arbitrary topology have been
                 related to the eigenproperties of the local subdivision
                 transformation, and conditions have been established on
                 the subdivision weightings for tangent plane continuity
                 at extraordinary points. In this paper, curves through
                 an extraordinary point, which align in both the tangent
                 and binormal direction, are identified, and their
                 curvatures are compared either side of the point.
                 Further restrictions on the subdivision weightings are
                 derived to optimize the curvature properties of the
                 surface. In general continuity of curvature is not
                 attained.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; B-splines surfaces; curvature continuity;
                 design; discrete Fourier transform; nonrectangular
                 topologies; recursive subdivision; theory",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf G.1.3}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Eigenvalues. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Geometric algorithms,
                 languages, and systems.",
}

@Article{Kamada:1991:GFV,
  author =       "Tomihisa Kamada and Satoru Kawai",
  title =        "A General Framework for Visualizing Abstract Objects
                 and Relations",
  journal =      j-TOG,
  volume =       "10",
  number =       "1",
  pages =        "1--39",
  month =        jan,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/99903.html",
  abstract =     "Pictorial representations significantly enhance our
                 ability to understand complicated relations and
                 structures, which means that information systems
                 strongly require user interfaces that support the
                 visualization of many kinds of information with a wide
                 variety of graphical forms. At present, however, these
                 difficult visualization problems have not been solved.
                 We present a visualization framework for translating
                 abstract objects and relations, typically represented
                 in textual forms, into pictorial representations, and
                 describe a general visualization interface based on
                 this framework. In our framework, abstract objects and
                 relations are mapped to graphical objects and relations
                 by user-defined mapping rules. The kernel of our
                 visualization process is to determine a layout of
                 graphical objects under geometric constraints. A
                 constraint-based object layout system named COOL has
                 been developed to handle this layout problem. COOL
                 introduces the concept of rigidity of constraints in
                 order to reasonably handle, a set of conflicting
                 constraints by use of the least squares method. As
                 applications of our system, we show the generation of
                 kinship diagrams, list diagrams, Nassi-Shneiderman
                 diagrams, and entity-relationship diagrams.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Algorithms; Computer graphics; Constraint-based
                 systems; Constraints; Design; Graph drawing; Graphics
                 systems; Graphics utilities; human factors; Languages;
                 Layouts; Methodology and techniques; Pictorial
                 representations; Picture description languages;
                 Software engineering; Theory; Tools and techniques;
                 User interfaces; Visualization",
  subject =      "{\bf I.3.4}: Computing Methodologies, COMPUTER
                 GRAPHICS, Graphics Utilities, Picture description
                 languages. {\bf H.5.2}: Information Systems,
                 INFORMATION INTERFACES AND PRESENTATION, User
                 Interfaces, Evaluation/methodology. {\bf D.2.2}:
                 Software, SOFTWARE ENGINEERING, Tools and Techniques,
                 User interfaces. {\bf H.1.2}: Information Systems,
                 MODELS AND PRINCIPLES, User/Machine Systems, Human
                 information processing.",
}

@Article{Jansen:1991:DOP,
  author =       "Frederik W. Jansen",
  title =        "Depth-Order Point Classification Techniques for {CSG}
                 Display Algorithms",
  journal =      j-TOG,
  volume =       "10",
  number =       "1",
  pages =        "40--70",
  month =        jan,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/ray.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/99904.html",
  abstract =     "Constructive Solid Geometry (CSG) defines objects as
                 Boolean combinations (CSG trees) of primitive solids.
                 To display such objects, one must classify points on
                 the surfaces of the primitive solids with respect to
                 the resulting composite object, to test whether these
                 points lie on the boundary of the composite object or
                 not. Although the point classification is trivial
                 compared to the surface classification (i.e., the
                 computation of the composite object), for CSG models
                 with a large number of primitive solids (large CSG
                 trees), the point classification may still consume a
                 considerable fraction of the total processing time.
                 This paper presents an overview of existing and new
                 efficiency-improving techniques for classifying points
                 in depth order. The different techniques are compared
                 through experiments.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; computational geometry; constructive solid
                 geometry; CSG; CSG algorithms; design; display
                 algorithms; efficiency; experimentation; object
                 modeling; realism; solid modeling",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Geometric algorithms, languages, and systems. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling,
                 Constructive solid geometry (CSG).",
}

@Article{Karasick:1991:EDT,
  author =       "Michael Karasick and Derek Lieber and Lee R. Nackman",
  title =        "Efficient {Delaunay} Triangulation Using Rational
                 Arithmetic",
  journal =      j-TOG,
  volume =       "10",
  number =       "1",
  pages =        "71--91",
  month =        jan,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 11 18:22:31 1999",
  bibsource =    "Graphics/imager/imager.91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/99905.html",
  abstract =     "Many fundamental tests performed by geometric
                 algorithms can be formulated in terms of finding the
                 sign of a determinant. When these tests are implemented
                 using fixed precision arithmetic such as floating
                 point, they can produce incorrect answers; when they
                 are implemented using arbitrary-precision arithmetic,
                 they are expensive to compute. We present
                 adaptive-precision algorithms for finding the signs of
                 determinants of matrices with integer and rational
                 elements. These algorithms were developed and tested by
                 integrating them into the Guibas-Stolfi Delaunay
                 triangulation algorithm. Through a combination of
                 algorithm design and careful engineering of the
                 implementation, the resulting program can triangulate a
                 set of random rational points in the unit circle only
                 four to five times slower than can a floating-point
                 implementation of the algorithm. The algorithms,
                 engineering process, and software tools developed are
                 described.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; experimentation; languages;
                 performance; reliability; robust geometric computation;
                 triangulation",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Geometric algorithms, languages, and systems. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD). {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Efficiency.",
}

@Article{Klassen:1991:DAC,
  author =       "R. Victor Klassen",
  title =        "Drawing Antialiased Cubic Spline Curves",
  journal =      j-TOG,
  volume =       "10",
  number =       "1",
  pages =        "92--108",
  month =        jan,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/99906.html",
  abstract =     "Cubic spline curves have many nice properties that
                 make them desirable for use in computer graphics, and
                 the advantages of antialiasing have been known for some
                 years. Yet, only recently has there been any attempt at
                 directly antialiasing spline curves. Parametric spline
                 curves have resisted antialiasing in several ways:
                 single segments may cross or become tangent to
                 themselves. Cusps and small loops are easily missed
                 entirely. Thus, short pieces of the curve cannot
                 necessarily be rendered in isolation. Finding the
                 distance from a pixel center to the curve accurately
                 and efficiently---usually an essential part of
                 antialiasing---is an unsolved problem. The method
                 presented by Lien, Shantz, and Pratt [21] is a good
                 start, although it considers pixel-length pieces of the
                 curve in isolation and lacks robustness in the handling
                 of certain curves. This paper provides an improved
                 method that is more robust, and is able to handle
                 intersections and tangency.",
  acknowledgement = ack-nhfb,
  annote =       "figures 7 and 8 on p. 106 are transposed but not their
                 captions",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "adaptive forward differencing; algorithms;
                 antialiasing parametric curves; B{\'e}zier curves;
                 design; parametric curve plotting",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Splines.",
}

@Article{Lamming:1991:CSM,
  author =       "Michael G. Lamming and Warren L. Rhodes",
  title =        "Corrigenda: ``{A Simple Method for Improved Color
                 Printing of Monitor Images}''",
  journal =      j-TOG,
  volume =       "10",
  number =       "1",
  pages =        "109--109",
  month =        jan,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 17:34:26 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See \cite{Lamming:1990:SMI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Casner:1991:TAA,
  author =       "Stephen M. Casner",
  title =        "A Task-Analytic Approach to the Automated Design of
                 Graphic Presentations",
  journal =      j-TOG,
  volume =       "10",
  number =       "2",
  pages =        "111--151",
  month =        apr,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:41:24 1996",
  bibsource =    "Graphics/siggraph/91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108361.html",
  abstract =     "BOZ is an automated graphic design and presentation
                 tool that designs graphics based on an analysis of the
                 task for which a graphic is intended to support. When
                 designing a graphic, BOZ aims to optimize two ways in
                 which graphics help expedite human performance of
                 information-processing tasks: (1) allowing users to
                 substitute simple perceptual inferences in place of
                 more demanding logical inferences, and (2) streamlining
                 users' search for needed information. BOZ analyzes a
                 logical description of a task to be performed by a
                 human user and designs a provably equivalent perceptual
                 task by substituting perceptual inferences in place of
                 logical inferences in the task description. BOZ then
                 designs and renders an accompanying graphic that
                 encodes and structures data such that performance of
                 each perceptual inference is supported and visual
                 search is minimized. BOZ produces a graphic along with
                 a perceptual procedure describing how to use the
                 graphic to complete the task. A key feature of BOZ's
                 approach is that it is able to design different
                 presentations of the same information customized to the
                 requirements of different tasks. BOZ is used to design
                 graphic presentations of airline schedule information
                 to support five different airline reservation tasks.
                 Reaction time studies done with real users for one task
                 and graphic show that the BOZ-designed graphic
                 significantly reduces users' performance time to the
                 task. Regression analyses link the observed efficiency
                 savings to BOZ's two key design principles: perceptual
                 inference substitutions and pruning of visual search.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Algorithms; Applications and expert systems;
                 Artificial intelligence; Automated design; Computer
                 graphics; Design; Ergonomics; experimentation; Graphic
                 design; Graphic user interface; Human factors; Human
                 information processing; Methodology and techniques;
                 Models and principles; Software engineering; Task
                 analysis; Theory; Tools and techniques; User
                 interfaces; User/machine systems; Visual languages",
  subject =      "{\bf H.5.2}: Information Systems, INFORMATION
                 INTERFACES AND PRESENTATION, User Interfaces, Screen
                 design. {\bf H.5.2}: Information Systems, INFORMATION
                 INTERFACES AND PRESENTATION, User Interfaces,
                 Interaction styles. {\bf H.1.2}: Information Systems,
                 MODELS AND PRINCIPLES, User/Machine Systems, Human
                 information processing. {\bf D.2.2}: Software, SOFTWARE
                 ENGINEERING, Tools and Techniques, User interfaces.
                 {\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques, Ergonomics. {\bf
                 H.5.2}: Information Systems, INFORMATION INTERFACES AND
                 PRESENTATION, User Interfaces, Ergonomics.",
}

@Article{Klassen:1991:IFD,
  author =       "R. Victor Klassen",
  title =        "Integer Forward Differencing of Cubic Polynomials:
                 Analysis and Algorithms",
  journal =      j-TOG,
  volume =       "10",
  number =       "2",
  pages =        "152--181",
  month =        apr,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108364.html",
  abstract =     "Two incremental cubic interpolation algorithms are
                 derived and analysed. Each is based on a known linear
                 interpolation algorithm and modified for third order
                 forward differencing. The tradeoff between overflow
                 avoidance and loss of precision has made forward
                 differencing a method which, although known to be fast,
                 can be difficult to implement. It is shown that there
                 is one particular family of curves which represents the
                 worst case, in the sense that if a member of this
                 family can be accurately drawn without overflow, then
                 any curve which fits in the bounding box of that curve
                 can be. From this the limitations in terms of step
                 count and screen resolution are found for each of the
                 two algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; B{\'e}zier curves; parametric curve
                 plotting",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Splines. {\bf G.1.1}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf G.1.2}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Approximation, Spline
                 and piecewise polynomial approximation. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Curve,
                 surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems.",
}

@Article{Ekoule:1991:TAA,
  author =       "A. B. Ekoule and F. C. Peyrin and C. L. Odet",
  title =        "A Triangulation Algorithm From Arbitrary Shaped
                 Multiple Planar Contours",
  journal =      j-TOG,
  volume =       "10",
  number =       "2",
  pages =        "182--199",
  month =        apr,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:41:32 1996",
  bibsource =    "Graphics/siggraph/91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108363.html",
  abstract =     "Conventional triangulation algorithms from planar
                 contours suffer from some limitations. For instance,
                 incorrect results can be obtained when the contours are
                 not convex, or when the contours in two successive
                 slices are very different. In the same way, the
                 presence of multiple contours in a slice leads to
                 ambiguities in defining the appropriate links. The
                 purpose of this paper is to define a general
                 triangulation procedure that provides a solution to
                 these problems. We first describe a simple heuristic
                 triangulation algorithm which is extended to nonconvex
                 contours. It uses an original decomposition of an
                 arbitrary contour into elementary convex subcontours.
                 Then the problem of linking one contour in a slice to
                 several contours in an adjacent slice is examined. To
                 this end, a new and unique interpolated contour is
                 generated between the two slices, and the link is
                 created using the previously defined procedure. Next, a
                 solution to the general case of linking multiple
                 contours in each slice is proposed. Finally, the
                 algorithm is applied to the reconstitution of the
                 external surface of a complex shaped object: a human
                 vertebra.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; slice interpolation; triangulation",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations.",
}

@Article{Becker:1991:IMT,
  author =       "Shawn C. Becker and William A. Barrett and Dan R.
                 {Olsen, Jr.}",
  title =        "Interactive measurement of three-dimensional objects
                 using a depth buffer and linear probe",
  journal =      j-TOG,
  volume =       "10",
  number =       "2",
  pages =        "201--207",
  month =        apr,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:41:43 1996",
  bibsource =    "Graphics/siggraph/91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108446.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism. {\bf
                 I.3.6}: Computing Methodologies, COMPUTER GRAPHICS,
                 Methodology and Techniques, Interaction techniques.
                 {\bf J.2}: Computer Applications, PHYSICAL SCIENCES AND
                 ENGINEERING.",
}

@Article{Beatty:1991:ENE,
  author =       "John Beatty",
  title =        "Editorial: New {Editor-in-Chief}",
  journal =      j-TOG,
  volume =       "10",
  number =       "3",
  pages =        "209--210",
  month =        jul,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 17 19:20:23 2012",
  bibsource =    "Graphics/siggraph/91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Singh:1991:ALS,
  author =       "Gurminder Singh and Mark Green",
  title =        "Automating the Lexical and Syntactic Design of
                 Graphical User Interfaces: The {UofA}* {UIMS}",
  journal =      j-TOG,
  volume =       "10",
  number =       "3",
  pages =        "213--254",
  month =        jul,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:41:48 1996",
  bibsource =    "Graphics/siggraph/91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108543.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Computer graphics; design; human factors; Interaction
                 techniques; Methodologies; Methodology and techniques;
                 Miscellaneous; Rapid prototyping; Software engineering;
                 User interface design; User interface management
                 systems",
  subject =      "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
                 Techniques, User interfaces. {\bf H.5.2}: Information
                 Systems, INFORMATION INTERFACES AND PRESENTATION, User
                 Interfaces, User interface management systems (UIMS).
                 {\bf D.2.10}: Software, SOFTWARE ENGINEERING, Design,
                 Methodologies. {\bf H.5.2}: Information Systems,
                 INFORMATION INTERFACES AND PRESENTATION, User
                 Interfaces, Screen design. {\bf H.5.2}: Information
                 Systems, INFORMATION INTERFACES AND PRESENTATION, User
                 Interfaces, Interaction styles. {\bf I.3.6}: Computing
                 Methodologies, COMPUTER GRAPHICS, Methodology and
                 Techniques, Interaction techniques.",
}

@Article{Hobby:1991:NSI,
  author =       "John D. Hobby",
  title =        "Numerically Stable Implicitization of Cubic Curves",
  journal =      j-TOG,
  volume =       "10",
  number =       "3",
  pages =        "255--296",
  month =        jul,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108546.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; numerical stability; reliability",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations.",
}

@Article{Walton:1991:TPP,
  author =       "D. J. Walton and R. Xu",
  title =        "Turning Point Preserving Planar Interpolation",
  journal =      j-TOG,
  volume =       "10",
  number =       "3",
  pages =        "297--311",
  month =        jul,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108548.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; approximation; design; interpolation;
                 quadratic B{\'e}zier curves",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Splines. {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Spline and piecewise polynomial
                 approximation. {\bf G.1.1}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf J.6}: Computer
                 Applications, COMPUTER-AIDED ENGINEERING,
                 Computer-aided design (CAD).",
}

@Article{Meyer:1991:LTO,
  author =       "Alan Meyer",
  title =        "A Linear Time {Oslo} Algorithm",
  journal =      j-TOG,
  volume =       "10",
  number =       "3",
  pages =        "312--318",
  month =        jul,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108552.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; B-splines; computer-aided geometric
                 design; design; subdivision",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Splines. {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD).",
}

@Article{Ware:1991:CRC,
  author =       "Colin Ware and William Cowan",
  title =        "Corrigenda: ``{The {RGYB} Color Geometry}''",
  journal =      j-TOG,
  volume =       "10",
  number =       "3",
  pages =        "319--319",
  month =        jul,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 17:38:09 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See \cite{Ware:1990:RCG}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Foley:1991:ELB,
  author =       "Jim Foley",
  title =        "Editorial: Looking Back, Looking Ahead",
  journal =      j-TOG,
  volume =       "10",
  number =       "4",
  pages =        "321--322",
  month =        oct,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Rappoport:1991:RCS,
  author =       "Ari Rappoport",
  title =        "Rendering Curves and Surfaces with Hybrid Subdivision
                 and Forward Differencing",
  journal =      j-TOG,
  volume =       "10",
  number =       "4",
  pages =        "323--341",
  month =        oct,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/116914.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "adaptive forward differencing; algorithms; B{\'e}zier
                 curves and surfaces; design; parametric curves and
                 surfaces; performance; subdivision method; theory",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations.",
}

@Article{Lee:1991:CSP,
  author =       "S. L. Lee and A. A. Majid",
  title =        "Closed Smooth Piecewise Bicubic Surfaces",
  journal =      j-TOG,
  volume =       "10",
  number =       "4",
  pages =        "342--365",
  month =        oct,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/116915.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; B-splines; bicubic patches; B{\'e}zier
                 representation; closed surfaces; de Casteljau
                 algorithm; design; geometric continuity; geometric
                 modeling; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Spline and piecewise polynomial
                 interpolation. {\bf G.1.3}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Numerical Linear Algebra,
                 Eigenvalues. {\bf I.3.5}: Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Splines.",
}

@Article{Pottmann:1991:LCC,
  author =       "Helmut Pottmann",
  title =        "Locally controllable conic splines with curvature
                 continuity",
  journal =      j-TOG,
  volume =       "10",
  number =       "4",
  pages =        "366--377",
  month =        oct,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/imager/imager.91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/116916.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; conic sections; design; geometric
                 continuity; projective geometry; rational B{\'e}zier
                 curves",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING. {\bf I.3.5}: Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Splines.",
}

@Article{Chionh:1991:UMR,
  author =       "Eng-Wee Chionh and Ronald N. Goldman and James R.
                 Miller",
  title =        "Using Multivariate Resultants to Find the Intersection
                 of Three Quadric Surfaces",
  journal =      j-TOG,
  volume =       "10",
  number =       "4",
  pages =        "378--400",
  month =        oct,
  year =         "1991",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 16:06:06 1996",
  bibsource =    "Graphics/siggraph/91.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/116917.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD). {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Curve,
                 surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Physically
                 based modeling.",
}

@Article{Sharir:1992:SOS,
  author =       "Micha Sharir and Mark H. Overmars",
  title =        "A Simple Output-Sensitive Algorithm for Hidden Surface
                 Removal",
  journal =      j-TOG,
  volume =       "11",
  number =       "1",
  pages =        "1--11",
  month =        jan,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/112141.html",
  abstract =     "We derive a simple output-sensitive algorithm for
                 hidden surface removal in a collection of n triangles
                 in space for which a (partial) depth order is known. If
                 $k$ is the combinatorial complexity of the output
                 visibility map, the method runs in time $O(n\sqrt{k}
                 \log n)$. The method is extended to work for other
                 classes of objects as well, sometimes with even
                 improved time bounds. For example, we obtain an
                 algorithm that performs hidden surface removal for n
                 (nonintersecting) balls in time $O(n^{3/2}\log n+k)$",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; hidden surface removal; theory",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Hidden line/surface removal. {\bf F.2.2}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Geometrical problems and computations. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems.",
}

@Article{Cameron:1992:RMG,
  author =       "Stephen Cameron and Yap Chee-Keng",
  title =        "Refinement Methods for Geometric Bounds in
                 Constructive Solid Geometry",
  journal =      j-TOG,
  volume =       "11",
  number =       "1",
  pages =        "12--39",
  month =        jan,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/123764.html",
  abstract =     "In constructive solid geometry, geometric solids are
                 represented as trees whose leaves are labeled by
                 primitive solids and whose internal nodes are labeled
                 by set-theoretic operations. A {\em bounding function}
                 in this context is an upper or lower estimate on the
                 extent of the constituent sets; such bounds are
                 commonly used to speed up algorithms based on such
                 trees. We introduce the class of {\em totally
                 consistent bounding functions}, which have the
                 desirable properties of allowing surprisingly good
                 bounds to be built quickly. Both outer and inner bounds
                 can be refined using a set of rewrite rules, for which
                 we give some complexity and convergence results. We
                 have implemented the refinement rules for outer bounds
                 within a solid modeling system, where they have proved
                 especially useful for intersection testing in three and
                 four dimensions. Our implementations have used boxes as
                 bounds, but different classes (shapes) of bounds are
                 also explored. The rewrite rules are also applicable to
                 relatively slow, exact operations, which we explore for
                 their theoretical insight, and to general Boolean
                 algebras. Results concerning the relationship between
                 these bounds and active zones are also noted.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; performance; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Hierarchy and geometric transformations. {\bf F.2.2}:
                 Theory of Computation, ANALYSIS OF ALGORITHMS AND
                 PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Computations on discrete structures. {\bf
                 F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Geometrical problems and computations. {\bf
                 I.1.1}: Computing Methodologies, ALGEBRAIC
                 MANIPULATION, Expressions and Their Representation,
                 Simplification of expressions. {\bf J.6}: Computer
                 Applications, COMPUTER-AIDED ENGINEERING,
                 Computer-aided design (CAD).",
}

@Article{Desaulniers:1992:EMB,
  author =       "H. Desaulniers and N. F. Stewart",
  title =        "An Extension of Manifold Boundary Representations to
                 the $r$-Sets",
  journal =      j-TOG,
  volume =       "11",
  number =       "1",
  pages =        "40--60",
  month =        jan,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/111777.html",
  abstract =     "In this paper we study the relationship between {\em
                 manifold solids} (r-sets whose boundaries are
                 two-dimensional closed manifolds) and {\em r-sets}. We
                 begin by showing that an r-set may be viewed as the
                 limit of a certain sequence of manifold solids, where
                 distance is measured using the Hausdorff metric. This
                 permits us to introduce a minimal set of generalized
                 Euler operators, sufficient for the construction and
                 manipulation of r-sets. The completeness result for
                 ordinary Euler operators carries over immediately to
                 the generalized Euler operators on the r-sets and the
                 modification of the usual boundary data structures,
                 corresponding to our extension to nonmanifold r-sets,
                 is straightforward. We in fact describe a modification
                 of a well-known boundary data structure in order to
                 illustrate how the extension can be used in typical
                 solid modeling algorithms, and describe an
                 implementation.\par

                 The results described above largely eliminate what has
                 been called an inherent mismatch between the modeling
                 spaces defined by manifold solids and by r-sets. We
                 view the r-sets as a more appropriate choice for a
                 modeling space: in particular, the r-sets provide
                 closure with respect to regularized set operations and
                 a complete set of generalized Euler operators for the
                 manipulation of boundary representations, for graphics
                 and other purposes. It remains to formulate and prove a
                 theorem on the soundness of the generalized Euler
                 operators.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Boundary representations.",
}

@Article{Bajaj:1992:ASD,
  author =       "Chanderjit L. Bajaj and Insung Ihm",
  title =        "Algebraic Surface Design with {Hermite}
                 Interpolation",
  journal =      j-TOG,
  volume =       "11",
  number =       "1",
  pages =        "61--91",
  month =        jan,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/120081.html",
  abstract =     "This paper presents an efficient algorithm called
                 Hermite interpolation, for constructing low-degree
                 algebraic surfaces, which contain, with $C^1$ or
                 tangent plane continuity, any given collection of
                 points and algebraic space curves having derivative
                 information. Positional as well as derivative
                 constraints on an implicitly defined algebraic surface
                 are translated into a homogeneous linear system, where
                 the unknowns are the coefficients of the polynomial
                 defining the algebraic surface. Computational details
                 of the Hermite interpolation algorithm are presented
                 along with several illustrative applications of the
                 interpolation technique to construction of joining or
                 blending surfaces for solid models as well as fleshing
                 surfaces for curved wire frame models. A heuristic
                 approach to interactive shape control of implicit
                 algebraic surfaces is also given, and open problems in
                 algebraic surface design are discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Numerical Algorithms and
                 Problems, Computations on polynomials. {\bf G.1.1}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Interpolation formulas.",
}

@Article{Shneiderman:1992:TVT,
  author =       "Ben Shneiderman",
  title =        "Tree Visualization with Tree-Maps: {A} {2-D}
                 Space-Filling Approach",
  journal =      j-TOG,
  volume =       "11",
  number =       "1",
  pages =        "92--99",
  month =        jan,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/115768.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; human factors",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 E.1}: Data, DATA STRUCTURES, Trees.",
}

@Article{Anonymous:1992:AI,
  author =       "Anonymous",
  title =        "Author Index",
  journal =      j-TOG,
  volume =       "11",
  number =       "1",
  pages =        "100--101",
  month =        jan,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 6 16:37:06 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Williams:1992:VOM,
  author =       "Peter L. Williams",
  title =        "Visibility Ordering Meshed Polyhedra",
  journal =      j-TOG,
  volume =       "11",
  number =       "2",
  pages =        "103--126",
  month =        apr,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130899.html",
  abstract =     "A visibility-ordering of a set of objects from some
                 viewpoint is an ordering such that if object $a$
                 obstructs object $b$, then $b$ precedes $a$ in the
                 ordering. An algorithm is presented that generates a
                 visibility-ordering of an acyclic convex set of meshed
                 convex polyhedra. This algorithm takes time linear in
                 the size of the mesh. Modifications to this algorithm
                 and/or preprocessing techniques are described that
                 permit nonconvex cells nonconvex meshes (meshes with
                 cavities and/or voids), meshes with cycles, and sets of
                 disconnected meshes to be ordered. Visibility-ordering
                 of polyhedra is applicable to scientific visualization,
                 particularly direct volume rendering. It is shown how
                 the ordering algorithms can be used for domain
                 decomposition of finite element meshes for parallel
                 processing, and how the data structures used by these
                 algorithms can be used to solve the spatial point
                 location problem. The effects of cyclically obstructing
                 polyhedra are discussed and methods for their
                 elimination are described, including the use of the
                 Delaunay triangulation. Methods for converting
                 nonconvex meshes into convex meshes are described.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Visible line/surface algorithms. {\bf I.3.3}: Computing
                 Methodologies, COMPUTER GRAPHICS, Picture/Image
                 Generation, Display algorithms. {\bf I.3.3}: Computing
                 Methodologies, COMPUTER GRAPHICS, Picture/Image
                 Generation, Viewing algorithms. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Curve, surface, solid,
                 and object representations.",
}

@Article{Warren:1992:CMR,
  author =       "Joe Warren",
  title =        "Creating Multisided Rational {B}{\'e}zier Surfaces
                 Using Base Points",
  journal =      j-TOG,
  volume =       "11",
  number =       "2",
  pages =        "127--139",
  month =        apr,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130828.html",
  abstract =     "Rational B{\'e}zier surfaces provide an effective tool
                 for geometric design. One aspect of the theory of
                 rational surfaces that is not well understood is what
                 happens when a rational parameterization takes on the
                 value (0/0, 0/0, 0/0) for some parameter value. Such
                 parameter values are called base points of the
                 parameterization. Base points can be introduced into a
                 rational parameterization in B{\'e}zier form by setting
                 weights of appropriate control points to zero. By
                 judiciously introducing base points, one can create
                 parameterizations of four-, five- and six-sided surface
                 patches using rational B{\'e}zier surfaces defined over
                 triangular domains. Subdivision techniques allow
                 rendering and smooth meshing of such surfaces.
                 Properties of base points also lead to a new
                 understanding of incompatible edge twist methods such
                 as Gregory's patch.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Interpolation formulas.",
}

@Article{Cheng:1992:ESD,
  author =       "Fuhua Cheng",
  title =        "Estimating Subdivision Depths for Rational Curves and
                 Surfaces",
  journal =      j-TOG,
  volume =       "11",
  number =       "2",
  pages =        "140--151",
  month =        apr,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130829.html",
  abstract =     "An algorithm to estimate subdivision depths for
                 rational curves and surfaces is presented. The
                 subdivision depth is not estimated for the given
                 curve/surface directly. The algorithm computes a
                 subdivision depth for the polynomial curve/surface of
                 which the given rational curve/surface is the image
                 under the standard perspective projection. This
                 subdivision depth, however, guarantees the required
                 flatness of the given curve/surface after the
                 subdivision. This work has applications in surface
                 rendering, surface/surface intersection, and mesh
                 generation.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems. {\bf J.6}: Computer
                 Applications, COMPUTER-AIDED ENGINEERING,
                 Computer-aided design (CAD).",
}

@Article{Hansen:1992:AGN,
  author =       "Allan Hansen and Farhad Arbab",
  title =        "An Algorithm for Generating {NC} Tools Paths for
                 Arbitrarily Shaped Pockets with Islands",
  journal =      j-TOG,
  volume =       "11",
  number =       "2",
  pages =        "152--182",
  month =        apr,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130832.html",
  abstract =     "In this paper we describe algorithms for generating NC
                 tool paths for machining of arbitrarily shaped 2 l/2
                 dimensional pockets with arbitrary islands. These
                 pocketing algorithms are based on a new offsetting
                 algorithm presented in this paper. Our offsetting
                 algorithm avoids costly two-dimensional Boolean set
                 operations, relatively expensive distance calculations,
                 and the overhead of extraneous geometry, such as the
                 Voronoi diagrams, used in other pocketing algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Geometric algorithms, languages, and systems. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD). {\bf F.1.2}:
                 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES,
                 Modes of Computation.",
}

@Article{Rokne:1992:DIL,
  author =       "J. Rokne and Y. Yao",
  title =        "Double-Step Incremental Linear Interpolation",
  journal =      j-TOG,
  volume =       "11",
  number =       "2",
  pages =        "183--192",
  month =        apr,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See \cite{Rokne:1993:C}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130833.html",
  abstract =     "A two-step incremental linear interpolation algorithm
                 is derived and analyzed. It is shown that the algorithm
                 is correct, that it is reversible, and that it is
                 faster than previous single-step algorithms. An example
                 is given of the execution of the algorithm.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; performance",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Error analysis.",
}

@Article{Hudson:1992:ASC,
  author =       "Scott E. Hudson",
  title =        "Adding Shadows to a {3D} Cursor",
  journal =      j-TOG,
  volume =       "11",
  number =       "2",
  pages =        "193--199",
  month =        apr,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wilhelms:1992:OFI,
  author =       "Jane Wilhelms and Allen {Van Gelder}",
  title =        "Octrees for Faster Isosurface Generation",
  journal =      j-TOG,
  volume =       "11",
  number =       "3",
  pages =        "201--227",
  month =        jul,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130882.html",
  abstract =     "The large size of many volume data sets often prevents
                 visualization algorithms from providing interactive
                 rendering. The use of hierarchical data structures can
                 ameliorate this problem by storing summary information
                 to prevent useless exploration of regions of little or
                 no {\em current} interest within the volume. This paper
                 discusses research into the use of the {\em octree}
                 hierarchical data structure when the regions of current
                 interest can vary during the application, and are not
                 known {\em a priori}. Octrees are well suited to the
                 six-sided cell structure of many volumes.\par

                 A new space-efficient design is introduced for octree
                 representations of volumes whose resolutions are not
                 conveniently a power of two; octrees following this
                 design are called {\em branch-on-need octrees} (BONOs).
                 Also, a caching method is described that essentially
                 passes information between octree neighbors whose
                 visitation times may be quite different, then discards
                 it when its useful life is over.\par

                 Using the application of octrees to isosurface
                 generation as a focus, space and time comparisons for
                 octree-based versus more traditional ``marching''
                 methods are presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; performance",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Visible line/surface algorithms. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Curve, surface, solid,
                 and object representations. {\bf E.1}: Data, DATA
                 STRUCTURES, Trees. {\bf I.3.3}: Computing
                 Methodologies, COMPUTER GRAPHICS, Picture/Image
                 Generation, Display algorithms.",
}

@Article{Meyers:1992:SC,
  author =       "David Meyers and Shelley Skinner and Kenneth Sloan",
  title =        "Surfaces from Contours",
  journal =      j-TOG,
  volume =       "11",
  number =       "3",
  pages =        "228--258",
  month =        jul,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/131213.html",
  abstract =     "This paper is concerned with the problem of
                 reconstructing the surfaces of three-dimensional
                 objects, given a collection of planar contours
                 representing cross-sections through the objects. This
                 problem has important applications in biomedical
                 research and instruction, solid modeling, and
                 industrial inspection.\par

                 The method we describe produces a triangulated mesh
                 from the data points of the contours which is then used
                 in conjunction with a piecewise parametric
                 surface-fitting algorithm to produce a reconstructed
                 surface.\par

                 The problem can be broken into four subproblems: the
                 {\em correspondence problem} (which contours should be
                 connected by the surface?), the {\em tiling problem}
                 (how should the contours be connected?), the {\em
                 branching problem} (what do we do when there are
                 branches in the surface?), and the {\em surface-fitting
                 problem} (what is the precise geometry of the
                 reconstructed surface?) We describe our system for
                 surface reconstruction from sets of contours with
                 respect to each of these subproblems. Special attention
                 is given to the correspondence and branching problems.
                 We present a method that can handle sets of contours in
                 which adjacent contours share a very contorted
                 boundary, and we describe a new approach to solving the
                 correspondence problem using a Minimum Spanning Tree
                 generated from the contours.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Boundary
                 representations. {\bf I.3.5}: Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Geometric algorithms, languages, and systems.
                 {\bf I.3.8}: Computing Methodologies, COMPUTER
                 GRAPHICS, Applications.",
}

@Article{McIlroy:1992:GRE,
  author =       "M. Douglas McIlroy",
  title =        "Getting Raster Ellipses Right",
  journal =      j-TOG,
  volume =       "11",
  number =       "3",
  pages =        "259--275",
  month =        jul,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130892.html",
  abstract =     "A concise, incremental algorithm for raster
                 approximations to ellipses in standard position
                 produces approximations that are good to the last pixel
                 even near octant boundaries or the thin ends of highly
                 eccentric ellipses. The resulting approximations
                 commute with reflection about the diagonal and are
                 mathematically specifiable without reference to details
                 of the algorithm.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Line and curve
                 generation.",
}

@Article{Maillot:1992:NFM,
  author =       "Patrick-Gilles Maillot",
  title =        "A New, Fast Method for {2-D} Polygon Clipping:
                 Analysis and Software Implementation",
  journal =      j-TOG,
  volume =       "11",
  number =       "3",
  pages =        "276--290",
  month =        jul,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130894.html",
  abstract =     "This paper presents a new 2D polygon clipping method,
                 based on an extension to the Sutherland-Cohen 2D line
                 clipping method. After discussing three basic polygon
                 clipping algorithms, a different approach is proposed,
                 explaining the principles of a new algorithm and
                 presenting it step by step.\par

                 An example implementation of the algorithm is given
                 along with some results. A comparison between the
                 proposed method, the Liang and Barsky algorithm, and
                 the Sutherland-Hodgman algorithm is also given, showing
                 performances up to eight times the speed of the
                 Sutherland-Hodgman algorithm, and up to three times the
                 Liang and Barsky algorithm. The algorithm proposed here
                 can use floating point or integer operations; this can
                 be useful for fast or simple implementations.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.4}: Computing Methodologies, COMPUTER
                 GRAPHICS, Graphics Utilities, Graphics packages. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems.",
}

@Article{Olsen:1992:BES,
  author =       "Dan R. Olsen",
  title =        "Bookmarks: An Enhanced Scroll Bar",
  journal =      j-TOG,
  volume =       "11",
  number =       "3",
  pages =        "291--295",
  month =        jul,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Foley:1992:E,
  author =       "Jim Foley",
  title =        "Editorial",
  journal =      j-TOG,
  volume =       "11",
  number =       "4",
  pages =        "297--298",
  month =        oct,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Anonymous:1992:CP,
  author =       "Anonymous",
  title =        "Call for papers",
  journal =      j-TOG,
  volume =       "11",
  number =       "4",
  pages =        "299--299",
  month =        oct,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:52:54 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Stone:1992:SIC,
  author =       "Maureen C. Stone",
  title =        "Special Issue on Color",
  journal =      j-TOG,
  volume =       "11",
  number =       "4",
  pages =        "300--304",
  month =        oct,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Haase:1992:MPM,
  author =       "Chet S. Haase and Gary W. Meyer",
  title =        "Modeling Pigmented Materials for Realistic Image
                 Synthesis",
  journal =      j-TOG,
  volume =       "11",
  number =       "4",
  pages =        "305--335",
  month =        oct,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/146452.html",
  abstract =     "This article discusses and applies the Kubelka-Munk
                 theory of pigment mixing to computer graphics in order
                 to facilitate improved image synthesis. The theories of
                 additive and subtractive color mixing are discussed and
                 are shown to be insufficient for pigmented materials.
                 The Kubelka-Munk theory of pigment mixing is developed
                 and the relevant equations are derived. Pigment mixing
                 experiments are performed and the results are displayed
                 on color television monitors. A paint program that uses
                 Kubelka-Munk theory to mix real pigments is presented.
                 Theories of color matching with pigments are extended
                 to determine reflectances for use in realistic image
                 synthesis.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; experimentation; human factors",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Color, shading, shadowing, and texture. {\bf I.3.4}:
                 Computing Methodologies, COMPUTER GRAPHICS, Graphics
                 Utilities, Paint systems.",
}

@Article{MacIntyre:1992:PAC,
  author =       "Blair MacIntyre and William B. Cowan",
  title =        "A Practical Approach to Calculating Luminance Contrast
                 on a {CRT}",
  journal =      j-TOG,
  volume =       "11",
  number =       "4",
  pages =        "336--347",
  month =        oct,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/146467.html",
  abstract =     "Luminance contrast is the basis of text legibility,
                 and maintaining luminance contrast is essential for any
                 color selection algorithm. In principle, it can be
                 calculated precisely on a sufficiently well-calibrated
                 display surface, but calibration is very expensive.
                 Consequently, most current systems deal with contrast
                 using heuristics. However, the usual CRT setup puts the
                 display surface into a state that is relatively
                 predictable. Luminance values can be estimated based on
                 this state, and these luminance values have been used
                 to calculate contrast using the Michelson definition.
                 This paper proposes a method for determining the
                 contrast of colored areas displayed on a CRT. It uses a
                 contrast metric that is in wide use in visual
                 psychophysics and shows that the metric can be
                 approximated reasonably without display measurement, as
                 long as it is possible to assume that the CRT has been
                 adjusted according to usual CRT setup standards.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; human factors",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf B.4.2}: Hardware, INPUT/OUTPUT AND DATA
                 COMMUNICATIONS, Input/Output Devices, Image display.
                 {\bf H.5.2}: Information Systems, INFORMATION
                 INTERFACES AND PRESENTATION, User Interfaces, Screen
                 design.",
}

@Article{Wu:1992:CQD,
  author =       "Xialin Wu",
  title =        "Color Quantization by Dynamic Programming and
                 Principal Analysis",
  journal =      j-TOG,
  volume =       "11",
  number =       "4",
  pages =        "348--372",
  month =        oct,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/146475.html",
  abstract =     "Color quantization is a process of choosing a set of
                 $K$ representative colors to approximate the $N$ colors
                 of an image, $K < N$, such that the resulting $K$-color
                 image looks as much like the original $N$-color image
                 as possible. This is an optimization problem known to
                 be NP-complete in $K$. However, this paper shows that
                 by ordering the $N$ colors along their principal axis
                 and partitioning the color space with respect to this
                 ordering, the resulting constrained optimization
                 problem can be solved in $O(N + KM^{2})$ time by
                 dynamic programming (where $M$ is the intensity
                 resolution of the device).\par

                 Traditional color quantization algorithms recursively
                 bipartition the color space. By using the above
                 dynamic-programming algorithm, we can construct a
                 globally optimal $K$-partition, $K>2$, of a color space
                 in the principal direction of the input data. This new
                 partitioning strategy leads to smaller quantization
                 error and hence better image quality. Other algorithmic
                 issues in color quantization such as efficient
                 statistical computations and nearest-neighbor searching
                 are also studied. The interplay between luminance and
                 chromaticity in color quantization with and without
                 color dithering is investigated. Our color quantization
                 method allows the user to choose a balance between the
                 image smoothness and hue accuracy for a given $K$.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.4.1}: Computing Methodologies, IMAGE
                 PROCESSING, Digitization, Quantization. {\bf I.3.3}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation, Digitizing and scanning. {\bf
                 I.4.2}: Computing Methodologies, IMAGE PROCESSING,
                 Compression (Coding), Approximate methods.",
}

@Article{Kasson:1992:ASC,
  author =       "James M. Kasson and Wil Plouffe",
  title =        "An Analysis of Selected Computer Interchange Color
                 Spaces",
  journal =      j-TOG,
  volume =       "11",
  number =       "4",
  pages =        "373--405",
  month =        oct,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/146479.html",
  abstract =     "Important standards for device-independent color allow
                 many different color encodings. This freedom obliges
                 users of these standards to choose the color space in
                 which to represent their data. A device-independent
                 interchange color space must exhibit an exact mapping
                 to a colorimetric color representation, ability to
                 encode all visible colors, compact representation for
                 given accuracy, and low computational cost for
                 transforms to and from device-dependent spaces. The
                 performance of CIE 1931 XYZ, CIELUV, CIELAB, YES, CCIR
                 601-2 YCbCr, and SMPTE-C RGB is measured against these
                 requirements. With extensions, all of these spaces can
                 meet the first two requirements. Quantizing error
                 dominates the representational errors of the tested
                 color spaces. Spaces that offer low quantization error
                 also have low gain for image noise. All linear spaces
                 are less compact than nonlinear alternatives. The
                 choice of nonlinearity is not critical; a wide range of
                 gammas yields acceptable results. The choice of
                 primaries for RGB representations is not critical,
                 except that high-chroma primaries should be avoided.
                 Quantizing the components of the candidate spaces with
                 varying precision yields only small improvements.
                 Compatibility with common image data compression
                 techniques leads to the requirement for low luminance
                 contamination, a property that compromises several
                 otherwise acceptable spaces. The conversion of a
                 device-independent representation to popular device
                 spaces by means of trilinear interpolation requires
                 substantially fewer lookup table entries with CCIR
                 601-2 YCbCr and CIELAB.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "experimentation; measurement; standardization",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism. {\bf
                 I.4.1}: Computing Methodologies, IMAGE PROCESSING,
                 Digitization. {\bf I.4.1}: Computing Methodologies,
                 IMAGE PROCESSING, Digitization, Quantization.",
}

@Article{Stokes:1992:PRD,
  author =       "Mike Stokes and Mark D. Fairchild and Roy S. Berns",
  title =        "Precision Requirements for Digital Color
                 Reproduction",
  journal =      j-TOG,
  volume =       "11",
  number =       "4",
  pages =        "406--422",
  month =        oct,
  year =         "1992",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/146482.html",
  abstract =     "An environment was established to perform
                 device-independent color reproduction of full-color
                 pictorial images. In order to determine the required
                 precision for this environment, an experiment was
                 performed to psychophysically measure colorimetric
                 tolerances for six images using paired comparison
                 techniques. These images were manipulated using 10
                 linear and nonlinear functions in the CIELAB dimensions
                 of lightness, chroma, and hue angle. Perceptibility
                 tolerances were determined using probit analysis. From
                 these results, the necessary precision in number of
                 bits per color channel was determined for both the
                 CIELAB and the CRT rgb device color spaces. For both
                 the CIELAB color space and the CRT rgb device space,
                 approximately eight color bits per channel were
                 required for imperceptible color differences for
                 pictorial images, and 10 bits per channel were required
                 for computational precision.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; experimentation; measurement",
  subject =      "{\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques, Ergonomics. {\bf
                 I.2.10}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Vision and Scene Understanding,
                 Intensity, color, photometry, and thresholding. {\bf
                 I.3.3}: Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation, Display algorithms. {\bf
                 I.3.3}: Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation, Viewing algorithms. {\bf
                 I.4.1}: Computing Methodologies, IMAGE PROCESSING,
                 Digitization, Quantization. {\bf I.4.1}: Computing
                 Methodologies, IMAGE PROCESSING, Digitization,
                 Sampling.",
}

@Article{Seidel:1993:PFG,
  author =       "Hans-Peter Seidel",
  title =        "Polar Forms for Geometrically Continuous Spline Curves
                 of Arbitrary Degree",
  journal =      j-TOG,
  volume =       "12",
  number =       "1",
  pages =        "1--34",
  month =        jan,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/93.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/169726.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations.",
}

@Article{Shapiro:1993:SBC,
  author =       "Vadim Shapiro and Donald L. Vossler",
  title =        "Separation for Boundary to {CSG} Conversion",
  journal =      j-TOG,
  volume =       "12",
  number =       "1",
  pages =        "35--55",
  month =        jan,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/93.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/169723.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Boundary representations. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Constructive solid
                 geometry (CSG). {\bf I.4.0}: Computing Methodologies,
                 IMAGE PROCESSING, General.",
}

@Article{Paoluzzi:1993:DIM,
  author =       "A. Paoluzzi and F. Bernardini and C. Cattani and V.
                 Ferrucci",
  title =        "Dimension-Independent Modeling with Simplicial
                 Complexes",
  journal =      j-TOG,
  volume =       "12",
  number =       "1",
  pages =        "56--102",
  month =        jan,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/93.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/169719.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems. {\bf J.6}: Computer
                 Applications, COMPUTER-AIDED ENGINEERING,
                 Computer-aided design (CAD).",
}

@Article{Salesin:1993:ATO,
  author =       "David Salesin and Ronen Barzel",
  title =        "Adjustable Tools: An Object-Oriented Interaction
                 Metaphor",
  journal =      j-TOG,
  volume =       "12",
  number =       "1",
  pages =        "103--107",
  month =        jan,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/93.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/214378.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design",
  subject =      "{\bf I.3.4}: Computing Methodologies, COMPUTER
                 GRAPHICS, Graphics Utilities.",
}

@Article{Rokne:1993:C,
  author =       "J. Rokne and Y. Yao",
  title =        "Corrigendum",
  journal =      j-TOG,
  volume =       "12",
  number =       "1",
  pages =        "108--108",
  month =        jan,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See \cite{Rokne:1992:DIL}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Anonymous:1993:AI,
  author =       "Anonymous",
  title =        "Author Index",
  journal =      j-TOG,
  volume =       "12",
  number =       "1",
  pages =        "109--110",
  month =        jan,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:57:52 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-pb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{DeRose:1993:FCA,
  author =       "Tony D. DeRose and Ronald N. Goldman and Hans Hagen
                 and Stephen Mann",
  title =        "Functional Composition Algorithms via Blossoming",
  journal =      j-TOG,
  volume =       "12",
  number =       "2",
  pages =        "113--135",
  month =        apr,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/151290.html",
  abstract =     "In view of the fundamental role that functional
                 composition plays in mathematics, it is not surprising
                 that a variety of problems in geometric modeling can be
                 viewed as instances of the following composition
                 problem: given representations for two functions $F$
                 and $G$, compute a representation of the function $H$ =
                 $F o G$. We examine this problem in detail for the case
                 when $F$ and $G$ are given in either B{\'e}zier or
                 B-spline form. Blossoming techniques are used to gain
                 theoretical insight into the structure of the solution
                 which is then used to develop efficient, tightly
                 codable algorithms. From a practical point of view, if
                 the composition algorithms are implemented as library
                 routines, a number of geometric-modeling problems can
                 be solved with a small amount of additional software.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD). {\bf G.1.2}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Spline and piecewise polynomial
                 approximation.",
}

@Article{Geist:1993:MFD,
  author =       "Robert Geist and Robert Reynolds and Darrell Suggs",
  title =        "A {Markovian} Framework for Digital Halftoning",
  journal =      j-TOG,
  volume =       "12",
  number =       "2",
  pages =        "136--159",
  month =        apr,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/151281.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.4.0}: Computing Methodologies, IMAGE
                 PROCESSING, General, Image displays. {\bf I.4.1}:
                 Computing Methodologies, IMAGE PROCESSING,
                 Digitization, Quantization. {\bf G.3}: Mathematics of
                 Computing, PROBABILITY AND STATISTICS, Probabilistic
                 algorithms (including Monte Carlo). {\bf I.3.3}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation, Digitizing and scanning. {\bf
                 I.3.3}: Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation, Display algorithms. {\bf
                 I.3.3}: Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation. {\bf I.4.1}: Computing
                 Methodologies, IMAGE PROCESSING, Digitization.",
}

@Article{Elber:1993:SSA,
  author =       "Gershon Elber and Elaine Cohen",
  title =        "Second-Order Surface Analysis Using Hybrid Symbolic
                 and Numeric Operators",
  journal =      j-TOG,
  volume =       "12",
  number =       "2",
  pages =        "160--178",
  month =        apr,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/151283.html",
  abstract =     "Results from analyzing the curvature of a surface can
                 be used to improve the implementation, efficiency, and
                 effectiveness of manufacturing and visualization of
                 sculptured surfaces.\par

                 We develop a robust method using hybrid symbolic and
                 numeric operators to create trimmed surfaces, each of
                 which is solely convex, concave, or saddle and
                 partitions the original surface. The same method is
                 also used to identify regions whose curvature lies
                 within prespecified bounds.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Splines.",
}

@Article{Bartels:1993:ECS,
  author =       "Richard H. Bartels and John C. Beatty and Kellogg S.
                 Booth and Eric G. Bosch and Pierre Jolicoeur",
  title =        "Experimental Comparison of Splines Using the
                 Shape-Matching Paradigm",
  journal =      j-TOG,
  volume =       "12",
  number =       "3",
  pages =        "179--208",
  month =        jul,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/93.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/169709.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design; experimentation; human factors; performance",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Splines. {\bf H.5.2}: Information Systems, INFORMATION
                 INTERFACES AND PRESENTATION, User Interfaces,
                 Evaluation/methodology. {\bf H.5.2}: Information
                 Systems, INFORMATION INTERFACES AND PRESENTATION, User
                 Interfaces, Interaction styles. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Curve, surface, solid,
                 and object representations. {\bf I.3.6}: Computing
                 Methodologies, COMPUTER GRAPHICS, Methodology and
                 Techniques, Interaction techniques.",
}

@Article{Paluszny:1993:FTC,
  author =       "Marco Paluszny and Richard R. Patterson",
  title =        "A Family of Tangent Continuous Cubic Algebraic
                 Splines",
  journal =      j-TOG,
  volume =       "12",
  number =       "3",
  pages =        "209--232",
  month =        jul,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/93.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/169707.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Splines. {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD).",
}

@Article{Malzbender:1993:FVR,
  author =       "Tom Malzbender",
  title =        "{Fourier} Volume Rendering",
  journal =      j-TOG,
  volume =       "12",
  number =       "3",
  pages =        "233--250",
  month =        jul,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/93.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/169705.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; performance; theory",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Color, shading, shadowing, and texture. {\bf F.2.1}:
                 Theory of Computation, ANALYSIS OF ALGORITHMS AND
                 PROBLEM COMPLEXITY, Numerical Algorithms and Problems,
                 Computation of transforms. {\bf I.3.3}: Computing
                 Methodologies, COMPUTER GRAPHICS, Picture/Image
                 Generation, Display algorithms. {\bf I.3.6}: Computing
                 Methodologies, COMPUTER GRAPHICS, Methodology and
                 Techniques, Graphics data structures and data types.
                 {\bf I.4.1}: Computing Methodologies, IMAGE PROCESSING,
                 Digitization, Sampling. {\bf I.4.10}: Computing
                 Methodologies, IMAGE PROCESSING, Image Representation,
                 Volumetric.",
}

@Article{Fellner:1993:RRG,
  author =       "Dieter W. Fellner and Christoph Helmberg",
  title =        "Robust Rendering of General Ellipses and Elliptical
                 Arcs",
  journal =      j-TOG,
  volume =       "12",
  number =       "3",
  pages =        "251--276",
  month =        jul,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Graphics/siggraph/93.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/169704.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; performance",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Color, shading, shadowing, and texture.",
}

@Article{Kurlander:1993:ICM,
  author =       "David Kurlander and Steven Feiner",
  title =        "Inferring Constraints from Multiple Snapshots",
  journal =      j-TOG,
  volume =       "12",
  number =       "4",
  pages =        "277--304",
  month =        oct,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/159731.html",
  abstract =     "Many graphic tasks, such as the manipulation of
                 graphical objects and the construction of
                 user-interface widgets, can be facilitated by geometric
                 constraints. However, the difficulty of specifying
                 constraints by traditional methods forms a barrier to
                 their widespread use. In order to make constraints
                 easier to declare, we have developed a method of
                 specifying constraints implicitly, through multiple
                 examples. Snapshots are taken of an initial scene
                 configuration, and one or more additional snapshots are
                 taken after the scene has been edited into other valid
                 configurations. The constraints that are satisfied in
                 all of the snapshots are then applied to the scene
                 objects. We discuss an efficient algorithm for
                 inferring constraints from multiple snapshots. The
                 algorithm has been incorporated into the Chimera
                 editor, and several examples of its use are
                 discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques, Interaction
                 techniques. {\bf D.2.2}: Software, SOFTWARE
                 ENGINEERING, Tools and Techniques, User interfaces.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.2.6}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Learning, Concept learning.",
}

@Article{Chen:1993:SIS,
  author =       "Lin-Lin Chen and Shuo-Yan Chou and Tony C. Woo",
  title =        "Separating and Intersecting Spherical Polygons:
                 Computing Machinability on Three-, Four-, and Five-Axis
                 Numerically Controlled Machines",
  journal =      j-TOG,
  volume =       "12",
  number =       "4",
  pages =        "305--326",
  month =        oct,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/159732.html",
  abstract =     "We consider the computation of an optimal workpiece
                 orientation allowing the maximal number of surfaces to
                 be machined in a single setup on a three-, four-, or
                 five-axis numerically controlled machine. Assuming the
                 use of a ball-end cutter, we establish the conditions
                 under which a surface is machinable by the cutter
                 aligned in a certain direction, without the cutter's
                 being obstructed by portions of the same surface. The
                 set of such directions is represented on the sphere as
                 a convex region, called the {\em visibility map} of the
                 surface. By using the Gaussian maps and the visibility
                 maps of the surfaces on a component, we can formulate
                 the optimal workpiece orientation problems as geometric
                 problems on the sphere. These and related geometric
                 problems include finding a densest hemisphere that
                 contains the largest subset of a given set of spherical
                 polygons, determining a great circle that separates a
                 given set of spherical polygons, computing a great
                 circle that bisects a given set of spherical polygons,
                 and finding a great circle that intersects the largest
                 or the smallest subset of a set of spherical polygons.
                 We show how all possible ways of intersecting a set of
                 $n$ spherical polygons with $v$ total number of
                 vertices by a great circle can be computed in $O(vn
                 \log n)$ time and represented as a spherical partition.
                 By making use of this representation, we present
                 efficient algorithms for solving the five geometric
                 problems on the sphere.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; performance",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Geometric algorithms, languages, and systems. {\bf
                 F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Geometrical problems and computations. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided manufacturing (CAM).",
}

@Article{Bajaj:1993:HIL,
  author =       "Chanderjit Bajaj and Ihm Insung and Joe Warren",
  title =        "Higher-Order Interpolation and Least-Squares
                 Approximation Using Implicit Algebraic Surfaces",
  journal =      j-TOG,
  volume =       "12",
  number =       "4",
  pages =        "327--347",
  month =        oct,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/159734.html",
  abstract =     "In this article, we characterize the solution space of
                 low-degree, implicitly defined, algebraic surfaces
                 which interpolate and/or least-squares approximate a
                 collection of scattered point and curve data in
                 three-dimensional space. The problem of higher-order
                 interpolation and least-squares approximation with
                 algebraic surfaces under a proper normalization reduces
                 to a quadratic minimization problem with elegant and
                 easily expressible solutions. We have implemented our
                 algebraic surface-fitting algorithms, and included them
                 in the distributed and collaborative geometric
                 environment SHASTRA. Several examples are given to
                 illustrate how our algorithms are applied to algebraic
                 surface design.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Least squares approximation. {\bf
                 G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization. {\bf I.3.5}: Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Geometric algorithms, languages, and systems.
                 {\bf F.2.1}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
                 and Problems, Computations on polynomials. {\bf J.6}:
                 Computer Applications, COMPUTER-AIDED ENGINEERING. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Interpolation formulas.",
}

@Article{Rappoport:1993:UDR,
  author =       "Ari Rappoport and Maarten van Emmerik",
  title =        "User-Interface Devices for Rapid and Exact Number
                 Specification",
  journal =      j-TOG,
  volume =       "12",
  number =       "4",
  pages =        "348--354",
  month =        oct,
  year =         "1993",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/214380.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design; human factors",
  subject =      "{\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques, Interaction
                 techniques. {\bf I.3.4}: Computing Methodologies,
                 COMPUTER GRAPHICS, Graphics Utilities, Virtual device
                 interfaces. {\bf I.3.5}: Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Geometric algorithms, languages, and
                 systems.",
}

@Article{Foley:1994:SC,
  author =       "Jim Foley",
  title =        "Scope and Charter",
  journal =      j-TOG,
  volume =       "13",
  number =       "1",
  pages =        "1--1",
  month =        jan,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:42:18 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Taubin:1994:DAR,
  author =       "Gabriel Taubin",
  title =        "Discrete Approximations for Rasterizing Implicit
                 Curves",
  journal =      j-TOG,
  volume =       "13",
  number =       "1",
  pages =        "3--42",
  month =        jan,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:42:26 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/174531.html",
  abstract =     "In this article we present new algorithms for
                 rasterizing implicit curves, i.e., curves represented
                 as level sets of functions of two variables.
                 Considering the pixels as square regions of the plane,
                 a ``correct'' algorithm should paint those pixels whose
                 centers lie at less than half the desired line width
                 from the curve. A straightforward implementation,
                 scanning the display array evaluating the Euclidean
                 distance from the center of each pixel to the curve, is
                 impractical, and a standard quad-tree-like recursive
                 subdivision scheme is used instead. Then we attack the
                 problem of testing whether or not the Euclidean
                 distance from a point to an implicit curve is less than
                 a given threshold. For the most general case, when the
                 implicit function is only required to have continuous
                 first-order derivatives, we show how to reformulate the
                 test as an unconstrained global root-finding problem in
                 a circular domain. For implicit functions with
                 continuous derivatives up to order $k$ we introduce an
                 approximate distance of order $k$. The approximate
                 distance of order $k$ from a point to an implicit curve
                 is asymptotically equivalent to the Euclidean distance
                 and provides a sufficient test for a polynomial of
                 degree $k$ not to have roots inside a circle. This is
                 the main contribution of the article. By replacing the
                 Euclidean distance test with one of these approximate
                 distance tests, we obtain a practical rendering
                 algorithm, proven to be correct for algebraic curves.
                 To speed up the computation we also introduce
                 heuristics, which used in conjunction with low-order
                 approximate distances almost always produce equivalent
                 results. The behavior of the algorithms is analyzed,
                 both near regular and singular points, and several
                 possible extensions and applications are discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD).",
}

@Article{Edelsbrunner:1994:TAS,
  author =       "Herbert Edelsbrunner and Ernst P. M{\"{u}}cke",
  title =        "Three-Dimensional Alpha Shapes",
  journal =      j-TOG,
  volume =       "13",
  number =       "1",
  pages =        "43--72",
  month =        jan,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 16:06:13 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/156635.html",
  abstract =     "Frequently, data in scientific computing is in its
                 abstract form a finite point set in space, and it is
                 sometimes useful or required to compute what one might
                 call the ``shape'' of the set. For that purpose, this
                 article introduces the formal notion of the family of
                 [alpha]-shapes of a finite point set in $R^3$. Each
                 shape is a well-defined polytope, derived from the
                 Delaunay triangulation of the point set, with a
                 parameter [alpha] [epsilon] R controlling the desired
                 level of detail. An algorithm is presented that
                 constructs the entire family of shapes for a given set
                 of size $n$ in time $O(n^2)$, worst case. A robust
                 implementation of the algorithm is discussed, and
                 several applications in the area of scientific
                 computing are mentioned.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Geometrical problems and computations. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Reliability and robustness. {\bf I.2.10}: Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Vision and
                 Scene Understanding, Representations, data structures,
                 and transforms. {\bf J.2}: Computer Applications,
                 PHYSICAL SCIENCES AND ENGINEERING. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems.",
}

@Article{Manocha:1994:AIP,
  author =       "Dinesh Manocha and James Demmel",
  title =        "Algorithms for Intersecting Parametric and Algebraic
                 Curves {I}: Simple Intersections",
  journal =      j-TOG,
  volume =       "13",
  number =       "1",
  pages =        "73--100",
  month =        jan,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:42:39 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/174617.html",
  abstract =     "The problem of computing the intersection of
                 parametric and algebraic curves arises in many
                 applications of computer graphics and geometric and
                 solid modeling. Previous algorithms are based on
                 techniques from elimination theory or subdivision and
                 iteration. The former is, however, restricted to
                 low-degree curves. This is mainly due to issues of
                 efficiency and numerical stability. In this article we
                 use elimination theory and express the resultant of the
                 equations of intersection as matrix determinant. The
                 matrix itself rather than its symbolic determinant, a
                 polynomial, is used as the representation. The problem
                 of intersection is reduced to that of computing the
                 eigenvalues and eigenvectors of a numeric matrix. The
                 main advantage of this approach lies in its {\em
                 efficiency and robustness}. Moreover, the numerical
                 accuracy of these operations is well understood. For
                 almost all cases we are able to compute accurate
                 answers in 64-bit IEEE floating-point arithmetic.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; performance",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems. {\bf F.2.2}: Theory
                 of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems.",
}

@Article{Rossignac:1994:ISI,
  author =       "Jarek Rossignac",
  title =        "Introduction to the Special Issue on Interactive
                 Sculpting",
  journal =      j-TOG,
  volume =       "13",
  number =       "2",
  pages =        "101--102",
  month =        apr,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Sep 06 19:22:43 1994",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Terzopoulos:1994:DNG,
  author =       "Demetri Terzopoulos and Hong Qin",
  title =        "Dynamic {NURBS} with Geometric Constraints to
                 Interactive Sculpting",
  journal =      j-TOG,
  volume =       "13",
  number =       "2",
  pages =        "103--136",
  month =        apr,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:42:54 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/176580.html",
  abstract =     "This article develops a dynamic generalization of the
                 nonuniform rational B-spline (NURBS) model. NURBS have
                 become a de facto standard in commercial modeling
                 systems because of their power to represent free-form
                 shapes as well as common analytic shapes. To date,
                 however, they have been viewed as purely geometric
                 primitives that require the user to manually adjust
                 multiple control points and associated weights in order
                 to design shapes. Dynamic NURBS, or D-NURBS, are
                 physics-based models that incorporate mass
                 distributions, internal deformation energies, and other
                 physical quantities into the popular NURBS geometric
                 substrate. Using D-NURBS, a modeler can interactively
                 sculpt curves and surfaces and design complex shapes to
                 required specifications not only in the traditional
                 indirect fashion, by adjusting control points and
                 weights, but also through direct physical manipulation,
                 by applying simulated forces and local and global shape
                 constraints. D-NURBS move and deform in a physically
                 intuitive manner in response to the user's direct
                 manipulations. Their dynamic behavior results from the
                 numerical integration of a set of nonlinear
                 differential equations that automatically evolve the
                 control points and weights in response to the applied
                 forces and constraints. To derive these equations, we
                 employ Lagrangian mechanics and a finite-element-like
                 discretization. Our approach supports the trimming of
                 D-NURBS surfaces using D-NURBS curves. We demonstrate
                 D-NURBS models and constraints in applications
                 including the rounding of solids, optimal surface
                 fitting to unstructured data, surface design from cross
                 sections, and free-form deformation. We also introduce
                 a new technique for 2D shape metamorphosis using
                 constrained D-NURBS surfaces.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Physically
                 based modeling. {\bf I.3.6}: Computing Methodologies,
                 COMPUTER GRAPHICS, Methodology and Techniques,
                 Interaction techniques.",
}

@Article{Borrel:1994:SCD,
  author =       "Paul Borrel and Ari Rappoport",
  title =        "Simple Constrained Deformations for Geometric Modeling
                 and Interactive Design",
  journal =      j-TOG,
  volume =       "13",
  number =       "2",
  pages =        "137--155",
  month =        apr,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:43:07 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/176581.html",
  abstract =     "Deformations are a powerful tool for shape modeling
                 and design. We present a new model for producing
                 controlled spatial deformations, which we term {\em
                 Simple Constrained Deformations (Scodef)}. The user
                 defines a set of constraint points, giving a desired
                 displacement and radius of influence for each. Each
                 constraint point determines a local B-spline basis
                 function centered at the constraint point, falling to
                 zero for points beyond the radius. The deformed image
                 of any point in space is a blend of these basis
                 functions, using a projection matrix computed to
                 satisfy the constraints. The deformation operates on
                 the whole space regardless of the representation of the
                 objects embedded inside the space. The constraints
                 directly influence the final shape of the deformed
                 objects, and this shape can be fine-tuned by adjusting
                 the radius of influence of each constraint point. The
                 computations required by the technique can be done very
                 efficiently, and real-time interactive deformation
                 editing on current workstations is possible.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Splines.",
}

@Article{Rappoport:1994:IDS,
  author =       "Ari Rappoport and Yaacov {Hel-Or} and Michael Werman",
  title =        "Interactive Design of Smooth Objects with
                 Probabilistic Point Constraints",
  journal =      j-TOG,
  volume =       "13",
  number =       "2",
  pages =        "156--176",
  month =        apr,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 15:43:17 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/176582.html",
  abstract =     "Point displacement constraints constitute an
                 attractive technique for interactive design of smooth
                 curves, surfaces, and volumes. The user defines an
                 arbitrary number of ``control points'' on the object
                 and specifies their desired spatial location, while the
                 system computes the object's degrees of freedom so that
                 the constraints are satisfied. A constraint-based
                 interface gives a feeling of direct manipulation of the
                 object. In this article we introduce {\em soft
                 constraints}, constraints which do not have to be met
                 exactly. The softness of each constraint serves as a
                 nonisotropic, local {\em shape parameter} enabling the
                 user to explore the space of objects conforming to the
                 constraints. Additionally, there is a global shape
                 parameter which determines the amount of similarity of
                 the designed object to a rest shape, or equivalently,
                 the rigidity of the rest shape.\par

                 We present an algorithm termed {\em probabilistic point
                 constraints (PPC)} for implementing soft constraints.
                 The PPC algorithm views constraints as stochastic
                 measurements of the state of a static system. The
                 softness of a constraint is derived from the {\em
                 covariance} of the ``measurement.'' The resulting
                 system of probabilistic equations is solved using the
                 {\em Kalman filter}, a powerful estimation tool in the
                 theory of stochastic systems. We also describe a user
                 interface using {\em direct-manipulation devices} for
                 specifying and visualizing covariances in 2D and
                 3D.\par

                 The algorithm is suitable for any object represented as
                 a parametric blend of control points, including most
                 spline representations. The covariance of a constraint
                 provides a continuous transition from exact
                 interpolation to controlled approximation of the
                 constraint. The algorithm involves only linear
                 operations and allows real-time interactive direct
                 manipulation of curves and surfaces on current
                 workstations.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Spline and piecewise polynomial
                 interpolation. {\bf G.1.2}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Approximation, Least squares
                 approximation. {\bf G.1.2}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Approximation, Spline and piecewise
                 polynomial approximation. {\bf I.3.4}: Computing
                 Methodologies, COMPUTER GRAPHICS, Graphics Utilities,
                 Graphics editors. {\bf I.3.5}: Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Splines.",
}

@Article{Vemuri:1994:MSH,
  author =       "B. C. Vemuri and A. Radisavljevic",
  title =        "Multiresolution Stochastic Hybrid Shape Models with
                 Fractal Priors",
  journal =      j-TOG,
  volume =       "13",
  number =       "2",
  pages =        "177--207",
  month =        apr,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 06 18:01:36 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/176583.html",
  abstract =     "3D shape modeling has received enormous attention in
                 computer graphics and computer vision over the past
                 decade. Several shape modeling techniques have been
                 proposed in literature, some are local (distributed
                 parameter) while others are global (lumped parameter)
                 in terms of the parameters required to describe the
                 shape. Hybrid models that combine both ends of this
                 parameter spectrum have been in vogue only recently.
                 However, they do not allow a smooth transition between
                 the two extremes of this parameter spectrum.\par

                 We introduce a {\em new shape-modeling scheme} that can
                 {\em transform smoothly from local to global} models or
                 vice versa. The modeling scheme utilizes a hybrid
                 primitive called the deformable superquadric {\em
                 constructed in an orthonormal wavelet basis}. The
                 multiresolution wavelet basis provides the power to
                 continuously transform from local to global shape
                 deformations and thereby allow for a continuum of shape
                 models---from those with local to those with global
                 shape descriptive power---to be created. The
                 multiresolution wavelet basis allows us to generate
                 fractal surfaces of arbitrary order that can be useful
                 in describing natural detail.\par

                 We embed these multiresolution shape models in a
                 probabilistic framework and use them for recovery of
                 anatomical structures in the human brain from MRI data.
                 A salient feature of our modeling scheme is that it can
                 naturally allow for the incorporation of prior
                 statistics of a rich variety of shapes. This stems from
                 the fact that, unlike other modeling schemes, in our
                 modeling, we require relatively few parameters to
                 describe a large class of shapes.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.2.10}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Vision and Scene Understanding, Modeling
                 and recovery of physical attributes. {\bf G.1.8}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Partial
                 Differential Equations, Finite element methods. {\bf
                 G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Statistical computing. {\bf I.2.10}:
                 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Vision and Scene Understanding, Shape. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Curve,
                 surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Hierarchy
                 and geometric transformations. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Physically based
                 modeling. {\bf I.3.5}: Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Splines. {\bf I.3.8}: Computing
                 Methodologies, COMPUTER GRAPHICS, Applications.",
}

@Article{Hudson:1994:UIS,
  author =       "Scott E. Hudson",
  title =        "User Interface Specification Using an Enhanced
                 Spreadsheet Model",
  journal =      j-TOG,
  volume =       "13",
  number =       "3",
  pages =        "209--239",
  month =        jul,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:40:37 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/195787.html",
  abstract =     "This paper describes a new interactive environment for
                 user interface specification which is based on an
                 enhanced spreadsheet model of computation. This
                 environment allows sophisticated graphical user
                 interfaces with dynamic feedback to be implemented with
                 little or no explicit programming. Its goal is to
                 support user interface specification by nonprogramming
                 experts in human factors, visual design, or the
                 application domain. In addition, the system is designed
                 to allow sophisticated end-users to modify and
                 customize their own interfaces. The system is based on
                 a data flow model of computation. This model is
                 presented to the interface designer in the form of a
                 spreadsheet enhanced with new constructs for easier
                 programming and reuse. These constructs include an
                 improved interactive programming environment, a
                 prototype-instance-based inheritance system, support
                 for composition, abstraction, and customization using
                 indirect references, the addition of support for
                 graphical inputs and outputs, and support for the
                 encapsulation of application data structures and
                 routines within system objects.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "human factors; languages",
  subject =      "{\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques. {\bf D.2.2}:
                 Software, SOFTWARE ENGINEERING, Tools and Techniques,
                 User interfaces. {\bf D.2.6}: Software, SOFTWARE
                 ENGINEERING, Programming Environments, Interactive.
                 {\bf D.2.m}: Software, SOFTWARE ENGINEERING,
                 Miscellaneous, Rapid prototyping.",
}

@Article{Klassen:1994:EIH,
  author =       "R. Victor Klassen",
  title =        "Exact Integer Hybrid Subdivision and Forward
                 Differencing of Cubics",
  journal =      j-TOG,
  volume =       "13",
  number =       "3",
  pages =        "240--255",
  month =        jul,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:40:37 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/197476.html",
  abstract =     "Forward differencing is widely used to generate
                 rapidly large numbers of points at equally space
                 parameter values along a curve. A failing of forward
                 differencing is the tendency to generate many
                 extraneous points for curves with highly nonuniform
                 parameterizations. A key result is presented and
                 proven, namely, that a few levels of subdivision, prior
                 to initialization for forward differencing, can improve
                 substantially the quality of the step size estimate,
                 resulting in very few extra points. The initial
                 subdivisions can be done without loss of the exact
                 integer precision available in forward differencing.
                 For small numbers of points---a common occurrence in
                 fonts---exact subdivision is even faster than exact
                 forward differencing. When exact subdivision is used in
                 conjunction with a previously presented exact
                 forward-differencing algorithm, arbitrary cubic curves
                 may be rendered with 32-bit arithmetic and guaranteed
                 single-pixel accuracy, in a grid with an address space
                 as large as 0..7281, with no two generated points
                 greater than one pixel apart. This is more steps than
                 previously possible. Previous discussions of rendering
                 using subdivision have concentrated not on distance but
                 on straightness estimates, whereby subdivision can be
                 stopped once a subcurve can be drawn safely using its
                 polygonal approximation. In this article, bounds are
                 also derived on the size of the control polygon after
                 multiple levels of subdivision: these are used to
                 determine bounds on the number of steps required for
                 differencing. It is shown that any curve whose
                 rasterization fits in a space of $\omega$ pixels
                 requires no more than $9\omega$ steps.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; reliability",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Splines. {\bf G.1.2}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Approximation, Spline and piecewise
                 polynomial approximation.",
}

@Article{Hart:1994:VQR,
  author =       "John C. Hart and George K. Francis and Louis H.
                 Kauffman",
  title =        "Visualizing Quaternion Rotation",
  journal =      j-TOG,
  volume =       "13",
  number =       "3",
  pages =        "256--276",
  month =        jul,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:40:37 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/197480.html",
  abstract =     "Quaternions play a vital role in the representation of
                 rotations in computer graphics, primarily for animation
                 and user interfaces. Unfortunately, quaternion rotation
                 is often left as an advanced topic in computer graphics
                 education due to difficulties in portraying the
                 four-dimensional space of the quaternions. One tool for
                 overcoming these obstacles is the quaternion
                 demonstrator, a physical visual aid consisting
                 primarily of a belt. Every quaternion used to specify a
                 rotation can be represented by fixing one end of the
                 belt and rotating the other. Multiplication of
                 quaternions is demonstrated by the composition of
                 rotations, and the resulting twists in the belt depict
                 visually how quaternions interpolate rotation.\par

                 This article introduces to computer graphics the
                 exponential notation that mathematicians have used to
                 represent unit quaternions. Exponential notation
                 combines the angle and axis of the rotation into
                 concise quaternion expression. This notation allows the
                 article to present more clearly a mechanical quaternion
                 demonstrator consisting of a ribbon and a tag, and
                 develop a computer simulation suitable for interactive
                 educational packages. Local deformations and the belt
                 trick are used to minimize the ribbon's twisting and
                 simulate a natural-appearing interactive quaternion
                 demonstrator.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Hierarchy and geometric transformations. {\bf I.3.6}:
                 Computing Methodologies, COMPUTER GRAPHICS, Methodology
                 and Techniques, Graphics data structures and data
                 types.",
}

@Article{Niizeki:1994:PII,
  author =       "Masatoshi Niizeki and Fujio Yamaguchi",
  title =        "Projectively Invariant Intersection Detections for
                 Solid Modeling",
  journal =      j-TOG,
  volume =       "13",
  number =       "3",
  pages =        "277--299",
  month =        jul,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:40:37 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/197485.html",
  abstract =     "An intersection detection method for solid modeling
                 which is invariant under projective transformations is
                 presented. We redefine the fundamental geometric
                 figures necessary to describe solid models and their
                 dual figures in a homogeneous coordinate
                 representation. Then we derive conditions, which are
                 projectively invariant, for intersections between these
                 primitives. We will show that a geometric processor
                 based on the 4 x 4 determinant method is applicable to
                 a wide range of problems with little modification. This
                 method has applications in intersection detections of
                 rational parametric curves and surfaces and
                 hidden-line/surface removal algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Geometric algorithms, languages, and systems. {\bf
                 F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Numerical Algorithms and
                 Problems, Computations on matrices. {\bf F.2.2}: Theory
                 of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Geometrical problems and computations. {\bf G.1.3}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical
                 Linear Algebra, Determinants. {\bf I.3.4}: Computing
                 Methodologies, COMPUTER GRAPHICS, Graphics Utilities,
                 Application packages. {\bf J.6}: Computer Applications,
                 COMPUTER-AIDED ENGINEERING, Computer-aided design
                 (CAD).",
}

@Article{Rodham:1994:STM,
  author =       "Kenneth J. Rodham and Dan R. {Olsen, Jr.}",
  title =        "Smart Telepointers: Maintaining Telepointer
                 Consistency in the Presence of User Interface
                 Customization",
  journal =      j-TOG,
  volume =       "13",
  number =       "3",
  pages =        "300--307",
  month =        jul,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:40:37 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/197492.html",
  abstract =     "Conventional methods for maintaining telepointer
                 consistency in shared windows do not work in the
                 presence of per-user window customizations. This
                 article presents the notion of a ``smart telepointer,''
                 which is a telepointer that works correctly in spite of
                 such customizations. Methods for smart-telepointer
                 implementation are discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "human factors",
  subject =      "{\bf H.5.2}: Information Systems, INFORMATION
                 INTERFACES AND PRESENTATION, User Interfaces,
                 Interaction styles. {\bf H.5.2}: Information Systems,
                 INFORMATION INTERFACES AND PRESENTATION, User
                 Interfaces, Windowing systems. {\bf H.5.3}: Information
                 Systems, INFORMATION INTERFACES AND PRESENTATION, Group
                 and Organization Interfaces, Synchronous interaction.",
}

@Article{Baker:1994:CAL,
  author =       "Henry G. Baker",
  title =        "Corrigenda: ``{Intersection Algorithms for Lines and
                 Circles}''",
  journal =      j-TOG,
  volume =       "13",
  number =       "3",
  pages =        "308--310",
  month =        jul,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:40:37 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See \cite{Middleditch:1989:IAL}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/197874.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; reliability; theory",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Error analysis. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Computer arithmetic. {\bf G.1.0}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, General, Condition (and
                 ill-condition). {\bf G.1.0}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, General, Stability (and
                 instability). {\bf I.3.5}: Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Curve, surface, solid, and object
                 representations. {\bf I.3.5}: Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Geometric algorithms, languages, and systems.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Hierarchy and geometric transformations. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Modeling
                 packages.",
}

@Article{Zhao:1994:IKP,
  author =       "Jianmin Zhao and Norman I. Badler",
  title =        "Inverse Kinematics Positioning Using Nonlinear
                 Programming for Highly Articulated Figures",
  journal =      j-TOG,
  volume =       "13",
  number =       "4",
  pages =        "313--336",
  month =        oct,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:49:28 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/195827.html",
  abstract =     "An articulated figure is often modeled as a set of
                 rigid segments connected with joints. Its configuration
                 can be altered by varying the joint angles. Although it
                 is straight forward to compute figure configurations
                 given joint angles (forward kinematics), it is more
                 difficult to find the joint angles for a desired
                 configuration (inverse kinematics). Since the inverse
                 kinematics problem is of special importance to an
                 animator wishing to set a figure to a posture
                 satisfying a set of positioning constraints,
                 researchers have proposed several different approaches.
                 However, when we try to follow these approaches in an
                 interactive animation system where the object on which
                 to operate is as highly articulated as a realistic
                 human figure, they fail in either generality or
                 performance. So, we approach this problem through
                 nonlinear programming techniques. It has been
                 successfully used since 1988 in the spatial constraint
                 system within {\em Jack}, a human figure simulation
                 system developed at the University of Pennsylvania, and
                 proves to be satisfactorily efficient, controllable,
                 and robust. A spatial constraint in our system involves
                 two parts: one constraint on the figure, the {\em
                 end-effector}, and one on the spatial environment, the
                 {\em goal}. These two parts are dealt with separately,
                 so that we can achieve a neat modular implementation.
                 Constraints can be added one at a time with appropriate
                 weights designating the importance of this constraint
                 relative to the others and are always solved as a
                 group. If physical limits prevent satisfaction of all
                 the constraints, the system stops with the (possibly
                 local) optimal solution for the given weights. Also,
                 the rigidity of each joint angle can be controlled,
                 which is useful for redundant degrees of freedom.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; performance",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Animation. {\bf I.3.8}: Computing Methodologies,
                 COMPUTER GRAPHICS, Applications.",
}

@Article{VanGelder:1994:TCI,
  author =       "Allen {Van Gelder} and Jane Wilhelms",
  title =        "Topological Considerations in Isosurface Generation",
  journal =      j-TOG,
  volume =       "13",
  number =       "4",
  pages =        "337--375",
  month =        oct,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:49:28 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See corrigendum: \cite{VanGelder:1995:CCI}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/195828.html",
  abstract =     "A popular technique for rendition of isosurfaces in
                 sampled data is to consider cells with sample points as
                 corners and approximate the isosurface in each cell by
                 one or more polygons whose vertices are obtained by
                 interpolation of the sample data. That is, each polygon
                 vertex is a point on a cell edge, between two adjacent
                 sample points, where the function is estimated to equal
                 the desired threshold value. The two sample points have
                 values on opposite sides of the threshold, and the
                 interpolated point is called an {\em intersection
                 point}.\par

                 When one cell face has an intersection point in each of
                 its four edges, then the correct connection among
                 intersection points becomes ambiguous. An incorrect
                 connection can lead to erroneous topology in the
                 rendered surface, and possible discontinuities. We show
                 that disambiguation methods, to be at all accurate,
                 need to consider sample values in the neighborhood
                 outside the cell. This paper studies the problems of
                 disambiguation, reports on some solutions, and presents
                 some statistics on the occurrence of such
                 ambiguities.\par

                 A natural way to incorporate neighborhood information
                 is through the use of calculated gradients at cell
                 corners. They provide insight into the behavior of a
                 function in well-understood ways. We introduce two {\em
                 gradient consistency heuristics} that use calculated
                 gradients at the corners of ambiguous faces, as well as
                 the function values at those corners, to disambiguate
                 at a reasonable computational cost. These methods give
                 the correct topology on several examples that caused
                 problems for other methods we examined.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; experimentation; performance; theory;
                 verification",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Boundary representations. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Curve, surface, solid,
                 and object representations. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Geometric algorithms,
                 languages, and systems.",
}

@Article{Paglieroni:1994:HDD,
  author =       "David W. Paglieroni and Sidney M. Petersen",
  title =        "Height Distributional Distance Transform Methods for
                 Height Field Ray Tracing",
  journal =      j-TOG,
  volume =       "13",
  number =       "4",
  pages =        "376--399",
  month =        oct,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:49:28 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/197312.html",
  abstract =     "Height distributional distance transform (HDDT)
                 methods are introduced as a new class of methods for
                 height field ray tracing. HDDT methods utilize results
                 of height field preprocessing. The preprocessing
                 involves computing a height field transform
                 representing an array of cone-like volumes of empty
                 space above the height field surface that are as wide
                 as possible. There is one cone-like volume balanced on
                 its apex centered above each height field cell. Various
                 height field transforms of this type are developed.
                 Each is based on distance transforms of height field
                 horizontal cross-sections. HDDT methods trace rays
                 through empty cone-like volumes instead of through
                 successive height field cells. The performance of HDDT
                 methods is evaluated experimentally against existing
                 height field ray tracing methods.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; theory",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Raytracing. {\bf I.3.3}: Computing Methodologies,
                 COMPUTER GRAPHICS, Picture/Image Generation, Display
                 algorithms. {\bf I.3.3}: Computing Methodologies,
                 COMPUTER GRAPHICS, Picture/Image Generation, Viewing
                 algorithms.",
}

@Article{Shene:1994:LDI,
  author =       "Ching-Kuang Shene and John K. Johnstone",
  title =        "On the Lower Degree Intersections of Two Natural
                 Quadrics",
  journal =      j-TOG,
  volume =       "13",
  number =       "4",
  pages =        "400--424",
  month =        oct,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:49:28 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/197316.html",
  abstract =     "In general, two quadric surface intersect in a space
                 quartic curve. However, the intersection frequently
                 degenerates to a collection of plane curves. Degenerate
                 cases are frequent in geometric/solid modeling because
                 degeneracies are often required by design. Their
                 detection is important because degenerate intersections
                 can be computed more easily and allow simpler treatment
                 of important problems. In this paper, we investigate
                 this problem for natural quadrics. Algorithms are
                 presented to detect and compute conic intersections and
                 linear intersections. These methods reveal the
                 relationship between the planes of the degenerate
                 intersections and the quadrics. Using the theory
                 developed in the paper, we present a new and simplified
                 proof of a necessary and sufficient condition for conic
                 intersection. Finally, we present a simple method for
                 determining the types of conic in a degenerate
                 intersection without actually computing the
                 intersection, and an enumeration of all possible conic
                 types. Since only elementary geometric routines such as
                 line intersection are used, all of the above algorithms
                 are intuitive and easily implementable.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD).",
}

@Article{Anonymous:1994:AI,
  author =       "Anonymous",
  title =        "Author Index",
  journal =      j-TOG,
  volume =       "13",
  number =       "4",
  pages =        "425--426",
  month =        oct,
  year =         "1994",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:49:28 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Foley:1995:SC,
  author =       "Jim Foley",
  title =        "Scope and Charter",
  journal =      j-TOG,
  volume =       "14",
  number =       "1",
  pages =        "1--2",
  month =        jan,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ware:1995:UVT,
  author =       "Colin Ware and William Knight",
  title =        "Using Visual Texture for Information Display",
  journal =      j-TOG,
  volume =       "14",
  number =       "1",
  pages =        "3--20",
  month =        jan,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/200974.html",
  abstract =     "Results from vision research are applied to the
                 synthesis of visual texture for the purposes of
                 information display. The literature surveyed suggests
                 that the human visual system processes spatial
                 information by means of parallel arrays of neurons that
                 can be modeled by Gabor functions. Based on the Gabor
                 model, it is argued that the fundamental dimensions of
                 texture for human perception are orientation, size
                 (1/frequency), and contrast. It is shown that there are
                 a number of trade-offs in the density with which
                 information can be displayed using texture. Two of
                 these are (1) a trade-off between the size of the
                 texture elements and the precision with which the
                 location can be specified, and (2) the precision with
                 which texture orientation can be specified and the
                 precision with which texture size can be specified. Two
                 algorithms for generating texture are included.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; human factors",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques. {\bf I.3.7}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism, Color, shading,
                 shadowing, and texture. {\bf I.4.3}: Computing
                 Methodologies, IMAGE PROCESSING, Enhancement,
                 Filtering.",
}

@Article{Karasick:1995:ISM,
  author =       "Michael Karasick and David Strip",
  title =        "Intersecting Solids on a Massively Parallel
                 Processor",
  journal =      j-TOG,
  volume =       "14",
  number =       "1",
  pages =        "21--57",
  month =        jan,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/200976.html",
  abstract =     "Solid modeling underlies many technologies that are
                 key to modern manufacturing. These range from CAD
                 systems to robot simulators, from finite-element
                 analysis to integrated circuit process modeling. The
                 accuracy, and hence the utility, of these models is
                 often constrained by the amount of computer time
                 required to perform the desired operations. In this
                 paper we present, in detail, an efficient algorithm for
                 parallel intersections of solids using the Connection
                 Machine, a massively parallel SIMD processor. We
                 describe the data structure for representing the solid
                 models and detail the intersection algorithm, giving
                 special attention to implementation issues. We provide
                 performance results, comparing the parallel algorithm
                 to a serial intersection algorithm.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Least squares approximation. {\bf
                 G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Spline and piecewise polynomial
                 approximation. {\bf I.3.5}: Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Splines.",
}

@Article{Glassner:1995:DR,
  author =       "A. S. Glassner and K. P. Fishkin and D. H. Marimont
                 and M. C. Stone",
  title =        "Device-Directed Rendering",
  journal =      j-TOG,
  volume =       "14",
  number =       "1",
  pages =        "58--76",
  month =        jan,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/200977.html",
  abstract =     "Rendering systems can produce images that include the
                 entire range of visible colors. Imaging hardware,
                 however, can reproduce only a subset of these colors:
                 the device gamut. An image can only be correctly
                 displayed if all of its colors lie inside of the gamut
                 of the target device. Current solutions to this problem
                 are either to correct the scene colors by hand, or to
                 apply gamut mapping techniques to the final image. We
                 propose a methodology called {\em device-directed
                 rendering} that performs scene color adjustments
                 automatically. Device-directed rendering applies
                 classic minimization techniques to a symbolic
                 representation of the image that describes the
                 relationship of the scene lights and surfaces to the
                 pixel colors. This representation can then be evaluated
                 to produce an image that is guaranteed to be in gamut.
                 Although our primary application has been correcting
                 out-of-gamut colors, this methodology can be generally
                 applied to the problem of adjusting a scene description
                 to accommodate constraints on the output image pixel
                 values.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Color, shading, shadowing, and texture. {\bf I.3.3}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation, Viewing algorithms. {\bf
                 I.3.6}: Computing Methodologies, COMPUTER GRAPHICS,
                 Methodology and Techniques, Device independence.",
}

@Article{Pattanaik:1995:AER,
  author =       "S. N. Pattanaik and S. P. Mudur",
  title =        "Adjoint Equations and Random Walks for Illumination
                 Computation",
  journal =      j-TOG,
  volume =       "14",
  number =       "1",
  pages =        "77--102",
  month =        jan,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/200985.html",
  abstract =     "In this paper we introduce the potential equation that
                 along with the rendering equation forms an adjoint
                 system of equations and provides a mathematical frame
                 work for all known approaches to illumination
                 computation based on geometric optics. The potential
                 equation is more natural for illumination computations
                 that simulate light propagation starting from the light
                 sources, such as progressive radiosity and particle
                 tracing. Using the mathematical handles provided by
                 this framework and the random-walk solution model, we
                 present a number of importance sampling schemes for
                 improving the computation of flux estimation. Of
                 particular significance is the use of approximately
                 computed potential for directing a majority of the
                 random walks through regions of importance in the
                 environment, thus reducing the variance in the
                 estimates of luminous flux in these regions. Finally,
                 results from a simple implementation are presented to
                 demonstrate the high-efficiency improvements made
                 possible by the use of these techniques.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; experimentation",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism. {\bf
                 I.3.3}: Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation.",
}

@Article{Bajaj:1995:MCA,
  author =       "Chanderjit L. Bajaj and Jindon Chen and Guoliang Xu",
  title =        "Modeling with Cubic {A}-Patches",
  journal =      j-TOG,
  volume =       "14",
  number =       "2",
  pages =        "103--133",
  month =        apr,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/221662.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; performance; theory",
  subject =      "{\bf I.4.7}: Computing Methodologies, IMAGE
                 PROCESSING, Feature Measurement, Size and shape. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD). {\bf G.1.1}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Interpolation formulas. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems. {\bf G.2.2}:
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory.",
}

@Article{Forsey:1995:SFH,
  author =       "David Forsey and Richard H. Bartels",
  title =        "Surface Fitting with Hierarchical Splines",
  journal =      j-TOG,
  volume =       "14",
  number =       "2",
  pages =        "134--161",
  month =        apr,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/221665.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "performance; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Spline and piecewise polynomial
                 interpolation. {\bf F.2.1}: Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Numerical Algorithms and Problems, Computations on
                 matrices.",
}

@Article{Peters:1995:SPM,
  author =       "J{\"o}rg Peters",
  title =        "Smoothing Polyhedra Made Easy",
  journal =      j-TOG,
  volume =       "14",
  number =       "2",
  pages =        "162--170",
  month =        apr,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/221670.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; performance",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Smoothing. {\bf G.1.1}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Interpolation, Spline
                 and piecewise polynomial interpolation.",
}

@Article{Sapidis:1995:DCP,
  author =       "Nickolas S. Sapidis and Paul J. Best",
  title =        "Direct Construction of Polynomial Surfaces from Dense
                 Range Images through Region Growing",
  journal =      j-TOG,
  volume =       "14",
  number =       "2",
  pages =        "171--200",
  month =        apr,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/221672.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; experimentation; performance; theory",
  subject =      "{\bf I.4.5}: Computing Methodologies, IMAGE
                 PROCESSING, Reconstruction. {\bf I.4.6}: Computing
                 Methodologies, IMAGE PROCESSING, Segmentation, Edge and
                 feature detection. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Curve, surface, solid,
                 and object representations. {\bf G.1.2}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Approximation. {\bf
                 G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Spline and piecewise polynomial
                 approximation.",
}

@Article{Foley:1995:E,
  author =       "Jim Foley",
  title =        "Editorial",
  journal =      j-TOG,
  volume =       "14",
  number =       "3",
  pages =        "201--201",
  month =        jul,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:33:38 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Christensen:1995:ESA,
  author =       "Jon Christensen and Joe Marks and Stuart Shieber",
  title =        "An Empirical Study of Algorithms for Point-Feature
                 Label Placement",
  journal =      j-TOG,
  volume =       "14",
  number =       "3",
  pages =        "203--232",
  month =        jul,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:33:38 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/212334.html",
  abstract =     "A major factor affecting the clarity of graphical
                 displays that include text labels is the degree to
                 which labels obscure display features (including other
                 labels) as a result of spatial overlap. Point-feature
                 label placement (PFLP) is the problem of placing text
                 labels adjacent to point features on a map or diagram
                 so as to maximize legibility. This problem occurs
                 frequently in the production of many types of
                 informational graphics, though it arises most often in
                 automated cartography. In this paper we present a
                 comprehensive treatment of the PFLP problem, viewed as
                 a type of combinatorial optimization problem.
                 Complexity analysis reveals that the basic PFLP problem
                 and most interesting variants of it are NP-hard. These
                 negative results help inform a survey of previously
                 reported algorithms for PFLP; not surprisingly, all
                 such algorithms either have exponential time complexity
                 or are incomplete. To solve the PFLP problem in
                 practice, then, we must rely on good heuristic methods.
                 We propose two new methods, one based on a discrete
                 form of gradient descent, the other on simulated
                 annealing, and report on a series of empirical tests
                 comparing these and the other known algorithms for the
                 problem. Based on this study, the first to be
                 conducted, we identify the best approaches as a
                 function of available computation time.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; experimentation",
  subject =      "{\bf I.2.1}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Applications and Expert Systems,
                 Cartography. {\bf H.5.2}: Information Systems,
                 INFORMATION INTERFACES AND PRESENTATION, User
                 Interfaces, Screen design. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Geometric algorithms,
                 languages, and systems. {\bf I.2.8}: Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Problem
                 Solving, Control Methods, and Search, Heuristic
                 methods.",
}

@Article{Neumann:1995:RHM,
  author =       "L{\'{a}}szl{\'{o}} Neumann and Attila Neumann",
  title =        "Radiosity and Hybrid Methods",
  journal =      j-TOG,
  volume =       "14",
  number =       "3",
  pages =        "233--265",
  month =        jul,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:33:38 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/212347.html",
  abstract =     "We examine various solutions to the global
                 illumination problem, based on an exact mathematical
                 analysis of the rendering equation. In addition to
                 introducing efficient radiosity algorithms, we present
                 a uniform approach to reformulate all of the basic
                 radiosity equations used so far. Using hybrid methods
                 we are able to analyze possible combinations of the
                 view-dependent ray-tracing method and of the
                 low-resolution radiosity-based method, and to offer new
                 algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Radiosity. {\bf I.3.3}: Computing Methodologies,
                 COMPUTER GRAPHICS, Picture/Image Generation, Display
                 algorithms. {\bf I.3.7}: Computing Methodologies,
                 COMPUTER GRAPHICS, Three-Dimensional Graphics and
                 Realism, Color, shading, shadowing, and texture. {\bf
                 I.3.7}: Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism, Raytracing.",
}

@Article{Paoluzzi:1995:GPP,
  author =       "Alberto Paoluzzi and Valerio Pascucci and Michele
                 Vicentino",
  title =        "Geometric Programming: {A} Programming Approach to
                 Geometric Design",
  journal =      j-TOG,
  volume =       "14",
  number =       "3",
  pages =        "266--306",
  month =        jul,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:33:38 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/212349.html",
  abstract =     "This article presents a functional programming
                 approach to geometric design with embedded polyhedral
                 complexes. Its main goals are to show the expressive
                 power of the language as well as its usefulness for
                 geometric design. The language, named PLASM (the
                 Programming LAnguage for Solid Modeling), introduces a
                 very high level approach to ``constructive'' or
                 ``generative'' modeling. Geometrical objects are
                 generated by evaluating some suitable language
                 expressions. Because generating expressions can be
                 easily combined, the language also extends the standard
                 variational geometry approach by supporting classes of
                 geometric objects with varying topology and shape. The
                 design language PLASM can be roughly considered as a
                 geometry-oriented extension of a subset of the
                 functional language FL. The language takes a
                 dimension-independent approach to geometry
                 representation and algorithms. In particular it
                 implements an algebraic calculus over embedded
                 polyhedra of any dimension. The generated objects are
                 always geometrically consistent because the validity of
                 geometry is guaranteed at a syntactical level. Such an
                 approach allows one to use a representation scheme
                 which is weaker than those usually adopted in solid
                 modelers, thus encompassing a broader geometric domain,
                 which contains solids, surfaces, and wire-frames, as
                 well as higher-dimensional objects.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design; languages; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Geometric algorithms, languages, and systems. {\bf
                 D.1.1}: Software, PROGRAMMING TECHNIQUES, Applicative
                 (Functional) Programming. {\bf D.3.2}: Software,
                 PROGRAMMING LANGUAGES, Language Classifications,
                 Applicative languages. {\bf D.3.2}: Software,
                 PROGRAMMING LANGUAGES, Language Classifications, Design
                 languages. {\bf I.3.5}: Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Curve, surface, solid, and object
                 representations. {\bf I.3.5}: Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Hierarchy and geometric transformations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Object
                 hierarchies. {\bf J.6}: Computer Applications,
                 COMPUTER-AIDED ENGINEERING, Computer-aided design
                 (CAD).",
}

@Article{VanGelder:1995:CTC,
  author =       "Allen {Van Gelder} and Jane Wilhelms",
  title =        "Corrigendum: ``{Topological Considerations in
                 Isosurface Generation}''",
  journal =      j-TOG,
  volume =       "14",
  number =       "3",
  pages =        "307--308",
  month =        jul,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Jan 13 12:33:38 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "See \cite{VanGelder:1994:TCI}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/215264.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; experimentation; performance; theory;
                 verification",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Boundary representations. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Curve, surface, solid,
                 and object representations. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Geometric algorithms,
                 languages, and systems.",
}

@Article{Glassner:1995:E,
  author =       "Andrew S. Glassner",
  title =        "Editorial",
  journal =      j-TOG,
  volume =       "14",
  number =       "4",
  pages =        "309--310",
  month =        oct,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Apr 05 05:31:00 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Auslander:1995:FEC,
  author =       "Joel Auslander and Alex Fukunaga and Hadi Partovi and
                 Jon Christensen and Lloyd Hsu and Peter Reiss and
                 Andrew Shuman and Joe Marks and J. Thomas Ngo",
  title =        "Further Experience with Controller-Based Automatic
                 Motion Synthesis for Articulated Figures",
  journal =      j-TOG,
  volume =       "14",
  number =       "4",
  pages =        "311--336",
  month =        oct,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Apr 05 05:31:00 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/225295.html",
  abstract =     "We extend an earlier automatic motion-synthesis
                 algorithm for physically realistic articulated figures
                 in several ways. First, we summarize several
                 incremental improvements to the original algorithm that
                 improve its efficiency significantly and provide the
                 user with some ability to influence what motions are
                 generated. These techniques can be used by an animator
                 to achieve a desired movement style, or they can be
                 used to guarantee variety in the motions synthesized
                 over several runs of the algorithm. Second, we report
                 on new mechanisms that support the concatenation of
                 existing, automatically generated motion controllers to
                 produce complex, composite movement. Finally, we
                 describe initial work on generalizing the techniques
                 from 2D to 3D articulated figures. Taken together,
                 these results illustrate the promise and challenges
                 afforded by the controller-based approach to automatic
                 motion synthesis for computer animation.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; experimentation",
  subject =      "{\bf I.2.6}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Learning, Parameter learning. {\bf
                 I.2.8}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Problem Solving, Control Methods, and
                 Search, Heuristic methods. {\bf I.3.7}: Computing
                 Methodologies, COMPUTER GRAPHICS, Three-Dimensional
                 Graphics and Realism, Animation. {\bf I.6.3}: Computing
                 Methodologies, SIMULATION AND MODELING, Applications.",
}

@Article{Redner:1995:SBI,
  author =       "Richard A. Redner and Mark E. Lee and Samuel P.
                 Uselton",
  title =        "Smooth {B}-Spline Illumination Maps for Bidirectional
                 Ray Tracing",
  journal =      j-TOG,
  volume =       "14",
  number =       "4",
  pages =        "337--362",
  month =        oct,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon May 26 09:17:43 1997",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "Corrections to Figures 4--9 are available on the
                 World-Wide Web at
                 \path=http://www.acm.org/tog/AandE.html=.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/225296.html",
  abstract =     "In this paper we introduce B-spline illumination maps
                 and their generalizations and extensions for use in
                 realistic image generation algorithms. The B-spline
                 lighting functions (i.e., illumination maps) are
                 defined as weighted probability density functions. The
                 lighting functions can be estimated from random data
                 and may be used in bidirectional distributed ray
                 tracing programs as well as radiosity oriented
                 algorithms. The use of these lighting functions in a
                 bidirectional ray tracing system that can handle
                 dispersion as well as the focusing of light through
                 lenses is presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; theory",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Visible line/surface algorithms.",
}

@Article{deFloriani:1995:HTM,
  author =       "Leila de Floriani and Enrico Puppo",
  title =        "Hierarchical Triangulation for Multiresolution Surface
                 Description",
  journal =      j-TOG,
  volume =       "14",
  number =       "4",
  pages =        "363--411",
  month =        oct,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Apr 05 05:31:00 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/225297.html",
  abstract =     "A new hierarchical triangle-based model for
                 representing surfaces over sampled data is proposed,
                 which is based on the subdivision of the surface domain
                 into nested triangulations, called a {\em hierarchical
                 triangulation (HT)}. The model allows compression of
                 spatial data and representation of a surface at
                 successively finer degrees of resolution. An HT is a
                 collection of triangulations organized in a tree, where
                 each node, except for the root, is a triangulation
                 refining a face belonging to its parent in the
                 hierarchy. We present a topological model for
                 representing an HT, and algorithms for its construction
                 and for the extraction of a triangulation at a given
                 degree of resolution. The surface model, called a {\em
                 hierarchical triangulated surface (HTS)} is obtained by
                 associating data values with the vertices of triangles,
                 and by defining suitable functions that describe the
                 surface over each triangular patch. We consider an
                 application of a piecewise-linear version of the HTS to
                 interpolate topographical data, and we describe a
                 specialized version of the construction algorithm that
                 builds an HTS for a terrain starting from a
                 high-resolution rectangular grid of sampled data.
                 Finally, we present an algorithm for extracting
                 representations of terrain at variable resolution over
                 the domain.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations.",
}

@Article{Anonymous:1995:AI,
  author =       "Anonymous",
  title =        "1995 Author Index",
  journal =      j-TOG,
  volume =       "14",
  number =       "4",
  pages =        "412--413",
  month =        oct,
  year =         "1995",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Apr 05 05:31:00 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Shirley:1996:MCT,
  author =       "Peter Shirley and Changyaw Wang and Kurt Zimmerman",
  title =        "{Monte Carlo} Techniques for Direct Lighting
                 Calculations",
  journal =      j-TOG,
  volume =       "15",
  number =       "1",
  pages =        "1--36",
  month =        jan,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 24 07:49:27 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/225887.html;
                 http://www.acm.org/pubs/toc/Abstracts/0730-0301/226151.html",
  abstract =     "In a distributed ray tracer, the sampling strategy is
                 the crucial part of the direct lighting calculation.
                 Monte Carlo integration with importance sampling is
                 used to carry out this calculation. Importance sampling
                 involves the design of integrand-specific probability
                 density functions that are used to generate sample
                 points for the numerical quadrature. Probability
                 density functions are presented that aid in the direct
                 lighting calculation from luminaires of various simple
                 shapes. A method for defining a probability density
                 function over a set of luminaires is presented that
                 allows the direct lighting calculation to be carried
                 out with a number of sample points that is independent
                 of the number of luminaires.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS. {\bf G.1.4}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Quadrature and Numerical
                 Differentiation. {\bf I.3.0}: Computing Methodologies,
                 COMPUTER GRAPHICS, General. {\bf I.4.1}: Computing
                 Methodologies, IMAGE PROCESSING, Digitization,
                 Sampling.",
}

@Article{Christensen:1996:GIG,
  author =       "Per H. Christensen and Eric J. Stollnitz and David H.
                 Salesin",
  title =        "Global Illumination of Glossy Environments Using
                 Wavelets and Importance",
  journal =      j-TOG,
  volume =       "15",
  number =       "1",
  pages =        "37--71",
  month =        jan,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 24 07:49:27 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/225888.html;
                 http://www.acm.org/pubs/toc/Abstracts/0730-0301/226153.html",
  abstract =     "We show how importance-driven refinement and a wavelet
                 basis can be combined to provide an efficient solution
                 to the global illumination problem with glossy and
                 diffuse reflections. Importance is used to focus the
                 computation on the interactions having the greatest
                 impact on the visible solution. Wavelets are used to
                 provide an efficient representation of radiance,
                 importance, and the transport operator. We discuss a
                 number of choices that must be made when constructing a
                 finite element algorithm for glossy global
                 illumination. Our algorithm is based on the standard
                 wavelet decomposition of the transport operator and
                 makes use of a four-dimensional wavelet representation
                 for spatially and angularly varying radiance
                 distributions. We use a final gathering step to improve
                 the visual quality of the solution. Features of our
                 implementation include support for curved surfaces as
                 well as texture-mapped anisotropic emission and
                 reflection functions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.9}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Integral Equations, Fredholm equations. {\bf
                 I.6.8}: Computing Methodologies, SIMULATION AND
                 MODELING, Types of Simulation, Combined. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 General.",
}

@Article{vanOverveld:1996:SSD,
  author =       "C. W. A. M. van Overveld and Marie Luce Viaud",
  title =        "Sticky Splines: Definition and Manipulation of Spline
                 Structures with Maintained Topological Relations",
  journal =      j-TOG,
  volume =       "15",
  number =       "1",
  pages =        "72--98",
  month =        jan,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 24 07:49:27 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/225889.html;
                 http://www.acm.org/pubs/toc/Abstracts/0730-0301/226154.html",
  abstract =     "This paper describes an augmentation to the spline
                 concept to account for topological relations between
                 different spline curves. These topological relations
                 include incidence relations, constraining the extremes
                 of spline curves to other spline curves, and also more
                 general geometric relations, for example, involving the
                 tangents of spline curves in their extremes. To
                 maintain these incidence relations, some spline curves
                 may have to be transformed (translated, rotated,
                 scaled), or even deformed (i.e., the shape of the curve
                 may change) as a result of modifying other spline
                 curves. A data structure and algorithms are given to
                 implement the propagation of these transformations and
                 deformations.\par

                 Based on the augmented spline concept, to be called
                 {\em sticky splines}, both a script system to represent
                 spline structures and an interactive system for editing
                 drawings while automatically, maintaining their
                 topological structure are presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; experimentation; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Splines. {\bf I.6.1}: Computing Methodologies,
                 SIMULATION AND MODELING, Simulation Theory, Systems
                 theory. {\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism.",
}

@Article{Ezquerra:1996:APD,
  author =       "Norberto Ezquerra and Rakesh Mullick",
  title =        "An Approach to {3D} Pose Determination",
  journal =      j-TOG,
  volume =       "15",
  number =       "2",
  pages =        "99--120",
  month =        apr,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat May 25 07:25:30 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ware:1996:ESM,
  author =       "Colin Ware and Glenn Franck",
  title =        "Evaluating Stereo and Motion Cues for Visualizing
                 Information Nets in Three Dimensions",
  journal =      j-TOG,
  volume =       "15",
  number =       "2",
  pages =        "121--140",
  month =        apr,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat May 25 07:25:30 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bar-Yehuda:1996:TST,
  author =       "Rueven Bar-Yehuda and Craig Gotsman",
  title =        "Time\slash Space Tradeoffs for Polygon Mesh
                 Rendering",
  journal =      j-TOG,
  volume =       "15",
  number =       "2",
  pages =        "141--152",
  month =        apr,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat May 25 07:25:30 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Luken:1996:CSD,
  author =       "William L. Luken and Fuhua (Frank) Cheng",
  title =        "Comparison of Surface and Derivative Evaluation
                 Methods for the Rendering of {NURB} Surfaces",
  journal =      j-TOG,
  volume =       "15",
  number =       "2",
  pages =        "153--178",
  month =        apr,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat May 25 07:25:30 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hubbard:1996:APS,
  author =       "Philip M. Hubbard",
  title =        "Approximating polyhedra with spheres for time-critical
                 collision detection",
  journal =      j-TOG,
  volume =       "15",
  number =       "3",
  pages =        "179--210",
  month =        jul,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon May 26 09:16:35 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  note =         "MPEG animations showing the algorithm's performance
                 are available on the World-Wide Web at
                 \path=http://www.acm.org/tog/hubbard96/index.html=.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/230518.html",
  abstract =     "This article presents a method for approximating
                 polyhedral objects to support a {\em time-critical}
                 collision-detection algorithm. The approximations are
                 hierarchies of spheres, and they allow the
                 time-critical algorithm to progressively refine the
                 accuracy of its detection, stopping as needed to
                 maintain the real-time performance essential for
                 interactive applications. The key to this approach is a
                 preprocess that automatically builds tightly fitting
                 hierarchies for rigid and articulated objects. The
                 preprocess uses {\em medial-axis surfaces}, which are
                 skeletal representations of objects. These skeletons
                 guide an optimization technique that gives the
                 hierarchies accuracy properties appropriate for
                 collision detection. In a sample application,
                 hierarchies build this way allow the time-critical
                 collision-detection algorithm to have acceptable
                 accuracy, improving significantly on that possible with
                 hierarchies built by previous techniques. The
                 performance of the time-critical algorithm in this
                 application is consistently 10 to 100 times better than
                 a previous collision-detection algorithm, maintaining
                 low latency and a nearly constant frame rate of 10
                 frames per second on a conventional graphics
                 workstation. The time-critical algorithm maintains its
                 real-time performance as objects become more
                 complicated, even as they exceed previously reported
                 complexity levels by a factor of more that 10.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; humanfactors; performance",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Object hierarchies. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Geometric algorithms,
                 languages, and systems. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Physically based
                 modeling. {\bf I.3.7}: Computing Methodologies,
                 COMPUTER GRAPHICS, Three-Dimensional Graphics and
                 Realism, Animation. {\bf I.3.7}: Computing
                 Methodologies, COMPUTER GRAPHICS, Three-Dimensional
                 Graphics and Realism, Virtual reality.",
}

@Article{Jeng:1996:MCP,
  author =       "Elvis Ko-Yung Jeng and Zhigang Xiang",
  title =        "Moving cursor plane for interactive sculpting",
  journal =      j-TOG,
  volume =       "15",
  number =       "3",
  pages =        "211--222",
  month =        jul,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 31 16:39:46 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/230523.html",
  abstract =     "Direct interactive manipulation of 3D objects is a
                 highly desirable but not yet fully realized feature
                 that can make the use of a modeling system more
                 intuitive and convenient. Two kinds of manipulation may
                 be identified: positioning and sculpting. {\em
                 Positioning} refers to the placement of objects in
                 relation to each other within a common scene. {\em
                 Sculpting} refers to the arbitrary deformation of
                 object shapes.\par

                 Ideally, we would like to be able to move objects
                 around easily as if they were held in our hands and to
                 reshape them freely as if they were made of clay.
                 However, realizing these goals of 3D editing on a
                 computer is very difficult, especially with an ordinary
                 display monitor. A fundamental problem is to provide
                 sufficient depth and shape cues for the user to
                 perceive the rendered objects and editing cursor in
                 such a way that positioning and sculpting operations
                 can be performed with reasonable flexibility and
                 accuracy.\par

                 Traditional CAD packages avoid true 3D editing by
                 restricting the controlled movement of the editing
                 cursor to two-dimensional. An arbitrary 3D location or
                 displacement has to be specified in consecutive steps
                 using separately projected views of the geometry. It is
                 conceivably more natural and productive to work in a
                 single display window. However, the challenge is to
                 include in the display meaningful and distinguishable
                 visual cues beyond such standard features as hidden
                 surface removal, surface lighting, and perspective
                 projection.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design; humanfactors",
  subject =      "{\bf I.3.6}: Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques, Interaction
                 techniques. {\bf D.2.2}: Software, SOFTWARE
                 ENGINEERING, Tools and Techniques, User interfaces.
                 {\bf H.5.2}: Information Systems, INFORMATION
                 INTERFACES AND PRESENTATION, User Interfaces,
                 Interaction styles. {\bf I.3.4}: Computing
                 Methodologies, COMPUTER GRAPHICS, Graphics Utilities,
                 Graphics editors.",
}

@Article{Fortune:1996:SAY,
  author =       "Steven Fortune and Christopher J. {Van Wyk}",
  title =        "Static analysis yields efficient exact integer
                 arithmetic for computational geometry",
  journal =      j-TOG,
  volume =       "15",
  number =       "3",
  pages =        "223--248",
  month =        jul,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 31 16:39:46 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/230533.html",
  abstract =     "Geometric algorithms as usually described assuming
                 that arithmetic operations are performed exactly on
                 real numbers. A program implemented using a naive
                 substitution of floating-point arithmetic for real
                 arithmetic can fail, since geometric primitives depend
                 upon sign-evaluation and may not be reliable if
                 evaluated approximately. Geometric primitives are
                 reliable if evaluated exactly with integer arithmetic,
                 but this degrades performance since software
                 extended-precision arithmetic is required.\par

                 We describe static-analysis techniques that reduce the
                 performance cost of exact integer arithmetic used to
                 implement geometric algorithms. We have used the
                 techniques for a number of examples, including
                 line-segment intersection in two dimensions, Delaunay
                 triangulations, and a tree-dimensional boundary-based
                 polyhedral modeler. In general, the techniques are
                 appropriate for algorithms that use primitives of
                 relatively low algebraic total degree, e.g., those
                 involving flat objects (points, lines, planes) in two
                 or three dimensions. The techniques have been package
                 in a preprocessor for reasonably convenient use.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; experimentation",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Geometric algorithms, languages, and systems. {\bf
                 D.3.4}: Software, PROGRAMMING LANGUAGES, Processors,
                 Preprocessors. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Efficiency. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Reliability and robustness.",
}

@Article{Elber:1996:AIR,
  author =       "Gershon Elber and Elaine Cohen",
  title =        "Adaptive isocurve-based rendering for freeform
                 surfaces",
  journal =      j-TOG,
  volume =       "15",
  number =       "3",
  pages =        "249--263",
  month =        jul,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Aug 31 16:39:46 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/230537.html",
  abstract =     "Freeform surface rendering is traditionally performed
                 by approximating the surface with polygons and then
                 rendering the polygons. This approach is extremely
                 common because of the complexity in accurately
                 rendering the surfaces directly. Recently several
                 papers presented methods that render surfaces as
                 sequences of isocurves. These methods each have
                 deficiencies in their ability to guarantee a complete
                 coverage of the rendered surface, in their ability to
                 prevent processing the same pixel multiple times, or in
                 their ability to produce an optimal surface coverage
                 under some prescribed norm. In this article, and
                 algorithm is introduced that alleviates the
                 difficulties in all these areas. This algorithm can be
                 combined with a fast curve-rendering method to make
                 surface rendering without polygonal approximation
                 practical.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Color, shading, shadowing, and texture. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Curve,
                 surface, solid, and object representations. {\bf
                 I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Splines.
                 {\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Hidden line/surface removal.",
}

@Article{Chang:1996:IST,
  author =       "Meng-Chou Chang and Feipei Lai and Wei-Chao Chen",
  title =        "Image shaping taking into account relativistic
                 effects",
  journal =      j-TOG,
  volume =       "15",
  number =       "4",
  pages =        "265--300",
  month =        oct,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Nov 11 16:14:40 MST 1996",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/234537.html",
  abstract =     "This article is concerned with creating more realistic
                 images of 3D scenes which are moving relative to the
                 viewer at such high speeds that the propagation delay
                 of light signals and other relativistic effects can not
                 be neglected. Creating images of 3D scenes in
                 relativistic motion might have important applications
                 to science-fiction films, computer games, and virtual
                 environments. We shall discuss the following problems:
                 (1) how to determine the visual appearance of a rapidly
                 moving object, (2) how to determine the apparent
                 radiance of a scene point on a moving object, (3) how
                 to determine the incident irradiance at a scene point
                 coming from a moving light source, (4) how to determine
                 the color of a rapidly moving object, and (5) how to
                 generate shadows when there are relative motions
                 between the viewer, the scenes, and the light sources.
                 Detailed examples are also given to show the result of
                 shading with the relativistic effects taken into
                 account.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; theory",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Color, shading, shadowing, and texture. {\bf J.2}:
                 Computer Applications, PHYSICAL SCIENCES AND
                 ENGINEERING, Physics.",
}

@Article{Davidson:1996:DGN,
  author =       "Ron Davidson and David Harel",
  title =        "Drawing graphs nicely using simulated annealing",
  journal =      j-TOG,
  volume =       "15",
  number =       "4",
  pages =        "301--331",
  month =        oct,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Nov 11 16:14:40 MST 1996",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/234538.html",
  abstract =     "The paradigm of simulated annealing is applied to the
                 problem of drawing graphs ``nicely.'' Our algorithm
                 deals with general undirected graphs with straight-line
                 edges, and employs several simple criteria for the
                 aesthetic quality of the result. The algorithm is
                 flexible, in that the relative weights of the criteria
                 can be changed. For graphs of modest size it produces
                 good results, competitive with those produced by other
                 methods, notably, the ``spring method'' and its
                 variants.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; theory",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Computations on discrete
                 structures. {\bf G.2.2}: Mathematics of Computing,
                 DISCRETE MATHEMATICS, Graph Theory. {\bf D.0}:
                 Software, GENERAL. {\bf E.0}: Data, GENERAL.",
}

@Article{Guenter:1996:QPH,
  author =       "Brian Guenter and Jack Tumblin",
  title =        "Quadrature prefiltering for high quality
                 antialiasing",
  journal =      j-TOG,
  volume =       "15",
  number =       "4",
  pages =        "332--353",
  month =        oct,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Nov 11 16:14:40 MST 1996",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/234540.html",
  abstract =     "This article introduces quadrature prefiltering, an
                 accurate, efficient, and fairly simple algorithm for
                 prefiltering polygons for scanline rendering. It
                 renders very high quality images at reasonable cost,
                 strongly suppressing aliasing artifacts. For equivalent
                 RMS error, quadrature prefiltering is significantly
                 faster than either uniform or jittered supersampling.
                 Quadrature prefiltering is simple to implement and
                 space-efficient; it needs only a small two-dimensional
                 lookup table, even when computing nonradially symmetric
                 filter kernels. Previous algorithms have required
                 either three-dimensional tables or a restriction to
                 radially symmetric filter kernels. Though only slightly
                 more complicated to implement than the widely used box
                 prefiltering method, quadrature prefiltering can
                 generate images with much less visible aliasing
                 artifacts.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; performance; reliability",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation.",
}

@Article{Dobkin:1996:CDA,
  author =       "David P. Dobkin and David Eppstein and Don P.
                 Mitchell",
  title =        "Computing the discrepancy with applications to
                 supersampling patterns",
  journal =      j-TOG,
  volume =       "15",
  number =       "4",
  pages =        "354--376",
  month =        oct,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Nov 11 16:14:40 MST 1996",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/234536.html",
  abstract =     "Patterns used for supersampling in graphics have been
                 analyzed from statistical and signal-processing
                 viewpoints. We present an analysis based on a type of
                 isotropic discrepancy---how good patterns are at
                 estimating the area in a region of defined type. We
                 present algorithms for computing discrepancy relative
                 to regions that are defined by rectangles, halfplanes,
                 and higher-dimensional figures. Experimental evidence
                 shows that popular supersampling patterns have
                 discrepancies with better asymptotic behavior than
                 random sampling, which is not inconsistent with
                 theoretical bounds on discrepancy.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; experimentation",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Geometrical problems and
                 computations. {\bf I.3.3}: Computing Methodologies,
                 COMPUTER GRAPHICS, Picture/Image Generation,
                 Antialiasing.",
}

@Article{Anonymous:1996:AI,
  author =       "Anonymous",
  title =        "1996 Author Index",
  journal =      j-TOG,
  volume =       "15",
  number =       "4",
  pages =        "377--378",
  month =        oct,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Nov 11 16:29:49 1996",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Glassner:1997:E,
  author =       "Andrew Glassner",
  title =        "Editorial",
  journal =      j-TOG,
  volume =       "16",
  number =       "1",
  pages =        "1--2",
  month =        jan,
  year =         "1997",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Feb 24 11:25:57 1997",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Christensen:1997:CGG,
  author =       "Per H. Christensen and Dani Lischinski and Eric J.
                 Stollnitz and David H. Salesin",
  title =        "Clustering for Glossy Global Illumination",
  journal =      j-TOG,
  volume =       "16",
  number =       "1",
  pages =        "3--33",
  month =        jan,
  year =         "1997",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Feb 24 11:25:57 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1997-16-1/p3-christensen/",
  abstract =     "We present a new clustering algorithm for global
                 illumination in complex environments. The new algorithm
                 extends previous work on clustering for radiosity to
                 allow for nondiffuse (glossy) reflectors. We represent
                 clusters as points with directional distributions of
                 outgoing and incoming radiance and importance, and we
                 derive an error bound for transfers between these
                 clusters. The algorithm groups input surfaces into a
                 hierarchy of clusters, and then permits clusters to
                 interact only if the error bound is below an acceptable
                 tolerance. We show that the algorithm is asymptotically
                 more efficient than previous clustering algorithms even
                 when restricted to ideally diffuse environments.
                 Finally, we demonstrate the performance of our method
                 on two complex glossy environments.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Color, shading, shadowing, and texture.",
}

@Article{Lounsbery:1997:MAS,
  author =       "Michael Lounsbery and Tony D. DeRose and Joe Warren",
  title =        "Multiresolution Analysis for Surfaces of Arbitrary
                 Topological Type",
  journal =      j-TOG,
  volume =       "16",
  number =       "1",
  pages =        "34--73",
  month =        jan,
  year =         "1997",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1997-16-1/p34-lounsbery/",
  abstract =     "Multiresolution analysis and wavelets provide useful
                 and efficient tools for representing functions at
                 multiple levels of detail. Wavelet representations have
                 been used in a broad range of applications, including
                 image compression, physical simulation, and numerical
                 analysis. In this article, we present a new class of
                 wavelets, based on subdivision surfaces, that radically
                 extends the class of representable functions. Whereas
                 previous two-dimensional methods were restricted to
                 functions defined on ${\bf R}^2$, the subdivision
                 wavelets developed here may be applied to functions
                 defined on compact surfaces of arbitrary topological
                 type. We envision many applications of this work,
                 including continuous level-of-detail control for
                 graphics rendering, compression of geometric models,
                 and acceleration of global illumination algorithms.
                 Level-of-detail control for spherical domains is
                 illustrated using two examples: shape approximation of
                 a polyhedral model, and color approximation of global
                 terrain data.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Spline and piecewise polynomial
                 approximation. {\bf J.6}: Computer Applications,
                 COMPUTER-AIDED ENGINEERING, Computer-aided design
                 (CAD).",
}

@Article{Krishnan:1997:ESI,
  author =       "Shankar Krishnan and Dinesh Manocha",
  title =        "An Efficient Surface Intersection Algorithm Based on
                 Lower-Dimensional Formulation",
  journal =      j-TOG,
  volume =       "16",
  number =       "1",
  pages =        "74--106",
  month =        jan,
  year =         "1997",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Feb 26 10:45:12 MST 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1997-16-1/p74-krishnan/",
  abstract =     "We present an efficient algorithm to compute the
                 intersection of algebraic and NURBS surfaces. Our
                 approach is based on combining the marching methods
                 with the algebraic formulation. In particular, we
                 propose and matrix computations. We present algorithms
                 to compute a start point on each component of the
                 intersection curve (both open and closed components),
                 detect the presence of singularities, and find all the
                 curve branches near the singularity. We also suggest
                 methods to compute the step size during tracing to
                 prevent component jumping. The algorithm runs an order
                 of magnitude faster than previously published robust
                 algorithms. The complexity of the algorithm is output
                 sensitive.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING.",
}

@Article{Hill:1997:CAQ,
  author =       "Bernhard Hill and Thomas Roger and Friedrich Wilhelm
                 Vorhagen",
  title =        "Comparative analysis of the quantization of color
                 spaces on the basis of the {CIELAB} color-difference
                 formula",
  journal =      j-TOG,
  volume =       "16",
  number =       "2",
  pages =        "109--154",
  month =        apr,
  year =         "1997",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Sep 26 10:17:27 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1997-16-2/p109-hill/",
  abstract =     "This article discusses the CIELAB color space within
                 the limits of optimal colors including the complete
                 volume of object colors. A graphical representation of
                 this color space is composed of planes of constant
                 lightness $L*$ with a net of lines parallel to the $a*$
                 and $b*$ axes. This uniform net is projected onto a
                 number of other color spaces (CIE XYZ, tristimulus RGB,
                 predistorted RGB, and YCC color space) to demonstrate
                 and study the structure of color differences in these
                 spaces on the basis of CIELAB color difference
                 formulas. Two formulas are considered: the CIE 1976
                 formula *** and the newer CiE 1994 formula ***. The
                 various color spaces considered are uniformly quantized
                 and the grid of quantized points is transformed into
                 CIELAB coordinates to study the distribution of color
                 differences due to basic quantization steps and to
                 specify the areas of the colors with the highest
                 sensitivity to color discrimination. From a threshold
                 value for the maximum color difference among
                 neighboring quantized points searched for in each color
                 space, concepts for the quantization of the color
                 spaces are derived. The results are compared to
                 quantization concepts based on average values of
                 quantization errors published in previous work. In
                 addition to color spaces bounded by the optimal colors,
                 the studies are also applied to device-dependent color
                 spaces limited by the range of a positive RGB cube or
                 by the gamut of colors of practical print processes
                 (thermal dye sublimation, chromalin, and match print).
                 For all the color spaces, estimation of the number of
                 distinguishable colors are given on the basis of a
                 threshold value for the color difference perception of
                 *** = 1 and *** = 1.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; experimentation; performance;
                 standardization; theory",
  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Color, shading, shadowing, and texture. {\bf I.4.1}:
                 Computing Methodologies, IMAGE PROCESSING,
                 Digitization, Quantization. {\bf G.1.2}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Approximation. {\bf
                 I.3.1}: Computing Methodologies, COMPUTER GRAPHICS,
                 Hardware architecture, Hardcopy devices. {\bf I.3.3}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation, Display algorithms.",
}

@Article{Liu:1997:OAE,
  author =       "Wayne Liu and Stephen Mann",
  title =        "An Optimal Algorithm for Expanding the Composition of
                 Polynomials",
  journal =      j-TOG,
  volume =       "16",
  number =       "2",
  pages =        "155--178",
  month =        apr,
  year =         "1997",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon May 26 09:24:06 MDT 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1997-16-2/p155-liu/",
  abstract =     "A runtime analysis is made of a previously published
                 algorithm for polynomial composition. The relationship
                 between this composition algorithm and
                 Sablonni{\`e}re's algorithm is explored. This
                 composition algorithm is then made optimal aby first
                 performing a change of basis.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; performance",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Numerical Algorithms and
                 Problems, Computations on polynomials. {\bf J.6}:
                 Computer Applications, COMPUTER-AIDED ENGINEERING,
                 Computer-aided design (CAD).",
}

@Article{Fudos:1997:GCA,
  author =       "Ioannis Fudos and Christoph M. Hoffmann",
  title =        "A Graph-constructive Approach to Solving Systems of
                 Geometric Constraints",
  journal =      j-TOG,
  volume =       "16",
  number =       "2",
  pages =        "179--216",
  month =        apr,
  year =         "1997",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon May 26 09:24:06 MDT 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1997-16-2/p179-fudos/",
  abstract =     "A graph-constructive approach to solving systems of
                 geometric constraints capable of efficiently handling
                 well-constrained, overconstrained, and underconstrained
                 configurations is presented. The geometric constraint
                 solver works in two phases: in the analysis phase the
                 constraint graph is analyzed and a sequence of
                 elementary construction steps is derived, and then in
                 the construction phase the sequence of construction
                 steps in actually carried out. The analysis phase of
                 the algorithm is described in detail, its correctness
                 is proved, and an efficient algorithm to realized it is
                 presented. The scope of the graph analysis is then
                 extended by utilizing semantic information in the form
                 of angle derivations, and by extending the repertoire
                 of the construction steps. Finally, the construction
                 phase is briefly discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; performance; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Geometric algorithms, languages, and systems. {\bf
                 G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS,
                 Graph Theory, Graph algorithms. {\bf I.1.0}: Computing
                 Methodologies, ALGEBRAIC MANIPULATION, General. {\bf
                 I.3.6}: Computing Methodologies, COMPUTER GRAPHICS,
                 Methodology and Techniques. {\bf J.6}: Computer
                 Applications, COMPUTER-AIDED ENGINEERING,
                 Computer-aided design (CAD).",
}

@Article{Walter:1997:GIU,
  author =       "Bruce Walter and Philip M. Hubbard and Peter Shirley
                 and Donald P. Greenberg",
  title =        "Global illumination using local linear density
                 estimation",
  journal =      j-TOG,
  volume =       "16",
  number =       "3",
  pages =        "217--259",
  month =        jul,
  year =         "1997",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Sep 24 17:29:18 MDT 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1997-16-3/p217-walter/",
  abstract =     "This article presents the density estimation framework
                 for generating view-independent global illumination
                 solutions. It works by probabilistically simulating the
                 light flow in an environment with light particles that
                 trace random walks originating at luminaires and then
                 using statistical density estimation techniques to
                 reconstruct the lighting on each surface. By splitting
                 the computation into separate transport and
                 reconstruction stages, we gain many advantages
                 including reduced memory usage, the ability to simulate
                 nondiffuse transport, and natural parallelism.
                 Solutions to several theoretical and practical
                 difficulties in implementing this framework are also
                 described. Light sources that vary spectrally and
                 directionally are integrated into a spectral particle
                 tracer using nonuniform rejection. A new local linear
                 density estimation technique eliminates boundary bias
                 and extends to arbitrary polygons. A mesh decimation
                 algorithm with perceptual calibration is introduced to
                 simplify the Gouraud shaded representation of the
                 solution for interactive display.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; measurement; performance; theory",
  subject =      "{\bf I.3.6} Computing Methodologies, COMPUTER
                 GRAPHICS, Methodology and Techniques. {\bf I.1.2}
                 Computing Methodologies, ALGEBRAIC MANIPULATION,
                 Algorithms, Analysis of algorithms. {\bf G.1.8}
                 Mathematics of Computing, NUMERICAL ANALYSIS, Partial
                 Differential Equations, Finite element methods",
}

@Article{Xiang:1997:CIQ,
  author =       "Zhigang Xiang",
  title =        "Color image quantization by minimizing the maximum
                 intercluster distance",
  journal =      j-TOG,
  volume =       "16",
  number =       "3",
  pages =        "260--276",
  month =        jul,
  year =         "1997",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Sep 24 17:29:18 MDT 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1997-16-3/p260-xiang/",
  abstract =     "One of the numerical criteria for color image
                 quantization is to minimize the maximum discrepancy
                 between original pixel colors and the corresponding
                 quantized colors. This is typically carried out by
                 first grouping color points into tight clusters and
                 then finding a representative for each cluster. In this
                 article we show that getting the smallest clusters
                 under a formal notion of minimizing the maximum
                 intercluster distance does not guarantee an optimal
                 solution for the quantization criterion. Nevertheless,
                 our use of an efficient clustering algorithm by Teofilo
                 F. Gonzalez, which is optimal with respect to the
                 approximation bound of the clustering problem, has
                 resulted in a fast and effective quantizer. This new
                 quantizer is highly competitive and excels when
                 quantization errors need to be well capped and when the
                 performance of other quantizers may be hindered by such
                 factors as low number of quantized colors or
                 unfavorable pixel population distribution. Both
                 computer-synthesized and photographic images are used
                 in experimental comparison with several existing
                 quantization methods.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design; experimentation; measurement; performance;
                 theory",
  subject =      "{\bf I.3.3} Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.4.1} Computing Methodologies, IMAGE PROCESSING,
                 Digitization, Quantization. {\bf I.3.7} Computing
                 Methodologies, COMPUTER GRAPHICS, Three-Dimensional
                 Graphics and Realism, Color, shading, shadowing, and
                 texture",
}

@Article{Park:1997:SII,
  author =       "F. C. Park and Bahram Ravani",
  title =        "Smooth invariant interpolation of rotations",
  journal =      j-TOG,
  volume =       "16",
  number =       "3",
  pages =        "277--295",
  month =        jul,
  year =         "1997",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Sep 24 17:29:18 MDT 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1997-16-3/p277-park/",
  abstract =     "We present an algorithm for generating a
                 twice-differentiable curve on the rotation group SO(3)
                 that interpolates a given ordered set of rotation
                 matrices at their specified knot times. In our approach
                 we regard SO(3) as a Lie group with a bi-invariant
                 Riemannian metric, and apply the coordinate-invariant
                 methods of Riemannian geometry. The resulting rotation
                 curve is easy to compute, invariant with respect to
                 fixed and moving reference frames, and also
                 approximately minimizes angular acceleration",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; measurement; performance; theory",
  subject =      "{\bf G.1.1} Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf I.3.7} Computing
                 Methodologies, COMPUTER GRAPHICS, Three-Dimensional
                 Graphics and Realism, Animation. {\bf I.3.5} Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Geometric algorithms,
                 languages, and systems",
}

@Article{Castillo:1997:SCF,
  author =       "Enrique Castillo and Andr{\'e}s Iglesias",
  title =        "Some characterizations of families of surfaces using
                 functional equations",
  journal =      j-TOG,
  volume =       "16",
  number =       "3",
  pages =        "296--318",
  month =        jul,
  year =         "1997",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Sep 24 17:29:18 MDT 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1997-16-3/p296-castillo/",
  abstract =     "In this article functional equations are used to
                 characterize some families of surfaces. First, the most
                 general surfaces in implicit form $f(x,y,z) = 0$, such
                 that any arbitrary intersection with the planes $z =
                 z0$, $y = y0$, and $x = x0$ are linear combinations of
                 sets of functions of the other two variables, are
                 characterized. It is shown that only linear
                 combinations of tensor products of univariate functions
                 are possible for $f(x,y,z)$. Second, we obtain the most
                 general families of surfaces in explicit form such that
                 their intersections with planes parallel to the planes
                 $y = 0$ and $x = 0$ belong to two, not necessarily
                 equal, parametric families of curves. Finally,
                 functional equations are used to analyze the uniqueness
                 of representation of Gordon-Coons surfaces. Some
                 practical examples are used to illustrate the
                 theoretical results.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design; measurement; performance; theory;
                 verification",
  subject =      "{\bf I.3.5} Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations",
}

@Article{Sanchez-Reyes:1997:SAP,
  author =       "J. S{\'a}nchez-Reyes",
  title =        "The symmetric analogue of the polynomial power basis",
  journal =      j-TOG,
  volume =       "16",
  number =       "3",
  pages =        "319--357",
  month =        jul,
  year =         "1997",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Sep 26 10:19:42 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1997-16-3/p319-sanchez-reyes/",
  abstract =     "A new polynomial basis over the unit interval $t \in
                 [0,1]$ is proposed. The work is motivated by the fact
                 that the monomial (power) form is not suitable in CAGD,
                 as it suffers from serious numerical problems, and the
                 monomial coefficients have no geometric meaning. The
                 new form is the symmetric analogue of the power form,
                 because it can be regarded as an ``Hermite two-point
                 expansion'' instead of a Taylor expansion. This form
                 enjoys good numerical properties and admits a
                 Horner-like evaluation algorithm that is almost as fast
                 as that of the power form. In addition, the symmetric
                 power coefficients convey a geometric meaning, and
                 therefore they can be used as shape handles. A
                 polynomial expressed in the symmetric power basis is
                 decomposed into linear, cubic quintic, and successive
                 components. In consequence, this basis is bbetter
                 suited to handle polynomials of different degrees than
                 the Bernstein basis, and those algorithms involving
                 degree operations have extremely simple formulations.
                 The minimum degree of a polynomial is immediately
                 obtained by inspecting its coefficients. Degree
                 reduction of a curve or surface reduces to dropping the
                 desired high degree terms",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; measurement; performance; theory",
  subject =      "{\bf G.1.0} Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Error analysis. {\bf G.1.1}
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation. {\bf I.3.5} Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Curve, surface, solid, and object
                 representations. {\bf J.6} Computer Applications,
                 COMPUTER-AIDED ENGINEERING. {\bf F.2.1} Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Numerical Algorithms and Problems,
                 Computations on matrices",
}

@Article{Yun:1997:LCC,
  author =       "Hee Cheol Yun and Brian K. Guenter and Russell M.
                 Mersereau",
  title =        "Lossless compression of computer generated animation
                 frames",
  journal =      j-TOG,
  volume =       "16",
  number =       "4",
  pages =        "359--396",
  month =        oct,
  year =         "1997",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Nov 26 06:52:24 MST 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1997-16-4/p359-yun/",
  abstract =     "This article presents a new lossless compression
                 algorithm for computer animation image sequences. The
                 algorithm uses transformation information available in
                 the animation script and floating point depth and
                 object number information at each pixel to perform
                 highly accurate motion prediction with vary low
                 computation. The geometric data (i.e., the depth and
                 object number) can either be computed during the
                 original rendering process and stored with the image or
                 computed on the fly during compression and
                 decompression. In the former case the stored geometric
                 data are very efficiently compressed using motion
                 prediction and a new technique called direction coding,
                 typically to 1 to 2 bits per pixel. The geometric data
                 are also useful in z-buffer image compositing and this
                 new compression algorithm offers a very low storage
                 overhead method for saving the information needed for
                 this compositing. The overall compression ratio of the
                 new algorithm, including the geometric data overhead,
                 in compared to conventional spatial linear prediction
                 compression and block-matching motion. The algorithm
                 improves on a previous motion prediction algorithm by
                 incorporating block predictor switching and color ratio
                 prediction. The combination of these techniques gives
                 compression ratios 30\% better than those reported
                 previously.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; measurement",
  subject =      "{\bf I.4.2} Computing Methodologies, IMAGE PROCESSING
                 AND COMPUTER VISION, Compression (Coding), Exact
                 coding**.",
}

@Article{Overveld:1997:PNI,
  author =       "C. W. A. M. {Van Overveld} and B. Wyvill",
  title =        "{Phong} normal interpolation revisited",
  journal =      j-TOG,
  volume =       "16",
  number =       "4",
  pages =        "397--419",
  month =        oct,
  year =         "1997",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Nov 26 06:52:24 MST 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1997-16-4/p397-van_overveld/",
  abstract =     "Phong shading is one of the best known, and at the
                 same time simplest techniques to arrive at realistic
                 images when rendering 3D geometric models. However,
                 despite (or maybe due to) its success and its
                 widespread use, some aspects remain to be clarified
                 with respect to its validity and robustness. This might
                 be caused by the fact that the Phong method is based on
                 geometric arguments, illumination models, and clever
                 heuristics. In this article we address some of the
                 fundamentals that underlie Phong shading, such as the
                 computation of vertex normals for nonmanifold models
                 and the adequacy of linear interpolation and we apply a
                 new interpolation technique to achieve an efficient and
                 qualitatively improve result.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.3.7} Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Color, shading, shadowing, and texture.",
}

@Article{Peters:1997:SSS,
  author =       "J{\"o}rg Peters and Ulrich Reif",
  title =        "The simplest subdivision scheme for smoothing
                 polyhedra",
  journal =      j-TOG,
  volume =       "16",
  number =       "4",
  pages =        "420--431",
  month =        oct,
  year =         "1997",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Nov 26 06:52:24 MST 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1997-16-4/p420-peters/",
  abstract =     "Given a polyhedron, construct a new polyhedron by
                 connecting every edge-midpoint to its four neighboring
                 edge-midpoints. This refinement rule yields a {\em
                 C\/}1 surface and the surface has a piecewise quadratic
                 parametrization except at a finite number of isolated
                 points. We analyze and improve the construction.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design",
  subject =      "{\bf I.3.3} Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.5} Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Curve,
                 surface, solid, and object representations. {\bf I.3.5}
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems.",
}

@Article{Bajaj:1998:RPN,
  author =       "Chandrajit L. Bajaj and Robert L. Holt and Arun N.
                 Netravali",
  title =        "Rational Parametrizations of Nonsingular Real Cubic
                 Surfaces",
  journal =      j-TOG,
  volume =       "17",
  number =       "1",
  pages =        "1--31",
  month =        jan,
  year =         "1998",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat May 16 07:25:59 MDT 1998",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1998-17-1/p1-bajaj/",
  abstract =     "Real cubic algebraic surfaces may be described by
                 either implicit or parametric equations. One
                 particularly useful representation is the rational
                 parametrization, where the three spatial coordinates
                 are given by rational functions of two parameters.
                 These parametrizations take on different forms for
                 different classes of cubic surfaces. Classification of
                 real cubic algebraic surfaces into five families for
                 the nonsingular case is based on the configuration of
                 27 lines on them. We provide a method of extracting all
                 these lines by constructing and solving a polynomial of
                 degree 27. Simple roots of this polynomial correspond
                 to real lines on the surface, and real skew lines are
                 used to form rational parametrizations for three of
                 these families. Complex conjugate skew lines are used
                 to parametrize surfaces from the fourth family. The
                 parametrizations for these four families involve
                 quotients of polynomials of degree no higher than four.
                 Each of these parametrizations covers the whole surface
                 except for a few points, lines, or conic sections. The
                 parametrization for the fifth family, as noted
                 previously in the literature, requires a square root.
                 We also analyze the image of the derived rational
                 parametrization for both real and complex parameter
                 values, together with ``base'' points where the
                 parametrizations are ill-defined.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.1.2} Computing Methodologies, SYMBOLIC AND
                 ALGEBRAIC MANIPULATION, Algorithms. {\bf F.2.1} Theory
                 of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Numerical Algorithms and Problems.",
  xxauthor =     "Chandrajit L. Bajaj and Robert J. Holt and Arun N.
                 Netravali",
}

@Article{Elber:1998:BSR,
  author =       "Gershon Elber and Myung-Soo Kim",
  title =        "The Bisector Surface of Rational Space Curves",
  journal =      j-TOG,
  volume =       "17",
  number =       "1",
  pages =        "32--49",
  month =        jan,
  year =         "1998",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat May 16 07:25:59 MDT 1998",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1998-17-1/p32-elber/",
  abstract =     "Given a point and a rational curve in the plane, their
                 bisector curve is rational [Farouki and Johnston
                 1994a]. However, in general, the bisector of two
                 rational curves in the plane is not rational [Farouki
                 and Johnstone 1994b]. Given a point and a rational {\em
                 space\/} curve, this art icle shows that the bisector
                 surface is a rational ruled surface. Moreover, given
                 two rational space curves, we show that the bisector
                 surface is rational (except for the degenerate case in
                 which the two curves are coplanar).",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design; theory",
  subject =      "{\bf I.3.5} Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling.",
}

@Article{Paglieroni:1998:DPP,
  author =       "David W. Paglieroni",
  title =        "The Directional Parameter Plane Transform of a Height
                 Field",
  journal =      j-TOG,
  volume =       "17",
  number =       "1",
  pages =        "50--70",
  month =        jan,
  year =         "1998",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat May 16 07:25:59 MDT 1998",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1998-17-1/p50-paglieroni/",
  abstract =     "The linear {\em Parameter Plane Transform (PPT)\/} of
                 a height field attributes an inverted cone of empty
                 space to each height field cell. In is known that
                 height field ray-tracing efficiency can be improved by
                 traversing rays in steps across inverted cones of empty
                 space. However, steps across inverted cones of empty
                 space along rays close to the base of a steep ridge
                 will be short, even if there are no obstructions along
                 the line of sight, because the cones will be narrow.
                 This weakness can be virtually eliminated by allowing
                 the opening angles of the inverted cones of empty space
                 to vary between sectors, i.e., by directionalizing the
                 linear PPT. An efficient algorithm for computing the
                 linear directional PPT of a height field is given and
                 its properties are investigated.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; theory",
  subject =      "{\bf I.3.7} Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Raytracing. {\bf I.3.3} Computing Methodologies,
                 COMPUTER GRAPHICS, Picture/Image Generation, Display
                 algorithms. {\bf I.3.3} Computing Methodologies,
                 COMPUTER GRAPHICS, Picture/Image Generation, Viewing
                 algorithms.",
}

@Article{Greiner:1998:ECA,
  author =       "G{\"u}nther Greiner and Kai Hormann",
  title =        "Efficient clipping of arbitrary polygons",
  journal =      j-TOG,
  volume =       "17",
  number =       "2",
  pages =        "71--83",
  month =        apr,
  year =         "1998",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat May 16 07:25:59 MDT 1998",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1998-17-2/p71-greiner/",
  abstract =     "Clipping 2D polygons is one of the basic routines in
                 computer graphics. In rendering complex 3D images it
                 has to be done several thousand times. Efficient
                 algorithms are therefore very important. We present
                 such an efficient algorithm for clipping arbitrary
                 2D-polygons. The algorithm can handle arbitrary closed
                 polygons, specifically where the clip and subject
                 polygons may self-intersect. The algorithm is simple
                 and faster that Vatti's (1992) algorithm, which was
                 designed for the general case as well. Simple
                 modifications allow determination of union and
                 set-theoretic differences of two arbitrary polygons.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.3.3} Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.5} Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling.",
}

@Article{Taubin:1998:GCT,
  author =       "Gabriel Taubin and Jarek Rossignac",
  title =        "Geometric compression through topological surgery",
  journal =      j-TOG,
  volume =       "17",
  number =       "2",
  pages =        "84--115",
  month =        apr,
  year =         "1998",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat May 16 07:25:59 MDT 1998",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1998-17-2/p84-taubin/",
  abstract =     "The abundance and importance of complex 3-D data bases
                 in major industry segments, the affordability of
                 interactive 3-D rendering for office and consumer use,
                 and the exploitation of the Internet to distribute and
                 share 3-D data have intensified the need for an
                 effective 3-D geometric compression technique that
                 would significantly reduce the time required to
                 transmit 3-D models over digital communication
                 channels, and the amount of memory or disk space
                 required to store the models. Because the prevalent
                 representation of 3-D models for graphics purposes is
                 polyhedral and because polyhedral models are in general
                 triangulated for rendering, this article introduces a
                 new compressed representation for complex triangulated
                 models and simple, yet efficient, compression and
                 decompression algorithms. In this scheme, vertex
                 positions are quantized within the desired accuracy, a
                 vertex spanning tree is used to predict the position of
                 each vertex from 2,3, or 4 of its ancestors in the
                 tree, and the correction vectors are entropy encoded.
                 Properties, such as normals, colors, and texture
                 coordinates, are compressed in a similar manner. The
                 connectivity is encoded with no loss of information to
                 an average of less than two bits per triangle. The
                 vertex spanning tree and a small set of jump edges are
                 used to split the model into a simple polygon. A
                 triangle spanning tree and a sequence of marching bits
                 are used to encode the triangulation of the polygon.
                 Our approach improves on Michael Deering's pioneering
                 results by exploiting the geometric coherence of
                 several ancestors in the vertex spanning tree,
                 preserving the connectivity with no loss of
                 information, avoiding vertex repetitions, and using
                 about three fewer bits for the connectivity. However,
                 since decompression requires random access to all
                 vertices, this method must be modified for hardware
                 rendering with limited onboard memory. Finally, we
                 demonstrate implementation results for a variety of
                 VRML models with up to two orders of magnitude
                 compression.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; standardization",
  subject =      "{\bf I.3.5} Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations.",
}

@Article{Cohen-Or:1998:TDD,
  author =       "Daniel Cohen-Or and Amira Solomovic and David Levin",
  title =        "Three-dimensional distance field metamorphosis",
  journal =      j-TOG,
  volume =       "17",
  number =       "2",
  pages =        "116--141",
  month =        apr,
  year =         "1998",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat May 16 07:25:59 MDT 1998",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1998-17-2/p116-cohen-or/",
  abstract =     "Given two or more objects of general topology,
                 intermediate objects are constructed by a distance
                 field metamorphosis. In the presented method the
                 interpolation of the distance field is guided by a warp
                 function controlled by a set of corresponding anchor
                 points. Some rules for defining a smooth
                 least-distorting warp function are given. To reduce the
                 distortion of the intermediate shapes, the warp
                 function is decomposed into a rigid rotational part and
                 an elastic part. The distance field interpolation
                 method is modified so that the interpolation is done in
                 correlation with the warp function. The method provides
                 the animator with a technique that can be used to
                 create a set of models forming a smooth transition
                 between pairs of a given sequence of keyframe models.
                 The advantage of the new approach is that it is capable
                 of morphing between objects having a different
                 topological genus where no correspondence between the
                 geometric primitives of the models needs to be
                 established. The desired correspondence is defined by
                 an animator in terms of a relatively small number of
                 anchor points",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.3.7} Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism,
                 Animation. {\bf I.3.5} Computing Methodologies,
                 COMPUTER GRAPHICS, Computational Geometry and Object
                 Modeling, Curve, surface, solid, and object
                 representations. {\bf I.3.6} Computing Methodologies,
                 COMPUTER GRAPHICS, Methodology and Techniques,
                 Interaction techniques.",
}

@Article{Gonzalez-Ochoa:1998:CMO,
  author =       "Carlos Gonzalez-Ochoa and Scott McCammon and J{\"o}rg
                 Peters",
  title =        "Computing moments of objects enclosed by piecewise
                 polynomial surfaces",
  journal =      j-TOG,
  volume =       "17",
  number =       "3",
  pages =        "143--157",
  month =        jul,
  year =         "1998",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 16 16:30:05 MDT 1998",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1998-17-3/p143-gonzalez-ochoa/",
  abstract =     "Combining a polynomial free-form surface
                 representation with Gauss' divergence theorem allows
                 efficient and exact calculation of the moments of the
                 enclosed objects. For example, for any cubic
                 representation, volume, center of mass, and the inertia
                 tensor can be computed in seconds even for complex
                 objects with several thousand patches while change due
                 to local modification of the surface geometry can be
                 computed in real-time as feedback for animation or
                 design. Speed and simplicity of the approach allow
                 solving the inverse problem of modeling to match
                 prescribed moments.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; design",
  subject =      "{\bf I.3.5} Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Curve, surface, solid, and object representations. {\bf
                 G.1.4} Mathematics of Computing, NUMERICAL ANALYSIS,
                 Quadrature and Numerical Differentiation,
                 Multidimensional (multiple) quadrature.",
}

@Article{Heidrich:1998:SPS,
  author =       "Wolfgang Heidrich and Philip Slusallek and Hans-Peter
                 Seidel",
  title =        "Sampling procedural shaders using affine arithmetic",
  journal =      j-TOG,
  volume =       "17",
  number =       "3",
  pages =        "158--176",
  month =        jul,
  year =         "1998",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 16 16:30:05 MDT 1998",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1998-17-3/p158-heidrich/",
  abstract =     "Procedural shaders have become popular tools for
                 describing surface reflectance functions and other
                 material properties. In comparison to fixed resolution
                 textures, they have the advantage of being
                 resolution-independent and storage-efficient.\par While
                 procedural shaders provide an interface for evaluating
                 the shader at a single point, it is not easily possible
                 to obtain an average value of the shader together with
                 accurate error bounds over a finite area. Yet the
                 ability to compute such error bounds is crucial for
                 several interesting applications, most notably
                 hierarchical area sampling for global illumination,
                 using the finite element approach, and for generation
                 of textures used in interactive computer graphics.\par
                 Using affine arithmetic for evaluating the shader over
                 a finite area yields a tight, conservative error
                 interval for the shader function. Compilers can
                 automatically generate code for utilizing affine
                 arithmetic from within shaders implemented in a
                 dedicated language such as the RenderMan shading
                 language.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "experimentation; performance; theory; verification",
  subject =      "{\bf I.4.7} Computing Methodologies, IMAGE PROCESSING
                 AND COMPUTER VISION, Feature Measurement, Texture. {\bf
                 G.1.0} Mathematics of Computing, NUMERICAL ANALYSIS,
                 General, Error analysis. {\bf G.1.0} Mathematics of
                 Computing, NUMERICAL ANALYSIS, General, Interval
                 arithmetic. {\bf G.1.4} Mathematics of Computing,
                 NUMERICAL ANALYSIS, Quadrature and Numerical
                 Differentiation, Automatic differentiation. {\bf I.3.7}
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism, Color, shading,
                 shadowing, and texture. {\bf I.4.1} Computing
                 Methodologies, IMAGE PROCESSING AND COMPUTER VISION,
                 Digitization and Image Capture, Sampling.",
}

@Article{Mirtich:1998:VFR,
  author =       "Brian Mirtich",
  title =        "{V-Clip}: fast and robust polyhedral collision
                 detection",
  journal =      j-TOG,
  volume =       "17",
  number =       "3",
  pages =        "177--208",
  month =        jul,
  year =         "1998",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 16 16:30:05 MDT 1998",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1998-17-3/p177-mirtich/",
  abstract =     "This article presents the Voronoi-clip, or V-Clip,
                 collision detection algorithm for polyhedral objects
                 specified by a boundary representation. V-Clip tracks
                 the closest pair of features between convex polyhedra,
                 using an approach reminiscent of the Lin-Canny closest
                 features algorithm. V-Clip is an improvement over the
                 latter in several respects. Coding complexity is
                 reduced, and robustness is significantly improved; the
                 implementation has no numerical tolerances and does not
                 exhibit cycling problems. The algorithm also handles
                 penetrating polyhedra, and can therefore be used to
                 detect collisions between nonconvex polyhedra described
                 as hierarchies of convex pieces. The article presents
                 the theoretical principles of V-Clip, and gives a
                 pseudocode description of the algorithm. It also
                 documents various test that compare V-Clip, Lin-Canny,
                 and the Enhanced GJK algorithm, a simplex-based
                 algorithm that is widely used for the same application.
                 The results show V-Clip to be a strong contender in
                 this field, comparing favorably with the other
                 algorithms in most of the tests, in term of both
                 performance and robustness.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.3.5} Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Geometric algorithms, languages, and systems. {\bf
                 I.3.5} Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Boundary
                 representations.",
}

@Article{Kobbelt:1998:MFV,
  author =       "Leif Kobbelt and Peter Schr{\"o}der",
  title =        "A multiresolution framework for variational
                 subdivision",
  journal =      j-TOG,
  volume =       "17",
  number =       "4",
  pages =        "209--237",
  month =        oct,
  year =         "1998",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 19 08:20:08 MST 1999",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1998-17-4/p209-kobbelt/",
  abstract =     "Subdivision is a powerful paradigm for the generation
                 of curves and surfaces. It is easy to implement,
                 computationally efficient, and useful in a variety of
                 applications because of its intimate connection with
                 multiresolution analysis. An important task in computer
                 graphics and geometric modeling is the construction of
                 curves that interpolate a given set of points and
                 minimize a fairness functional (variational design). In
                 the context of subdivision, fairing leads to special
                 schemes requiring the solution of a banded linear
                 system at every subdivision step. We present several
                 examples of such schemes including one that reproduces
                 nonuniform interpolating cubic splines. Expressing the
                 construction in terms of certain elementary operations
                 we are able to embed variational subdivision in the
                 lifting framework, a powerful technique to construct
                 wavelet filter banks given a subdivision scheme. This
                 allows us to extend the traditional lifting scheme for
                 FIR filters to a certain class of IIR filters.
                 Consequently, we how to build variationally optimal
                 curves {\em and\/} associated, stable wavelets in a
                 straightforward fashion. The algorithms to perform the
                 corresponding decomposition and reconstruction
                 transformations are easy to implement and efficient
                 enough for interactive applications.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design",
  subject =      "{\bf G.1.1} Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf G.1.2} Mathematics of
                 Computing, NUMERICAL ANALYSIS, Approximation, Spline
                 and piecewise polynomial approximation. {\bf G.1.2}
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Wavelets and fractals. {\bf I.3.3}
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation, Line and curve generation.
                 {\bf I.3.5} Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Splines.",
}

@Article{Naiman:1998:JEW,
  author =       "Avi C. Naiman",
  title =        "Jagged edges: when is filtering needed?",
  journal =      j-TOG,
  volume =       "17",
  number =       "4",
  pages =        "238--258",
  month =        oct,
  year =         "1998",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 19 08:20:08 MST 1999",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1998-17-4/p238-naiman/",
  abstract =     "Depiction of oblique edges by discrete pixels usually
                 results in visible stair steps, often called {\em
                 jaggies\/}. A variety of filtering approaches exists to
                 minimize this visual artifact, but none has been
                 applied selectively only to those edges that would
                 otherwise appear jagged. A recent series of experiments
                 has led to a model of the visibility of jagged edges.
                 Here, we demonstrate how these data can be used
                 efficiently to determine when filtering of edges is
                 needed to eliminate the jaggies and when it is
                 unnecessary. This work also provides a template for how
                 the results of psychophysical experiments can be
                 applied in computer graphics to address image-quality
                 questions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms",
  subject =      "{\bf I.4.3} Computing Methodologies, IMAGE PROCESSING
                 AND COMPUTER VISION, Enhancement, Filtering. {\bf
                 I.4.3} Computing Methodologies, IMAGE PROCESSING AND
                 COMPUTER VISION, Enhancement, Smoothing. {\bf I.3.0}
                 Computing Methodologies, COMPUTER GRAPHICS, General.
                 {\bf I.3.3} Computing Methodologies, COMPUTER GRAPHICS,
                 Picture/Image Generation.",
}

@Article{Raghothama:1998:BRD,
  author =       "Srinivas Raghothama and Vadim Shapiro",
  title =        "Boundary representation deformation in parametric
                 solid modeling",
  journal =      j-TOG,
  volume =       "17",
  number =       "4",
  pages =        "259--286",
  month =        oct,
  year =         "1998",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 19 08:20:08 MST 1999",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1998-17-4/p259-raghothama/",
  abstract =     "One of the major unsolved problems in parametric solid
                 modeling is a robust update (regeneration) of the
                 solid's boundary representation, given a specified
                 change in the solid's parameter values. The fundamental
                 difficulty lies in determining the mapping between
                 boundary representations for solids in the same
                 parametric family. Several heuristic approaches have
                 been proposed for dealing with this problem, but the
                 formal properties of such mappings are not well
                 understood. We propose a formal definition for boundary
                 representation. (BR-)deformation for solids in the same
                 parametric family, based on the assumption of
                 continuity: small changes in solid parameter values
                 should result in small changes in the solid's boundary
                 representation, which may include local collapses of
                 cells in the boundary representation. The necessary
                 conditions that must be satisfied by any BR-deforming
                 mappings between boundary representations are powerful
                 enough to identify invalid updates in many (but not
                 all) practical situations, and the algorithms to check
                 them are simple. Our formulation provides a formal
                 criterion for the recently proposed heuristic
                 approaches to ``persistent naming,'' and explains the
                 difficulties in devising sufficient tests for
                 BR-deformation encountered in practice. Finally our
                 methods are also applicable to more general cellular
                 models of pointsets and should be useful in developing
                 universal standards in parametric modeling.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; reliability; standardization; theory",
  subject =      "{\bf F.2.2} Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Geometrical problems and
                 computations. {\bf G.2.1} Mathematics of Computing,
                 DISCRETE MATHEMATICS, Combinatorics, Combinatorial
                 algorithms. {\bf H.5.2} Information Systems,
                 INFORMATION INTERFACES AND PRESENTATION, User
                 Interfaces, Interaction styles. {\bf I.1.2} Computing
                 Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION,
                 Algorithms, Algebraic algorithms. {\bf I.3.5} Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Boundary representations.
                 {\bf J.6} Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD).",
}

@Article{Dana:1999:RTR,
  author =       "Kristin J. Dana and Bram van Ginneken and Shree K.
                 Nayar and Jan J. Koenderink",
  title =        "Reflectance and texture of real-world surfaces",
  journal =      j-TOG,
  volume =       "18",
  number =       "1",
  pages =        "1--34",
  month =        jan,
  year =         "1999",
  bibdate =      "Fri Jun 4 06:15:34 MDT 1999",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1999-18-1/p1-dana/",
  abstract =     "In this work, we investigate the visual appearance of
                 real-world surfaces and the dependence of appearance on
                 the geometry of imaging conditions. We discuss a new
                 texture representation called the BTF (bidirectional
                 texture function) which captures the variation in
                 texture with illumination and viewing direction. We
                 present a BTF database with image textures from over 60
                 different samples, each observed with over 200
                 different combinations of viewing and illumination
                 directions. We describe the methods involved in
                 collecting the database as well as the importance and
                 uniqueness of this database for computer graphics. A
                 related quantity to the BTF is the familiar BRDF
                 (bidirectional reflectance distribution function). The
                 measurement methods involved in the BTF database are
                 conducive to simultaneous measurement of the BRDF.
                 Accordingly, we also present a BRDF database with
                 reflectance measurements for over 60 different samples,
                 each observed with over 200 different combinations of
                 viewing and illumination directions. Both of these
                 unique databases are publicly available and have
                 important implications for computer graphics.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "experimentation; measurement",
  subject =      "{\bf I.2.10} Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Vision and Scene Understanding,
                 Intensity, color, photometry, and thresholding. {\bf
                 I.2.10} Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Vision and Scene Understanding, Texture.
                 {\bf I.3.5} Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Physically
                 based modeling. {\bf I.4.1} Computing Methodologies,
                 IMAGE PROCESSING AND COMPUTER VISION, Digitization and
                 Image Capture, Imaging geometry. {\bf I.4.1} Computing
                 Methodologies, IMAGE PROCESSING AND COMPUTER VISION,
                 Digitization and Image Capture, Radiometry. {\bf I.4.7}
                 Computing Methodologies, IMAGE PROCESSING AND COMPUTER
                 VISION, Feature Measurement, Texture. {\bf I.4.8}
                 Computing Methodologies, IMAGE PROCESSING AND COMPUTER
                 VISION, Scene Analysis, Photometry.",
}

@Article{Joan-Arinyo:1999:CCE,
  author =       "R. Joan-Arinyo and A. Soto-Riera",
  title =        "Combining constructive and equational geometric
                 constraint-solving techniques",
  journal =      j-TOG,
  volume =       "18",
  number =       "1",
  pages =        "35--55",
  month =        jan,
  year =         "1999",
  bibdate =      "Fri Jun 4 06:15:34 MDT 1999",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1999-18-1/p35-joan-arinyo/",
  abstract =     "In the past few years, there has been a strong trend
                 towards developing parametric, computer-aided design
                 systems based on geometric constraint solving. An
                 effective way to capture the design intent in these
                 systems is to define relationships between geometric
                 and technological variables. In general, geometric
                 constraint solving including functional relationships
                 requires a general approach and appropriate techniques
                 to achieve the expected functional capabilities. This
                 work reports on a hybrid method that combines two
                 geometric constraint solving techniques: constructive
                 and equational. The hybrid solver has the capability of
                 managing functional relationships between dimension
                 variables and variables representing conditions
                 external to the geometric problem. The hybrid solver is
                 described as a rewriting system and is shown to be
                 correct.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "design",
  subject =      "{\bf F.2.2} Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Geometrical problems and
                 computations. {\bf I.2.3} Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving.
                 {\bf I.3.5} Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling. {\bf J.6}
                 Computer Applications, COMPUTER-AIDED ENGINEERING.",
}

@Article{Tumblin:1999:TMD,
  author =       "Jack Tumblin and Jessica K. Hodgins and Brian K.
                 Guenter",
  title =        "Two methods for display of high contrast images",
  journal =      j-TOG,
  volume =       "18",
  number =       "1",
  pages =        "56--94",
  month =        jan,
  year =         "1999",
  bibdate =      "Fri Jun 4 06:15:34 MDT 1999",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1999-18-1/p56-tumblin/",
  abstract =     "High contrast images are common in night scenes and
                 other scenes that include dark shadows and bright light
                 sources. These scenes are difficult to display because
                 their contrasts greatly exceed the range of most
                 display devices for images. As a result, the image
                 contrasts are compressed or truncated, obscuring subtle
                 textures and details. Humans view and understand high
                 contrast scenes easily, ``adapting'' their visual
                 response to avoid compression or truncation with no
                 apparent loss of detail. By imitating some of these
                 visual adaptation processes, we developed methods for
                 the improved display of high-contrast images. The first
                 builds a display image from several layers of lighting
                 and surface properties. Only the lighting layers are
                 compressed, drastically reducing contrast while
                 preserving much of the image detail. This method is
                 practical only for synthetic images where the layers
                 can be retained from the rendering process. The second
                 method interactively adjusts the displayed image to
                 preserve local contrasts in a small ``foveal''
                 neighborhood. Unlike the first method, this technique
                 is usable on any image and includes a new tone
                 reproduction operator. Both methods use a sigmoid
                 function for contrast compression. This function has no
                 effect when applied to small signals but compresses
                 large signals to fit within an asymptotic limit. We
                 demonstrate the effectiveness of these approaches by
                 comparing processed and unprocessed images.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "algorithms; human factors; measurement",
  subject =      "{\bf I.3.3} Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation, Display algorithms.
                 {\bf I.3.7} Computing Methodologies, COMPUTER GRAPHICS,
                 Three-Dimensional Graphics and Realism, Color, shading,
                 shadowing, and texture. {\bf I.4.0} Computing
                 Methodologies, IMAGE PROCESSING AND COMPUTER VISION,
                 General, Image displays. {\bf I.4.1} Computing
                 Methodologies, IMAGE PROCESSING AND COMPUTER VISION,
                 Digitization and Image Capture, Quantization. {\bf
                 I.4.3} Computing Methodologies, IMAGE PROCESSING AND
                 COMPUTER VISION, Enhancement, Grayscale manipulation.",
}

@Article{Douglas:1999:MRE,
  author =       "Sarah A. Douglas and Arthur E. Kirkpatrick",
  title =        "Model and Representation: the effect of visual
                 feedback on human performance in a color picker
                 interface",
  journal =      j-TOG,
  volume =       "18",
  number =       "2",
  pages =        "96--127",
  month =        apr,
  year =         "1999",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 5 06:31:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1999-18-2/p96-douglas/",
  abstract =     "User interfaces for color selection consist of a
                 visible screen representation, an input method, and the
                 underlying conceptual organization of the color model.
                 We report a two-way factorial, between-subjects
                 variable experiment that tested the effect of high and
                 low visual feedback interfaces on speed and accuracy of
                 color matching for RGB and HSV color models. The only
                 significant effect was improved accuracy due to
                 increased visual feedback. Using color groups as a
                 within-subjects variable, we found differences in
                 performance of both speed and accuracy. We recommend
                 that experimental tests adopt a color test set that
                 does not show bias toward a particular model, but is
                 based instead on a range of colors that would be most
                 likely matched in practice by people using color
                 selection software. We recommend the Macbeth Color
                 Checker naturals, primaries, and grays. As a follow-up
                 study, a qualitative case analysis of the way users
                 navigated through the color space indicates that
                 feedback helps users with limited knowledge of the
                 model, allowing them to refine their match to a higher
                 degree of accuracy. Users with very little or a lot of
                 knowledge of the color model do not appear to be aided
                 by increased feedback. In conclusion, we suggest that
                 visual feedback and design of the interface may be a
                 more important factor in improving the usability of a
                 color selection interface than the particular color
                 model used.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "color model; color selection; feedback; HSV; mental
                 model; RGB; user interface",
  subject =      "Information Systems -Information Interfaces and
                 Presentation --- User Interfaces (H.5.2): Graphical
                 user interfaces (GUI); Information Systems -Information
                 Interfaces and Presentation --- User Interfaces
                 (H.5.2): Interaction styles; Computing Methodologies
                 -Computer Graphics --- Methodology and Techniques
                 (I.3.6): Ergonomics; Computing Methodologies -Computer
                 Graphics --- Methodology and Techniques (I.3.6):
                 Interaction techniques; General Terms: Experimentation,
                 Human Factors, Measurement",
}

@Article{Durand:1999:FAH,
  author =       "Fr{\'e}do Durand and George Drettakis and Claude
                 Puech",
  title =        "Fast and accurate hierarchical radiosity using global
                 visibility",
  journal =      j-TOG,
  volume =       "18",
  number =       "2",
  pages =        "128--170",
  month =        apr,
  year =         "1999",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 5 06:31:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1999-18-2/p128-durand/",
  abstract =     "Recent hierarchical global illumination algorithms
                 permit the generation of images with a high degree of
                 realism. Nonetheless, appropriate refinement of light
                 transfers, high quality meshing, and accurate
                 visibility calculation can be challenging tasks. This
                 is particularly true for scenes containing multiple
                 light sources and scenes lit mainly by indirect light.
                 We present solutions to these problems by extending a
                 global visibility data structure, the Visibility
                 Skeleton. This extension allows us to calculate exact
                 point-to-polygon form-factors at vertices created by
                 subdivision. The structures also provides visibility
                 information for all light interactions, allowing
                 intelligent refinement strategies. High-quality meshing
                 is effected based on a perceptually based ranking
                 strategy which results in appropriate insertions of
                 discontinuity curves into the meshes representing
                 illumination. We introduce a hierarchy of
                 triangulations that allows the generation of a
                 hierarchical radiosity solution using accurate
                 visibility and meshing. Results of our implementation
                 show that our new algorithm produces high quality
                 view-independent lighting solutions for direct
                 illumination, for scenes with multiple lights and also
                 scenes lit mainly by indirect illumination.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "discontinuity meshing; form factor calculation; global
                 illumination; global visibility; hierarchical
                 radiosity; hierarchical triangulation; perception",
  subject =      "Computing Methodologies -Computer Graphics ---
                 Three-Dimensional Graphics and Realism (I.3.7); General
                 Terms: Algorithms",
}

@Article{McCool:1999:ADM,
  author =       "Michael D. McCool",
  title =        "Anisotropic diffusion for {Monte Carlo} noise
                 reduction",
  journal =      j-TOG,
  volume =       "18",
  number =       "2",
  pages =        "171--194",
  month =        apr,
  year =         "1999",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 5 06:31:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1999-18-2/p171-mccool/",
  abstract =     "Monte Carlo sampling can be used to estimate solutions
                 to global light transport and other rendering problems.
                 However, a large number of observations may be needed
                 to reduce the variance to acceptable levels. Rather
                 than computing more observations within each pixel, if
                 spatial coherence exists in image space it can be used
                 to reduce visual error by averaging estimators in
                 adjacent pixels. Anisotropic diffusion is a
                 space-variant noise reduction technique that can
                 selectively preserve texture, edges, and other details
                 using a map of image coherence. The coherence map can
                 be estimated from depth and normal information as well
                 as interpixel color distance. Incremental estimation of
                 the reduction in variance, in conjunction with
                 statistical normalization of interpixel color
                 distances, yields an energy-preserving algorithm that
                 converges to a spatially nonconstant steady state.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "anisotropic diffusion; global illumination; image
                 processing; image synthesis; light transport; Monte
                 Carlo methods; noise reduction; space-variant
                 filtering",
  subject =      "Computing Methodologies -Image Processing And Computer
                 Vision --- Enhancement (I.4.3); General Terms:
                 Algorithms, Design",
}

@Article{Ugail:1999:TID,
  author =       "Hassan Ugail and Malcolm I. G. Bloor and Michael J.
                 Wilson",
  title =        "Techniques for interactive design using the {PDE}
                 method",
  journal =      j-TOG,
  volume =       "18",
  number =       "2",
  pages =        "195--212",
  month =        apr,
  year =         "1999",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 5 06:31:37 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/tog/1999-18-2/p195-ugail/",
  abstract =     "Interactive design of practical surfaces using the
                 partial differential equation (PDE) method is
                 considered. The PDE method treats surface design as a
                 boundary value problem (ensuring that surfaces can be
                 defined using a small set of design parameters). Owing
                 to the elliptic nature of the PDE operator, the
                 boundary conditions imposed around the edges of the
                 surface control the internal shape of the surface.
                 Moreover, surfaces obtained in this manner tend to be
                 smooth and fair. The PDE chosen has a closed form
                 solution allowing the interactive manipulation of the
                 surfaces in real time. Thus we present efficient
                 techniques by which we show how surfaces of practical
                 significance can be constructed interactively in real
                 time.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "CAD; interactive design; partial differential
                 equations; PDE method",
  subject =      "Computing Methodologies -Computer Graphics ---
                 Computational Geometry and Object Modeling (I.3.5):
                 Curve, surface, solid, and object representations;
                 Information Systems -Information Systems Applications
                 --- General (H.4.0); Information Systems -Information
                 Storage and Retrieval --- Information Storage (H.3.2);
                 Mathematics of Computing -Numerical Analysis ---
                 Partial Differential Equations (G.1.8); General Terms:
                 Design, Theory",
}

@Article{Bala:1999:RIA,
  author =       "Kavita Bala and Julie Dorsey and Seth Teller",
  title =        "Radiance interpolants for accelerated bounded-error
                 ray tracing",
  journal =      j-TOG,
  volume =       "18",
  number =       "3",
  pages =        "213--256",
  month =        jul,
  year =         "1999",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Sep 18 10:53:48 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1999-18-3/p213-bala/",
  abstract =     "Ray tracers, which sample radiance, are usually
                 regarded as offline rendering algorithms that are too
                 slow for interactive use. In this article we present a
                 system that exploits object-space, ray-space,
                 image-space, and temporal coherence to accelerate ray
                 tracing. Our system uses {\em per-surface
                 interpolants\/} to approximate radiance both
                 interactive and batch ray tracers.\par

                 Our approach explicitly decouples the two primary
                 operations of a ray tracer --- shading and visibility
                 determination --- and accelerates each of them
                 independently. Shading is accelerated by
                 quadrilinearily interpolating lazily acquired radiance
                 samples. Interpolation error does not exceed a
                 user-specified bound, allowing the user to control
                 performance/quality tradeoffs. Error is bounded by
                 adaptive sampling at discontinuities and radiance
                 nonlinearities.\par

                 Visibility determination at pixels is accelerated by
                 {\em reprojecting\/} interpolants as the user's
                 viewpoint changes. A fast scan-line algorithm then
                 achieves high performance without sacrificing image
                 quality. For a smoothly varying viewpoint, the
                 combination of lazy interpolants and projection
                 substantially accelerates the ray tracer. Additionally,
                 an efficient cache management algorithm keeps the
                 memory footprint of the system small with negligible
                 overhead.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "4D interpolation; approximation; data structures;
                 error bounds; interactive; interval arithmetic;
                 radiance; rendering; rendering systems; visibility",
  subject =      "Computing Methodologies --- Computer Graphics ---
                 Picture/Image Generation (I.3.3); Computing
                 Methodologies --- Computer Graphics ---
                 Three-Dimensional Graphics and Realism (I.3.7);
                 Computing Methodologies --- Computer Graphics ---
                 Three-Dimensional Graphics and Realism (I.3.7): Color,
                 shading, shadowing, and texture Mathematics of
                 Computing --- Numerical Analysis --- Approximation
                 (G.1.2); Mathematics of Computing --- Numerical
                 Analysis --- Approximation (G.1.2): Linear
                 approximation",
}

@Article{Suri:1999:ABB,
  author =       "Subhash Suri and Philip M. Hubbard and John F.
                 Hughes",
  title =        "Analyzing bounding boxes for object intersection",
  journal =      j-TOG,
  volume =       "18",
  number =       "3",
  pages =        "257--277",
  month =        jul,
  year =         "1999",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Sep 18 10:53:48 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1999-18-3/p257-suri/",
  abstract =     "Heuristics that exploit bounding boxes are common in
                 algorithms for rendering, modeling, and animation.
                 While experience has shown that bounding boxes improve
                 the performance of these algorithms in practice, the
                 previous theoretical analysis has concluded that
                 bounding boxes perform poorly in the worst case. This
                 paper reconciles this discrepancy by analyzing
                 intersections among $n$ geometric objects in terms of
                 two parameters: $\alpha$, an upper bound on the {\em
                 aspect ratio\/} or elongatedness of each object; and
                 $\sigma$, an upper bound on the {\em scale factor\/} or
                 size disparity between the largest and smallest
                 objects. Letting $K_o$ and $K_b$ be the number of
                 intersecting object pairs and bounding box pairs,
                 respectively, we analyze a ratio measure of the
                 bounding boxes' efficiency, $\rho = K_b/(n+K_o)$. The
                 analysis proves that $\rho = O(\alpha
                 \sqrt{\sigma}\log^2\sigma)$ and
                 $\rho=\Omega(\alpha\sqrt(\sigma))$.\par

                 One important consequence is that if and are small
                 constants (as is often the case in practice), then $K_b
                 = O(K_o) + O(n)$, so an algorithm that uses bounding
                 boxes has time complexity proportional to the number of
                 actual object intersections. This theoretical result
                 validates the efficiency that bounding boxes have
                 demonstrated in practice. Another consequence of our
                 analysis is a proof of the output-sensitivity of an
                 algorithm for reporting all intersecting pairs in a set
                 of $n$ convex polyhedra with constant $\alpha$ and
                 $\sigma$. The algorithm takes time $O(n log^(d-1)n +
                 K_o log^(d-1)n)$ for dimension $d = 2, 3$. This running
                 time improves on the performance of previous
                 algorithms, which make no assumptions about $\alpha$
                 and $\sigma$.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "aspect ratio; bounding boxes; collision detection",
  subject =      "Theory of Computation --- Analysis of Algorithms and
                 Problem Complexity --- Nonnumerical Algorithms and
                 Problems (F.2.2); Theory of Computation --- Analysis of
                 Algorithms and Problem Complexity --- Nonnumerical
                 Algorithms and Problems (F.2.2): Geometrical problems
                 and computations; Computing Methodologies --- Symbolic
                 and Algebraic Manipulation --- Algorithms (I.1.2);
                 Computing Methodologies --- Symbolic and Algebraic
                 Manipulation --- Algorithms (I.1.2): Analysis of
                 algorithms; Computing Methodologies --- Computer
                 Graphics --- General (I.3.0); Computing Methodologies
                 --- Computer Graphics --- Computational Geometry and
                 Object Modeling (I.3.5); Computing Methodologies ---
                 Computer Graphics --- Three-Dimensional Graphics and
                 Realism (I.3.7);",
}

@Article{Weiskopf:1999:SDE,
  author =       "Daniel Weiskopf and Ute Kraus and Hanns Ruder",
  title =        "Searchlight and {Doppler} effects in the visualization
                 of special relativity: a corrected derivation of the
                 transformation of radiance",
  journal =      j-TOG,
  volume =       "18",
  number =       "3",
  pages =        "278--292",
  month =        jul,
  year =         "1999",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Sep 18 10:53:48 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1999-18-3/p278-weiskopf/",
  abstract =     "We demonstrate that a photo-realistic image of a
                 rapidly moving object is dominated by the searchlight
                 and Doppler effects. Using a photon-counting technique,
                 we derive expressions for the relativistic
                 transformation of radiance. We show how to incorporate
                 the Doppler and searchlight effects in the two common
                 techniques of special relativistic visualization,
                 namely ray tracing and polygon rendering. Most authors
                 consider geometrical appearance only and neglect
                 relativistic effects on the lighting model. Chang et
                 al. [1996] present an incorrect derivation of the
                 searchlight effect, which we compare to our results.
                 Some examples are given to show the results of image
                 synthesis with relativistic effects taken into
                 account.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "aberration of light; Doppler effect; illumination;
                 Lorentz transformation; searchlight effect; special
                 relativity",
  subject =      "Computing Methodologies --- Computer Graphics ---
                 Three-Dimensional Graphics and Realism (I.3.7);
                 Computing Methodologies --- Computer Graphics ---
                 Three-Dimensional Graphics and Realism (I.3.7): Color,
                 shading, shadowing, and texture; Computer Applications
                 --- Physical Sciences and Engineering (J.2); Computer
                 Applications --- Physical Sciences and Engineering
                 (J.2): Physics;",
}

@Article{Aguado:1999:MGC,
  author =       "Alberto S. Aguado and Eugenia Montiel and Ed Zaluska",
  title =        "Modeling generalized cylinders via {Fourier}
                 morphing",
  journal =      j-TOG,
  volume =       "18",
  number =       "4",
  pages =        "293--315",
  month =        oct,
  year =         "1999",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Sep 18 10:53:48 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1999-18-4/p293-aguado/",
  abstract =     "Generalized cylinders provide a compact representation
                 for modeling many components of natural objects as well
                 as a great variety of human-made industrial parts. This
                 paper presents a new approach to modeling generalized
                 cylinders based on cross-sectional curves defined using
                 Fourier descriptors. This modeling is based on contour
                 interpolation and is implemented using a subdivision
                 technique. The definition of generalized cylinders uses
                 a three-dimensional trajectory which provides an
                 adequate control for the smoothness of bend with a
                 small number of parameters and includes the orientation
                 of each cross-section (i.e., the local coordinate
                 system) in the interpolation framework. Fourier
                 representations of cross-sectional curves are obtained
                 from contours in digital images, and corresponding
                 points are identified by considering angular and
                 arc-length parametrizations. Changes in cross-section
                 shape through the trajectory are performed using
                 Fourier morphing. The technique proposed provides a
                 comprehensive definition that allows the modeling of a
                 wide variety of shapes, while maintaining a compact
                 characterization to facilitate the description of
                 shapes and displays.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "contour interpolation; Fourier expansion; generalized
                 cylinders; morphing; parametric surfaces; solid
                 modeling; subdivision methods",
  subject =      "Computing Methodologies --- Computer Graphics ---
                 Picture/Image Generation (I.3.3); Computing
                 Methodologies --- Computer Graphics --- Picture/Image
                 Generation (I.3.3): Display algorithms Computing
                 Methodologies --- Computer Graphics --- Picture/Image
                 Generation (I.3.3): Line and curve generation Computing
                 Methodologies --- Computer Graphics --- Computational
                 Geometry and Object Modeling (I.3.5); Computing
                 Methodologies --- Computer Graphics --- Computational
                 Geometry and Object Modeling (I.3.5): Curve, surface,
                 solid, and object representations Computing
                 Methodologies --- Computer Graphics --- Computational
                 Geometry and Object Modeling (I.3.5): Hierarchy and
                 geometric transformations",
}

@Article{Gallier:1999:SMD,
  author =       "Jean Gallier",
  title =        "A simple method for drawing a rational curve as two
                 {B{\'e}zier} segments",
  journal =      j-TOG,
  volume =       "18",
  number =       "4",
  pages =        "316--328",
  month =        oct,
  year =         "1999",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Sep 18 10:53:48 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1999-18-4/p316-gallier/",
  abstract =     "In this paper we give a simple method for drawing a
                 closed rational curve specified in terms of control
                 points as two B{\'e}zier segments. The main result is
                 the following:\par

                 For every affine frame $(r,s)$ (where $r < s$), for
                 every rational curve $F(t)$ specified over $[r,s]$ by
                 some control polygon (\beta_0, \ldots{}, \beta_m)
                 (where the $\beta_0$ are weighted control points or
                 control vectors), the control points ($\theta_0,
                 \ldots{}, \theta_m$) (w.r.t. $[r,s]$) of the rational
                 curve $G(t) = F(\phi(t))$ are given by\par

                 $\theta_i = (-1)^i\beta_i$\par

                 \noindent where $\phi : \mbox{\bf RP}^1 \rightarrow
                 \mbox{\bf RP}^1$ is the projectivity mapping $[r,s]$
                 onto $\mbox{\bf RP}^1 --- ]r,s[$. Thus, in order to
                 draw the entire trace of the curve $F$ over
                 $[-\infty,+\infty]$ we simply draw the curve segments
                 $F([r,s])$ and $G([r,s])$.\par

                 The correctness of the method is established using a
                 simple geometric argument about ways of partitioning
                 the real projective line into two disjoint segments.
                 Other known methods for drawing rational curves can be
                 justified using similar geometric arguments.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "B{\'e}zier curves; control points; de Casteljau
                 algorithm; rational curves; subdivision; weights",
  subject =      "Computing Methodologies --- Computer Graphics ---
                 Picture/Image Generation (I.3.3); Computing
                 Methodologies --- Computer Graphics --- Picture/Image
                 Generation (I.3.3): Line and curve generation Computing
                 Methodologies --- Computer Graphics --- Computational
                 Geometry and Object Modeling (I.3.5); Mathematics of
                 Computing --- Numerical Analysis --- Approximation
                 (G.1.2);",
}

@Article{Velho:1999:UAH,
  author =       "Luiz Velho and Luiz Henrique de Figueiredo and Jonas
                 Gomes",
  title =        "A unified approach for hierarchical adaptive
                 tesselation of surfaces",
  journal =      j-TOG,
  volume =       "18",
  number =       "4",
  pages =        "329--360",
  month =        oct,
  year =         "1999",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Sep 18 10:53:48 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1999-18-4/p329-velho/",
  abstract =     "This paper introduces a unified and general
                 tesselation algorithm for parametric and implicit
                 surfaces. The algorithm produces a hierarchical mesh
                 that is adapted to the surface geometry and has a
                 multiresolution and progressive structure. The
                 representation can be exploited with advantages in
                 several applications.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "adapted meshes; geometric modeling; implicit surfaces;
                 multiresolution representations; parametric surfaces;
                 polygonization; surface approximation",
  subject =      "Computing Methodologies --- Computer Graphics ---
                 Computational Geometry and Object Modeling (I.3.5);
                 Computing Methodologies --- Computer Graphics ---
                 Methodology and Techniques (I.3.6); Computer
                 Applications --- Computer-Aided Engineering (J.6);
                 Computer Applications --- Computer-Aided Engineering
                 (J.6): Computer-aided design (CAD)",
}

@Article{Ward:1999:HRC,
  author =       "Gregory Ward and Maryann Simmons",
  title =        "The holodeck ray cache: an interactive rendering
                 system for global illumination in nondiffuse
                 environments",
  journal =      j-TOG,
  volume =       "18",
  number =       "4",
  pages =        "361--398",
  month =        oct,
  year =         "1999",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Sep 18 10:53:48 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/1999-18-4/p361-ward/",
  abstract =     "We present a new method for rendering complex
                 environments using interactive, progressive,
                 view-independent, parallel ray tracing. A
                 four-dimensional {\em holodeck\/} data structure serves
                 as a rendering target and caching mechanism for
                 interactive walk-throughs of nondiffuse environments
                 with full global illumination. Ray sample density
                 varies locally according to need, and on-demand ray
                 computation is supported in a parallel implementation.
                 The holodeck file is stored on disk and cached in
                 memory by a server using a least-recently-used (LRU)
                 beam-replacement strategy. The holodeck server
                 coordinates separate ray evaluation and display
                 processes, optimizing disk and memory usage. Different
                 display systems are supported by specialized drivers,
                 which handle display rendering, user interaction, and
                 input. The display driver creates an image from ray
                 samples sent by the server and permits the manipulation
                 of local objects, which are rendered dynamically using
                 approximate lighting computed from holodeck samples.
                 The overall method overcomes many of the conventional
                 limits of interactive rendering in scenes with complex
                 surface geometry and reflectance properties, through an
                 effective combination of ray tracing, caching, and
                 hardware rendering.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "illumination; image reconstruction; mesh generation;
                 ray tracing; rendering system; virtual reality",
  subject =      "Computing Methodologies --- Computer Graphics ---
                 Picture/Image Generation (I.3.3); Computing
                 Methodologies --- Computer Graphics ---
                 Three-Dimensional Graphics and Realism (I.3.7);
                 Computing Methodologies --- Computer Graphics ---
                 Three-Dimensional Graphics and Realism (I.3.7):
                 Raytracing; Computing Methodologies --- Image
                 Processing And Computer Vision --- General (I.4.0);
                 Computing Methodologies --- Image Processing And
                 Computer Vision --- General (I.4.0): Image displays;
                 Computing Methodologies --- Computer Graphics ---
                 Methodology and Techniques (I.3.6); Computing
                 Methodologies --- Computer Graphics --- Applications
                 (I.3.8); Computing Methodologies --- Computer Graphics
                 --- Graphics Systems (I.3.2);",
}

@Article{McCool:2000:SVR,
  author =       "Michael D. McCool",
  title =        "Shadow volume reconstruction from depth maps",
  journal =      j-TOG,
  volume =       "19",
  number =       "1",
  pages =        "1--26",
  month =        jan,
  year =         "2000",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Sep 18 14:51:16 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/2000-19-1/p1-mccool/",
  abstract =     "Current graphics hardware can be used to generate
                 shadows using either the shadow volume or shadow map
                 techniques. However, the shadow volume technique
                 requires access to a representation of the scene as a
                 polygonal model, and handling the near plane clip
                 correctly and efficiently is difficult; conversely,
                 accurate shadow maps require high-precision texture map
                 data representations, but these are not widely
                 supported.\par

                 We present a hybrid of the shadow map and shadow volume
                 approaches which does not have these difficulties and
                 leverages high-performance polygon rendering. The scene
                 is rendered from the point of view of the light source
                 and a sampled depth map is recovered. Edge detection
                 and a template-based reconstruction technique are used
                 to generate a global shadow volume boundary surface,
                 after which the pixels in shadow can be marked using
                 only a one-bit stencil buffer and a single-pass
                 rendering of the shadow volume boundary polygons. The
                 simple form of our template-based reconstruction scheme
                 simplifies capping the shadow volume after the near
                 plane clip.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "hardware accelerated image synthesis; illumination;
                 image processing; shadows",
  subject =      "Computing Methodologies --- Computer Graphics ---
                 Three --- Dimensional Graphics and Realism (I.3.7);
                 Computing Methodologies --- Computer Graphics ---
                 Three-Dimensional Graphics and Realism (I.3.7): Color,
                 shading, shadowing, and texture; Computing
                 Methodologies --- Image Processing And Computer Vision
                 --- Scene Analysis (I.4.8); Computing Methodologies ---
                 Image Processing And Computer Vision --- Scene Analysis
                 (I.4.8): Range data",
}

@Article{Sanchez-Reyes:2000:APP,
  author =       "Javier S{\'a}nchez-Reyes",
  title =        "Applications of the polynomial $s$-power basis in
                 geometry processing",
  journal =      j-TOG,
  volume =       "19",
  number =       "1",
  pages =        "27--55",
  month =        jan,
  year =         "2000",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Sep 18 10:53:48 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/2000-19-1/p27-sachez-reyes/",
  abstract =     "We propose a unified methodology to tackle geometry
                 processing operations admitting explicit algebraic
                 expressions. This new approach is based on representing
                 and manipulating polynomials algebraically in a
                 recently basis, the symmetric analogue of the power
                 form ($s$-power basis for brevity), so called because
                 it is associated with a ``Hermite two-point expansion''
                 instead of a Taylor expansion. Given the expression of
                 a polynomial in this basis over the unit interval $u
                 \in [0, 1]$, degree reduction is trivially obtained by
                 truncation, which yields the Hermite interpolant that
                 matches the original derivatives at $u = \{0,1\}$.
                 Operations such as division or square root become
                 meaningful and amenable in this basis, since we can
                 compute as many terms as desired of the corresponding
                 Hermite interpolant and build ``$s$-power series,''
                 akin to Taylor series. Applications include computing
                 integral approximations of rational polynomials, or
                 approximations of offset curves.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "$s$-power basis; degree reduction; geometry
                 processing; Hermite interpolation; offset curves and
                 surfaces; power basis; Taylor series",
  subject =      "Mathematics of Computing --- Numerical Analysis ---
                 Interpolation (G.1.1); Mathematics of Computing ---
                 Numerical Analysis --- Interpolation (G.1.1):
                 Interpolation formulas; Mathematics of Computing ---
                 Numerical Analysis --- Approximation (G.1.2);
                 Mathematics of Computing --- Numerical Analysis ---
                 Approximation (G.1.2): Spline and piecewise polynomial
                 approximation;

                 Computing Methodologies --- Symbolic and Algebraic
                 Manipulation --- Expressions and Their Representation
                 (I.1.1); Computing Methodologies --- Symbolic and
                 Algebraic Manipulation --- Expressions and Their
                 Representation (I.1.1): Representations (general and
                 polynomial); Computing Methodologies --- Computer
                 Graphics --- Computational Geometry and Object Modeling
                 (I.3.5); Computing Methodologies --- Computer Graphics
                 --- Computational Geometry and Object Modeling (I.3.5):
                 Curve, surface, solid, and object representations;
                 Computer Applications --- Computer-Aided Engineering
                 (J.6); Computer Applications --- Computer-Aided
                 Engineering (J.6): Computer-aided design (CAD)",
}

@Article{Zheng:2000:ETP,
  author =       "Jianmin Zheng and Thomas W. Sederberg",
  title =        "Estimating tessellation parameter intervals for
                 rational curves and surfaces",
  journal =      j-TOG,
  volume =       "19",
  number =       "1",
  pages =        "56--77",
  month =        jan,
  year =         "2000",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Sep 18 10:53:48 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/2000-19-1/p56-zheng/",
  abstract =     "This paper presents a method for determining {\em a
                 priori\/} a constant parameter interval for
                 tessellating a rational curve or surface such that the
                 deviation of the curve or surface from its piecewise
                 linear approximation is within a specified tolerance.
                 The parameter interval is estimated based on
                 information about second-order derivatives in the
                 homogeneous coordinates, instead of using affine
                 coordinates directly. This new step size can be found
                 with roughly the same amount of computation as the step
                 size in Cheng [1992], though it can be proven to always
                 be larger than Cheng's step size. In fact, numerical
                 experiments show the new step is typically orders of
                 magnitude larger than the step size in Cheng [1992].
                 Furthermore, for rational cubic and quartic curves, the
                 new step size is generally twice as large as the step
                 size found by computing bounds on the Bernstein
                 polynomial coefficients of the second derivatives
                 function.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "derivative bounds; flatness; projection distance;
                 rational curves and surfaces; step size; tessellation",
  subject =      "Computing Methodologies --- Computer Graphics ---
                 Computational Geometry and Object Modeling (I.3.5);
                 Computing Methodologies --- Computer Graphics ---
                 Computational Geometry and Object Modeling (I.3.5):
                 Geometric algorithms, languages, and systems; Computer
                 Applications --- Computer-Aided Engineering (J.6);
                 Computer Applications --- Computer-Aided Engineering
                 (J.6): Computer-aided design (CAD)",
}

@Article{Lee:2000:NTT,
  author =       "Michael Lee and Hanan Samet",
  title =        "Navigating through Triangle Meshes Implemented as
                 Linear Quadtrees",
  journal =      j-TOG,
  volume =       "19",
  number =       "2",
  pages =        "79--121",
  month =        apr,
  year =         "2000",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Apr 17 09:34:42 MDT 2001",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/tog/2000-19-2/p79-lee/p79-lee.pdf;
                 http://www.acm.org/pubs/citations/journals/tog/2000-19-2/p79-lee/",
  abstract =     "Techniques are presented for navigating between
                 adjacent triangles of greater or equal size in a
                 hierarchical triangle mesh where the triangles are
                 obtained by a recursive quadtree-like subdivision of
                 the underlying space into four equilateral triangles.
                 These techniques are useful in a number of
                 applications, including finite element analysis, ray
                 tracing, and the modeling of spherical data. The
                 operations are implemented in a manner analogous to
                 that used in a quadtree representation of data on the
                 two-dimensional plane where the underlying space is
                 tessellated into a square mesh. A new technique is
                 described for labeling the triangles, which is useful
                 in implementing the quadtree triangle mesh as a linear
                 quadtree (i.e., a pointer-less quadtree); the
                 navigation can then take place in this linear quadtree.
                 When the neighbors are of equal size, the algorithms
                 have a worst-case constant time complexity. The
                 algorithms are very efficient, as they make use of just
                 a few bit manipulation operations, and can be
                 implemented in hardware using just a few machine
                 language instructions. The use of these techniques when
                 modeling spherical data by projecting it onto the faces
                 of a regular solid whose faces are equilateral
                 triangles, which are represented as quadtree triangle
                 meshes, is discussed in detail. The methods are
                 applicable to the icosahedron, octahedron, and
                 tetrahedron. The difference lies in the way transitions
                 are made between the faces of the polyhedron. However,
                 regardless of the type of polyhedron, the computational
                 complexity of the methods is the same.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "data structures; finite element analysis; hierarchical
                 methods; neighbor finding; ray tracing; spherical
                 modeling; triangle meshes",
  subject =      "Mathematics of Computing --- Numerical Analysis ---
                 Approximation (G.1.2): Approximation of surfaces and
                 contours; Mathematics of Computing --- Numerical
                 Analysis --- Partial Differential Equations (G.1.8):
                 Finite element methods; Computing Methodologies ---
                 Computer Graphics --- Picture/Image Generation (I.3.3):
                 Display algorithms; Computing Methodologies ---
                 Computer Graphics --- Computational Geometry and Object
                 Modeling (I.3.5): Boundary representations;

                 Computing Methodologies --- Image Processing And
                 Computer Vision --- Image Representation (I.4.10):
                 Hierarchical",
}

@Article{Volevich:2000:UVD,
  author =       "Valdimir Volevich and Karol Myszkowski and Andrei
                 Khodulev and Edward A. Kopylov",
  title =        "Using the Visual Differences Predictor to Improve
                 Performance of Progressive Global Illumination
                 Computation",
  journal =      j-TOG,
  volume =       "19",
  number =       "2",
  pages =        "122--161",
  month =        apr,
  year =         "2000",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Apr 17 09:48:06 MDT 2001",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/tog/2000-19-2/p122-volevich/p122-volevich.pdf;
                 http://www.acm.org/pubs/citations/journals/tog/2000-19-2/p122-volevich/",
  abstract =     "A novel view-independent technique for progressive
                 global illumination computing that uses prediction of
                 visible differences to improve both efficiency and
                 effectiveness of physically-sound lighting solutions
                 has been developed. The technique is a mixture of
                 stochastic (density estimation) and deterministic
                 (adaptive mesh refinement) algorithms used in a
                 sequence and optimized to reduce the differences
                 between the intermediate and final images as perceived
                 by the human observer in the course of lighting
                 computation. The quantitative measurements of
                 visibility were obtained using the model of human
                 vision captured in the visible differences predictor
                 (VDP) developed by Daly [1993]. The VDP responses were
                 used to support the selection of the best component
                 algorithms from a pool of global illumination
                 solutions, and to enhance the selected algorithms for
                 even better progressive refinement of image quality.
                 The VDP was also used to determine the optimal
                 sequential order of component-algorithm execution, and
                 to choose the points at which switchover between
                 algorithms should take place. As the VDP is
                 computationally expensive, it was applied exclusively
                 at the design and tuning stage of the composite
                 technique, and so perceptual considerations are
                 embedded into the resulting solution, though no VDP
                 calculations were performed during lighting
                 simulation.\par

                 The proposed illumination technique is also novel,
                 providing intermediate image solutions of high quality
                 at unprecedented speeds, even for complex scenes. One
                 advantage of the technique is that local estimates of
                 global illumination are readily available at the early
                 stages of computing, making possible the development of
                 a more robust adaptive mesh subdivision, which is
                 guided by local contrast information. Efficient object
                 space filtering, also based on stochastically-derived
                 estimates of the local illumination error, is applied
                 to substantially reduce the visible noise inherent in
                 stochastic solutions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "adaptive mesh subdivision; density estimation; human
                 perception; Monte Carlo photon tracing; progressive
                 refinement; view-independent solutions",
  subject =      "Computing Methodologies --- Computer Graphics ---
                 Three-Dimensional Graphics and Realism (I.3.7): {\bf
                 Color, shading, shadowing, and texture}; Computing
                 Methodologies --- Image Processing And Computer Vision
                 --- Digitization and Image Capture (I.4.1): {\bf
                 Sampling}; Computing Methodologies --- Image Processing
                 And Computer Vision --- Enhancement (I.4.3): {\bf
                 Filtering}; Computing Methodologies --- Simulation and
                 Modeling --- Types of Simulation (I.6.8): {\bf Monte
                 Carlo}; Computing Methodologies --- Artificial
                 Intelligence --- Vision and Scene Understanding
                 (I.2.10): {\bf Intensity, color, photometry, and
                 thresholding}; Computing Methodologies --- Image
                 Processing And Computer Vision --- Digitization and
                 Image Capture (I.4.1): {\bf Radiometry}; Computing
                 Methodologies --- Image Processing And Computer Vision
                 --- Digitization and Image Capture (I.4.1): {\bf
                 Reflectance}",
}

@Article{Hodgins:2000:E,
  author =       "Jessica Hodgins",
  title =        "Editorial",
  journal =      j-TOG,
  volume =       "19",
  number =       "3",
  pages =        "163--163",
  year =         "2000",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Apr 17 09:34:42 MDT 2001",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/tog/2000-19-3/p163-hodgins/p163-hodgins.pdf;
                 http://www.acm.org/pubs/citations/journals/tog/2000-19-3/p163-hodgins/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Cant:2000:TPM,
  author =       "R. J. Cant and P. A. Shrubsole",
  title =        "Texture potential {MIP} mapping, a new high-quality
                 texture antialiasing algorithm",
  journal =      j-TOG,
  volume =       "19",
  number =       "3",
  pages =        "164--184",
  year =         "2000",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Apr 17 09:39:15 MDT 2001",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/tog/2000-19-3/p164-cant/p164-cant.pdf;
                 http://www.acm.org/pubs/citations/journals/tog/2000-19-3/p164-cant/",
  abstract =     "A refined version of the texture potential mapping
                 algorithm is introduced in which a one-dimensional MIP
                 map is incorporated. This has the effect of controlling
                 the maximum number of texture samples required. The new
                 technique is compared to existing texture antialiasing
                 methods in terms of quality and sample count. The new
                 method is shown to compare favorably with existing
                 techniques for producing high quality antialiased,
                 texture-mapped images.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  generalterms = "Algorithms; Performance",
  keywords =     "anisotropic filtering; antialiasing; texture mapping",
  subject =      "Computing Methodologies --- Computer Graphics ---
                 Picture/Image Generation (I.3.3): {\bf Display
                 algorithms}; Computing Methodologies --- Computer
                 Graphics --- Three-Dimensional Graphics and Realism
                 (I.3.7): {\bf Color, shading, shadowing, and texture}",
}

@Article{Goshtasby:2000:GPI,
  author =       "A. Ardeshir Goshtasby",
  title =        "Grouping and parameterizing irregularly spaced points
                 for curve fitting",
  journal =      j-TOG,
  volume =       "19",
  number =       "3",
  pages =        "185--203",
  year =         "2000",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Apr 17 09:39:15 MDT 2001",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/tog/2000-19-3/p185-goshtasby/p185-goshtasby.pdf;
                 http://www.acm.org/pubs/citations/journals/tog/2000-19-3/p185-goshtasby/",
  abstract =     "Given a large set irregularly spaced points in the
                 plane, an algorithm for partitioning the points into
                 subsets and fitting a parametric curve to each subset
                 is described. The points could be measurements from a
                 physical phenomenon, and the objective in this process
                 could be to find patterns among the points and describe
                 the phenomenon analytically. The points could be
                 measurements from a geometric curves. The algorithm
                 proposed here can be used in various applications,
                 especially where given points are dense and noisy.
                 Examples demonstrating the behavior of the algorithm
                 under noise and density of the points are presented and
                 discussed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  generalterms = "Algorithms",
  keywords =     "irregularly spaced points; node estimation; noisy
                 point set; parametric curve",
  subject =      "Computing Methodologies --- Computer Graphics ---
                 Computational Geometry and Object Modeling (I.3.5):
                 {\bf Curve, surface, solid, and object
                 representations}",
}

@Article{Lindstrom:2000:IDS,
  author =       "Peter Lindstrom and Greg Turk",
  title =        "Image-driven simplification",
  journal =      j-TOG,
  volume =       "19",
  number =       "3",
  pages =        "204--241",
  year =         "2000",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Apr 17 09:39:15 MDT 2001",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/tog/2000-19-3/p204-lindstrom/p204-lindstrom.pdf;
                 http://www.acm.org/pubs/citations/journals/tog/2000-19-3/p204-lindstrom/",
  abstract =     "We introduce the notion of {\em image-driven
                 simplification\/}, a framework that uses images to
                 decide which portions of a model to simplify. This is a
                 departure from approaches that make polygonal
                 simplification decisions based on geometry. As with
                 many methods, we use the edge collapse operator to make
                 incremental changes to a model. Unique to our approach,
                 however, is the use at comparisons between images of
                 the original model against those of a simplified model
                 to determine the cost of an ease collapse. We use
                 common graphics rendering hardware to accelerate the
                 creation of the required images. As expected, this
                 method produces models that are close to the original
                 model according to image differences. Perhaps more
                 surprising, however, is that the method yields models
                 that have high geometric fidelity as well. Our approach
                 also solves the quandary of how to weight the geometric
                 distance versus appearance properties such as normals,
                 color, and texture. All of these trade-offs are
                 balanced by the image metric. Benefits of this approach
                 include high fidelity silhouettes, extreme
                 simplification of hidden portions of a model, attention
                 to shading interpolation effects, and simplification
                 that is sensitive to the content of a texture. In order
                 to better preserve the appearance of textured models,
                 we introduce a novel technique for assigning texture
                 coordinates to the new vertices of the mesh. This
                 method is based on a geometric heuristic that can be
                 integrated with any edge collapse algorithm to produce
                 high quality textured surfaces.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  generalterms = "Algorithms; Performance",
  keywords =     "image metrics; level-of-detail; polygonal
                 simplification; visual perception",
  subject =      "Computing Methodologies --- Computer Graphics ---
                 Picture/Image Generation (I.3.3): {\bf Display
                 algorithms}; Computing Methodologies --- Computer
                 Graphics --- Computational Geometry and Object Modeling
                 (I.3.5): {\bf Object hierarchies}",
}

@Article{Fiume:2000:AFA,
  author =       "Eugene Fiume",
  title =        "{Alain Fournier}: 1943--2000: An Appreciation",
  journal =      j-TOG,
  volume =       "19",
  number =       "4",
  pages =        "243--245",
  month =        oct,
  year =         "2000",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/380666.380668",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Feb 6 18:10:33 MST 2002",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/2000-19-4/p243-fiume/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Chen:2000:TAS,
  author =       "Min Chen and James Arvo",
  title =        "Theory and Application of Specular Path Perturbation",
  journal =      j-TOG,
  volume =       "19",
  number =       "4",
  pages =        "246--278",
  month =        oct,
  year =         "2000",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/380666.380670",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Feb 6 18:10:33 MST 2002",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/2000-19-4/p246-chen/",
  abstract =     "In this paper we apply perturbation methods to the
                 problem of computing specular reflections in curved
                 surfaces. The key idea is to generate families of
                 closely related optical paths by expanding a given path
                 into a high-dimensional Taylor series. Our path
                 perturbation method is based on closed-form expressions
                 for linear and higher-order approximations of ray
                 paths, which are derived using Fermat's Variation
                 Principle and the Implicit Function Theorem (IFT). The
                 perturbation formula presented here holds for general
                 multiple-bounce reflection paths and provides a
                 mathematical foundation for exploiting path coherence
                 in ray tracing acceleration techniques and incremental
                 rendering. To illustrate its use, we describe an
                 algorithm for fast approximation of specular
                 reflections on curved surfaces; the resulting images
                 are highly accurate and nearly indistinguishable from
                 ray traced images.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sarraga:2000:VMM,
  author =       "Ramon F. Sarraga",
  title =        "A Variational Method to Model {$G^1$} Surfaces over
                 Triangular Meshes of Arbitrary Topology in {$R^3$}",
  journal =      j-TOG,
  volume =       "19",
  number =       "4",
  pages =        "279--301",
  month =        oct,
  year =         "2000",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/380666.380674",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Feb 6 18:10:33 MST 2002",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/2000-19-4/p279-sarraga/",
  abstract =     "This article presents a method for constructing a
                 $G^1$-smooth surface, composed of independently
                 parametrized triangular polynomial B{\'e}zier patches,
                 to fit scattered data points triangulated in $R^3$ with
                 arbitrary topology. The method includes a variational
                 technique to optimize the shape of the surface. A
                 systematic development of the method is given,
                 presenting general equations provided by the theory of
                 manifolds, explaining the heuristic assumptions made to
                 simplify calculations, and analyzing the numerical
                 results obtained from fitting two test configurations
                 of scattered data points. The goal of this work is to
                 explore an alternative $G^3$ construction, inspired by
                 the theory of manifolds, that is subject to fewer
                 application constraints than approaches found in the
                 technical literature; e.g., this approach imposes no
                 artificial restrictions on the tangents of patch
                 boundary curves at vertex points of a $G^1$ surface.
                 The constructed surface shapes fit all test data
                 surprisingly well for a noniterative method based on
                 polynomial patches.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Soler:2000:TVE,
  author =       "Cyril Soler and F. X. Sillion",
  title =        "Texture-Based Visibility for Efficient Lighting
                 Simulation",
  journal =      j-TOG,
  volume =       "19",
  number =       "4",
  pages =        "302--342",
  month =        oct,
  year =         "2000",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/380666.380679",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Feb 6 18:10:33 MST 2002",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/2000-19-4/p302-soler/",
  abstract =     "Lighting simulations using hierarchical radiosity with
                 clustering can be very slow when the computation of
                 fine and artifact-free shadows is needed. To avoid the
                 high cost of mesh refinement associated with fast
                 variations of visibility across receivers, we propose a
                 new hierarchical algorithm in which partial visibility
                 maps can be computed on the fly, using a convolution
                 technique for emitter-receiver configurations where
                 complex shadows are produced. Other configurations
                 still rely on mesh subdivision to reach the desired
                 accuracy in modeling energy transfer. In our system,
                 therefore, radiosity is represented as a combination of
                 textures and piecewise-constant or linear contributions
                 over mesh elements at multiple hierarchical levels. We
                 give a detailed description of the {\em gather}, {\em
                 push}\slash {\em pull}, and {\em display} stages of the
                 hierarchical radiosity algorithm, adapted to seamlessly
                 integrate both representations. A new refinement
                 algorithm is proposed, which chooses the most
                 appropriate technique to compute the energy transfer
                 and resulting radiosity distribution for each
                 receiver\slash transmitter configuration. Comprehensive
                 error control is achieved by subdividing either the
                 source or receiver in a traditional manner, or by using
                 a blocker subdivision scheme that improves the quality
                 of shadow masks without increasing the complexity of
                 the mesh. Results show that high-quality images are
                 obtained in a matter of seconds for scenes with tens of
                 thousands of polygons.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Peters:2001:SPR,
  author =       "J{\"o}rg Peters",
  title =        "Smooth Patching of Refined Triangulations",
  journal =      j-TOG,
  volume =       "20",
  number =       "1",
  pages =        "1--9",
  month =        jan,
  year =         "2001",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/383745.383746",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Feb 6 18:10:33 MST 2002",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/2001-20-1/p1-peters/",
  abstract =     "This paper presents a simple algorithm for associating
                 a smooth, low-degree polynomial surface with
                 triangulations whose extraordinary mesh nodes are
                 separated by sufficiently many ordinary, 6-valent mesh
                 nodes. Output surfaces are at least tangent continuous
                 and are $C^2$ sufficiently far away from extraordinary
                 mesh nodes; they consist of three-sided B{\'e}zier
                 patches of degree 4. In particular, the algorithm can
                 be used to skin a mesh generated by a few steps of
                 Loop's generalization of three-direction box-spline
                 subdivision.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bajaj:2001:RIC,
  author =       "Chandrajit Bajaj and Insung Ihm and Sanghun Park",
  title =        "{$3$D RGB} Image Compression for Interactive
                 Applications",
  journal =      j-TOG,
  volume =       "20",
  number =       "1",
  pages =        "10--38",
  month =        jan,
  year =         "2001",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/383745.383747",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 22 15:33:29 2002",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tog/2001-20-1/p10-bajaj/",
  abstract =     "This paper presents a new 3D RGB image compression
                 scheme designed for interactive real-time applications.
                 In designing our compression method, we have
                 compromised between two important goals: high
                 compression ratio and fast random access ability, and
                 have tried to minimize the overhead caused during
                 run-time reconstruction. Our compression technique is
                 suitable for applications wherein data are accessed in
                 a somewhat unpredictable fashion, and real-time
                 performance of decompression is necessary. The
                 experimental results on three different kinds of 3D
                 images from medical imaging, image-based rendering, and
                 solid texture mapping suggest that the compression
                 method can be used effectively in developing real-time
                 applications that must handle large volume data, made
                 of color samples taken in three- or higher-dimensional
                 space.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Yee:2001:SSV,
  author =       "H. Yee and S. Pattanaik and D. P. Greenberg",
  title =        "Spatiotemporal Sensitivity and Visual Attention for
                 Efficient Rendering of Dynamic Environments",
  journal =      j-TOG,
  volume =       "20",
  number =       "1",
  pages =        "39--65",
  month =        jan,
  year =         "2001",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/383745.383748",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 22 15:33:40 2002",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  URL =          "http://www.acm.org/tog/yee01/index.html",
  abstract =     "We present a method to accelerate global illumination
                 computation in prerendered animations by taking
                 advantage of limitations of the human visual system. A
                 spatiotemporal error tolerance map, constructed from
                 psychophysical data based on velocity dependent
                 contrast sensitivity, is used to accelerate rendering.
                 The error map is augmented by a model of visual
                 attention in order to account for the tracking behavior
                 of the eye. Perceptual acceleration combined with good
                 sampling protocols provide a global illumination
                 solution feasible for use in animation. Results
                 indicate an order of magnitude improvement in
                 computational speed.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Shin:2001:CPI,
  author =       "Hyun Joon Shin and Jehee Lee and Michael Gleicher and
                 Sung Yong Shin",
  title =        "Computer Puppetry: An Importance-Based Approach",
  journal =      j-TOG,
  volume =       "20",
  number =       "2",
  pages =        "67--94",
  month =        apr,
  year =         "2001",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/502122.502123",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 22 15:33:47 2002",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Computer puppetry maps the movements of a performer to
                 an animated character in real-time. In this article, we
                 provide a comprehensive solution to the problem of
                 transferring the observations of the motion capture
                 sensors to an animated character whose size and
                 proportion may be different from the performer's. Our
                 goal is to map as many of the important aspects of the
                 motion to the target character as possible, while
                 meeting the online, real-time demands of computer
                 puppetry. We adopt a Kalman filter scheme that
                 addresses motion capture noise issues in this setting.
                 We provide the notion of dynamic importance of an
                 end-effector that allows us to determine what aspects
                 of the performance must be kept in the resulting
                 motion. We introduce a novel inverse kinematics solver
                 that realizes these important aspects within tight
                 real-time constraints. Our approach is demonstrated by
                 its application to broadcast television performances.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Buss:2001:SAA,
  author =       "Samuel R. Buss and Jay P. Fillmore",
  title =        "Spherical Averages and Applications to Spherical
                 Splines and Interpolation",
  journal =      j-TOG,
  volume =       "20",
  number =       "2",
  pages =        "95--126",
  month =        apr,
  year =         "2001",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/502122.502124",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Feb 6 18:10:33 MST 2002",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This article introduces a method for computing
                 weighted averages on spheres based on least squares
                 minimization that respects spherical distance. We prove
                 existence and uniqueness properties of the weighted
                 averages, and give fast iterative algorithms with
                 linear and quadratic convergence rates. Our methods are
                 appropriate to problems involving averages of spherical
                 data in meteorological, geophysical, and astronomical
                 applications. One simple application is a method for
                 smooth averaging of quaternions, which generalizes
                 Shoemake's spherical linear interpolation. The weighted
                 averages methods allow a novel method of defining
                 B{\'e}zier and spline curves on spheres, which provides
                 direct generalization of B{\'e}zier and B-spline curves
                 to spherical spline curves. We present a fast algorithm
                 for spline interpolation on spheres. Our spherical
                 splines allow the use of arbitrary knot positions;
                 potential applications of spherical splines include
                 smooth quaternion curves for applications in graphics,
                 animation, robotics, and motion planning.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Liang:2001:RTS,
  author =       "Lin Liang and Ce Liu and Ying-Qing Xu and Baining Guo
                 and Heung-Yeung Shum",
  title =        "Real-time Texture Synthesis by Patch-based Sampling",
  journal =      j-TOG,
  volume =       "20",
  number =       "3",
  pages =        "127--150",
  month =        jul,
  year =         "2001",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/501786.501787",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 22 15:33:55 2002",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an algorithm for synthesizing textures from
                 an input sample. This patch-based sampling algorithm is
                 fast and it makes high-quality texture synthesis a
                 real-time process. For generating textures of the same
                 size and comparable quality, patch-based sampling is
                 orders of magnitude faster than existing algorithms.
                 The patch-based sampling algorithm works well for a
                 wide variety of textures ranging from regular to
                 stochastic. By sampling patches according to a
                 nonparametric estimation of the local conditional MRF
                 density function, we avoid mismatching features across
                 patch boundaries. We also experimented with documented
                 cases for which pixel-based nonparametric sampling
                 algorithms cease to be effective but our algorithm
                 continues to work well.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{OSullivan:2001:CP,
  author =       "Carol O'Sullivan and John Dingliana",
  title =        "Collisions and Perception",
  journal =      j-TOG,
  volume =       "20",
  number =       "3",
  pages =        "151--168",
  month =        jul,
  year =         "2001",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/501786.501788",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Feb 6 18:10:33 MST 2002",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Level of Detail (LOD) techniques for real-time
                 rendering and related perceptual issues have received a
                 lot of attention in recent years. Researchers have also
                 begun to look at the issue of perceptually adaptive
                 techniques for plausible physical simulations. In this
                 article, we are particularly interested in the problem
                 of realistic collision simulation in scenes where large
                 numbers of objects are colliding and processing must
                 occur in real-time. An interruptible and therefore
                 degradable collision-handling mechanism is used and the
                 perceptual impact of this degradation is explored. We
                 look for ways in which we can optimize the realism of
                 such simulations and describe a series of
                 psychophysical experiments that investigate different
                 factors affecting collision perception, including
                 eccentricity, separation, distractors, causality, and
                 accuracy of physical response. Finally, strategies for
                 incorporating these factors into a perceptually
                 adaptive real-time simulation of large numbers of
                 visually similar objects are presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Alonso:2001:VMG,
  author =       "L. Alonso and F. Cuny and S. Petitjean and J.-C. Paul
                 and S. Lazard and E. Wies",
  title =        "The Virtual Mesh: {A} Geometric Abstraction for
                 Efficiently Computing Radiosity",
  journal =      j-TOG,
  volume =       "20",
  number =       "3",
  pages =        "169--201",
  month =        jul,
  year =         "2001",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/501786.501789",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 22 15:34:02 2002",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this article, we introduce a general-purpose method
                 for computing radiosity on scenes made of parametric
                 surfaces with arbitrary trimming curves. In contrast
                 with past approaches that require a tessellation of the
                 input surfaces (be it made up of triangles or patches
                 with simple trimming curves) or some form of geometric
                 approximation, our method takes full advantage of the
                 rich and compact mathematical representation of
                 objects. At its core lies the virtual mesh, an
                 abstraction of the input geometry that allows complex
                 shapes to be illuminated as if they were simple
                 primitives. The virtual mesh is a collection of
                 normalized square domains to which the input surfaces
                 are mapped while preserving their energy properties.
                 Radiosity values are then computed on these supports
                 before being lifted back to the original surfaces. To
                 demonstrate the power of our method, we describe a
                 high-order wavelet radiosity implementation that uses
                 the virtual mesh. Examples of objects and environments,
                 designed for interactive applications or virtual
                 reality, are presented. They prove that, by exactly
                 integrating curved surfaces in the resolution process,
                 the virtual mesh allows complex scenes to be rendered
                 more quickly, more accurately, and much more naturally
                 than with previously known methods.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Surazhsky:2001:CMC,
  author =       "Vitaly Surazhsky and Craig Gotsman",
  title =        "Controllable Morphing of Compatible Planar
                 Triangulations",
  journal =      j-TOG,
  volume =       "20",
  number =       "4",
  pages =        "203--231",
  month =        oct,
  year =         "2001",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/502783.502784",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Feb 6 18:10:33 MST 2002",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Two planar triangulations with a correspondence
                 between the pair of vertex sets are compatible
                 (isomorphic) if they are topologically equivalent. This
                 work describes methods for morphing compatible planar
                 triangulations with identical convex boundaries in a
                 manner that guarantees compatibility throughout the
                 morph. These methods are based on a fundamental
                 representation of a planar triangulation as a matrix
                 that unambiguously describes the triangulation.
                 Morphing the triangulations corresponds to
                 interpolations between these matrices. We show that
                 this basic approach can be extended to obtain better
                 control over the morph, resulting in valid morphs with
                 various natural properties. Two schemes, which generate
                 the linear trajectory morph if it is valid, or a morph
                 with trajectories close to linear otherwise, are
                 presented. An efficient method for verification of
                 validity of the linear trajectory morph between two
                 triangulations is proposed. We also demonstrate how to
                 obtain a morph with a natural evolution of triangle
                 areas and how to find a smooth morph through a given
                 intermediate triangulation.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ouellette:2001:NSO,
  author =       "Marc J. Ouellette and Eugene Fiume",
  title =        "On Numerical Solutions to One-Dimensional Integration
                 Problems with Applications to Linear Light Sources",
  journal =      j-TOG,
  volume =       "20",
  number =       "4",
  pages =        "232--279",
  month =        oct,
  year =         "2001",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/502783.502785",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Feb 6 18:10:33 MST 2002",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Many key problems in computer graphics require the
                 computation of integrals. Due to the nature of the
                 integrand and of the domain of integration, these
                 integrals seldom can be computed analytically. As a
                 result, numerical techniques are used to find
                 approximate solutions to these problems. While the
                 numerical analysis literature offers many integration
                 techniques, the choice of which method to use for
                 specific computer graphic problems is a difficult one.
                 This choice must be driven by the numerical efficiency
                 of the method, and ultimately, by its visual impact on
                 the computed image. In this paper, we begin to address
                 these issues by methodically analyzing deterministic
                 and stochastic numerical techniques and their
                 application to the type of one-dimensional problems
                 that occur in computer graphics, especially in the
                 context of linear light source integration. In addition
                 to traditional methods such as Gauss--Legendre
                 quadratures, we also examine Voronoi diagram-based
                 sampling, jittered quadratures, random offset
                 quadratures, weighted Monte Carlo, and a newly
                 introduced method of compounding known as a difficulty
                 driven compound quadrature. We compare the
                 effectiveness of these methods using a three-pronged
                 approach. First, we compare the frequency domain
                 characteristics of all the methods using periodograms.
                 Next, applying ideas found in the numerical analysis
                 literature, we examine the numerical and visual
                 performance profiles of these methods for seven
                 different one-parameter problem families. We then
                 present results from the application of the methods for
                 the example of linear light sources. Finally, we
                 summarize the relative effectiveness of the methods
                 surveyed, showing the potential power of
                 difficulty-driven compound quadratures.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ashikhmin:2002:SIT,
  author =       "Michael Ashikhmin and Peter Shirley",
  title =        "Steerable illumination textures",
  journal =      j-TOG,
  volume =       "21",
  number =       "1",
  pages =        "1--19",
  month =        jan,
  year =         "2002",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/504789.504790",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Apr 11 17:55:04 MDT 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce a new set of illumination basis functions
                 designed for lighting bumpy surfaces. This lighting
                 includes shadowing and interreflection. To create an
                 image with a new light direction, only a linear
                 combination of precomputed textures is required. This
                 is possible by using a carefully selected set of
                 steerable basis functions. Steerable basis lights have
                 the property that they allow lights to move
                 continuously without jarring visual artifacts. The new
                 basis lights are shown to produce images of high visual
                 quality with as few as 49 basis textures.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bump mapping; displacement mapping; relighting;
                 steerable functions; textures",
}

@Article{Milliron:2002:FGW,
  author =       "Tim Milliron and Robert J. Jensen and Ronen Barzel and
                 Adam Finkelstein",
  title =        "A framework for geometric warps and deformations",
  journal =      j-TOG,
  volume =       "21",
  number =       "1",
  pages =        "20--51",
  month =        jan,
  year =         "2002",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/504789.504791",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Apr 11 17:55:04 MDT 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a framework for geometric warps and
                 deformations. The framework provides a conceptual and
                 mathematical foundation for analyzing known warps and
                 for developing new warps, and serves as a common base
                 for many warps and deformations. Our framework is
                 composed of two components: a generic modular algorithm
                 for warps and deformations; and a concise,
                 geometrically meaningful formula that describes how
                 warps are evaluated. Together, these two elements
                 comprise a complete framework useful for analyzing,
                 evaluating, designing, and implementing deformation
                 algorithms. While the framework is independent of
                 user-interfaces and geometric model representations and
                 is formally capable of describing any warping
                 algorithm, its design is geared toward the most
                 prevalent class of user-controlled deformations: those
                 computed using geometric operations. To demonstrate the
                 expressive power of the framework, we cast several
                 well-known warps in terms of the framework. To
                 illustrate the framework's usefulness for analyzing and
                 modifying existing warps, we present variations of
                 these warps that provide additional functionality or
                 improved behavior. To show the utility of the framework
                 for developing new warps, we design a novel 3-D warping
                 algorithm: a mesh warp---useful as a modeling and
                 animation tool---that allows users to deform a detailed
                 surface by manipulating a low-resolution mesh of
                 similar shape. Finally, to demonstrate the mathematical
                 utility of the framework, we use the framework to
                 develop guarantees of several mathematical properties
                 such as commutativity and continuity for large classes
                 of deformations.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "deformation; warp",
}

@Article{Goldman:2002:AGF,
  author =       "Ron Goldman",
  title =        "On the algebraic and geometric foundations of computer
                 graphics",
  journal =      j-TOG,
  volume =       "21",
  number =       "1",
  pages =        "52--86",
  month =        jan,
  year =         "2002",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/504789.504792",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Apr 11 17:55:04 MDT 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Today's computer graphics is ostensibly based upon
                 insights from projective geometry and computations on
                 homogeneous coordinates. Paradoxically, however,
                 projective spaces and homogeneous coordinates are
                 incompatible with much of the algebra and a good deal
                 of the geometry currently in actual use in computer
                 graphics. To bridge this gulf between theory and
                 practice, Grassmann spaces are proposed here as an
                 alternative to projective spaces. We establish that
                 unlike projective spaces, Grassmann spaces do support
                 all the algebra and geometry needed for contemporary
                 computer graphics. We then go on to explain how to
                 exploit this algebra and geometry for a variety of
                 applications, both old and new, including the graphics
                 pipeline, shading algorithms, texture maps, and
                 overcrown surfaces.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Grassmann space; homogeneous coordinates; mass-points;
                 projective space",
}

@Article{Hodgins:2002:E,
  author =       "Jessica Hodgins",
  title =        "Editorial",
  journal =      j-TOG,
  volume =       "21",
  number =       "2",
  pages =        "87--87",
  month =        apr,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Jul 2 14:04:52 MDT 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Andujar:2002:TRS,
  author =       "Carlos And{\'u}jar and Pere Brunet and Dolors Ayala",
  title =        "Topology-reducing surface simplification using a
                 discrete solid representation",
  journal =      j-TOG,
  volume =       "21",
  number =       "2",
  pages =        "88--105",
  month =        apr,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Jul 2 14:04:52 MDT 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Carr:2002:MAR,
  author =       "Nathan A. Carr and John C. Hart",
  title =        "Meshed atlases for real-time procedural solid
                 texturing",
  journal =      j-TOG,
  volume =       "21",
  number =       "2",
  pages =        "106--131",
  month =        apr,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Jul 2 14:04:52 MDT 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Littlewood:2002:POF,
  author =       "D. J. Littlewood and P. A. Drakopoulos and G.
                 Subbarayan",
  title =        "{Pareto}-optimal formulations for cost versus
                 colorimetric accuracy trade-offs in printer color
                 management",
  journal =      j-TOG,
  volume =       "21",
  number =       "2",
  pages =        "132--175",
  month =        apr,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Jul 2 14:04:52 MDT 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Durand:2002:VC,
  author =       "Fr{\'e}do Durand and George Drettakis and Claude
                 Puech",
  title =        "The {$3$D} visibility complex",
  journal =      j-TOG,
  volume =       "21",
  number =       "2",
  pages =        "176--206",
  month =        apr,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Jul 2 14:04:52 MDT 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zelinka:2002:PGP,
  author =       "Steve Zelinka and Michael Garland",
  title =        "Permission grids: practical, error-bounded
                 simplification",
  journal =      j-TOG,
  volume =       "21",
  number =       "2",
  pages =        "207--229",
  month =        apr,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Jul 2 14:04:52 MDT 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hodgins:2002:A,
  author =       "Jessica Hodgins",
  title =        "Acknowledgments",
  journal =      j-TOG,
  volume =       "21",
  number =       "2",
  pages =        "230--230",
  month =        apr,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Jul 2 14:04:52 MDT 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Chuang:2002:VMC,
  author =       "Yung-Yu Chuang and Aseem Agarwala and Brian Curless
                 and David H. Salesin and Richard Szeliski",
  title =        "Video matting of complex scenes",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "243--248",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Fattal:2002:GDH,
  author =       "Raanan Fattal and Dani Lischinski and Michael Werman",
  title =        "Gradient domain high dynamic range compression",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "249--256",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Durand:2002:FBF,
  author =       "Fr{\'e}do Durand and Julie Dorsey",
  title =        "Fast bilateral filtering for the display of
                 high-dynamic-range images",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "257--266",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Reinhard:2002:PTR,
  author =       "Erik Reinhard and Michael Stark and Peter Shirley and
                 James Ferwerda",
  title =        "Photographic tone reproduction for digital images",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "267--276",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Welsh:2002:TCG,
  author =       "Tomihisa Welsh and Michael Ashikhmin and Klaus
                 Mueller",
  title =        "Transferring color to greyscale images",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "277--280",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Grinspun:2002:CSF,
  author =       "Eitan Grinspun and Petr Krysl and Peter Schr{\"o}der",
  title =        "{CHARMS}: a simple framework for adaptive simulation",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "281--290",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{OBrien:2002:GMA,
  author =       "James F. O'Brien and Adam W. Bargteil and Jessica K.
                 Hodgins",
  title =        "Graphical modeling and animation of ductile fracture",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "291--294",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Smith:2002:CMT,
  author =       "Jeffrey Smith and Jessica Hodgins and Irving Oppenheim
                 and Andrew Witkin",
  title =        "Creating models of truss structures with
                 optimization",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "295--301",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Cutler:2002:PAA,
  author =       "Barbara Cutler and Julie Dorsey and Leonard McMillan
                 and Matthias M{\"u}ller and Robert Jagnow",
  title =        "A procedural approach to authoring solid models",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "302--311",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Biermann:2002:CPE,
  author =       "Henning Biermann and Ioana Martin and Fausto
                 Bernardini and Denis Zorin",
  title =        "Cut-and-paste editing of multiresolution surfaces",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "312--321",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zwicker:2002:PIS,
  author =       "Matthias Zwicker and Mark Pauly and Oliver Knoll and
                 Markus Gross",
  title =        "{Pointshop $3$D}: an interactive system for
                 point-based surface editing",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "322--329",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Museth:2002:LSS,
  author =       "Ken Museth and David E. Breen and Ross T. Whitaker and
                 Alan H. Barr",
  title =        "Level set surface editing operators",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "330--338",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ju:2002:DCH,
  author =       "Tao Ju and Frank Losasso and Scott Schaefer and Joe
                 Warren",
  title =        "Dual contouring of {Hermite} data",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "339--346",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Alliez:2002:IGR,
  author =       "Pierre Alliez and Mark Meyer and Mathieu Desbrun",
  title =        "Interactive geometry remeshing",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "347--354",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Gu:2002:GI,
  author =       "Xianfeng Gu and Steven J. Gortler and Hugues Hoppe",
  title =        "Geometry images",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "355--361",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Levy:2002:LSC,
  author =       "Bruno L{\'e}vy and Sylvain Petitjean and Nicolas Ray
                 and J{\'e}rome Maillot",
  title =        "Least squares conformal maps for automatic texture
                 atlas generation",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "362--371",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Gandoin:2002:PLC,
  author =       "Pierre-Marie Gandoin and Olivier Devillers",
  title =        "Progressive lossless compression of arbitrary
                 simplicial complexes",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "372--379",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Alexa:2002:LCT,
  author =       "Marc Alexa",
  title =        "Linear combination of transformations",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "380--387",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ezzat:2002:TVS,
  author =       "Tony Ezzat and Gadi Geiger and Tomaso Poggio",
  title =        "Trainable videorealistic speech animation",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "388--398",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bregler:2002:TMM,
  author =       "Christoph Bregler and Lorie Loeb and Erika Chuang and
                 Hrishi Deshpande",
  title =        "Turning to the masters: motion capturing cartoons",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "399--407",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Liu:2002:SCD,
  author =       "C. Karen Liu and Zoran Popovi{\'c}",
  title =        "Synthesis of complex dynamic character motion from
                 simple animations",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "408--416",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Blumberg:2002:ILI,
  author =       "Bruce Blumberg and Marc Downie and Yuri Ivanov and
                 Matt Berlin and Michael Patrick Johnson and Bill
                 Tomlinson",
  title =        "Integrated learning for interactive synthetic
                 characters",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "417--426",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Matusik:2002:IBP,
  author =       "Wojciech Matusik and Hanspeter Pfister and Addy Ngan
                 and Paul Beardsley and Remo Ziegler and Leonard
                 McMillan",
  title =        "Image-based {$3$D} photography using opacity hulls",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "427--437",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Rusinkiewicz:2002:RTM,
  author =       "Szymon Rusinkiewicz and Olaf Hall-Holt and Marc
                 Levoy",
  title =        "Real-time {$3$D} model acquisition",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "438--446",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Chen:2002:LFM,
  author =       "Wei-Chao Chen and Jean-Yves Bouguet and Michael H. Chu
                 and Radek Grzeszczuk",
  title =        "Light field mapping: efficient representation and
                 hardware rendering of surface light fields",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "447--456",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zhang:2002:FBL,
  author =       "Zhunping Zhang and Lifeng Wang and Baining Guo and
                 Heung-Yeung Shum",
  title =        "Feature-based light field morphing",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "457--464",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Li:2002:MTT,
  author =       "Yan Li and Tianshu Wang and Heung-Yeung Shum",
  title =        "Motion texture: a two-level statistical model for
                 character motion synthesis",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "465--472",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kovar:2002:MG,
  author =       "Lucas Kovar and Michael Gleicher and Fr{\'e}d{\'e}ric
                 Pighin",
  title =        "Motion graphs",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "473--482",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Arikan:2002:IMG,
  author =       "Okan Arikan and D. A. Forsyth",
  title =        "Interactive motion generation from examples",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "483--490",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lee:2002:ICA,
  author =       "Jehee Lee and Jinxiang Chai and Paul S. A. Reitsma and
                 Jessica K. Hodgins and Nancy S. Pollard",
  title =        "Interactive control of avatars animated with human
                 motion data",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "491--500",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Pullen:2002:MCA,
  author =       "Katherine Pullen and Christoph Bregler",
  title =        "Motion capture assisted animation: texturing and
                 synthesis",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "501--508",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Latta:2002:HFB,
  author =       "Lutz Latta and Andreas Kolb",
  title =        "Homomorphic factorization of {BRDF}-based lighting
                 computation",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "509--516",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ramamoorthi:2002:FSE,
  author =       "Ravi Ramamoorthi and Pat Hanrahan",
  title =        "Frequency space environment map rendering",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "517--526",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sloan:2002:PRT,
  author =       "Peter-Pike Sloan and Jan Kautz and John Snyder",
  title =        "Precomputed radiance transfer for real-time rendering
                 in dynamic, low-frequency lighting environments",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "527--536",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tole:2002:IGI,
  author =       "Parag Tole and Fabio Pellacini and Bruce Walter and
                 Donald P. Greenberg",
  title =        "Interactive global illumination in dynamic scenes",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "537--546",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Debevec:2002:LRA,
  author =       "Paul Debevec and Andreas Wenger and Chris Tchou and
                 Andrew Gardner and Jamie Waese and Tim Hawkins",
  title =        "A lighting reproduction approach to live-action
                 compositing",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "547--556",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Stamminger:2002:PSM,
  author =       "Marc Stamminger and George Drettakis",
  title =        "Perspective shadow maps",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "557--562",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Pellacini:2002:UII,
  author =       "Fabio Pellacini and Parag Tole and Donald P.
                 Greenberg",
  title =        "A user interface for interactive cinematic shadow
                 design",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "563--566",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Duguet:2002:REV,
  author =       "Florent Duguet and George Drettakis",
  title =        "Robust epsilon visibility",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "567--575",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Jensen:2002:RHR,
  author =       "Henrik Wann Jensen and Juan Buhler",
  title =        "A rapid hierarchical rendering technique for
                 translucent materials",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "576--581",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{James:2002:DDR,
  author =       "Doug L. James and Dinesh K. Pai",
  title =        "{DyRT}: dynamic response textures for real time
                 deformation simulation with graphics hardware",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "582--585",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Capell:2002:ISD,
  author =       "Steve Capell and Seth Green and Brian Curless and Tom
                 Duchamp and Zoran Popovi{\'c}",
  title =        "Interactive skeleton-driven dynamic deformations",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "586--593",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bridson:2002:RTC,
  author =       "Robert Bridson and Ronald Fedkiw and John Anderson",
  title =        "Robust treatment of collisions, contact and friction
                 for cloth animation",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "594--603",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Choi:2002:SRC,
  author =       "Kwang-Jin Choi and Hyeong-Seok Ko",
  title =        "Stable but responsive cloth",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "604--611",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Allen:2002:ABD,
  author =       "Brett Allen and Brian Curless and Zoran Popovi{\'c}",
  title =        "Articulated body deformation from range scan data",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "612--619",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kim:2002:IMH,
  author =       "Tae-Yong Kim and Ulrich Neumann",
  title =        "Interactive multiresolution hair modeling and
                 editing",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "620--629",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Chen:2002:MRR,
  author =       "Yanyun Chen and Yingqing Xu and Baining Guo and
                 Heung-Yeung Shum",
  title =        "Modeling and rendering of realistic feathers",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "630--636",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lee:2002:EA,
  author =       "Sooha Park Lee and Jeremy B. Badler and Norman I.
                 Badler",
  title =        "Eyes alive",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "637--644",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Meehan:2002:PMP,
  author =       "Michael Meehan and Brent Insko and Mary Whitton and
                 Frederick P. {Brooks, Jr.}",
  title =        "Physiological measures of presence in stressful
                 virtual environments",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "645--652",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Brooks:2002:SSB,
  author =       "Stephen Brooks and Neil Dodgson",
  title =        "Self-similarity based texture editing",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "653--656",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kim:2002:JIM,
  author =       "Junhwan Kim and Fabio Pellacini",
  title =        "Jigsaw image mosaics",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "657--664",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tong:2002:SBT,
  author =       "Xin Tong and Jingdan Zhang and Ligang Liu and Xi Wang
                 and Baining Guo and Heung-Yeung Shum",
  title =        "Synthesis of bidirectional texture functions on
                 arbitrary surfaces",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "665--672",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Soler:2002:HPM,
  author =       "Cyril Soler and Marie-Paule Cani and Alexis
                 Angelidis",
  title =        "Hierarchical pattern mapping",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "673--680",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Perlin:2002:IN,
  author =       "Ken Perlin",
  title =        "Improving noise",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "681--682",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Deering:2002:SGA,
  author =       "Michael Deering and David Naegle",
  title =        "The {SAGE} graphics architecture",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "683--692",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Humphreys:2002:CSP,
  author =       "Greg Humphreys and Mike Houston and Ren Ng and Randall
                 Frank and Sean Ahern and Peter D. Kirchner and James T.
                 Klosowski",
  title =        "{Chromium}: a stream-processing framework for
                 interactive rendering on clusters",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "693--702",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Purcell:2002:RTP,
  author =       "Timothy J. Purcell and Ian Buck and William R. Mark
                 and Pat Hanrahan",
  title =        "Ray tracing on programmable graphics hardware",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "703--712",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lalonde:2002:SDC,
  author =       "Paul Lalonde and Eric Schenk",
  title =        "Shader-driven compilation of rendering assets",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "713--720",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Nguyen:2002:PBM,
  author =       "Duc Quang Nguyen and Ronald Fedkiw and Henrik Wann
                 Jensen",
  title =        "Physically based modeling and animation of fire",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "721--728",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lamorlette:2002:SMF,
  author =       "Arnauld Lamorlette and Nick Foster",
  title =        "Structural modeling of flames for a production
                 environment",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "729--735",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Enright:2002:ARC,
  author =       "Douglas Enright and Stephen Marschner and Ronald
                 Fedkiw",
  title =        "Animation and rendering of complex water surfaces",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "736--744",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{vanWijk:2002:IBF,
  author =       "Jarke J. van Wijk",
  title =        "Image based flow visualization",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "745--754",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kalnins:2002:WND,
  author =       "Robert D. Kalnins and Lee Markosian and Barbara J.
                 Meier and Michael A. Kowalski and Joseph C. Lee and
                 Philip L. Davidson and Matthew Webb and John F. Hughes
                 and Adam Finkelstein",
  title =        "{WYSIWYG NPR}: drawing strokes directly on {$3$D}
                 models",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "755--762",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{DeBry:2002:PRT,
  author =       "David (grue) DeBry and Jonathan Gibbs and Devorah
                 DeLeon Petty and Nate Robins",
  title =        "Painting and rendering textures on unparameterized
                 models",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "763--768",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{DeCarlo:2002:SAP,
  author =       "Doug DeCarlo and Anthony Santella",
  title =        "Stylization and abstraction of photographs",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "769--776",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Barrett:2002:OBI,
  author =       "William A. Barrett and Alan S. Cheney",
  title =        "Object-based image editing",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "777--784",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Benson:2002:OT,
  author =       "David Benson and Joel Davis",
  title =        "Octree textures",
  journal =      j-TOG,
  volume =       "21",
  number =       "3",
  pages =        "785--790",
  month =        jul,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:46 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Osada:2002:SD,
  author =       "Robert Osada and Thomas Funkhouser and Bernard
                 Chazelle and David Dobkin",
  title =        "Shape distributions",
  journal =      j-TOG,
  volume =       "21",
  number =       "4",
  pages =        "807--832",
  month =        oct,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:47 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bederson:2002:OQT,
  author =       "Benjamin B. Bederson and Ben Shneiderman and Martin
                 Wattenberg",
  title =        "Ordered and quantum treemaps: {Making} effective use
                 of {$2$D} space to display hierarchies",
  journal =      j-TOG,
  volume =       "21",
  number =       "4",
  pages =        "833--854",
  month =        oct,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:47 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Turk:2002:MIS,
  author =       "Greg Turk and James F. O'Brien",
  title =        "Modelling with implicit surfaces that interpolate",
  journal =      j-TOG,
  volume =       "21",
  number =       "4",
  pages =        "855--873",
  month =        oct,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:47 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sheffer:2002:SOG,
  author =       "Alla Sheffer and Eric de Sturler",
  title =        "Smoothing an overlay grid to minimize linear
                 distortion in texture mapping",
  journal =      j-TOG,
  volume =       "21",
  number =       "4",
  pages =        "874--890",
  month =        oct,
  year =         "2002",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Nov 23 17:40:47 MST 2002",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hodgins:2003:E,
  author =       "Jessica Hodgins",
  title =        "Editorial",
  journal =      j-TOG,
  volume =       "22",
  number =       "1",
  pages =        "1--1",
  month =        jan,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 9 17:43:28 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hart:2003:Ea,
  author =       "John C. Hart",
  title =        "Editorial",
  journal =      j-TOG,
  volume =       "22",
  number =       "1",
  pages =        "2--2",
  month =        jan,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 9 17:43:28 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{TOPLASStaff:2003:LR,
  author =       "{TOPLAS Staff}",
  title =        "List of reviewers",
  journal =      j-TOG,
  volume =       "22",
  number =       "1",
  pages =        "3--3",
  month =        jan,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 9 17:43:28 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bajaj:2003:ADS,
  author =       "Chandrajit L. Bajaj and Guoliang Xu",
  title =        "Anisotropic diffusion of surfaces and functions on
                 surfaces",
  journal =      j-TOG,
  volume =       "22",
  number =       "1",
  pages =        "4--32",
  month =        jan,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 9 17:43:28 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Freeman:2003:LST,
  author =       "William T. Freeman and Joshua B. Tenenbaum and Egon C.
                 Pasztor",
  title =        "Learning style translation for the lines of a
                 drawing",
  journal =      j-TOG,
  volume =       "22",
  number =       "1",
  pages =        "33--46",
  month =        jan,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 9 17:43:28 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{James:2003:MGF,
  author =       "Doug L. James and Dinesh K. Pai",
  title =        "Multiresolution {Green}'s function methods for
                 interactive simulation of large-scale elastostatic
                 objects",
  journal =      j-TOG,
  volume =       "22",
  number =       "1",
  pages =        "47--82",
  month =        jan,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 9 17:43:28 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Funkhouser:2003:SEM,
  author =       "Thomas Funkhouser and Patrick Min and Michael Kazhdan
                 and Joyce Chen and Alex Halderman and David Dobkin and
                 David Jacobs",
  title =        "A search engine for {$3$D} models",
  journal =      j-TOG,
  volume =       "22",
  number =       "1",
  pages =        "83--105",
  month =        jan,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 9 17:43:28 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kry:2003:CCS,
  author =       "Paul G. Kry and Dinesh K. Pai",
  title =        "Continuous contact simulation for smooth surfaces",
  journal =      j-TOG,
  volume =       "22",
  number =       "1",
  pages =        "106--129",
  month =        jan,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 9 17:43:28 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Shamir:2003:CBA,
  author =       "Ariel Shamir",
  title =        "Constraint-based approach for automatic hinting of
                 digital typefaces",
  journal =      j-TOG,
  volume =       "22",
  number =       "2",
  pages =        "131--151",
  month =        apr,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 9 17:43:29 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The rasterization process of characters from digital
                 outline fonts to bitmaps on displays must include
                 additional information in the form of hints beside the
                 shape of characters in order to produce high quality
                 bitmaps. Hints describe constraints on sizes and shapes
                 inside characters and across the font that should be
                 preserved during rasterization. We describe a novel,
                 fast and fully automatic method for adding those hints
                 to characters. The method is based on identifying
                 hinting situations inside characters. It includes
                 gathering global font information and linking it to
                 characters, defining a set of constraints, sorting
                 them, and converting them to hints in any known hinting
                 technology (PostScript, TrueType or other). Our scheme
                 is general enough to be applied on any language and on
                 complex scripts such as Chinese Japanese and Korean.
                 Although still inferior to expert manual hinting, our
                 method produces high quality bitmaps which approach
                 this goal. The method can also be used as a solid base
                 for further hinting refinements done manually.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Dumont:2003:PDD,
  author =       "Reynald Dumont and Fabio Pellacini and James A.
                 Ferwerda",
  title =        "Perceptually-driven decision theory for interactive
                 realistic rendering",
  journal =      j-TOG,
  volume =       "22",
  number =       "2",
  pages =        "152--181",
  month =        apr,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 9 17:43:29 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Choi:2003:PBL,
  author =       "Min Gyu Choi and Jehee Lee and Sung Yong Shin",
  title =        "Planning biped locomotion using motion capture data
                 and probabilistic roadmaps",
  journal =      j-TOG,
  volume =       "22",
  number =       "2",
  pages =        "182--203",
  month =        apr,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 9 17:43:29 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Soler:2003:EIA,
  author =       "Cyril Soler and Fran{\c{c}}ois X. Sillion and
                 Fr{\'e}d{\'e}ric Blaise and Philippe Dereffye",
  title =        "An efficient instantiation algorithm for simulating
                 radiant energy transfer in plant models",
  journal =      j-TOG,
  volume =       "22",
  number =       "2",
  pages =        "204--233",
  month =        apr,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 9 17:43:29 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lensch:2003:IBR,
  author =       "Hendrik P. A. Lensch and Jan Kautz and Michael Goesele
                 and Wolfgang Heidrich and Hans-Peter Seidel",
  title =        "Image-based reconstruction of spatial appearance and
                 geometric detail",
  journal =      j-TOG,
  volume =       "22",
  number =       "2",
  pages =        "234--257",
  month =        apr,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 9 17:43:29 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Spencer:2003:EAS,
  author =       "Stephen N. Spencer",
  title =        "Errata: {ACM SIGGRAPH 2002 Papers}",
  journal =      j-TOG,
  volume =       "22",
  number =       "2",
  pages =        "258--258",
  month =        apr,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 9 17:43:29 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kwatra:2003:GTI,
  author =       "Vivek Kwatra and Arno Sch{\"o}dl and Irfan Essa and
                 Greg Turk and Aaron Bobick",
  title =        "Graphcut textures: image and video synthesis using
                 graph cuts",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "277--286",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Cohen:2003:WTI,
  author =       "Michael F. Cohen and Jonathan Shade and Stefan Hiller
                 and Oliver Deussen",
  title =        "{Wang Tiles} for image and texture generation",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "287--294",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zhang:2003:SPV,
  author =       "Jingdan Zhang and Kun Zhou and Luiz Velho and Baining
                 Guo and Heung-Yeung Shum",
  title =        "Synthesis of progressively-variant textures on
                 arbitrary surfaces",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "295--302",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Drori:2003:FBI,
  author =       "Iddo Drori and Daniel Cohen-Or and Hezy Yeshurun",
  title =        "Fragment-based image completion",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "303--312",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Perez:2003:PIE,
  author =       "Patrick P{\'e}rez and Michel Gangnet and Andrew
                 Blake",
  title =        "{Poisson} image editing",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "313--318",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kang:2003:HDR,
  author =       "Sing Bing Kang and Matthew Uyttendaele and Simon
                 Winder and Richard Szeliski",
  title =        "High dynamic range video",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "319--325",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kraevoy:2003:MCC,
  author =       "Vladislav Kraevoy and Alla Sheffer and Craig Gotsman",
  title =        "Matchmaker: constructing constrained texture maps",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "326--333",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wang:2003:VDD,
  author =       "Lifeng Wang and Xi Wang and Xin Tong and Stephen Lin
                 and Shimin Hu and Baining Guo and Heung-Yeung Shum",
  title =        "View-dependent displacement mapping",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "334--339",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Praun:2003:SPR,
  author =       "Emil Praun and Hugues Hoppe",
  title =        "Spherical parametrization and remeshing",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "340--349",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Khodakovsky:2003:GSP,
  author =       "Andrei Khodakovsky and Nathan Litke and Peter
                 Schr{\"o}der",
  title =        "Globally smooth parameterizations with low
                 distortion",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "350--357",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Gotsman:2003:FSP,
  author =       "Craig Gotsman and Xianfeng Gu and Alla Sheffer",
  title =        "Fundamentals of spherical parameterization for {$3$D}
                 meshes",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "358--363",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Levy:2003:DDE,
  author =       "Bruno L{\'e}vy",
  title =        "Dual domain extrapolation",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "364--369",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sloan:2003:BSR,
  author =       "Peter-Pike Sloan and Xinguo Liu and Heung-Yeung Shum
                 and John Snyder",
  title =        "Bi-scale radiance transfer",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "370--375",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ng:2003:AFS,
  author =       "Ren Ng and Ravi Ramamoorthi and Pat Hanrahan",
  title =        "All-frequency shadows using non-linear wavelet
                 lighting approximation",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "376--381",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sloan:2003:CPC,
  author =       "Peter-Pike Sloan and Jesse Hall and John Hart and John
                 Snyder",
  title =        "Clustered principal components for precomputed
                 radiance transfer",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "382--391",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kim:2003:RMS,
  author =       "Tae-hoon Kim and Sang Il Park and Sung Yong Shin",
  title =        "Rhythmic-motion synthesis based on motion-beat
                 analysis",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "392--401",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Arikan:2003:MSA,
  author =       "Okan Arikan and David A. Forsyth and James F.
                 O'Brien",
  title =        "Motion synthesis from annotations",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "402--408",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Dontcheva:2003:LAC,
  author =       "Mira Dontcheva and Gary Yngve and Zoran Popovi{\'c}",
  title =        "Layered acting for character animation",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "409--416",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Fang:2003:ESP,
  author =       "Anthony C. Fang and Nancy S. Pollard",
  title =        "Efficient synthesis of physically valid human motion",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "417--426",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hersch:2003:RCI,
  author =       "Roger D. Hersch and Fabien Collaud and Patrick Emmel",
  title =        "Reproducing color images with embedded metallic
                 patterns",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "427--434",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zhou:2003:IMT,
  author =       "Bingfeng Zhou and Xifeng Fang",
  title =        "Improving mid-tone quality of variable-coefficient
                 error diffusion using threshold modulation",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "437--444",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tong:2003:DMV,
  author =       "Yiying Tong and Santiago Lombeyda and Anil N. Hirani
                 and Mathieu Desbrun",
  title =        "Discrete multiscale vector field decomposition",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "445--452",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Munzner:2003:TST,
  author =       "Tamara Munzner and Fran{\c{c}}ois Guimbreti{\`e}re and
                 Serdar Tasiran and Li Zhang and Yunhong Zhou",
  title =        "{TreeJuxtaposer}: scalable tree comparison using
                 {Focus+Context} with guaranteed visibility",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "453--462",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ohtake:2003:MLP,
  author =       "Yutaka Ohtake and Alexander Belyaev and Marc Alexa and
                 Greg Turk and Hans-Peter Seidel",
  title =        "Multi-level partition of unity implicits",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "463--470",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lee:2003:PEC,
  author =       "Haeyoung Lee and Mathieu Desbrun and Peter
                 Schr{\"o}der",
  title =        "Progressive encoding of complex isosurfaces",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "471--476",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sederberg:2003:SN,
  author =       "Thomas W. Sederberg and Jianmin Zheng and Almaz
                 Bakenov and Ahmad Nasri",
  title =        "{T}-splines and {T}-{NURCC}s",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "477--484",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Alliez:2003:APR,
  author =       "Pierre Alliez and David Cohen-Steiner and Olivier
                 Devillers and Bruno L{\'e}vy and Mathieu Desbrun",
  title =        "Anisotropic polygonal remeshing",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "485--493",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Chuang:2003:SMC,
  author =       "Yung-Yu Chuang and Dan B. Goldman and Brian Curless
                 and David H. Salesin and Richard Szeliski",
  title =        "Shadow matting and compositing",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "494--500",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Govindaraju:2003:ISG,
  author =       "Naga K. Govindaraju and Brandon Lloyd and Sung-Eui
                 Yoon and Avneesh Sud and Dinesh Manocha",
  title =        "Interactive shadow generation in complex
                 environments",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "501--510",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Assarsson:2003:GBS,
  author =       "Ulf Assarsson and Tomas Akenine-M{\"o}ller",
  title =        "A geometry-based soft shadow volume algorithm using
                 graphics hardware",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "511--520",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sen:2003:SSM,
  author =       "Pradeep Sen and Mike Cammarano and Pat Hanrahan",
  title =        "Shadow silhouette maps",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "521--526",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{OSullivan:2003:EVF,
  author =       "Carol O'Sullivan and John Dingliana and Thanh Giang
                 and Mary K. Kaiser",
  title =        "Evaluating the visual fidelity of physically based
                 animations",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "527--536",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Reitsma:2003:PMC,
  author =       "Paul S. A. Reitsma and Nancy S. Pollard",
  title =        "Perceptual metrics for character animation:
                 sensitivity to errors in ballistic motion",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "537--542",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Otaduy:2003:SPS,
  author =       "Miguel A. Otaduy and Ming C. Lin",
  title =        "Sensation preserving simplification for haptic
                 rendering",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "543--553",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kahler:2003:RDR,
  author =       "Kolja K{\"a}hler and J{\"o}rg Haber and Hans-Peter
                 Seidel",
  title =        "Reanimating the dead: reconstruction of expressive
                 faces from skull data",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "554--561",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Mohr:2003:BEA,
  author =       "Alex Mohr and Michael Gleicher",
  title =        "Building efficient, accurate character skins from
                 examples",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "562--568",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Carranza:2003:FVV,
  author =       "Joel Carranza and Christian Theobalt and Marcus A.
                 Magnor and Hans-Peter Seidel",
  title =        "Free-viewpoint video of human actors",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "569--577",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sand:2003:CCS,
  author =       "Peter Sand and Leonard McMillan and Jovan
                 Popovi{\'c}",
  title =        "Continuous capture of skin deformation",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "578--586",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Allen:2003:SHB,
  author =       "Brett Allen and Brian Curless and Zoran Popovi{\'c}",
  title =        "The space of human body shapes: reconstruction and
                 parameterization from range scans",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "587--594",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Leyvand:2003:RSF,
  author =       "Tommer Leyvand and Olga Sorkine and Daniel Cohen-Or",
  title =        "Ray space factorization for from-region visibility",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "595--604",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Agarwal:2003:SIS,
  author =       "Sameer Agarwal and Ravi Ramamoorthi and Serge Belongie
                 and Henrik Wann Jensen",
  title =        "Structured importance sampling of environment maps",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "605--612",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Masselus:2003:RIL,
  author =       "Vincent Masselus and Pieter Peers and Philip Dutr{\'e}
                 and Yves D. Willems",
  title =        "Relighting with {$4$D} incident light fields",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "613--620",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Goesele:2003:ALS,
  author =       "Michael Goesele and Xavier Granier and Wolfgang
                 Heidrich and Hans-Peter Seidel",
  title =        "Accurate light source acquisition and rendering",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "621--630",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bala:2003:CEP,
  author =       "Kavita Bala and Bruce Walter and Donald P. Greenberg",
  title =        "Combining edges and points for interactive
                 high-quality rendering",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "631--640",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Pauly:2003:SMP,
  author =       "Mark Pauly and Richard Keiser and Leif P. Kobbelt and
                 Markus Gross",
  title =        "Shape modeling with point-sampled geometry",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "641--650",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Adams:2003:IBO,
  author =       "Bart Adams and Philip Dutr{\'e}",
  title =        "Interactive boolean operations on surfel-bounded
                 solids",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "651--656",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Dachsbacher:2003:SPT,
  author =       "Carsten Dachsbacher and Christian Vogelgsang and Marc
                 Stamminger",
  title =        "Sequential point trees",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "657--662",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Llamas:2003:TSW,
  author =       "Ignacio Llamas and Byungmoon Kim and Joshua Gargus and
                 Jarek Rossignac and Chris D. Shaw",
  title =        "Twister: a space-warp operator for the two-handed
                 editing of {$3$D} shapes",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "663--668",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wonka:2003:IA,
  author =       "Peter Wonka and Michael Wimmer and Fran{\c{c}}ois
                 Sillion and William Ribarsky",
  title =        "Instant architecture",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "669--677",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wilson:2003:SCE,
  author =       "Andrew Wilson and Dinesh Manocha",
  title =        "Simplifying complex environments using incremental
                 textured depth meshes",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "678--688",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Decoret:2003:BCE,
  author =       "Xavier D{\'e}coret and Fr{\'e}do Durand and
                 Fran{\c{c}}ois X. Sillion and Julie Dorsey",
  title =        "Billboard clouds for extreme model simplification",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "689--696",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Igarashi:2003:CM,
  author =       "Takeo Igarashi and John F. Hughes",
  title =        "Clothing manipulation",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "697--697",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tsang:2003:BCS,
  author =       "Michael Tsang and George W. Fitzmzurice and Gordon
                 Kurtenbach and Azam Khan and Bill Buxton",
  title =        "Boom chameleon: simultaneous capture of {$3$D}
                 viewpoint, voice and gesture annotations on a
                 spatially-aware display",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "698--698",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Anonymous:2003:AWC,
  author =       "Anonymous",
  title =        "The actuated workbench: computer-controlled actuation
                 in tabletop tangible interfaces",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "699--699",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Niederauer:2003:NII,
  author =       "Christopher Niederauer and Mike Houston and Maneesh
                 Agrawala and Greg Humphreys",
  title =        "Non-invasive interactive visualization of dynamic
                 architectural environments",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "700--700",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lok:2003:IDR,
  author =       "Benjamin Lok and Samir Naik and Mary Whitton and
                 Frederick P. Brooks",
  title =        "Incorporating dynamic real objects into immersive
                 virtual environments",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "701--701",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Gleicher:2003:STM,
  author =       "Michael Gleicher and Hyun Joon Shin and Lucas Kovar
                 and Andrew Jepsen",
  title =        "Snap-together motion: assembling run-time animations",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "702--702",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Rasmussen:2003:SSL,
  author =       "Nick Rasmussen and Duc Quang Nguyen and Willi Geiger
                 and Ronald Fedkiw",
  title =        "Smoke simulation for large scale phenomena",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "703--707",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Feldman:2003:ASP,
  author =       "Bryan E. Feldman and James F. O'Brien and Okan
                 Arikan",
  title =        "Animating suspended particle explosions",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "708--715",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Treuille:2003:KCS,
  author =       "Adrien Treuille and Antoine McNamara and Zoran
                 Popovi{\'c} and Jos Stam",
  title =        "Keyframe control of smoke simulations",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "716--723",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Stam:2003:FSA,
  author =       "Jos Stam",
  title =        "Flows on surfaces of arbitrary topology",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "724--731",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Dobashi:2003:RTR,
  author =       "Yoshinori Dobashi and Tsuyoshi Yamamoto and Tomoyuki
                 Nishita",
  title =        "Real-time rendering of aerodynamic sound using sound
                 textures based on computational fluid dynamics",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "732--740",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Han:2003:MBT,
  author =       "Jefferson Y. Han and Ken Perlin",
  title =        "Measuring bidirectional texture reflectance with a
                 kaleidoscope",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "741--748",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Gardner:2003:LLS,
  author =       "Andrew Gardner and Chris Tchou and Tim Hawkins and
                 Paul Debevec",
  title =        "Linear light source reflectometry",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "749--758",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Matusik:2003:DDR,
  author =       "Wojciech Matusik and Hanspeter Pfister and Matt Brand
                 and Leonard McMillan",
  title =        "A data-driven reflectance model",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "759--769",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tsumura:2003:IBS,
  author =       "Norimichi Tsumura and Nobutoshi Ojima and Kayoko Sato
                 and Mitsuhiro Shiraishi and Hideto Shimizu and Hirohide
                 Nabeshima and Syuuichi Akazaki and Kimihiko Hori and
                 Yoichi Miyake",
  title =        "Image-based skin color and texture analysis\slash
                 synthesis by extracting hemoglobin and melanin
                 information in the skin",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "770--779",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Marschner:2003:LSH,
  author =       "Stephen R. Marschner and Henrik Wann Jensen and Mike
                 Cammarano and Steve Worley and Pat Hanrahan",
  title =        "Light scattering from human hair fibers",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "780--791",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Aila:2003:DSG,
  author =       "Timo Aila and Ville Miettinen and Petri Nordlund",
  title =        "Delay streams for graphics hardware",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "792--800",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Akenine-Moller:2003:GMH,
  author =       "Tomas Akenine-M{\"o}ller and Jacob Str{\"o}m",
  title =        "Graphics for the masses: a hardware rasterization
                 architecture for mobile phones",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "801--808",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Raskar:2003:IGA,
  author =       "Ramesh Raskar and Jeroen van Baar and Paul Beardsley
                 and Thomas Willwacher and Srinivas Rao and Clifton
                 Forlines",
  title =        "{iLamps}: geometrically aware and self-configuring
                 projectors",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "809--818",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Gross:2003:BCS,
  author =       "Markus Gross and Stephan W{\"u}rmlin and Martin Naef
                 and Edouard Lamboray and Christian Spagno and Andreas
                 Kunz and Esther Koller-Meier and Tomas Svoboda and Luc
                 Van Gool and Silke Lang and Kai Strehlke and Andrew
                 Vande Moere and Oliver Staadt",
  title =        "blue-c: a spatially immersive display and {$3$D} video
                 portal for telepresence",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "819--827",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Agrawala:2003:DES,
  author =       "Maneesh Agrawala and Doantam Phan and Julie Heiser and
                 John Haymaker and Jeff Klingner and Pat Hanrahan and
                 Barbara Tversky",
  title =        "Designing effective step-by-step assembly
                 instructions",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "828--837",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Jacobs:2003:AGB,
  author =       "Charles Jacobs and Wilmot Li and Evan Schrier and
                 David Bargeron and David Salesin",
  title =        "Adaptive grid-based document layout",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "838--847",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{DeCarlo:2003:SCC,
  author =       "Doug DeCarlo and Adam Finkelstein and Szymon
                 Rusinkiewicz and Anthony Santella",
  title =        "Suggestive contours for conveying shape",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "848--855",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kalnins:2003:CSS,
  author =       "Robert D. Kalnins and Philip L. Davidson and Lee
                 Markosian and Adam Finkelstein",
  title =        "Coherent stylized silhouettes",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "856--861",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Baraff:2003:UC,
  author =       "David Baraff and Andrew Witkin and Michael Kass",
  title =        "Untangling cloth",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "862--870",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Guendelman:2003:NRB,
  author =       "Eran Guendelman and Robert Bridson and Ronald Fedkiw",
  title =        "Nonconvex rigid bodies with stacking",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "871--878",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{James:2003:PID,
  author =       "Doug L. James and Kayvon Fatahalian",
  title =        "Precomputing interactive dynamic deformable scenes",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "879--887",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wu:2003:RMB,
  author =       "Jia-chi Wu and Zoran Popovi{\'c}",
  title =        "Realistic modeling of bird flight animations",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "888--895",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Mark:2003:CSP,
  author =       "William R. Mark and R. Steven Glanville and Kurt
                 Akeley and Mark J. Kilgard",
  title =        "Cg: a system for programming graphics hardware in a
                 {C-like} language",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "896--907",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kruger:2003:LAO,
  author =       "Jens Kr{\"u}ger and R{\"u}diger Westermann",
  title =        "Linear algebra operators for {GPU} implementation of
                 numerical algorithms",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "908--916",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bolz:2003:SMS,
  author =       "Jeff Bolz and Ian Farmer and Eitan Grinspun and Peter
                 Schr{\"o}der",
  title =        "Sparse matrix solvers on the {GPU}: conjugate
                 gradients and multigrid",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "917--924",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hillesland:2003:NOF,
  author =       "Karl E. Hillesland and Sergey Molinov and Radek
                 Grzeszczuk",
  title =        "Nonlinear optimization framework for image-based
                 modeling on programmable graphics hardware",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "925--934",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Isenburg:2003:CCG,
  author =       "Martin Isenburg and Stefan Gumhold",
  title =        "Out-of-core compression for gigantic polygon meshes",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "935--942",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Jones:2003:NIF,
  author =       "Thouis R. Jones and Fr{\'e}do Durand and Mathieu
                 Desbrun",
  title =        "Non-iterative, feature-preserving mesh smoothing",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "943--949",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Fleishman:2003:BMD,
  author =       "Shachar Fleishman and Iddo Drori and Daniel Cohen-Or",
  title =        "Bilateral mesh denoising",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "950--953",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Katz:2003:HMD,
  author =       "Sagi Katz and Ayellet Tal",
  title =        "Hierarchical mesh decomposition using fuzzy clustering
                 and cuts",
  journal =      j-TOG,
  volume =       "22",
  number =       "3",
  pages =        "954--961",
  month =        jul,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:37 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hart:2003:Eb,
  author =       "John C. Hart",
  title =        "Editorial",
  journal =      j-TOG,
  volume =       "22",
  number =       "4",
  pages =        "981--981",
  month =        oct,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:39 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Attene:2003:SRT,
  author =       "Marco Attene and Bianca Falcidieno and Michela
                 Spagnuolo and Jarek Rossignac",
  title =        "{SwingWrapper}: {Retiling} triangle meshes for better
                 edgebreaker compression",
  journal =      j-TOG,
  volume =       "22",
  number =       "4",
  pages =        "982--996",
  month =        oct,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:39 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Fleishman:2003:PPS,
  author =       "Shachar Fleishman and Daniel Cohen-Or and Marc Alexa
                 and Cl{\'a}udio T. Silva",
  title =        "Progressive point set surfaces",
  journal =      j-TOG,
  volume =       "22",
  number =       "4",
  pages =        "997--1011",
  month =        oct,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:39 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tasdizen:2003:GSP,
  author =       "Tolga Tasdizen and Ross Whitaker and Paul Burchard and
                 Stanley Osher",
  title =        "Geometric surface processing via normal maps",
  journal =      j-TOG,
  volume =       "22",
  number =       "4",
  pages =        "1012--1033",
  month =        oct,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:39 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Popovic:2003:MSC,
  author =       "Jovan Popovi{\'c} and Steven M. Seitz and Michael
                 Erdmann",
  title =        "Motion sketching for control of rigid-body
                 simulations",
  journal =      j-TOG,
  volume =       "22",
  number =       "4",
  pages =        "1034--1054",
  month =        oct,
  year =         "2003",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Sat Oct 25 10:10:39 MDT 2003",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bradshaw:2004:AMA,
  author =       "Gareth Bradshaw and Carol O'Sullivan",
  title =        "Adaptive medial-axis approximation for sphere-tree
                 construction",
  journal =      j-TOG,
  volume =       "23",
  number =       "1",
  pages =        "1--26",
  month =        jan,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jan 28 17:10:23 MST 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Gooch:2004:HFI,
  author =       "Bruce Gooch and Erik Reinhard and Amy Gooch",
  title =        "Human facial illustrations: {Creation} and
                 psychophysical evaluation",
  journal =      j-TOG,
  volume =       "23",
  number =       "1",
  pages =        "27--44",
  month =        jan,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jan 28 17:10:23 MST 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Goldfeather:2004:NCO,
  author =       "Jack Goldfeather and Victoria Interrante",
  title =        "A novel cubic-order algorithm for approximating
                 principal direction vectors",
  journal =      j-TOG,
  volume =       "23",
  number =       "1",
  pages =        "45--63",
  month =        jan,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jan 28 17:10:23 MST 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Healey:2004:PBB,
  author =       "Christopher G. Healey and Laura Tateosian and James T.
                 Enns and Mark Remple",
  title =        "Perceptually based brush strokes for nonphotorealistic
                 visualization",
  journal =      j-TOG,
  volume =       "23",
  number =       "1",
  pages =        "64--96",
  month =        jan,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jan 28 17:10:23 MST 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kaplan:2004:ISP,
  author =       "Craig S. Kaplan and David H. Salesin",
  title =        "{Islamic} star patterns in absolute geometry",
  journal =      j-TOG,
  volume =       "23",
  number =       "2",
  pages =        "97--119",
  month =        apr,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu May 20 13:45:19 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hao:2004:RTR,
  author =       "Xuejun Hao and Amitabh Varshney",
  title =        "Real-time rendering of translucent meshes",
  journal =      j-TOG,
  volume =       "23",
  number =       "2",
  pages =        "120--142",
  month =        apr,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu May 20 13:45:19 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Shum:2004:PLF,
  author =       "Heung-Yeung Shum and Jian Sun and Shuntaro Yamazaki
                 and Yin Li and Chi-Keung Tang",
  title =        "Pop-up light field: {An} interactive image-based
                 modeling and rendering system",
  journal =      j-TOG,
  volume =       "23",
  number =       "2",
  pages =        "143--162",
  month =        apr,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu May 20 13:45:19 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Granier:2004:FRA,
  author =       "Xavier Granier and George Drettakis",
  title =        "A final reconstruction approach for a unified global
                 illumination algorithm",
  journal =      j-TOG,
  volume =       "23",
  number =       "2",
  pages =        "163--189",
  month =        apr,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu May 20 13:45:19 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wood:2004:RET,
  author =       "Zo{\"e} Wood and Hugues Hoppe and Mathieu Desbrun and
                 Peter Schr{\"o}der",
  title =        "Removing excess topology from isosurfaces",
  journal =      j-TOG,
  volume =       "23",
  number =       "2",
  pages =        "190--208",
  month =        apr,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu May 20 13:45:19 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Guy:2004:GGR,
  author =       "Stephane Guy and Cyril Soler",
  title =        "Graphics gems revisited: fast and physically-based
                 rendering of gemstones",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "231--238",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hersch:2004:BMI,
  author =       "Roger David Hersch and Sylvain Chosson",
  title =        "Band moir{\'e} images",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "239--247",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tsingos:2004:PAR,
  author =       "Nicolas Tsingos and Emmanuel Gallo and George
                 Drettakis",
  title =        "Perceptual audio rendering of complex virtual
                 environments",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "249--258",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Mitani:2004:MPT,
  author =       "Jun Mitani and Hiromasa Suzuki",
  title =        "Making papercraft toys from meshes using strip-based
                 approximate unfolding",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "259--263",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Amenta:2004:DPS,
  author =       "Nina Amenta and Yong Joo Kil",
  title =        "Defining point-set surfaces",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "264--270",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ying:2004:SMB,
  author =       "Lexing Ying and Denis Zorin",
  title =        "A simple manifold-based construction of surfaces of
                 arbitrary smoothness",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "271--275",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sederberg:2004:SSL,
  author =       "Thomas W. Sederberg and David L. Cardon and G. Thomas
                 Finnigan and Nicholas S. North and Jianmin Zheng and
                 Tom Lyche",
  title =        "{T}-spline simplification and local refinement",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "276--283",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hofer:2004:EMS,
  author =       "Michael Hofer and Helmut Pottmann",
  title =        "Energy-minimizing splines in manifolds",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "284--293",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Agarwala:2004:IDP,
  author =       "Aseem Agarwala and Mira Dontcheva and Maneesh Agrawala
                 and Steven Drucker and Alex Colburn and Brian Curless
                 and David Salesin and Michael Cohen",
  title =        "Interactive digital photomontage",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "294--302",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Li:2004:LS,
  author =       "Yin Li and Jian Sun and Chi-Keung Tang and Heung-Yeung
                 Shum",
  title =        "Lazy snapping",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "303--308",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Rother:2004:GIF,
  author =       "Carsten Rother and Vladimir Kolmogorov and Andrew
                 Blake",
  title =        "{``GrabCut''}: interactive foreground extraction using
                 iterated graph cuts",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "309--314",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sun:2004:PM,
  author =       "Jian Sun and Jiaya Jia and Chi-Keung Tang and
                 Heung-Yeung Shum",
  title =        "{Poisson} matting",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "315--321",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Owada:2004:VID,
  author =       "Shigeru Owada and Frank Nielsen and Makoto Okabe and
                 Takeo Igarashi",
  title =        "Volumetric illustration: designing {$3$D} models with
                 internal textures",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "322--328",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Jagnow:2004:STS,
  author =       "Robert Jagnow and Julie Dorsey and Holly Rushmeier",
  title =        "Stereological techniques for solid textures",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "329--335",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Vasilescu:2004:TMI,
  author =       "M. Alex O. Vasilescu and Demetri Terzopoulos",
  title =        "{TensorTextures}: multilinear image-based rendering",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "336--342",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Chen:2004:STF,
  author =       "Yanyun Chen and Xin Tong and Jiaping Wang and Stephen
                 Lin and Baining Guo and Heung-Yeung Shum",
  title =        "Shell texture functions",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "343--353",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Fang:2004:TTS,
  author =       "Hui Fang and John C. Hart",
  title =        "Textureshop: texture synthesis as a photograph editing
                 tool",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "354--359",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bhat:2004:FBV,
  author =       "Kiran S. Bhat and Steven M. Seitz and Jessica K.
                 Hodgins and Pradeep K. Khosla",
  title =        "Flow-based video synthesis and editing",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "360--363",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wu:2004:FMD,
  author =       "Qing Wu and Yizhou Yu",
  title =        "Feature matching and deformation for texture
                 synthesis",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "364--367",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Liu:2004:NRT,
  author =       "Yanxi Liu and Wen-Chieh Lin and James Hays",
  title =        "Near-regular texture analysis and manipulation",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "368--376",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Carlson:2004:RFA,
  author =       "Mark Carlson and Peter J. Mucha and Greg Turk",
  title =        "Rigid fluid: animating the interplay between rigid
                 bodies and fluid",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "377--384",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Molino:2004:VNA,
  author =       "Neil Molino and Zhaosheng Bao and Ron Fedkiw",
  title =        "A virtual node algorithm for changing mesh topology
                 during simulation",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "385--392",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{James:2004:BTO,
  author =       "Doug L. James and Dinesh K. Pai",
  title =        "{BD-tree}: output-sensitive collision detection for
                 reduced deformable models",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "393--398",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sumner:2004:DTT,
  author =       "Robert W. Sumner and Jovan Popovi{\'c}",
  title =        "Deformation transfer for triangle meshes",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "399--405",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Raskar:2004:RLI,
  author =       "Ramesh Raskar and Paul Beardsley and Jeroen van Baar
                 and Yao Wang and Paul Dietz and Johnny Lee and Darren
                 Leigh and Thomas Willwacher",
  title =        "{RFIG} lamps: interacting with a self-describing world
                 via photosensing wireless tags and projectors",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "406--415",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lewis:2004:VAD,
  author =       "J. P. Lewis and Ruth Rosenholtz and Nickson Fong and
                 Ulrich Neumann",
  title =        "{VisualIDs}: automatic distinctive icons for desktop
                 interfaces",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "416--423",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Thorne:2004:MDI,
  author =       "Matthew Thorne and David Burke and Michiel van de
                 Panne",
  title =        "Motion doodles: an interface for sketching character
                 motion",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "424--431",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{LaViola:2004:MSC,
  author =       "Joseph J. {LaViola, Jr.} and Robert C. Zeleznik",
  title =        "{MathPad$^2$}: a system for the creation and
                 exploration of mathematical sketches",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "432--440",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Fattal:2004:TDS,
  author =       "Raanan Fattal and Dani Lischinski",
  title =        "Target-driven smoke animation",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "441--448",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{McNamara:2004:FCU,
  author =       "Antoine McNamara and Adrien Treuille and Zoran
                 Popovi{\'c} and Jos Stam",
  title =        "Fluid control using the adjoint method",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "449--456",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Losasso:2004:SWS,
  author =       "Frank Losasso and Fr{\'e}d{\'e}ric Gibou and Ron
                 Fedkiw",
  title =        "Simulating water and smoke with an octree data
                 structure",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "457--462",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Goktekin:2004:MAV,
  author =       "Tolga G. Goktekin and Adam W. Bargteil and James F.
                 O'Brien",
  title =        "A method for animating viscoelastic fluids",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "463--468",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tabellion:2004:AGI,
  author =       "Eric Tabellion and Arnauld Lamorlette",
  title =        "An approximate global illumination system for computer
                 generated films",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "469--476",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ng:2004:TPW,
  author =       "Ren Ng and Ravi Ramamoorthi and Pat Hanrahan",
  title =        "Triple product wavelet integrals for all-frequency
                 relighting",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "477--487",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ostromoukhov:2004:FHI,
  author =       "Victor Ostromoukhov and Charles Donohue and
                 Pierre-Marc Jodoin",
  title =        "Fast hierarchical importance sampling with blue noise
                 properties",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "488--495",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lawrence:2004:EBI,
  author =       "Jason Lawrence and Szymon Rusinkiewicz and Ravi
                 Ramamoorthi",
  title =        "Efficient {BRDF} importance sampling using a factored
                 representation",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "496--505",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Stone:2004:SHC,
  author =       "Matthew Stone and Doug DeCarlo and Insuk Oh and
                 Christian Rodriguez and Adrian Stere and Alyssa Lees
                 and Chris Bregler",
  title =        "Speaking with hands: creating animated conversational
                 characters from recordings of human performance",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "506--513",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Safonova:2004:SPR,
  author =       "Alla Safonova and Jessica K. Hodgins and Nancy S.
                 Pollard",
  title =        "Synthesizing physically realistic human motion in
                 low-dimensional, behavior-specific spaces",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "514--521",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Grochow:2004:SBI,
  author =       "Keith Grochow and Steven L. Martin and Aaron Hertzmann
                 and Zoran Popovi{\'c}",
  title =        "Style-based inverse kinematics",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "522--531",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Yamane:2004:SAH,
  author =       "Katsu Yamane and James J. Kuffner and Jessica K.
                 Hodgins",
  title =        "Synthesizing animations of human manipulation tasks",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "532--539",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Theobalt:2004:PBT,
  author =       "Christian Theobalt and Irene Albrecht and J{\"o}rg
                 Haber and Marcus Magnor and Hans-Peter Seidel",
  title =        "Pitching a baseball: tracking high-speed motion with
                 multi-exposure images",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "540--547",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zhang:2004:SFH,
  author =       "Li Zhang and Noah Snavely and Brian Curless and Steven
                 M. Seitz",
  title =        "Spacetime faces: high resolution capture for modeling
                 and animation",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "548--558",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kovar:2004:AEP,
  author =       "Lucas Kovar and Michael Gleicher",
  title =        "Automated extraction and parameterization of motions
                 in large data sets",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "559--568",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Harrison:2004:OLC,
  author =       "Jason Harrison and Ronald A. Rensink and Michiel van
                 de Panne",
  title =        "Obscuring length changes during animated motion",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "569--573",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wang:2004:VT,
  author =       "Jue Wang and Yingqing Xu and Heung-Yeung Shum and
                 Michael F. Cohen",
  title =        "Video tooning",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "574--583",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Agarwala:2004:KBT,
  author =       "Aseem Agarwala and Aaron Hertzmann and David H.
                 Salesin and Steven M. Seitz",
  title =        "Keyframe-based tracking for rotoscoping and
                 animation",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "584--591",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sand:2004:VM,
  author =       "Peter Sand and Seth Teller",
  title =        "Video matching",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "592--599",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zitnick:2004:HQV,
  author =       "C. Lawrence Zitnick and Sing Bing Kang and Matthew
                 Uyttendaele and Simon Winder and Richard Szeliski",
  title =        "High-quality video view interpolation using a layered
                 representation",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "600--608",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ohtake:2004:RVL,
  author =       "Yutaka Ohtake and Alexander Belyaev and Hans-Peter
                 Seidel",
  title =        "Ridge-valley lines on meshes via implicit surface
                 fitting",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "609--612",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ni:2004:FMF,
  author =       "Xinlai Ni and Michael Garland and John C. Hart",
  title =        "Fair {Morse} functions for extracting the topological
                 structure of a surface mesh",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "613--622",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kazhdan:2004:SMA,
  author =       "Michael Kazhdan and Thomas Funkhouser and Szymon
                 Rusinkiewicz",
  title =        "Shape matching and anisotropy",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "623--629",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Botsch:2004:IFR,
  author =       "Mario Botsch and Leif Kobbelt",
  title =        "An intuitive framework for real-time freeform
                 modeling",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "630--634",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Peng:2004:IMT,
  author =       "Jianbo Peng and Daniel Kristjansson and Denis Zorin",
  title =        "Interactive modeling of topologically complex
                 geometric detail",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "635--643",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Yu:2004:MEP,
  author =       "Yizhou Yu and Kun Zhou and Dong Xu and Xiaohan Shi and
                 Hujun Bao and Baining Guo and Heung-Yeung Shum",
  title =        "Mesh editing with {Poisson}-based gradient field
                 manipulation",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "644--651",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Funkhouser:2004:ME,
  author =       "Thomas Funkhouser and Michael Kazhdan and Philip
                 Shilane and Patrick Min and William Kiefer and Ayellet
                 Tal and Szymon Rusinkiewicz and David Dobkin",
  title =        "Modeling by example",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "652--663",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Petschnigg:2004:DPF,
  author =       "Georg Petschnigg and Richard Szeliski and Maneesh
                 Agrawala and Michael Cohen and Hugues Hoppe and Kentaro
                 Toyama",
  title =        "Digital photography with flash and no-flash image
                 pairs",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "664--672",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Eisemann:2004:FPE,
  author =       "Elmar Eisemann and Fr{\'e}do Durand",
  title =        "Flash photography enhancement via intrinsic
                 relighting",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "673--678",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Raskar:2004:NPC,
  author =       "Ramesh Raskar and Kar-Han Tan and Rogerio Feris and
                 Jingyi Yu and Matthew Turk",
  title =        "Non-photorealistic camera: depth edge detection and
                 stylized rendering using multi-flash imaging",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "679--688",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Levin:2004:CUO,
  author =       "Anat Levin and Dani Lischinski and Yair Weiss",
  title =        "Colorization using optimization",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "689--694",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Koller:2004:PIG,
  author =       "David Koller and Michael Turitzin and Marc Levoy and
                 Marco Tarini and Giuseppe Croccia and Paolo Cignoni and
                 Roberto Scopigno",
  title =        "Protected interactive {$3$D} graphics via remote
                 rendering",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "695--703",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Nishino:2004:ER,
  author =       "Ko Nishino and Shree K. Nayar",
  title =        "Eyes for relighting",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "704--711",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Paris:2004:CHG,
  author =       "Sylvain Paris and Hector M. Brice{\~n}o and
                 Fran{\c{c}}ois X. Sillion",
  title =        "Capture of hair geometry from multiple images",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "712--719",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Reche:2004:VRI,
  author =       "Alex Reche and Ignacio Martin and George Drettakis",
  title =        "Volumetric reconstruction and interactive rendering of
                 trees from photographs",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "720--727",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Saund:2004:PSI,
  author =       "Eric Saund and David Fleet and Daniel Larner and James
                 Mahoney",
  title =        "Perceptually-supported image editing of text and
                 graphics",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "728--728",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Cao:2004:VIT,
  author =       "Xiang Cao and Ravin Balakrishnan",
  title =        "{VisionWand}: interaction techniques for large
                 displays using a passive wand tracked in {$3$D}",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "729--729",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Fogarty:2004:GTO,
  author =       "James Fogarty and Scott E. Hudson",
  title =        "{GADGET}: a toolkit for optimization-based approaches
                 to interface and display generation",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "730--730",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hachet:2004:CEI,
  author =       "Martin Hachet and Pascal Guitton and Patrick Reuter
                 and Florence Tyndiuk",
  title =        "The {CAT} for efficient {$2$D} and {$3$D} interaction
                 as an alternative to mouse adaptations",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "731--731",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Nagahara:2004:SWV,
  author =       "Hajime Nagahara and Yasushi Yagi and Masahiko
                 Yachida",
  title =        "Super wide viewer using catadioptrical optics",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "732--732",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Mantiuk:2004:PMH,
  author =       "Rafal Mantiuk and Grzegorz Krawczyk and Karol
                 Myszkowski and Hans-Peter Seidel",
  title =        "Perception-motivated high dynamic range video
                 encoding",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "733--741",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Stokes:2004:PIC,
  author =       "William A. Stokes and James A. Ferwerda and Bruce
                 Walter and Donald P. Greenberg",
  title =        "Perceptual illumination components: a new approach to
                 efficient, high quality global illumination rendering",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "742--749",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Watson:2004:STC,
  author =       "Benjamin Watson and Neff Walker and Larry F. Hodges",
  title =        "Supra-threshold control of peripheral {LOD}",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "750--759",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Seetzen:2004:HDR,
  author =       "Helge Seetzen and Wolfgang Heidrich and Wolfgang
                 Stuerzlinger and Greg Ward and Lorne Whitehead and
                 Matthew Trentacoste and Abhijeet Ghosh and Andrejs
                 Vorozcovs",
  title =        "High dynamic range display systems",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "760--768",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Losasso:2004:GCT,
  author =       "Frank Losasso and Hugues Hoppe",
  title =        "Geometry clipmaps: terrain rendering using nested
                 regular grids",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "769--776",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Buck:2004:BGS,
  author =       "Ian Buck and Tim Foley and Daniel Horn and Jeremy
                 Sugerman and Kayvon Fatahalian and Mike Houston and Pat
                 Hanrahan",
  title =        "{Brook} for {GPUs}: stream computing on graphics
                 hardware",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "777--786",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{McCool:2004:SA,
  author =       "Michael McCool and Stefanus {Du Toit} and Tiberiu Popa
                 and Bryan Chan and Kevin Moule",
  title =        "Shader algebra",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "787--795",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Cignoni:2004:ATE,
  author =       "Paolo Cignoni and Fabio Ganovelli and Enrico Gobbetti
                 and Fabio Marton and Federico Ponchio and Roberto
                 Scopigno",
  title =        "Adaptive tetrapuzzles: efficient out-of-core
                 construction and visualization of gigantic
                 multiresolution polygonal models",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "796--803",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Akeley:2004:SDP,
  author =       "Kurt Akeley and Simon J. Watt and Ahna Reza Girshick
                 and Martin S. Banks",
  title =        "A stereo display prototype with multiple focal
                 distances",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "804--813",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Matusik:2004:TSS,
  author =       "Wojciech Matusik and Hanspeter Pfister",
  title =        "{$3$D} {TV}: a scalable system for real-time
                 acquisition, transmission, and autostereoscopic display
                 of dynamic scenes",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "814--824",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Levoy:2004:SAC,
  author =       "Marc Levoy and Billy Chen and Vaibhav Vaish and Mark
                 Horowitz and Ian McDowall and Mark Bolas",
  title =        "Synthetic aperture confocal imaging",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "825--834",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Goesele:2004:DAT,
  author =       "Michael Goesele and Hendrik P. A. Lensch and Jochen
                 Lang and Christian Fuchs and Hans-Peter Seidel",
  title =        "{DISCO}: acquisition of translucent objects",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "835--844",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Carr:2004:PD,
  author =       "Nathan A. Carr and John C. Hart",
  title =        "Painting detail",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "845--852",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tarini:2004:PM,
  author =       "Marco Tarini and Kai Hormann and Paolo Cignoni and
                 Claudio Montani",
  title =        "{PolyCube}-Maps",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "853--860",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kraevoy:2004:CPC,
  author =       "Vladislav Kraevoy and Alla Sheffer",
  title =        "Cross-parameterization and compatible remeshing of
                 {$3$D} models",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "861--869",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Schreiner:2004:ISM,
  author =       "John Schreiner and Arul Asirvatham and Emil Praun and
                 Hugues Hoppe",
  title =        "Inter-surface mapping",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "870--877",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sharf:2004:CBS,
  author =       "Andrei Sharf and Marc Alexa and Daniel Cohen-Or",
  title =        "Context-based surface completion",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "878--887",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ju:2004:RRP,
  author =       "Tao Ju",
  title =        "Robust repair of polygonal models",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "888--895",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Shen:2004:IAI,
  author =       "Chen Shen and James F. O'Brien and Jonathan R.
                 Shewchuk",
  title =        "Interpolating and approximating implicit surfaces from
                 polygon soup",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "896--904",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Cohen-Steiner:2004:VSA,
  author =       "David Cohen-Steiner and Pierre Alliez and Mathieu
                 Desbrun",
  title =        "Variational shape approximation",
  journal =      j-TOG,
  volume =       "23",
  number =       "3",
  pages =        "905--914",
  month =        aug,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:34 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hart:2004:E,
  author =       "John C. Hart",
  title =        "Editorial",
  journal =      j-TOG,
  volume =       "23",
  number =       "4",
  pages =        "929--929",
  month =        oct,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:35 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zelinka:2004:JMB,
  author =       "Steve Zelinka and Michael Garland",
  title =        "Jump map-based interactive texture synthesis",
  journal =      j-TOG,
  volume =       "23",
  number =       "4",
  pages =        "930--962",
  month =        oct,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:35 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Nayar:2004:LSD,
  author =       "Shree K. Nayar and Peter N. Belhumeur and Terry E.
                 Boult",
  title =        "Lighting sensitive display",
  journal =      j-TOG,
  volume =       "23",
  number =       "4",
  pages =        "963--979",
  month =        oct,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:35 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Peters:2004:CDS,
  author =       "J{\"o}rg Peters and Le-Jeng Shiue",
  title =        "Combining $4$- and $3$-direction subdivision",
  journal =      j-TOG,
  volume =       "23",
  number =       "4",
  pages =        "980--1003",
  month =        oct,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:35 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ramamoorthi:2004:SPF,
  author =       "Ravi Ramamoorthi and Pat Hanrahan",
  title =        "A signal-processing framework for reflection",
  journal =      j-TOG,
  volume =       "23",
  number =       "4",
  pages =        "1004--1042",
  month =        oct,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:35 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ivrissimtzis:2004:SRS,
  author =       "Ioannis P. Ivrissimtzis and Malcolm A. Sabin and Neil
                 A. Dodgson",
  title =        "On the support of recursive subdivision",
  journal =      j-TOG,
  volume =       "23",
  number =       "4",
  pages =        "1043--1060",
  month =        oct,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:35 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Friedel:2004:VNM,
  author =       "Ilja Friedel and Peter Schr{\"o}der and Andrei
                 Khodakovsky",
  title =        "Variational normal meshes",
  journal =      j-TOG,
  volume =       "23",
  number =       "4",
  pages =        "1061--1073",
  month =        oct,
  year =         "2004",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Oct 29 06:18:35 MDT 2004",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zhang:2005:FBS,
  author =       "Eugene Zhang and Konstantin Mischaikow and Greg Turk",
  title =        "Feature-based surface parameterization and texture
                 mapping",
  journal =      j-TOG,
  volume =       "24",
  number =       "1",
  pages =        "1--27",
  month =        jan,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Jan 13 08:44:14 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Schaefer:2005:TQS,
  author =       "Scott Schaefer and Joe Warren",
  title =        "On {$C^2$} triangle\slash quad subdivision",
  journal =      j-TOG,
  volume =       "24",
  number =       "1",
  pages =        "28--36",
  month =        jan,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Jan 13 08:44:14 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Baranoski:2005:SDA,
  author =       "Gladimir V. G. Baranoski and Justin Wan and Jon G.
                 Rokne and Ian Bell",
  title =        "Simulating the dynamics of auroral phenomena",
  journal =      j-TOG,
  volume =       "24",
  number =       "1",
  pages =        "37--59",
  month =        jan,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Jan 13 08:44:14 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ben-Chen:2005:OSC,
  author =       "Mirela Ben-Chen and Craig Gotsman",
  title =        "On the optimality of spectral compression of mesh
                 data",
  journal =      j-TOG,
  volume =       "24",
  number =       "1",
  pages =        "60--80",
  month =        jan,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Jan 13 08:44:14 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Song:2005:SNW,
  author =       "Oh-Young Song and Hyuncheol Shin and Hyeong-Seok Ko",
  title =        "Stable but nondissipative water",
  journal =      j-TOG,
  volume =       "24",
  number =       "1",
  pages =        "81--97",
  month =        jan,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Jan 13 08:44:14 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tak:2005:PBM,
  author =       "Seyoon Tak and Hyeong-Seok Ko",
  title =        "A physically-based motion retargeting filter",
  journal =      j-TOG,
  volume =       "24",
  number =       "1",
  pages =        "98--117",
  month =        jan,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Jan 13 08:44:14 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Majumder:2005:PPS,
  author =       "Aditi Majumder and Rick Stevens",
  title =        "Perceptual photometric seamlessness in
                 projection-based tiled displays",
  journal =      j-TOG,
  volume =       "24",
  number =       "1",
  pages =        "118--139",
  month =        jan,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Jan 13 08:44:14 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Shi:2005:CSA,
  author =       "Lin Shi and Yizhou Yu",
  title =        "Controllable smoke animation with guiding objects",
  journal =      j-TOG,
  volume =       "24",
  number =       "1",
  pages =        "140--164",
  month =        jan,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Jan 13 08:44:14 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sulejmanpasic:2005:APB,
  author =       "Adnan Sulejmanpa{\v{s}}i{\'c} and Jovan Popovi{\'c}",
  title =        "Adaptation of performed ballistic motion",
  journal =      j-TOG,
  volume =       "24",
  number =       "1",
  pages =        "165--179",
  month =        jan,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Jan 13 08:44:14 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hart:2005:E,
  author =       "John C. Hart",
  title =        "Editorial",
  journal =      j-TOG,
  volume =       "24",
  number =       "2",
  pages =        "181--181",
  month =        apr,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue May 3 12:30:50 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Alregib:2005:ERT,
  author =       "Ghassan Alregib and Yucel Altunbasak and Jarek
                 Rossignac",
  title =        "Error-resilient transmission of {$3$D} models",
  journal =      j-TOG,
  volume =       "24",
  number =       "2",
  pages =        "182--208",
  month =        apr,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue May 3 12:30:50 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Garland:2005:QBS,
  author =       "Michael Garland and Yuan Zhou",
  title =        "Quadric-based simplification in any dimension",
  journal =      j-TOG,
  volume =       "24",
  number =       "2",
  pages =        "209--239",
  month =        apr,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue May 3 12:30:50 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Vedula:2005:IBS,
  author =       "Sundar Vedula and Simon Baker and Takeo Kanade",
  title =        "Image-based spatio-temporal modeling and view
                 interpolation of dynamic events",
  journal =      j-TOG,
  volume =       "24",
  number =       "2",
  pages =        "240--261",
  month =        apr,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue May 3 12:30:50 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Dinerstein:2005:FML,
  author =       "Jonathan Dinerstein and Parris K. Egbert",
  title =        "Fast multi-level adaptation for interactive autonomous
                 characters",
  journal =      j-TOG,
  volume =       "24",
  number =       "2",
  pages =        "262--288",
  month =        apr,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue May 3 12:30:50 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Dinh:2005:TTD,
  author =       "Huong Quynh Dinh and Anthony Yezzi and Greg Turk",
  title =        "Texture transfer during shape transformation",
  journal =      j-TOG,
  volume =       "24",
  number =       "2",
  pages =        "289--310",
  month =        apr,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue May 3 12:30:50 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sheffer:2005:AFR,
  author =       "Alla Sheffer and Bruno L{\'e}vy and Maxim Mogilnitsky
                 and Alexander Bogomyakov",
  title =        "{ABF++}: fast and robust angle based flattening",
  journal =      j-TOG,
  volume =       "24",
  number =       "2",
  pages =        "311--330",
  month =        apr,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue May 3 12:30:50 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Chuang:2005:MSE,
  author =       "Erika Chuang and Christoph Bregler",
  title =        "Mood swings: expressive speech animation",
  journal =      j-TOG,
  volume =       "24",
  number =       "2",
  pages =        "331--347",
  month =        apr,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue May 3 12:30:50 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kalaiah:2005:SGR,
  author =       "Aravind Kalaiah and Amitabh Varshney",
  title =        "Statistical geometry representation for efficient
                 transmission and rendering",
  journal =      j-TOG,
  volume =       "24",
  number =       "2",
  pages =        "348--373",
  month =        apr,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue May 3 12:30:50 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{James:2005:SMA,
  author =       "Doug L. James and Christopher D. Twigg",
  title =        "Skinning mesh animations",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "399--407",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Anguelov:2005:SSC,
  author =       "Dragomir Anguelov and Praveen Srinivasan and Daphne
                 Koller and Sebastian Thrun and Jim Rodgers and James
                 Davis",
  title =        "{SCAPE}: shape completion and animation of people",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "408--416",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sifakis:2005:ADF,
  author =       "Eftychios Sifakis and Igor Neverov and Ronald Fedkiw",
  title =        "Automatic determination of facial muscle activations
                 from sparse motion capture marker data",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "417--425",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Vlasic:2005:FTM,
  author =       "Daniel Vlasic and Matthew Brand and Hanspeter Pfister
                 and Jovan Popovi{\'c}",
  title =        "Face transfer with multilinear models",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "426--433",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Woop:2005:RPR,
  author =       "Sven Woop and J{\"o}rg Schmittler and Philipp
                 Slusallek",
  title =        "{RPU}: a programmable ray processing unit for realtime
                 ray tracing",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "434--444",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Pellacini:2005:UCA,
  author =       "Fabio Pellacini",
  title =        "User-configurable automatic shader simplification",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "445--452",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Duca:2005:RDE,
  author =       "Nathaniel Duca and Krzysztof Niski and Jonathan
                 Bilodeau and Matthew Bolitho and Yuan Chen and Jonathan
                 Cohen",
  title =        "A relational debugging engine for the graphics
                 pipeline",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "453--463",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Pellacini:2005:LHH,
  author =       "Fabio Pellacini and Kiril Vidim{\v{c}}e and Aaron
                 Lefohn and Alex Mohr and Mark Leone and John Warren",
  title =        "{Lpics}: a hybrid hardware-accelerated relighting
                 engine for computer cinematography",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "464--470",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Muller:2005:MDB,
  author =       "Matthias M{\"u}ller and Bruno Heidelberger and
                 Matthias Teschner and Markus Gross",
  title =        "Meshless deformations based on shape matching",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "471--478",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lipman:2005:LRI,
  author =       "Yaron Lipman and Olga Sorkine and David Levin and
                 Daniel Cohen-Or",
  title =        "Linear rotation-invariant coordinates for meshes",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "479--487",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sumner:2005:MBI,
  author =       "Robert W. Sumner and Matthias Zwicker and Craig
                 Gotsman and Jovan Popovi{\'c}",
  title =        "Mesh-based inverse kinematics",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "488--495",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zhou:2005:LMD,
  author =       "Kun Zhou and Jin Huang and John Snyder and Xinguo Liu
                 and Hujun Bao and Baining Guo and Heung-Yeung Shum",
  title =        "Large mesh deformation using the volumetric graph
                 {Laplacian}",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "496--503",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Chu:2005:MRT,
  author =       "Nelson S.-H. Chu and Chiew-Lan Tai",
  title =        "{MoXi}: real-time ink dispersion in absorbent paper",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "504--511",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Burns:2005:LDV,
  author =       "Michael Burns and Janek Klawe and Szymon Rusinkiewicz
                 and Adam Finkelstein and Doug DeCarlo",
  title =        "Line drawings from volume data",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "512--518",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Liu:2005:MM,
  author =       "Ce Liu and Antonio Torralba and William T. Freeman and
                 Fr{\'e}do Durand and Edward H. Adelson",
  title =        "Motion magnification",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "519--526",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wang:2005:CTA,
  author =       "Hongcheng Wang and Qing Wu and Lin Shi and Yizhou Yu
                 and Narendra Ahuja",
  title =        "Out-of-core tensor approximation of multi-dimensional
                 matrices of visual data",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "527--535",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Nehab:2005:ECP,
  author =       "Diego Nehab and Szymon Rusinkiewicz and James Davis
                 and Ravi Ramamoorthi",
  title =        "Efficiently combining positions and normals for
                 precise {$3$D} geometry",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "536--543",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Fleishman:2005:RML,
  author =       "Shachar Fleishman and Daniel Cohen-Or and Cl{\'a}udio
                 T. Silva",
  title =        "Robust moving least-squares fitting with sharp
                 features",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "544--552",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Surazhsky:2005:FEA,
  author =       "Vitaly Surazhsky and Tatiana Surazhsky and Danil
                 Kirsanov and Steven J. Gortler and Hugues Hoppe",
  title =        "Fast exact and approximate geodesics on meshes",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "553--560",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ju:2005:MVC,
  author =       "Tao Ju and Scott Schaefer and Joe Warren",
  title =        "Mean value coordinates for closed triangular meshes",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "561--566",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{McGuire:2005:DVM,
  author =       "Morgan McGuire and Wojciech Matusik and Hanspeter
                 Pfister and John F. Hughes and Fr{\'e}do Durand",
  title =        "Defocus video matting",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "567--576",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hoiem:2005:APP,
  author =       "Derek Hoiem and Alexei A. Efros and Martial Hebert",
  title =        "Automatic photo pop-up",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "577--584",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wang:2005:IVC,
  author =       "Jue Wang and Pravin Bhat and R. Alex Colburn and
                 Maneesh Agrawala and Michael F. Cohen",
  title =        "Interactive video cutout",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "585--594",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Li:2005:VOC,
  author =       "Yin Li and Jian Sun and Heung-Yeung Shum",
  title =        "Video object cut and paste",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "595--600",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Peyre:2005:SCG,
  author =       "Gabriel Peyr{\'e} and St{\'e}phane Mallat",
  title =        "Surface compression with geometric bandelets",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "601--608",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Peng:2005:GGP,
  author =       "Jingliang Peng and C.-C. Jay Kuo",
  title =        "Geometry-guided progressive lossless {$3$D} mesh
                 coding with octree {(OT)} decomposition",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "609--616",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Alliez:2005:VTM,
  author =       "Pierre Alliez and David Cohen-Steiner and Mariette
                 Yvinec and Mathieu Desbrun",
  title =        "Variational tetrahedral meshing",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "617--625",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Porumbescu:2005:SM,
  author =       "Serban D. Porumbescu and Brian Budge and Louis Feng
                 and Kenneth I. Joy",
  title =        "Shell maps",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "626--633",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Gooch:2005:CSP,
  author =       "Amy A. Gooch and Sven C. Olsen and Jack Tumblin and
                 Bruce Gooch",
  title =        "{Color2Gray}: salience-preserving color removal",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "634--639",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ledda:2005:ETM,
  author =       "Patrick Ledda and Alan Chalmers and Tom Troscianko and
                 Helge Seetzen",
  title =        "Evaluation of tone mapping operators using a {High
                 Dynamic Range} display",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "640--648",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Deering:2005:PAM,
  author =       "Michael F. Deering",
  title =        "A photon accurate model of the human eye",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "649--658",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lee:2005:MS,
  author =       "Chang Ha Lee and Amitabh Varshney and David W.
                 Jacobs",
  title =        "Mesh saliency",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "659--666",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Assa:2005:ASP,
  author =       "Jackie Assa and Yaron Caspi and Daniel Cohen-Or",
  title =        "Action synopsis: pose selection and illustration",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "667--676",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Muller:2005:ECB,
  author =       "Meinard M{\"u}ller and Tido R{\"o}der and Michael
                 Clausen",
  title =        "Efficient content-based retrieval of motion capture
                 data",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "677--685",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Chai:2005:PAL,
  author =       "Jinxiang Chai and Jessica K. Hodgins",
  title =        "Performance animation from low-dimensional control
                 signals",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "686--696",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zordan:2005:DRM,
  author =       "Victor Brian Zordan and Anna Majkowska and Bill Chiu
                 and Matthew Fast",
  title =        "Dynamic response for motion capture animation",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "697--701",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Runions:2005:MVL,
  author =       "Adam Runions and Martin Fuhrer and Brendan Lane and
                 Pavol Federl and Anne-Ga{\"e}lle Rolland-Lagan and
                 Przemyslaw Prusinkiewicz",
  title =        "Modeling and visualization of leaf venation patterns",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "702--711",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wang:2005:RTR,
  author =       "Lifeng Wang and Wenle Wang and Julie Dorsey and Xu
                 Yang and Baining Guo and Heung-Yeung Shum",
  title =        "Real-time rendering of plant leaves",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "712--719",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ijiri:2005:FDI,
  author =       "Takashi Ijiri and Shigeru Owada and Makoto Okabe and
                 Takeo Igarashi",
  title =        "Floral diagrams and inflorescences: interactive flower
                 modeling using botanical structural constraints",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "720--726",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Marschner:2005:MMA,
  author =       "Stephen R. Marschner and Stephen H. Westin and Adam
                 Arbree and Jonathan T. Moon",
  title =        "Measuring and modeling the appearance of finished
                 wood",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "727--734",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ng:2005:FSP,
  author =       "Ren Ng",
  title =        "{Fourier} slice photography",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "735--744",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sen:2005:DP,
  author =       "Pradeep Sen and Billy Chen and Gaurav Garg and Stephen
                 R. Marschner and Mark Horowitz and Marc Levoy and
                 Hendrik P. A. Lensch",
  title =        "Dual photography",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "745--755",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wenger:2005:PRR,
  author =       "Andreas Wenger and Andrew Gardner and Chris Tchou and
                 Jonas Unger and Tim Hawkins and Paul Debevec",
  title =        "Performance relighting and reflectance transformation
                 with time-multiplexed illumination",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "756--764",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wilburn:2005:HPI,
  author =       "Bennett Wilburn and Neel Joshi and Vaibhav Vaish and
                 Eino-Ville Talvala and Emilio Antunez and Adam Barth
                 and Andrew Adams and Mark Horowitz and Marc Levoy",
  title =        "High performance imaging using large camera arrays",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "765--776",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lefebvre:2005:PCT,
  author =       "Sylvain Lefebvre and Hugues Hoppe",
  title =        "Parallel controllable texture synthesis",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "777--786",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Matusik:2005:TDU,
  author =       "Wojciech Matusik and Matthias Zwicker and Fr{\'e}do
                 Durand",
  title =        "Texture design using a simplicial complex of morphable
                 textures",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "787--794",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kwatra:2005:TOE,
  author =       "Vivek Kwatra and Irfan Essa and Aaron Bobick and Nipun
                 Kwatra",
  title =        "Texture optimization for example-based synthesis",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "795--802",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Cook:2005:WN,
  author =       "Robert L. Cook and Tony DeRose",
  title =        "Wavelet noise",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "803--811",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hawkins:2005:ATV,
  author =       "Tim Hawkins and Per Einarsson and Paul Debevec",
  title =        "Acquisition of time-varying participating media",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "812--815",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wei:2005:MHM,
  author =       "Yichen Wei and Eyal Ofek and Long Quan and Heung-Yeung
                 Shum",
  title =        "Modeling hair from multiple views",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "816--820",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Agarwala:2005:PVT,
  author =       "Aseem Agarwala and Ke Colin Zheng and Chris Pal and
                 Maneesh Agrawala and Michael Cohen and Brian Curless
                 and David Salesin and Richard Szeliski",
  title =        "Panoramic video textures",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "821--827",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Agrawal:2005:RPA,
  author =       "Amit Agrawal and Ramesh Raskar and Shree K. Nayar and
                 Yuanzhen Li",
  title =        "Removing photography artifacts using gradient
                 projection and flash-exposure sampling",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "828--835",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Li:2005:CCH,
  author =       "Yuanzhen Li and Lavanya Sharan and Edward H. Adelson",
  title =        "Compressing and companding high dynamic range images
                 with subband architectures",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "836--844",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bennett:2005:VEU,
  author =       "Eric P. Bennett and Leonard McMillan",
  title =        "Video enhancement using per-pixel virtual exposures",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "845--852",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Chuang:2005:APS,
  author =       "Yung-Yu Chuang and Dan B. Goldman and Ke Colin Zheng
                 and Brian Curless and David H. Salesin and Richard
                 Szeliski",
  title =        "Animating pictures with stochastic motion textures",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "853--860",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sun:2005:ICS,
  author =       "Jian Sun and Lu Yuan and Jiaya Jia and Heung-Yeung
                 Shum",
  title =        "Image completion with structure propagation",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "861--868",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Borgeat:2005:GID,
  author =       "Louis Borgeat and Guy Godin and Fran{\c{c}}ois Blais
                 and Philippe Massicotte and Christian Lahanier",
  title =        "{GoLD}: interactive display of huge colored and
                 textured models",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "869--877",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Gobbetti:2005:FVM,
  author =       "Enrico Gobbetti and Fabio Marton",
  title =        "Far voxels: a multiresolution framework for
                 interactive rendering of huge complex {$3$D} models on
                 commodity graphics platforms",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "878--885",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Yoon:2005:COM,
  author =       "Sung-Eui Yoon and Peter Lindstrom and Valerio Pascucci
                 and Dinesh Manocha",
  title =        "Cache-oblivious mesh layouts",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "886--893",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sandin:2005:VAV,
  author =       "Daniel J. Sandin and Todd Margolis and Jinghua Ge and
                 Javier Girado and Tom Peterka and Thomas A. DeFanti",
  title =        "The {Varrier$^{\rm TM}$} autostereoscopic virtual
                 reality display",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "894--903",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Feldman:2005:AGH,
  author =       "Bryan E. Feldman and James F. O'Brien and Bryan M.
                 Klingner",
  title =        "Animating gases with hybrid meshes",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "904--909",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Selle:2005:VPM,
  author =       "Andrew Selle and Nick Rasmussen and Ronald Fedkiw",
  title =        "A vortex particle method for smoke, water and
                 explosions",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "910--914",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hong:2005:DF,
  author =       "Jeong-Mo Hong and Chang-Hun Kim",
  title =        "Discontinuous fluids",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "915--920",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wang:2005:WDS,
  author =       "Huamin Wang and Peter J. Mucha and Greg Turk",
  title =        "Water drops on surfaces",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "921--929",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Apitz:2005:CCB,
  author =       "Georg Apitz and Fran{\c{c}}ois Guimbreti{\`e}re",
  title =        "{CrossY}: a crossing-based drawing application",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "930--930",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Grossman:2005:MFG,
  author =       "Tovi Grossman and Daniel Wigdor and Ravin
                 Balakrishnan",
  title =        "Multi-finger gestural interaction with {$3$D}
                 volumetric displays",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "931--931",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{MacIntyre:2005:DTR,
  author =       "Blair MacIntyre and Maribeth Gandy and Steven Dow and
                 Jay David Bolter",
  title =        "{DART}: a toolkit for rapid design exploration of
                 augmented reality experiences",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "932--932",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Dobbyn:2005:GRT,
  author =       "Simon Dobbyn and John Hamill and Keith O'Conor and
                 Carol O'Sullivan",
  title =        "{Geopostors}: a real-time geometry\slash impostor
                 crowd rendering system",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "933--933",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kho:2005:SMD,
  author =       "Youngihn Kho and Michael Garland",
  title =        "Sketching mesh deformations",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "934--934",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Policarpo:2005:RTR,
  author =       "F{\'a}bio Policarpo and Manuel M. Oliveira and
                 Jo{\~a}o L. D. Comba",
  title =        "Real-time relief mapping on arbitrary polygonal
                 surfaces",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "935--935",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Redon:2005:ADA,
  author =       "Stephane Redon and Nico Galoppo and Ming C. Lin",
  title =        "Adaptive dynamics of articulated bodies",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "936--945",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kaufman:2005:FFD,
  author =       "Danny M. Kaufman and Timothy Edmunds and Dinesh K.
                 Pai",
  title =        "Fast frictional dynamics for rigid bodies",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "946--956",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Pauly:2005:MAF,
  author =       "Mark Pauly and Richard Keiser and Bart Adams and
                 Philip Dutr{\'e} and Markus Gross and Leonidas J.
                 Guibas",
  title =        "Meshless animation of fracturing solids",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "957--964",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zhu:2005:ASF,
  author =       "Yongning Zhu and Robert Bridson",
  title =        "Animating sand as a fluid",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "965--972",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Guendelman:2005:CWS,
  author =       "Eran Guendelman and Andrew Selle and Frank Losasso and
                 Ronald Fedkiw",
  title =        "Coupling water and smoke to thin deformable and rigid
                 shells",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "973--981",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Barbic:2005:RTS,
  author =       "Jernej Barbi{\v{c}} and Doug James",
  title =        "Real-Time subspace integration for {St.
                 Venant--Kirchhoff} deformable models",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "982--990",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Govindaraju:2005:ICD,
  author =       "Naga K. Govindaraju and David Knott and Nitin Jain and
                 Ilknur Kabul and Rasmus Tamstorf and Russell Gayle and
                 Ming C. Lin and Dinesh Manocha",
  title =        "Interactive collision detection between deformable
                 models using chromatic decomposition",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "991--999",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Loop:2005:RIC,
  author =       "Charles Loop and Jim Blinn",
  title =        "Resolution independent curve rendering using
                 programmable graphics hardware",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1000--1009",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Shiue:2005:RGS,
  author =       "Le-Jeng Shiue and Ian Jones and J{\"o}rg Peters",
  title =        "A realtime {GPU} subdivision kernel",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1010--1015",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Guthe:2005:GBT,
  author =       "Michael Guthe and A{\'a}kos Bal{\'a}zs and Reinhard
                 Klein",
  title =        "{GPU}-based trimming and tessellation of {NURBS} and
                 {T-Spline} surfaces",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1016--1023",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hable:2005:BGB,
  author =       "John Hable and Jarek Rossignac",
  title =        "{Blister}: {GPU}-based rendering of {Boolean}
                 combinations of free-form triangulated shapes",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1024--1031",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Donner:2005:LDM,
  author =       "Craig Donner and Henrik Wann Jensen",
  title =        "Light diffusion in multi-layered translucent
                 materials",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1032--1039",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sun:2005:PAS,
  author =       "Bo Sun and Ravi Ramamoorthi and Srinivasa G.
                 Narasimhan and Shree K. Nayar",
  title =        "A practical analytic single scattering model for real
                 time rendering",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1040--1049",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wyman:2005:AIS,
  author =       "Chris Wyman",
  title =        "An approximate image-space approach for interactive
                 refraction",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1050--1053",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tong:2005:MRQ,
  author =       "Xin Tong and Jiaping Wang and Stephen Lin and Baining
                 Guo and Heung-Yeung Shum",
  title =        "Modeling and rendering of quasi-homogeneous
                 materials",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1054--1061",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Mukai:2005:GMI,
  author =       "Tomohiko Mukai and Shigeru Kuriyama",
  title =        "Geostatistical motion interpolation",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1062--1070",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Liu:2005:LPB,
  author =       "C. Karen Liu and Aaron Hertzmann and Zoran
                 Popovi{\'c}",
  title =        "Learning physics-based motion style with nonlinear
                 inverse optimization",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1071--1081",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hsu:2005:STH,
  author =       "Eugene Hsu and Kari Pulli and Jovan Popovi{\'c}",
  title =        "Style translation for human motion",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1082--1089",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ren:2005:DDA,
  author =       "Liu Ren and Alton Patrick and Alexei A. Efros and
                 Jessica K. Hodgins and James M. Rehg",
  title =        "A data-driven approach to quantifying natural human
                 motion",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1090--1097",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Walter:2005:LSA,
  author =       "Bruce Walter and Sebastian Fernandez and Adam Arbree
                 and Kavita Bala and Michael Donikian and Donald P.
                 Greenberg",
  title =        "{Lightcuts}: a scalable approach to illumination",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1098--1107",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Arikan:2005:FDA,
  author =       "Okan Arikan and David A. Forsyth and James F.
                 O'Brien",
  title =        "Fast and detailed approximate global illumination by
                 irradiance decomposition",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1108--1114",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Durand:2005:FAL,
  author =       "Fr{\'e}do Durand and Nicolas Holzschuch and Cyril
                 Soler and Eric Chan and Fran{\c{c}}ois X. Sillion",
  title =        "A frequency analysis of light transport",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1115--1126",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Chen:2005:VSW,
  author =       "Yanyun Chen and Lin Xia and Tien-Tsin Wong and Xin
                 Tong and Hujun Bao and Baining Guo and Heung-Yeung
                 Shum",
  title =        "Visual simulation of weathering by {$\gamma$}-ton
                 tracing",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1127--1133",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Igarashi:2005:RPS,
  author =       "Takeo Igarashi and Tomer Moscovich and John F.
                 Hughes",
  title =        "As-rigid-as-possible shape manipulation",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1134--1141",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Nealen:2005:SBI,
  author =       "Andrew Nealen and Olga Sorkine and Marc Alexa and
                 Daniel Cohen-Or",
  title =        "A sketch-based interface for detail-preserving mesh
                 editing",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1142--1147",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zhou:2005:T,
  author =       "Kun Zhou and Xi Wang and Yiying Tong and Mathieu
                 Desbrun and Baining Guo and Heung-Yeung Shum",
  title =        "{TextureMontage}",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1148--1155",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Laine:2005:SSV,
  author =       "Samuli Laine and Timo Aila and Ulf Assarsson and
                 Jaakko Lehtinen and Tomas Akenine-M{\"o}ller",
  title =        "Soft shadow volumes for ray tracing",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1156--1165",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Clarberg:2005:WIS,
  author =       "Petrik Clarberg and Wojciech Jarosz and Tomas
                 Akenine-M{\"o}ller and Henrik Wann Jensen",
  title =        "Wavelet importance sampling: efficiently evaluating
                 products of complex functions",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1166--1175",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Reshetov:2005:MLR,
  author =       "Alexander Reshetov and Alexei Soupikov and Jim
                 Hurley",
  title =        "Multi-level ray tracing algorithm",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1176--1185",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Cline:2005:ERP,
  author =       "David Cline and Justin Talbot and Parris Egbert",
  title =        "Energy redistribution path tracing",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1186--1195",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zhou:2005:PSF,
  author =       "Kun Zhou and Yaohua Hu and Stephen Lin and Baining Guo
                 and Heung-Yeung Shum",
  title =        "Precomputed shadow fields for dynamic scenes",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1196--1201",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wang:2005:AFI,
  author =       "Rui Wang and John Tran and David Luebke",
  title =        "All-frequency interactive relighting of translucent
                 objects with single and multiple scattering",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1202--1207",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kristensen:2005:PLR,
  author =       "Anders Wang Kristensen and Tomas Akenine-M{\"o}ller
                 and Henrik Wann Jensen",
  title =        "Precomputed local radiance transfer for real-time
                 lighting design",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1208--1215",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sloan:2005:LDP,
  author =       "Peter-Pike Sloan and Ben Luna and John Snyder",
  title =        "Local, deformable precomputed radiance transfer",
  journal =      j-TOG,
  volume =       "24",
  number =       "3",
  pages =        "1216--1224",
  month =        jul,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:00 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Nonato:2005:BCG,
  author =       "Luis Gustavo Nonato and Alex Jesus Cuadros-Vargas and
                 Rosane Minghim and Maria Cristina F. De Oliveira",
  title =        "{Beta-connection}: {Generating} a family of models
                 from planar cross sections",
  journal =      j-TOG,
  volume =       "24",
  number =       "4",
  pages =        "1239--1258",
  month =        oct,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:01 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Chen:2005:AAH,
  author =       "Doron Chen and Daniel Cohen-Or and Olga Sorkine and
                 Sivan Toledo",
  title =        "Algebraic analysis of high-pass quantization",
  journal =      j-TOG,
  volume =       "24",
  number =       "4",
  pages =        "1259--1282",
  month =        oct,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:01 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Cao:2005:ESD,
  author =       "Yong Cao and Wen C. Tien and Petros Faloutsos and
                 Fr{\'e}d{\'e}ric Pighin",
  title =        "Expressive speech-driven facial animation",
  journal =      j-TOG,
  volume =       "24",
  number =       "4",
  pages =        "1283--1302",
  month =        oct,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:01 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ren:2005:LSF,
  author =       "Liu Ren and Gregory Shakhnarovich and Jessica K.
                 Hodgins and Hanspeter Pfister and Paul Viola",
  title =        "Learning silhouette features for control of human
                 motion",
  journal =      j-TOG,
  volume =       "24",
  number =       "4",
  pages =        "1303--1331",
  month =        oct,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:01 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bischoff:2005:ARP,
  author =       "Stephan Bischoff and Darko Pavic and Leif Kobbelt",
  title =        "Automatic restoration of polygon models",
  journal =      j-TOG,
  volume =       "24",
  number =       "4",
  pages =        "1332--1352",
  month =        oct,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:01 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Haber:2005:PBS,
  author =       "J{\"o}rg Haber and Marcus Magnor and Hans-Peter
                 Seidel",
  title =        "Physically-based simulation of twilight phenomena",
  journal =      j-TOG,
  volume =       "24",
  number =       "4",
  pages =        "1353--1373",
  month =        oct,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:01 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Yvart:2005:HTS,
  author =       "Alex Yvart and Stefanie Hahmann and Georges-Pierre
                 Bonneau",
  title =        "Hierarchical triangular splines",
  journal =      j-TOG,
  volume =       "24",
  number =       "4",
  pages =        "1374--1391",
  month =        oct,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:01 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Mora:2005:LCM,
  author =       "Benjamin Mora and David S. Ebert",
  title =        "Low-complexity maximum intensity projection",
  journal =      j-TOG,
  volume =       "24",
  number =       "4",
  pages =        "1392--1416",
  month =        oct,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:01 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lee:2005:FBM,
  author =       "Sang Hun Lee",
  title =        "Feature-based multiresolution modeling of solids",
  journal =      j-TOG,
  volume =       "24",
  number =       "4",
  pages =        "1417--1441",
  month =        oct,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:01 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lagae:2005:POD,
  author =       "Ares Lagae and Philip Dutr{\'e}",
  title =        "A procedural object distribution function",
  journal =      j-TOG,
  volume =       "24",
  number =       "4",
  pages =        "1442--1461",
  month =        oct,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:01 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Johnson:2005:IZB,
  author =       "Gregory S. Johnson and Juhyun Lee and Christopher A.
                 Burns and William R. Mark",
  title =        "The irregular {Z}-buffer: {Hardware} acceleration for
                 irregular data structures",
  journal =      j-TOG,
  volume =       "24",
  number =       "4",
  pages =        "1462--1482",
  month =        oct,
  year =         "2005",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Oct 25 06:32:01 MDT 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Edwards:2006:HVD,
  author =       "Dave Edwards and Solomon Boulos and Jared Johnson and
                 Peter Shirley and Michael Ashikhmin and Michael Stark
                 and Chris Wyman",
  title =        "The halfway vector disk for {BRDF} modeling",
  journal =      j-TOG,
  volume =       "25",
  number =       "1",
  pages =        "1--18",
  month =        jan,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Mar 29 10:42:03 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bargteil:2006:SLC,
  author =       "Adam W. Bargteil and Tolga G. Goktekin and James F.
                 O'Brien and John A. Strain",
  title =        "A semi-{Lagrangian} contouring method for fluid
                 simulation",
  journal =      j-TOG,
  volume =       "25",
  number =       "1",
  pages =        "19--38",
  month =        jan,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Mar 29 10:42:03 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Diebel:2006:BMP,
  author =       "James R. Diebel and Sebastian Thrun and Michael
                 Br{\"u}nig",
  title =        "A {Bayesian} method for probable surface
                 reconstruction and decimation",
  journal =      j-TOG,
  volume =       "25",
  number =       "1",
  pages =        "39--59",
  month =        jan,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Mar 29 10:42:03 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lefohn:2006:GGE,
  author =       "Aaron E. Lefohn and Shubhabrata Sengupta and Joe Kniss
                 and Robert Strzodka and John D. Owens",
  title =        "{Glift}: {Generic}, efficient, random-access {GPU}
                 data structures",
  journal =      j-TOG,
  volume =       "25",
  number =       "1",
  pages =        "60--99",
  month =        jan,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Mar 29 10:42:03 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sun:2006:RBI,
  author =       "Yinlong Sun",
  title =        "Rendering biological iridescences with {RGB}-based
                 renderers",
  journal =      j-TOG,
  volume =       "25",
  number =       "1",
  pages =        "100--129",
  month =        jan,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Mar 29 10:42:03 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Gal:2006:SGF,
  author =       "Ran Gal and Daniel Cohen-Or",
  title =        "Salient geometric features for partial shape matching
                 and similarity",
  journal =      j-TOG,
  volume =       "25",
  number =       "1",
  pages =        "130--150",
  month =        jan,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Mar 29 10:42:03 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Houston:2006:HRL,
  author =       "Ben Houston and Michael B. Nielsen and Christopher
                 Batty and Ola Nilsson and Ken Museth",
  title =        "Hierarchical {RLE} level set: {A} compact and
                 versatile deformable surface representation",
  journal =      j-TOG,
  volume =       "25",
  number =       "1",
  pages =        "151--175",
  month =        jan,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Mar 29 10:42:03 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Pauly:2006:PBM,
  author =       "Mark Pauly and Leif P. Kobbelt and Markus Gross",
  title =        "Point-based multiscale surface representation",
  journal =      j-TOG,
  volume =       "25",
  number =       "2",
  pages =        "177--193",
  month =        apr,
  year =         "2006",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1138450.1138451",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jun 14 09:02:05 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sitharam:2006:SSN,
  author =       "Meera Sitharam and Adam Arbree and Yong Zhou and
                 Naganandhini Kohareswaran",
  title =        "Solution space navigation for geometric constraint
                 systems",
  journal =      j-TOG,
  volume =       "25",
  number =       "2",
  pages =        "194--213",
  month =        apr,
  year =         "2006",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1138450.1138452",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jun 14 09:02:05 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wang:2006:FBS,
  author =       "Wenping Wang and Helmut Pottmann and Yang Liu",
  title =        "Fitting {B}-spline curves to point clouds by
                 curvature-based squared distance minimization",
  journal =      j-TOG,
  volume =       "25",
  number =       "2",
  pages =        "214--238",
  month =        apr,
  year =         "2006",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1138450.1138453",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jun 14 09:02:05 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Xu:2006:ACP,
  author =       "Songhua Xu and Yingqing Xu and Sing Bing Kang and
                 David H. Salesin and Yunhe Pan and Heung-Yeung Shum",
  title =        "Animating {Chinese} paintings through stroke-based
                 decomposition",
  journal =      j-TOG,
  volume =       "25",
  number =       "2",
  pages =        "239--267",
  month =        apr,
  year =         "2006",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1138450.1138454",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jun 14 09:02:05 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Muller:2006:ESS,
  author =       "Kerstin M{\"u}ller and Lars Reusche and Dieter
                 Fellner",
  title =        "Extended subdivision surfaces: {Building} a bridge
                 between {NURBS} and {Catmull--Clark} surfaces",
  journal =      j-TOG,
  volume =       "25",
  number =       "2",
  pages =        "268--292",
  month =        apr,
  year =         "2006",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1138450.1138455",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jun 14 09:02:05 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wang:2006:AFR,
  author =       "Rui Wang and John Tran and David Luebke",
  title =        "All-frequency relighting of glossy objects",
  journal =      j-TOG,
  volume =       "25",
  number =       "2",
  pages =        "293--318",
  month =        apr,
  year =         "2006",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1138450.1138456",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jun 14 09:02:05 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Esteves:2006:APV,
  author =       "Claudia Esteves and Gustavo Arechavaleta and Julien
                 Pettr{\'e} and Jean-Paul Laumond",
  title =        "Animation planning for virtual characters
                 cooperation",
  journal =      j-TOG,
  volume =       "25",
  number =       "2",
  pages =        "319--339",
  month =        apr,
  year =         "2006",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1138450.1138457",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jun 14 09:02:05 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Vanraes:2006:TSS,
  author =       "Evelyne Vanraes and Adhemar Bultheel",
  title =        "A tangent subdivision scheme",
  journal =      j-TOG,
  volume =       "25",
  number =       "2",
  pages =        "340--355",
  month =        apr,
  year =         "2006",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1138450.1138458",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jun 14 09:02:05 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wallner:2006:ISS,
  author =       "Johannes Wallner and Helmut Pottmann",
  title =        "Intrinsic subdivision with smooth limits for graphics
                 and animation",
  journal =      j-TOG,
  volume =       "25",
  number =       "2",
  pages =        "356--374",
  month =        apr,
  year =         "2006",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1138450.1138459",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jun 14 09:02:05 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Popescu:2006:FR,
  author =       "Voicu Popescu and Paul Rosen",
  title =        "Forward rasterization",
  journal =      j-TOG,
  volume =       "25",
  number =       "2",
  pages =        "375--411",
  month =        apr,
  year =         "2006",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1138450.1138460",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jun 14 09:02:05 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kharevych:2006:DCM,
  author =       "Liliya Kharevych and Boris Springborn and Peter
                 Schr{\"o}der",
  title =        "Discrete conformal mappings via circle patterns",
  journal =      j-TOG,
  volume =       "25",
  number =       "2",
  pages =        "412--438",
  month =        apr,
  year =         "2006",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1138450.1138461",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jun 14 09:02:05 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Martinet:2006:ADS,
  author =       "Aur{\'e}lien Martinet and Cyril Soler and Nicolas
                 Holzschuch and Fran{\c{c}}ois X. Sillion",
  title =        "Accurate detection of symmetries in {$3$D} shapes",
  journal =      j-TOG,
  volume =       "25",
  number =       "2",
  pages =        "439--464",
  month =        apr,
  year =         "2006",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1138450.1138462",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Jun 14 09:02:05 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wald:2006:RTA,
  author =       "Ingo Wald and Thiago Ize and Andrew Kensler and Aaron
                 Knoll and Steven G. Parker",
  title =        "Ray tracing animated scenes using coherent grid
                 traversal",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "485--493",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wonka:2006:GVS,
  author =       "Peter Wonka and Michael Wimmer and Kaichi Zhou and
                 Stefan Maierhofer and Gerd Hesina and Alexander
                 Reshetov",
  title =        "Guided visibility sampling",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "494--502",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Dunbar:2006:SDS,
  author =       "Daniel Dunbar and Greg Humphreys",
  title =        "A spatial data structure for fast {Poisson-disk}
                 sample generation",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "503--508",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kopf:2006:RWT,
  author =       "Johannes Kopf and Daniel Cohen-Or and Oliver Deussen
                 and Dani Lischinski",
  title =        "Recursive {Wang} tiles for real-time blue noise",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "509--518",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Weiss:2006:FMB,
  author =       "Ben Weiss",
  title =        "Fast median and bilateral filtering",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "519--526",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Oliva:2006:HI,
  author =       "Aude Oliva and Antonio Torralba and Philippe G.
                 Schyns",
  title =        "Hybrid images",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "527--532",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Schaefer:2006:IDU,
  author =       "Scott Schaefer and Travis McPhail and Joe Warren",
  title =        "Image deformation using moving least squares",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "533--540",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lefebvre:2006:AST,
  author =       "Sylvain Lefebvre and Hugues Hoppe",
  title =        "Appearance-space texture synthesis",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "541--548",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Podolak:2006:PRS,
  author =       "Joshua Podolak and Philip Shilane and Aleksey
                 Golovinskiy and Szymon Rusinkiewicz and Thomas
                 Funkhouser",
  title =        "A planar-reflective symmetry transform for {$3$D}
                 shapes",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "549--559",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Mitra:2006:PAS,
  author =       "Niloy J. Mitra and Leonidas J. Guibas and Mark Pauly",
  title =        "Partial and approximate symmetry detection for {$3$D}
                 geometry",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "560--568",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Huang:2006:RFO,
  author =       "Qi-Xing Huang and Simon Fl{\"o}ry and Natasha Gelfand
                 and Michael Hofer and Helmut Pottmann",
  title =        "Reassembling fractured objects by geometric matching",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "569--578",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lefebvre:2006:PSH,
  author =       "Sylvain Lefebvre and Hugues Hoppe",
  title =        "Perfect spatial hashing",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "579--588",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Karpenko:2006:SFF,
  author =       "Olga A. Karpenko and John F. Hughes",
  title =        "{SmoothSketch}: {$3$D} free-form shapes from complex
                 sketches",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "589--598",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Quan:2006:IBP,
  author =       "Long Quan and Ping Tan and Gang Zeng and Lu Yuan and
                 Jingdong Wang and Sing Bing Kang",
  title =        "Image-based plant modeling",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "599--604",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Schmidt:2006:IDC,
  author =       "Ryan Schmidt and Cindy Grimm and Brian Wyvill",
  title =        "Interactive decal compositing with discrete
                 exponential maps",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "605--613",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Muller:2006:PMB,
  author =       "Pascal M{\"u}ller and Peter Wonka and Simon Haegler
                 and Andreas Ulmer and Luc {Van Gool}",
  title =        "Procedural modeling of buildings",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "614--623",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Cohen-Or:2006:CH,
  author =       "Daniel Cohen-Or and Olga Sorkine and Ran Gal and
                 Tommer Leyvand and Ying-Qing Xu",
  title =        "Color harmonization",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "624--630",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Jia:2006:DDP,
  author =       "Jiaya Jia and Jian Sun and Chi-Keung Tang and
                 Heung-Yeung Shum",
  title =        "Drag-and-drop pasting",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "631--637",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bae:2006:TST,
  author =       "Soonmin Bae and Sylvain Paris and Fr{\'e}do Durand",
  title =        "Two-scale tone management for photographic look",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "637--645",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lischinski:2006:ILA,
  author =       "Dani Lischinski and Zeev Farbman and Matt Uyttendaele
                 and Richard Szeliski",
  title =        "Interactive local adjustment of tonal values",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "646--653",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Khan:2006:IBM,
  author =       "Erum Arif Khan and Erik Reinhard and Roland W. Fleming
                 and Heinrich H. B{\"u}lthoff",
  title =        "Image-based material editing",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "654--663",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Loop:2006:RTG,
  author =       "Charles Loop and Jim Blinn",
  title =        "Real-time {GPU} rendering of piecewise algebraic
                 surfaces",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "664--670",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Adamson:2006:PSC,
  author =       "Anders Adamson and Marc Alexa",
  title =        "Point-sampled cell complexes",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "671--680",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Liu:2006:GMC,
  author =       "Yang Liu and Helmut Pottmann and Johannes Wallner and
                 Yong-Liang Yang and Wenping Wang",
  title =        "Geometric modeling with conical meshes and developable
                 surfaces",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "681--689",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zhou:2006:MQG,
  author =       "Kun Zhou and Xin Huang and Xi Wang and Yiying Tong and
                 Mathieu Desbrun and Baining Guo and Heung-Yeung Shum",
  title =        "Mesh quilting for geometric texture synthesis",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "690--697",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Munkberg:2006:HDR,
  author =       "Jacob Munkberg and Petrik Clarberg and Jon Hasselgren
                 and Tomas Akenine-M{\"o}ller",
  title =        "High dynamic range texture compression for graphics
                 hardware",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "698--706",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Roimela:2006:HDR,
  author =       "Kimmo Roimela and Tomi Aarnio and Joonas
                 It{\"a}ranta",
  title =        "High dynamic range texture compression",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "707--712",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Mantiuk:2006:BCH,
  author =       "Rafa{\l} Mantiuk and Alexander Efremov and Karol
                 Myszkowski and Hans-Peter Seidel",
  title =        "Backward compatible high dynamic range {MPEG} video
                 compression",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "713--723",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Blythe:2006:DS,
  author =       "David Blythe",
  title =        "The {Direct{$3$D}} 10 system",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "724--734",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lawrence:2006:IST,
  author =       "Jason Lawrence and Aner Ben-Artzi and Christopher
                 DeCoro and Wojciech Matusik and Hanspeter Pfister and
                 Ravi Ramamoorthi and Szymon Rusinkiewicz",
  title =        "Inverse shade trees for non-parametric material
                 representation and editing",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "735--745",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Peers:2006:CFR,
  author =       "Pieter Peers and Karl vom Berge and Wojciech Matusik
                 and Ravi Ramamoorthi and Jason Lawrence and Szymon
                 Rusinkiewicz and Philip Dutr{\'e}",
  title =        "A compact factored representation of heterogeneous
                 subsurface scattering",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "746--753",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wang:2006:AMM,
  author =       "Jiaping Wang and Xin Tong and Stephen Lin and Minghao
                 Pan and Chao Wang and Hujun Bao and Baining Guo and
                 Heung-Yeung Shum",
  title =        "Appearance manifolds for modeling time-variant
                 appearance of materials",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "754--761",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Gu:2006:TVS,
  author =       "Jinwei Gu and Chien-I Tu and Ravi Ramamoorthi and
                 Peter Belhumeur and Wojciech Matusik and Shree Nayar",
  title =        "Time-varying surface appearance: acquisition, modeling
                 and rendering",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "762--771",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sun:2006:FM,
  author =       "Jian Sun and Yin Li and Sing Bing Kang and Heung-Yeung
                 Shum",
  title =        "Flash matting",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "772--778",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Joshi:2006:NVM,
  author =       "Neel Joshi and Wojciech Matusik and Shai Avidan",
  title =        "Natural video matting using camera arrays",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "779--786",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Fergus:2006:RCS,
  author =       "Rob Fergus and Barun Singh and Aaron Hertzmann and Sam
                 T. Roweis and William T. Freeman",
  title =        "Removing camera shake from a single photograph",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "787--794",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Raskar:2006:CEP,
  author =       "Ramesh Raskar and Amit Agrawal and Jack Tumblin",
  title =        "Coded exposure photography: motion deblurring using
                 fluttered shutter",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "795--804",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Irving:2006:ESL,
  author =       "Geoffrey Irving and Eran Guendelman and Frank Losasso
                 and Ronald Fedkiw",
  title =        "Efficient simulation of large bodies of water by
                 coupling two and three dimensional techniques",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "805--811",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Losasso:2006:MIL,
  author =       "Frank Losasso and Tamar Shinar and Andrew Selle and
                 Ronald Fedkiw",
  title =        "Multiple interacting liquids",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "812--819",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Klingner:2006:FAD,
  author =       "Bryan M. Klingner and Bryan E. Feldman and Nuttapong
                 Chentanez and James F. O'Brien",
  title =        "Fluid animation with dynamic meshes",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "820--825",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Treuille:2006:MRR,
  author =       "Adrien Treuille and Andrew Lewis and Zoran
                 Popovi{\'c}",
  title =        "Model reduction for real-time fluids",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "826--834",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Snavely:2006:PTE,
  author =       "Noah Snavely and Steven M. Seitz and Richard
                 Szeliski",
  title =        "Photo tourism: exploring photo collections in {$3$D}",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "835--846",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Rother:2006:A,
  author =       "Carsten Rother and Lucas Bordeaux and Youssef Hamadi
                 and Andrew Blake",
  title =        "{AutoCollage}",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "847--852",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Agarwala:2006:PLS,
  author =       "Aseem Agarwala and Maneesh Agrawala and Michael Cohen
                 and David Salesin and Richard Szeliski",
  title =        "Photographing long scenes with multi-viewpoint
                 panoramas",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "853--861",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Goldman:2006:SSV,
  author =       "Dan B. Goldman and Brian Curless and David Salesin and
                 Steven M. Seitz",
  title =        "Schematic storyboarding for video visualization and
                 editing",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "862--871",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kry:2006:ICS,
  author =       "Paul G. Kry and Dinesh K. Pai",
  title =        "Interaction capture and synthesis",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "872--880",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Park:2006:CAS,
  author =       "Sang Il Park and Jessica K. Hodgins",
  title =        "Capturing and animating skin deformation in human
                 motion",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "881--889",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Arikan:2006:CMC,
  author =       "Okan Arikan",
  title =        "Compression of motion capture databases",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "890--897",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lee:2006:MPB,
  author =       "Kang Hoon Lee and Myung Geol Choi and Jehee Lee",
  title =        "Motion patches: building blocks for virtual
                 environments annotated with motion data",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "898--906",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zhang:2006:PDA,
  author =       "Li Zhang and Shree Nayar",
  title =        "Projection defocus analysis for scene capture and
                 image display",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "907--915",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kuthirummal:2006:MRC,
  author =       "Sujit Kuthirummal and Shree K. Nayar",
  title =        "Multiview radial catadioptric imaging for scene
                 capture",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "916--923",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Levoy:2006:LFM,
  author =       "Marc Levoy and Ren Ng and Andrew Adams and Matthew
                 Footer and Mark Horowitz",
  title =        "Light field microscopy",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "924--934",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Nayar:2006:FSD,
  author =       "Shree K. Nayar and Gurunandan Krishnan and Michael D.
                 Grossberg and Ramesh Raskar",
  title =        "Fast separation of direct and global components of a
                 scene using high frequency illumination",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "935--944",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ben-Artzi:2006:RTB,
  author =       "Aner Ben-Artzi and Ryan Overbeck and Ravi
                 Ramamoorthi",
  title =        "Real-time {BRDF} editing in complex lighting",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "945--954",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sun:2006:GWP,
  author =       "Weifeng Sun and Amar Mukherjee",
  title =        "Generalized wavelet product integral for rendering
                 dynamic glossy objects",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "955--966",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tsai:2006:AFP,
  author =       "Yu-Ting Tsai and Zen-Chung Shih",
  title =        "All-frequency precomputed radiance transfer using
                 spherical radial basis functions and clustered tensor
                 approximation",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "967--976",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ren:2006:RTS,
  author =       "Zhong Ren and Rui Wang and John Snyder and Kun Zhou
                 and Xinguo Liu and Bo Sun and Peter-Pike Sloan and
                 Hujun Bao and Qunsheng Peng and Baining Guo",
  title =        "Real-time soft shadows in dynamic scenes using
                 spherical harmonic exponentiation",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "977--986",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{James:2006:PAT,
  author =       "Doug L. James and Jernej Barbi{\v{c}} and Dinesh K.
                 Pai",
  title =        "Precomputed acoustic transfer: output-sensitive,
                 accurate sound generation for geometrically complex
                 vibration sources",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "987--995",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Garg:2006:PRR,
  author =       "Kshitiz Garg and Shree K. Nayar",
  title =        "Photorealistic rendering of rain streaks",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "996--1002",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Narasimhan:2006:ASP,
  author =       "Srinivasa G. Narasimhan and Mohit Gupta and Craig
                 Donner and Ravi Ramamoorthi and Shree K. Nayar and
                 Henrik Wann Jensen",
  title =        "Acquiring scattering properties of participating media
                 by dilution",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1003--1012",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Weyrich:2006:AHF,
  author =       "Tim Weyrich and Wojciech Matusik and Hanspeter Pfister
                 and Bernd Bickel and Craig Donner and Chien Tu and
                 Janet McAndless and Jinho Lee and Addy Ngan and Henrik
                 Wann Jensen and Markus Gross",
  title =        "Analysis of human faces using a measurement-based skin
                 reflectance model",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1013--1024",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Golovinskiy:2006:SMS,
  author =       "Aleksey Golovinskiy and Wojciech Matusik and Hanspeter
                 Pfister and Szymon Rusinkiewicz and Thomas Funkhouser",
  title =        "A statistical model for synthesis of detailed facial
                 geometry",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1025--1034",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Levin:2006:MSS,
  author =       "Adi Levin",
  title =        "Modified subdivision surfaces with continuous
                 curvature",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1035--1040",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wang:2006:ESS,
  author =       "Ke Wang and Weiwei and Yiying Tong and Mathieu Desbrun
                 and Peter Schr{\"o}der",
  title =        "Edge subdivision schemes and the construction of
                 smooth vector fields",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1041--1048",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Isenburg:2006:SCD,
  author =       "Martin Isenburg and Yuanxin Liu and Jonathan Shewchuk
                 and Jack Snoeyink",
  title =        "Streaming computation of {Delaunay} triangulations",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1049--1056",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Dong:2006:SSQ,
  author =       "Shen Dong and Peer-Timo Bremer and Michael Garland and
                 Valerio Pascucci and John C. Hart",
  title =        "Spectral surface quadrangulation",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1057--1066",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Moon:2006:SMS,
  author =       "Jonathan T. Moon and Stephen R. Marschner",
  title =        "Simulating multiple scattering in hair using a photon
                 mapping approach",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1067--1074",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Meyer:2006:SAA,
  author =       "Mark Meyer and John Anderson",
  title =        "Statistical acceleration for animated global
                 illumination",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1075--1080",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Walter:2006:ML,
  author =       "Bruce Walter and Adam Arbree and Kavita Bala and
                 Donald P. Greenberg",
  title =        "Multidimensional lightcuts",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1081--1088",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hasan:2006:DIT,
  author =       "Milo{\v{s}} Ha{\v{s}}an and Fabio Pellacini and Kavita
                 Bala",
  title =        "Direct-to-indirect transfer for cinematic relighting",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1089--1097",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kircher:2006:EAD,
  author =       "Scott Kircher and Michael Garland",
  title =        "Editing arbitrarily deforming surface animations",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1098--1107",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Shi:2006:FMA,
  author =       "Lin Shi and Yizhou Yu and Nathan Bell and Wei-Wen
                 Feng",
  title =        "A fast multigrid algorithm for mesh deformation",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1108--1117",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{vonFunck:2006:VFB,
  author =       "Wolfram von Funck and Holger Theisel and Hans-Peter
                 Seidel",
  title =        "Vector field based shape deformations",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1118--1125",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Huang:2006:SGD,
  author =       "Jin Huang and Xiaohan Shi and Xinguo Liu and Kun Zhou
                 and Li-Yi Wei and Shang-Hua Teng and Hujun Bao and
                 Baining Guo and Heung-Yeung Shum",
  title =        "Subspace gradient domain mesh deformation",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1126--1134",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Szeliski:2006:LAH,
  author =       "Richard Szeliski",
  title =        "Locally adapted hierarchical basis preconditioning",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1135--1143",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sud:2006:FPC,
  author =       "Avneesh Sud and Naga Govindaraju and Russell Gayle and
                 Ilknur Kabul and Dinesh Manocha",
  title =        "Fast proximity computation among deformable models
                 using discrete {Voronoi} diagrams",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1144--1153",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Volino:2006:RSC,
  author =       "Pascal Volino and Nadia Magnenat-Thalmann",
  title =        "Resolving surface collisions through intersection
                 contour minimization",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1154--1159",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Treuille:2006:CC,
  author =       "Adrien Treuille and Seth Cooper and Zoran
                 Popovi{\'c}",
  title =        "Continuum crowds",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1160--1168",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wang:2006:CAF,
  author =       "Jue Wang and Steven M. Drucker and Maneesh Agrawala
                 and Michael F. Cohen",
  title =        "The cartoon animation filter",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1169--1173",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Der:2006:IKR,
  author =       "Kevin G. Der and Robert W. Sumner and Jovan
                 Popovi{\'c}",
  title =        "Inverse kinematics for reduced deformable models",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1174--1179",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Bertails:2006:SHP,
  author =       "Florence Bertails and Basile Audoly and Marie-Paule
                 Cani and Bernard Querleux and Fr{\'e}d{\'e}ric Leroy
                 and Jean-Luc L{\'e}v{\^e}que",
  title =        "Super-helices for predicting the dynamics of natural
                 hair",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1180--1187",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lee:2006:HBM,
  author =       "Sung-Hee Lee and Demetri Terzopoulos",
  title =        "Heads up!: biomechanical modeling and neuromuscular
                 control of the neck",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1188--1198",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Rusinkiewicz:2006:ESD,
  author =       "Szymon Rusinkiewicz and Michael Burns and Doug
                 DeCarlo",
  title =        "Exaggerated shading for depicting shape and detail",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1199--1205",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Luft:2006:IEU,
  author =       "Thomas Luft and Carsten Colditz and Oliver Deussen",
  title =        "Image enhancement by unsharp masking the depth
                 buffer",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1206--1213",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Qu:2006:MC,
  author =       "Yingge Qu and Tien-Tsin Wong and Pheng-Ann Heng",
  title =        "Manga colorization",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1214--1220",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Winnemoller:2006:RTV,
  author =       "Holger Winnem{\"o}ller and Sven C. Olsen and Bruce
                 Gooch",
  title =        "Real-time video abstraction",
  journal =      j-TOG,
  volume =       "25",
  number =       "3",
  pages =        "1221--1226",
  month =        jul,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Aug 23 10:02:03 MDT 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Plantinga:2006:CCG,
  author =       "Simon Plantinga and Gert Vegter",
  title =        "Computing contour generators of evolving implicit
                 surfaces",
  journal =      j-TOG,
  volume =       "25",
  number =       "4",
  pages =        "1243--1280",
  month =        oct,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Nov 30 19:00:05 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Prautzsch:2006:PTS,
  author =       "Hartmut Prautzsch and Georg Umlauf",
  title =        "Parametrizations for triangular {$G^k$} spline
                 surfaces of low degree",
  journal =      j-TOG,
  volume =       "25",
  number =       "4",
  pages =        "1281--1293",
  month =        oct,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Nov 30 19:00:05 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zhang:2006:VFD,
  author =       "Eugene Zhang and Konstantin Mischaikow and Greg Turk",
  title =        "Vector field design on surfaces",
  journal =      j-TOG,
  volume =       "25",
  number =       "4",
  pages =        "1294--1326",
  month =        oct,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Nov 30 19:00:05 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Park:2006:VGM,
  author =       "Min Je Park and Min Gyu Choi and Yoshihisa Shinagawa
                 and Sung Yong Shin",
  title =        "Video-guided motion synthesis using example motions",
  journal =      j-TOG,
  volume =       "25",
  number =       "4",
  pages =        "1327--1359",
  month =        oct,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Nov 30 19:00:05 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wang:2006:DCI,
  author =       "Guangyu Wang and Tien-Tsin Wong and Pheng-Ann Heng",
  title =        "Deringing cartoons by image analogies",
  journal =      j-TOG,
  volume =       "25",
  number =       "4",
  pages =        "1360--1379",
  month =        oct,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Nov 30 19:00:05 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{VanHateren:2006:EHD,
  author =       "J. H. {Van Hateren}",
  title =        "Encoding of high dynamic range video with a model of
                 human cones",
  journal =      j-TOG,
  volume =       "25",
  number =       "4",
  pages =        "1380--1399",
  month =        oct,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Nov 30 19:00:05 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Merry:2006:AST,
  author =       "Bruce Merry and Patrick Marais and James Gain",
  title =        "Animation space: {A} truly linear framework for
                 character animation",
  journal =      j-TOG,
  volume =       "25",
  number =       "4",
  pages =        "1400--1423",
  month =        oct,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Nov 30 19:00:05 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hormann:2006:MVC,
  author =       "Kai Hormann and Michael S. Floater",
  title =        "Mean value coordinates for arbitrary planar polygons",
  journal =      j-TOG,
  volume =       "25",
  number =       "4",
  pages =        "1424--1441",
  month =        oct,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Nov 30 19:00:05 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lagae:2006:AWT,
  author =       "Ares Lagae and Philip Dutr{\'e}",
  title =        "An alternative for {Wang} tiles: colored edges versus
                 colored corners",
  journal =      j-TOG,
  volume =       "25",
  number =       "4",
  pages =        "1442--1459",
  month =        oct,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Nov 30 19:00:05 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ray:2006:PGP,
  author =       "Nicolas Ray and Wan Chiu Li and Bruno L{\'e}vy and
                 Alla Sheffer and Pierre Alliez",
  title =        "Periodic global parameterization",
  journal =      j-TOG,
  volume =       "25",
  number =       "4",
  pages =        "1460--1485",
  month =        oct,
  year =         "2006",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Nov 30 19:00:05 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hornung:2007:CAP,
  author =       "Alexander Hornung and Ellen Dekkers and Leif Kobbelt",
  title =        "Character animation from {$2$D} pictures and {$3$D}
                 motion data",
  journal =      j-TOG,
  volume =       "26",
  number =       "1",
  pages =        "1:1--1:9",
  month =        jan,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1189762.1189763",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:08:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This article presents a new method to animate photos
                 of 2D characters using 3D motion capture data. Given a
                 single image of a person or essentially human-like
                 subject, our method transfers the motion of a 3D
                 skeleton onto the subject's 2D shape in image space,
                 generating the impression of a realistic movement. We
                 present robust solutions to reconstruct a projective
                 camera model and a 3D model pose which matches best to
                 the given 2D image. Depending on the reconstructed
                 view, a 2D shape template is selected which enables the
                 proper handling of occlusions. After fitting the
                 template to the character in the input image, it is
                 deformed as-rigid-as-possible by taking the projected
                 3D motion data into account. Unlike previous work, our
                 method thereby correctly handles projective shape
                 distortion. It works for images from arbitrary views
                 and requires only a small amount of user interaction.
                 We present animations of a diverse set of human (and
                 nonhuman) characters with different types of motions,
                 such as walking, jumping, or dancing.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "2D character animation; 3D motion data;
                 as-rigid-as-possible shape manipulation with
                 perspective correction; camera and model pose
                 determination",
}

@Article{Ramamoorthi:2007:FOA,
  author =       "Ravi Ramamoorthi and Dhruv Mahajan and Peter
                 Belhumeur",
  title =        "A first-order analysis of lighting, shading, and
                 shadows",
  journal =      j-TOG,
  volume =       "26",
  number =       "1",
  pages =        "2:1--2:21",
  month =        jan,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1189762.1189764",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:08:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The shading in a scene depends on a combination of
                 many factors---how the lighting varies spatially across
                 a surface, how it varies along different directions,
                 the geometric curvature and reflectance properties of
                 objects, and the locations of soft shadows. In this
                 article, we conduct a complete first-order or gradient
                 analysis of lighting, shading, and shadows, showing how
                 each factor separately contributes to scene appearance,
                 and when it is important. Gradients are well-suited to
                 analyzing the intricate combination of appearance
                 effects, since each gradient term corresponds directly
                 to variation in a specific factor. First, we show how
                 the spatial and directional gradients of the light
                 field change as light interacts with curved objects.
                 This extends the recent frequency analysis of Durand et
                 al. [2005] to gradients, and has many advantages for
                 operations, like bump mapping, that are difficult to
                 analyze in the Fourier domain. Second, we consider the
                 individual terms responsible for shading gradients,
                 such as lighting variation, convolution with the
                 surface BRDF, and the object's curvature. This analysis
                 indicates the relative importance of various terms, and
                 shows precisely how they combine in shading. Third, we
                 understand the effects of soft shadows, computing
                 accurate visibility gradients, and generalizing
                 previous work to arbitrary curved occluders. As one
                 practical application, our visibility gradients can be
                 directly used with conventional ray-tracing methods in
                 practical gradient interpolation methods for efficient
                 rendering. Moreover, our theoretical framework can be
                 used to adaptively sample images in high-gradient
                 regions for efficient rendering.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Fourier analysis; Gradients; reflectance; shadows",
}

@Article{Lu:2007:CAT,
  author =       "Jianye Lu and Athinodoros S. Georghiades and Andreas
                 Glaser and Hongzhi Wu and Li-Yi Wei and Baining Guo and
                 Julie Dorsey and Holly Rushmeier",
  title =        "Context-aware textures",
  journal =      j-TOG,
  volume =       "26",
  number =       "1",
  pages =        "3:1--3:22",
  month =        jan,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1189762.1189765",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:08:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Interesting textures form on the surfaces of objects
                 as the result of external chemical, mechanical, and
                 biological agents. Simulating these textures is
                 necessary to generate models for realistic image
                 synthesis. The textures formed are progressively
                 variant, with the variations depending on the global
                 and local geometric context. We present a method for
                 capturing progressively varying textures and the
                 relevant context parameters that control them. By
                 relating textures and context parameters, we are able
                 to transfer the textures to novel synthetic objects. We
                 present examples of capturing chemical effects, such as
                 rusting; mechanical effects, such as paint cracking;
                 and biological effects, such as the growth of mold on a
                 surface. We demonstrate a user interface that provides
                 a method for specifying where an object is exposed to
                 external agents. We show the results of complex,
                 geometry-dependent textures evolving on synthetic
                 objects.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Aging; data capture; natural phenomenon; realistic
                 rendering; texture synthesis; weathering",
}

@Article{Elcott:2007:SCP,
  author =       "Sharif Elcott and Yiying Tong and Eva Kanso and Peter
                 Schr{\"o}der and Mathieu Desbrun",
  title =        "Stable, circulation-preserving, simplicial fluids",
  journal =      j-TOG,
  volume =       "26",
  number =       "1",
  pages =        "4:1--4:12",
  month =        jan,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1189762.1189766",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:08:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Visual quality, low computational cost, and numerical
                 stability are foremost goals in computer animation. An
                 important ingredient in achieving these goals is the
                 conservation of fundamental motion invariants. For
                 example, rigid and deformable body simulation benefits
                 greatly from the conservation of linear and angular
                 momenta. In the case of fluids, however, none of the
                 current techniques focuses on conserving invariants,
                 and consequently, often introduce a visually disturbing
                 numerical diffusion of vorticity. Just as important
                 visually is the resolution of complex simulation
                 domains. Doing so with regular (even if adaptive) grid
                 techniques can be computationally delicate. In this
                 article, we propose a novel technique for the
                 simulation of fluid flows. It is designed to respect
                 the defining differential properties, that is, the
                 conservation of circulation along arbitrary loops as
                 they are transported by the flow. Consequently, our
                 method offers several new and desirable properties:
                 Arbitrary simplicial meshes (triangles in 2D,
                 tetrahedra in 3D) can be used to define the fluid
                 domain; the computations involved in the update
                 procedure are efficient due to discrete operators with
                 small support; and it preserves discrete circulation,
                 avoiding numerical diffusion of vorticity.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Fluid animation; Lie advection; stable fluids;
                 vorticity preservation",
}

@Article{Lipman:2007:VSP,
  author =       "Yaron Lipman and Daniel Cohen-Or and Gal Ran and David
                 Levin",
  title =        "Volume and shape preservation via moving frame
                 manipulation",
  journal =      j-TOG,
  volume =       "26",
  number =       "1",
  pages =        "5:1--5:14",
  month =        jan,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1189762.1189767",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:08:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This article introduces a method for mesh editing that
                 is aimed at preserving shape and volume. We present two
                 new developments: The first is a minimization of a
                 functional expressing a geometric distance measure
                 between two isometric surfaces. The second is a local
                 volume analysis linking the volume of an object to its
                 surface curvature. Our method is based upon the moving
                 frames representation of meshes. Applying a rotation
                 field to the moving frames defines an isometry. Given
                 rotational constraints, the mesh is deformed by an
                 optimal isometry defined by minimizing the distance
                 measure between original and deformed meshes. The
                 resulting isometry nicely preserves the surface
                 details, but when large rotations are applied, the
                 volumetric behavior of the model may be unsatisfactory.
                 Using the local volume analysis, we define a scalar
                 field by which we scale the moving frames. Scaled and
                 rotated moving frames restore volumetric properties of
                 the original mesh, while properly maintaining the
                 surface details. Our results show that even extreme
                 deformations can be applied to meshes, with only
                 minimal distortion of surface details and object
                 volume.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "discrete differential geometry; Mesh editing; moving
                 frames",
}

@Article{Wald:2007:RTD,
  author =       "Ingo Wald and Solomon Boulos and Peter Shirley",
  title =        "Ray tracing deformable scenes using dynamic bounding
                 volume hierarchies",
  journal =      j-TOG,
  volume =       "26",
  number =       "1",
  pages =        "6:1--6:18",
  month =        jan,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1189762.1206075",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:08:45 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The most significant deficiency of most of today's
                 interactive ray tracers is that they are restricted to
                 static walkthroughs. This restriction is due to the
                 static nature of the acceleration structures used.
                 While the best reported frame rates for static
                 geometric models have been achieved using carefully
                 constructed kd-trees, this article shows that bounding
                 volume hierarchies (BVHs) can be used to efficiently
                 ray trace large static models. More importantly, the
                 BVH can be used to ray trace deformable models (sets of
                 triangles whose positions change over time) with little
                 loss of performance. A variety of efficiency techniques
                 are used to achieve this performance, but three
                 algorithmic changes to the typical BVH algorithm are
                 mainly responsible. First, the BVH is built using a
                 variant of the surface area heuristic conventionally
                 used to build kd-trees. Second, the topology of the BVH
                 is not changed over time so that only the bounding
                 volumes need to be refit from frame-to-frame. Third,
                 and most importantly, packets of rays are traced
                 together through the BVH using a novel integrated
                 packet-frustum traversal scheme. This traversal scheme
                 elegantly combines the advantages of both packet
                 traversal and frustum traversal and allows for rapid
                 hierarchy descent for packets that hit bounding volumes
                 as well as rapid exits for packets that miss. A
                 BVH-based ray tracing system using these techniques is
                 shown to achieve performance for deformable models
                 comparable to that previously available only for static
                 models.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Shilane:2007:DRS,
  author =       "Philip Shilane and Thomas Funkhouser",
  title =        "Distinctive regions of {$3$D} surfaces",
  journal =      j-TOG,
  volume =       "26",
  number =       "2",
  pages =        "7:1--7:??",
  month =        jun,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1243980.1243981",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:00 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Selecting the most important regions of a surface is
                 useful for shape matching and a variety of applications
                 in computer graphics and geometric modeling. While
                 previous research has analyzed geometric properties of
                 meshes in isolation, we select regions that distinguish
                 a shape from objects of a different type. Our approach
                 to analyzing distinctive regions is based on performing
                 a shape-based search using each region as a query into
                 a database. Distinctive regions of a surface have shape
                 consistent with objects of the same type and different
                 from objects of other types. We demonstrate the utility
                 of detecting distinctive surface regions for shape
                 matching and other graphics applications including mesh
                 visualization, icon generation, and mesh
                 simplification.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Distinct features; partial matching; shape
                 distinction; similarity; visualization",
}

@Article{Wu:2007:NSM,
  author =       "Tai-Pang Wu and Chi-Keung Tang and Michael S. Brown
                 and Heung-Yeung Shum",
  title =        "Natural shadow matting",
  journal =      j-TOG,
  volume =       "26",
  number =       "2",
  pages =        "8:1--8:??",
  month =        jun,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1243980.1243982",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:00 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This article addresses the problem of natural shadow
                 matting, the removal or extraction of natural shadows
                 from a single image. Because textures are maintained in
                 the shadowless image after the extraction process, our
                 approach produces some of the best results to date
                 among shadow removal techniques. Using the image
                 formation equation typical of computer vision, we
                 advocate a new model for shadow formation where shadow
                 effect is understood as light attenuation instead of a
                 mixture of two colors governed by the conventional
                 matting equation. This leads to a new shadow equation
                 with fewer unknowns to solve, where a three-channel
                 shadow matte and a shadowless image are considered in
                 our optimization. Our problem is formulated as one of
                 energy minimization guided by user-supplied hints in
                 the form of a quadmap which can be specified easily by
                 the user. This formulation allows for robust shadow
                 matte extraction while maintaining texture in the
                 shadowed region by considering color transfer, texture
                 gradient, and shadow smoothness. We demonstrate the
                 usefulness of our approach in shadow removal, image
                 matting, and compositing.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "interactive extraction; shadow matting; Shadow removal
                 and extraction",
}

@Article{Pellacini:2007:LP,
  author =       "Fabio Pellacini and Frank Battaglia and R. Keith
                 Morley and Adam Finkelstein",
  title =        "Lighting with paint",
  journal =      j-TOG,
  volume =       "26",
  number =       "2",
  pages =        "9:1--9:??",
  month =        jun,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1243980.1243983",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:00 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Lighting is a fundamental aspect of computer
                 cinematography that involves the placement and
                 configuration of lights to establish mood and enhance
                 storytelling. This process is labor intensive as
                 artists repeatedly adjust the parameters of a large set
                 of complex lights to achieve a desired effect. Typical
                 lighting controls affect the final image indirectly,
                 requiring a large number of trials to obtain a suitable
                 result.\par

                 We present an interactive system wherein an artist
                 paints desired lighting effects directly into the
                 scene, and the computer solves for parameters that
                 achieve the desired look. The artist can paint color,
                 light shape, shadows, highlights, and reflections using
                 a suite of tools designed for painting light. Our
                 system matches these effects using a nonlinear
                 optimizer made robust by a combination of initial
                 estimates, system design, and user-guided optimization.
                 In contrast, previous work on painting light has not
                 permitted the lights to move, allowing for linear
                 optimization but preventing its use in computer
                 cinematography.\par

                 To demonstrate our approach we lit several scenes,
                 mainly using a direct illumination renderer designed
                 for computer animation, but also including two other
                 rendering styles. We show that painting interfaces can
                 quickly produce high quality lighting setups, easing
                 the lighting artist's workflow.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; Lighting; optimization; painting;
                 rendering",
}

@Article{Fuchs:2007:ASR,
  author =       "Martin Fuchs and Volker Blanz and Hendrik P. A. Lensch
                 and Hans-Peter Seidel",
  title =        "Adaptive sampling of reflectance fields",
  journal =      j-TOG,
  volume =       "26",
  number =       "2",
  pages =        "10:1--10:??",
  month =        jun,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1243980.1243984",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:00 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Image-based relighting achieves high quality in
                 rendering, but it requires a large number of
                 measurements of the reflectance field. This article
                 discusses sampling techniques that improve on the
                 trade-offs between measurement effort and
                 reconstruction quality.\par

                 Specifically, we (i) demonstrate that sampling with
                 point lights and from a sparse set of incoming light
                 directions creates artifacts which can be reduced
                 significantly by employing extended light sources for
                 sampling, (ii) propose a sampling algorithm which
                 incrementally chooses light directions adapted to the
                 properties of the reflectance field being measured,
                 thus capturing significant features faster than
                 fixed-pattern sampling, and (iii) combine reflectance
                 fields from two different light domain
                 resolutions.\par

                 We present an automated measurement setup for
                 well-defined angular distributions of the incident,
                 indirect illumination. It is based on programmable
                 spotlights with controlled aperture that illuminate the
                 walls around the scene.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Image-based relighting; reflectance fields",
}

@Article{Lu:2007:VIU,
  author =       "Aidong Lu and David S. Ebert and Wei Qiao and Martin
                 Kraus and Benjamin Mora",
  title =        "Volume illustration using wang cubes",
  journal =      j-TOG,
  volume =       "26",
  number =       "2",
  pages =        "11:1--11:??",
  month =        jun,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1243980.1243985",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:00 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "To create a new, flexible system for volume
                 illustration, we have explored the use of Wang Cubes,
                 the 3D extension of 2D Wang Tiles. We use small sets of
                 Wang Cubes to generate a large variety of nonperiodic
                 illustrative 3D patterns and texture, which otherwise
                 would be too large to use in real applications. We also
                 develop a direct volume rendering framework with the
                 generated patterns and textures. Our framework can be
                 used to render volume datasets effectively and a
                 variety of rendering styles can be achieved with less
                 storage.\par

                 Specifically, we extend the nonperiodic tiling process
                 of Wang Tiles to Wang Cubes and modify it for
                 multipurpose tiling. We automatically generate
                 isotropic Wang Cubes consisting of 3D patterns or
                 textures to simulate various illustrative effects.
                 Anisotropic Wang Cubes are generated to yield patterns
                 by using the volume data, curvature, and gradient
                 information. We also extend the definition of Wang
                 Cubes into a set of different sized cubes to provide
                 multiresolution volume rendering. Finally, we provide
                 both coherent 3D geometry-based and texture-based
                 rendering frameworks that can be integrated with
                 arbitrary feature exploration methods.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "nonphotorealistic rendering; scientific illustration;
                 volume illustration; volume rendering; Wang Cubes; Wang
                 Tiles",
}

@Article{Erleben:2007:VBS,
  author =       "Kenny Erleben",
  title =        "Velocity-based shock propagation for multibody
                 dynamics animation",
  journal =      j-TOG,
  volume =       "26",
  number =       "2",
  pages =        "12:1--12:??",
  month =        jun,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1243980.1243986",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:00 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Multibody dynamics are used in interactive and
                 real-time applications, ranging from computer games to
                 virtual prototyping, and engineering. All these areas
                 strive towards faster and larger scale simulations.
                 Particularly challenging are large-scale simulations
                 with highly organized and structured stacking. We
                 present a stable, robust, and versatile method for
                 multibody dynamics simulation. Novel contributions
                 include a new, explicit, fixed time-stepping scheme for
                 velocity-based complementarity formulations using shock
                 propagation with a simple reliable implementation
                 strategy for an iterative complementarity problem
                 solver specifically optimized for multibody dynamics.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "complementarity formulations; constraint-based
                 simulation; Multibody dynamics; shock-propagation;
                 stacking",
}

@Article{Yuan:2007:IDB,
  author =       "Lu Yuan and Jian Sun and Long Quan and Heung-Yeung
                 Shum",
  title =        "Image deblurring with blurred\slash noisy image
                 pairs",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "1:1--1:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276379",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Taking satisfactory photos under dim lighting
                 conditions using a hand-held camera is challenging. If
                 the camera is set to a long exposure time, the image is
                 blurred due to camera shake. On the other hand, the
                 image is dark and noisy if it is taken with a short
                 exposure time but with a high camera gain. By combining
                 information extracted from both blurred and noisy
                 images, however, we show in this paper how to produce a
                 high quality image that cannot be obtained by simply
                 denoising the noisy image, or deblurring the blurred
                 image alone.\par

                 Our approach is image deblurring with the help of the
                 noisy image. First, both images are used to estimate an
                 accurate blur kernel, which otherwise is difficult to
                 obtain from a single blurred image. Second, and again
                 using both images, a residual deconvolution is proposed
                 to significantly reduce ringing artifacts inherent to
                 image deconvolution. Third, the remaining ringing
                 artifacts in smooth image regions are further
                 suppressed by a gain-controlled deconvolution process.
                 We demonstrate the effectiveness of our approach using
                 a number of indoor and outdoor images taken by
                 off-the-shelf hand-held cameras in poor lighting
                 environments.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kopf:2007:STS,
  author =       "Johannes Kopf and Chi-Wing Fu and Daniel Cohen-Or and
                 Oliver Deussen and Dani Lischinski and Tien-Tsin Wong",
  title =        "Solid texture synthesis from {$2$D} exemplars",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "2:1--2:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276380",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel method for synthesizing solid
                 textures from 2D texture exemplars. First, we extend 2D
                 texture optimization techniques to synthesize 3D
                 texture solids. Next, the non-parametric texture
                 optimization approach is integrated with histogram
                 matching, which forces the global statistics of the
                 synthesized solid to match those of the exemplar. This
                 improves the convergence of the synthesis process and
                 enables using smaller neighborhoods. In addition to
                 producing compelling texture mapped surfaces, our
                 method also effectively models the material in the
                 interior of solid objects. We also demonstrate that our
                 method is well-suited for synthesizing textures with a
                 large number of channels per texel.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "solid texture; texture synthesis",
}

@Article{Lalonde:2007:PCA,
  author =       "Jean-Fran{\c{c}}ois Lalonde and Derek Hoiem and Alexei
                 A. Efros and Carsten Rother and John Winn and Antonio
                 Criminisi",
  title =        "Photo clip art",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "3:1--3:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276381",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a system for inserting new objects into
                 existing photographs by querying a vast image-based
                 object library, pre-computed using a publicly available
                 Internet object database. The central goal is to shield
                 the user from all of the arduous tasks typically
                 involved in image compositing. The user is only asked
                 to do two simple things: (1) pick a 3D location in the
                 scene to place a new object; (2) select an object to
                 insert using a hierarchical menu. We pose the problem
                 of object insertion as a data-driven, 3D-based,
                 context-sensitive object retrieval task. Instead of
                 trying to manipulate the object to change its
                 orientation, color distribution, etc. to fit the new
                 image, we simply retrieve an object of a specified
                 class that has all the required properties (camera
                 pose, lighting, resolution, etc) from our large object
                 library. We present new automatic algorithms for
                 improving object segmentation and blending, estimating
                 true 3D object size and orientation, and estimating
                 scene lighting conditions. We also present an intuitive
                 user interface that makes object insertion fast and
                 simple even for the artistically challenged.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "3D scene reasoning; blending and compositing;
                 computational photography; image databases; object
                 insertion",
}

@Article{Hays:2007:SCU,
  author =       "James Hays and Alexei A. Efros",
  title =        "Scene completion using millions of photographs",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "4:1--4:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276382",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "What can you do with a million images? In this paper
                 we present a new image completion algorithm powered by
                 a huge database of photographs gathered from the Web.
                 The algorithm patches up holes in images by finding
                 similar image regions in the database that are not only
                 seamless but also semantically valid. Our chief insight
                 is that while the space of images is effectively
                 infinite, the space of semantically differentiable
                 scenes is actually not that large. For many image
                 completion tasks we are able to find similar scenes
                 which contain image fragments that will convincingly
                 complete the image. Our algorithm is entirely
                 data-driven, requiring no annotations or labelling by
                 the user. Unlike existing image completion methods, our
                 algorithm can generate a diverse set of results for
                 each input image and we allow users to select among
                 them. We demonstrate the superiority of our algorithm
                 over existing image completion approaches.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "hole filling; image completion; image compositing;
                 image database; inpainting",
}

@Article{Cooper:2007:ALR,
  author =       "Seth Cooper and Aaron Hertzmann and Zoran
                 Popovi{\'c}",
  title =        "Active learning for real-time motion controllers",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "5:1--5:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276384",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper describes an approach to building real-time
                 highly-controllable characters. A kinematic character
                 controller is built on-the-fly during a capture
                 session, and updated after each new motion clip is
                 acquired. Active learning is used to identify which
                 motion sequence the user should perform next, in order
                 to improve the quality and responsiveness of the
                 controller. Because motion clips are selected
                 adaptively, we avoid the difficulty of manually
                 determining which ones to capture, and can build
                 complex controllers from scratch while significantly
                 reducing the number of necessary motion samples.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "active learning; human motion; motion capture",
}

@Article{McCann:2007:RCM,
  author =       "James McCann and Nancy Pollard",
  title =        "Responsive characters from motion fragments",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "6:1--6:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276385",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In game environments, animated character motion must
                 rapidly adapt to changes in player input - for example,
                 if a directional signal from the player's gamepad is
                 not incorporated into the character's trajectory
                 immediately, the character may blithely run off a
                 ledge. Traditional schemes for data-driven character
                 animation lack the split-second reactivity required for
                 this direct control; while they can be made to work,
                 motion artifacts will result. We describe an on-line
                 character animation controller that assembles a motion
                 stream from short motion fragments, choosing each
                 fragment based on current player input and the previous
                 fragment. By adding a simple model of player behavior
                 we are able to improve an existing reinforcement
                 learning method for precalculating good fragment
                 choices. We demonstrate the efficacy of our model by
                 comparing the animation selected by our new controller
                 to that selected by existing methods and to the optimal
                 selection, given knowledge of the entire path. This
                 comparison is performed over real-world data collected
                 from a game prototype. Finally, we provide results
                 indicating that occasional low-quality transitions
                 between motion segments are crucial to high-quality
                 on-line motion generation; this is an important result
                 for others crafting animation systems for
                 directly-controlled characters, as it argues against
                 the common practice of transition thresholding.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "character control; motion generation; motion graphs",
}

@Article{Treuille:2007:NOC,
  author =       "Adrien Treuille and Yongjoon Lee and Zoran
                 Popovi{\'c}",
  title =        "Near-optimal character animation with continuous
                 control",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "7:1--7:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276386",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new approach to realtime character
                 animation with interactive control. Given a corpus of
                 motion capture data and a desired task, we
                 automatically compute near-optimal controllers using a
                 low-dimensional basis representation. We show that
                 these controllers produce motion that fluidly responds
                 to several dimensions of user control and environmental
                 constraints in realtime. Our results indicate that very
                 few basis functions are required to create
                 high-fidelity character controllers which permit
                 complex user navigation and obstacle-avoidance tasks.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "human animation; motion with constraints; optimal
                 control",
}

@Article{Chai:2007:CBM,
  author =       "Jinxiang Chai and Jessica K. Hodgins",
  title =        "Constraint-based motion optimization using a
                 statistical dynamic model",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "8:1--8:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276387",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we present a technique for generating
                 animation from a variety of user-defined constraints.
                 We pose constraint-based motion synthesis as a maximum
                 a posterior (MAP) problem and develop an optimization
                 framework that generates natural motion satisfying user
                 constraints. The system automatically learns a
                 statistical dynamic model from motion capture data and
                 then enforces it as a motion prior. This motion prior,
                 together with user-defined constraints, comprises a
                 trajectory optimization problem. Solving this problem
                 in the low-dimensional space yields optimal natural
                 motion that achieves the goals specified by the user.
                 We demonstrate the effectiveness of this approach by
                 generating whole-body and facial motion from a variety
                 of spatial-temporal constraints.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "constraint-based motion synthesis; facial animation;
                 human body animation; motion capture data; motion
                 control; spatial-temporal constraints; statistical
                 dynamic models",
}

@Article{Wang:2007:SSI,
  author =       "Jue Wang and Maneesh Agrawala and Michael F. Cohen",
  title =        "Soft scissors: an interactive tool for realtime high
                 quality matting",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "9:1--9:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276389",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present Soft Scissors, an interactive tool for
                 extracting alpha mattes of foreground objects in
                 realtime. We recently proposed a novel offline matting
                 algorithm capable of extracting high-quality mattes for
                 complex foreground objects such as furry animals [Wang
                 and Cohen 2007]. In this paper we both improve the
                 quality of our offline algorithm and give it the
                 ability to incrementally update the matte in an online
                 interactive setting. Our realtime system efficiently
                 estimates foreground color thereby allowing both the
                 matte and the final composite to be revealed instantly
                 as the user roughly paints along the edge of the
                 foreground object. In addition, our system can
                 dynamically adjust the width and boundary conditions of
                 the scissoring paint brush to approximately capture the
                 boundary of the foreground object that lies ahead on
                 the scissor's path. These advantages in both speed and
                 accuracy create the first interactive tool for high
                 quality image matting and compositing.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Avidan:2007:SCC,
  author =       "Shai Avidan and Ariel Shamir",
  title =        "Seam carving for content-aware image resizing",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "10:1--10:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276390",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Effective resizing of images should not only use
                 geometric constraints, but consider the image content
                 as well. We present a simple image operator called seam
                 carving that supports content-aware image resizing for
                 both reduction and expansion. A seam is an optimal
                 8-connected path of pixels on a single image from top
                 to bottom, or left to right, where optimality is
                 defined by an image energy function. By repeatedly
                 carving out or inserting seams in one direction we can
                 change the aspect ratio of an image. By applying these
                 operators in both directions we can retarget the image
                 to a new size. The selection and order of seams protect
                 the content of the image, as defined by the energy
                 function. Seam carving can also be used for image
                 content enhancement and object removal. We support
                 various visual saliency measures for defining the
                 energy of an image, and can also include user input to
                 guide the process. By storing the order of seams in an
                 image we create multi-size images, that are able to
                 continuously change in real time to fit a given size.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "content-aware image manipulation; display devices;
                 image resizing; image retargeting; image seams",
}

@Article{Sun:2007:IVU,
  author =       "Jian Sun and Lin Liang and Fang Wen and Heung-Yeung
                 Shum",
  title =        "Image vectorization using optimized gradient meshes",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "11:1--11:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276391",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Recently, gradient meshes have been introduced as a
                 powerful vector graphics representation to draw
                 multicolored mesh objects with smooth transitions.
                 Using tools from Abode Illustrator and Corel CorelDraw,
                 a user can manually create gradient meshes even for
                 photo-realistic vector arts, which can be further
                 edited, stylized and animated.\par

                 In this paper, we present an easy-to-use interactive
                 tool, called optimized gradient mesh, to
                 semi-automatically and quickly create gradient meshes
                 from a raster image. We obtain the optimized gradient
                 mesh by formulating an energy minimization problem. The
                 user can also interactively specify a few vector lines
                 to guide the mesh generation. The resulting optimized
                 gradient mesh is an editable and scalable mesh that
                 otherwise would have taken many hours for a user to
                 manually create.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Fang:2007:DPS,
  author =       "Hui Fang and John C. Hart",
  title =        "Detail preserving shape deformation in image editing",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "12:1--12:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276392",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Shape deformation is a common practice in digital
                 image editing, but can unrealistically stretch or
                 compress texture detail. We propose an image editing
                 system that decouples feature position from pixel color
                 generation, by resynthesizing texture from the source
                 image to preserve its detail and orientation around a
                 new feature curve location. We introduce a new
                 distortion to patch-based texture synthesis that aligns
                 texture features with image features. A dense
                 correspondence field between source and target images
                 generated by the control curves then guides texture
                 synthesis.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Irving:2007:VCF,
  author =       "Geoffrey Irving and Craig Schroeder and Ronald
                 Fedkiw",
  title =        "Volume conserving finite element simulations of
                 deformable models",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "13:1--13:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276394",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose a numerical method for modeling highly
                 deformable nonlinear incompressible solids that
                 conserves the volume locally near each node in a finite
                 element mesh. Our method works with arbitrary
                 constitutive models, is applicable to both passive and
                 active materials (e.g. muscles), and works with simple
                 tetrahedra without the need for multiple quadrature
                 points or stabilization techniques. Although simple
                 linear tetrahedra typically suffer from locking when
                 modeling incompressible materials, our method enforces
                 incompressibility per node (in a one-ring), and we
                 demonstrate that it is free from locking. We correct
                 errors in volume without introducing oscillations by
                 treating position and velocity in separate implicit
                 solves. Finally, we propose a novel method for treating
                 both object contact and self-contact as linear
                 constraints during the incompressible solve,
                 alleviating issues in enforcing multiple possibly
                 conflicting constraints.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "collisions; deformable solids; incompressibility",
}

@Article{Twigg:2007:MWB,
  author =       "Christopher D. Twigg and Doug L. James",
  title =        "Many-worlds browsing for control of multibody
                 dynamics",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "14:1--14:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276395",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Animation techniques for controlling passive
                 simulation are commonly based on an optimization
                 paradigm: the user provides goals a priori, and
                 sophisticated numerical methods minimize a cost
                 function that represents these goals. Unfortunately,
                 for multibody systems with discontinuous contact events
                 these optimization problems can be highly nontrivial to
                 solve, and many-hour offline optimizations, unintuitive
                 parameters, and convergence failures can frustrate
                 end-users and limit usage. On the other hand, users are
                 quite adaptable, and systems which provide interactive
                 feedback via an intuitive interface can leverage the
                 user's own abilities to quickly produce interesting
                 animations. However, the online computation necessary
                 for interactivity limits scene complexity in
                 practice.\par

                 We introduce Many-Worlds Browsing, a method which
                 circumvents these limits by exploiting the speed of
                 multibody simulators to compute numerous example
                 simulations in parallel (offline and online), and allow
                 the user to browse and modify them interactively. We
                 demonstrate intuitive interfaces through which the user
                 can select among the examples and interactively adjust
                 those parts of the scene that do not match his
                 requirements. We show that using a combination of our
                 techniques, unusual and interesting results can be
                 generated for moderately sized scenes with under an
                 hour of user time. Scalability is demonstrated by
                 sampling much larger scenes using modest offline
                 computations.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "browsing; control; data-driven animation; interactive
                 animation; rigid body dynamics",
}

@Article{Zhang:2007:CCD,
  author =       "Xinyu Zhang and Stephane Redon and Minkyoung Lee and
                 Young J. Kim",
  title =        "Continuous collision detection for articulated models
                 using {Taylor} models and temporal culling",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "15:1--15:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276396",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a fast continuous collision detection (CCD)
                 algorithm for articulated models using Taylor models
                 and temporal culling. Our algorithm is a generalization
                 of conservative advancement (CA) from convex models
                 [Mirtich 1996] to articulated models with non-convex
                 links. Given the initial and final configurations of a
                 moving articulated model, our algorithm creates a
                 continuous motion with constant translational and
                 rotational velocities for each link, and checks for
                 interferences between the articulated model under
                 continuous motion and other models in the environment
                 and for self-collisions. If collisions occur, our
                 algorithm reports the first time of contact (TOC) as
                 well as collision witness features. We have implemented
                 our CCD algorithm and applied it to several challenging
                 scenarios including locomotion generation,
                 articulated-body dynamics and character motion
                 planning. Our algorithm can perform CCDs including
                 self-collision detection for articulated models
                 consisting of many links and tens of thousands of
                 triangles in 1.22 ms on average running on a 3.6 GHz
                 Pentium 4 PC. This is an improvement on the performance
                 of prior algorithms of more than an order of
                 magnitude.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "articulated models; conservative advancement;
                 continuous collision detection; convex decomposition;
                 dynamics simulation",
}

@Article{Bargteil:2007:FEM,
  author =       "Adam W. Bargteil and Chris Wojt{\'a}n and Jessica K.
                 Hodgins and Greg Turk",
  title =        "A finite element method for animating large
                 viscoplastic flow",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "16:1--16:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276397",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an extension to Lagrangian finite element
                 methods to allow for large plastic deformations of
                 solid materials. These behaviors are seen in such
                 everyday materials as shampoo, dough, and clay as well
                 as in fantastic gooey and blobby creatures in special
                 effects scenes. To account for plastic deformation, we
                 explicitly update the linear basis functions defined
                 over the finite elements during each simulation step.
                 When these updates cause the basis functions to become
                 ill-conditioned, we remesh the simulation domain to
                 produce a new high-quality finite-element mesh, taking
                 care to preserve the original boundary. We also
                 introduce an enhanced plasticity model that preserves
                 volume and includes creep and work hardening/softening.
                 We demonstrate our approach with simulations of
                 synthetic objects that squish, dent, and flow. To
                 validate our methods, we compare simulation results to
                 videos of real materials.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational fluid dynamics; deformable models;
                 elastoplastic; finite element methods; natural
                 phenomena; physically based animation; viscoelastic;
                 viscoplastic",
}

@Article{Todo:2007:LCS,
  author =       "Hideki Todo and Ken-ichi Anjyo and William Baxter and
                 Takeo Igarashi",
  title =        "Locally controllable stylized shading",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "17:1--17:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276399",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Recent progress in non-photorealistic rendering (NPR)
                 has led to many stylized shading techniques that
                 efficiently convey visual information about the objects
                 depicted. Another crucial goal of NPR is to give
                 artists simple and direct ways to express the abstract
                 ideas born of their imaginations. In particular, the
                 ability to add intentional, but often unrealistic,
                 shading effects is indispensable for many applications.
                 We propose a set of simple stylized shading algorithms
                 that allow the user to freely add localized light and
                 shade to a model in a manner that is consistent and
                 seamlessly integrated with conventional lighting
                 techniques. The algorithms provide an intuitive, direct
                 manipulation method based on a paint-brush metaphor, to
                 control and edit the light and shade locally as
                 desired. Our prototype system demonstrates how our
                 method can enhance both the quality and range of
                 applicability of conventional stylized shading for
                 offline animation and interactive applications.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "direct manipulation; non-photorealistic rendering;
                 stylized shading",
}

@Article{Lee:2007:LDA,
  author =       "Yunjin Lee and Lee Markosian and Seungyong Lee and
                 John F. Hughes",
  title =        "Line drawings via abstracted shading",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "18:1--18:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276400",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We describe a GPU-based algorithm for rendering a 3D
                 model as a line drawing, based on the insight that a
                 line drawing can be understood as an abstraction of a
                 shaded image. We thus render lines along tone
                 boundaries or thin dark areas in the shaded image. We
                 extend this notion to the dual: we render highlight
                 lines along thin bright areas and tone boundaries. We
                 combine the lines with tone shading to capture broad
                 regions of tone.\par

                 The resulting line drawings effectively convey both
                 shape and material cues. The lines produced by the
                 method can include silhouettes. creases, and ridges,
                 along with a generalization of suggestive contours that
                 responds to lighting as well as viewing changes. The
                 method supports automatic level of abstraction, where
                 the size of depicted shape features adjusts
                 appropriately as the camera zooms in or out. Animated
                 models can be rendered in real time because costly mesh
                 curvature calculations are not needed.",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Judd:2007:ARL,
  author =       "Tilke Judd and Fr{\'e}do Durand and Edward Adelson",
  title =        "Apparent ridges for line drawing",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "19:1--19:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276401",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Three-dimensional shape can be drawn using a variety
                 of feature lines, but none of the current definitions
                 alone seem to capture all visually-relevant lines. We
                 introduce a new definition of feature lines based on
                 two perceptual observations. First, human perception is
                 sensitive to the variation of shading, and since shape
                 perception is little affected by lighting and
                 reflectance modification, we should focus on normal
                 variation. Second, view-dependent lines better convey
                 smooth surfaces. From this we define view-dependent
                 curvature as the variation of the surface normal with
                 respect to a viewing screen plane, and apparent ridges
                 as the loci of points that maximize a view-dependent
                 curvature. We present a formal definition of apparent
                 ridges and an algorithm to render line drawings of 3D
                 meshes. We show that our apparent ridges encompass or
                 enhance aspects of several other feature lines.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "apparent ridges; line drawing; NPR; ridges; valleys",
}

@Article{Breslav:2007:DPS,
  author =       "Simon Breslav and Karol Szerszen and Lee Markosian and
                 Pascal Barla and Jo{\"e}lle Thollot",
  title =        "Dynamic {$2$D} patterns for shading {$3$D} scenes",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "20:1--20:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276402",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We describe a new way to render 3D scenes in a variety
                 of non-photorealistic styles, based on patterns whose
                 structure and motion are defined in 2D. In doing so, we
                 sacrifice the ability of patterns that wrap onto 3D
                 surfaces to convey shape through their structure and
                 motion. In return, we gain several advantages, chiefly
                 that 2D patterns are more visually abstract - a quality
                 often sought by artists, which explains their
                 widespread use in hand-drawn images.\par

                 Extending such styles to 3D graphics presents a
                 challenge: how should a 2D pattern move? Our solution
                 is to transform it each frame by a 2D similarity
                 transform that closely follows the underlying 3D shape.
                 The resulting motion is often surprisingly effective,
                 and has a striking cartoon quality that matches the
                 visual style.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Brown:2007:GNR,
  author =       "Benedict J. Brown and Szymon Rusinkiewicz",
  title =        "Global non-rigid alignment of {$3$-D} scans",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "21:1--21:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276404",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "A key challenge in reconstructing high-quality 3D
                 scans is registering data from different viewpoints.
                 Existing global (multiview) alignment algorithms are
                 restricted to rigid-body transformations, and cannot
                 adequately handle non-rigid warps frequently present in
                 real-world datasets. Moreover, algorithms that can
                 compensate for such warps between pairs of scans do not
                 easily generalize to the multiview case. We present an
                 algorithm for obtaining a globally optimal alignment of
                 multiple overlapping datasets in the presence of
                 low-frequency non-rigid deformations, such as those
                 caused by device nonlinearities or calibration error.
                 The process first obtains sparse correspondences
                 between views using a locally weighted,
                 stability-guaranteeing variant of iterative closest
                 points (ICP). Global positions for feature points are
                 found using a relaxation method, and the scans are
                 warped to their final positions using thin-plate
                 splines. Our framework efficiently handles large
                 datasets---thousands of scans comprising hundreds of
                 millions of samples---for both rigid and non-rigid
                 alignment, with the non-rigid case requiring little
                 overhead beyond rigid-body alignment. We demonstrate
                 that, relative to rigid-body registration, it improves
                 the quality of alignment and better preserves detail in
                 3D datasets from a variety of scanners exhibiting
                 non-rigid distortion.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lipman:2007:PFP,
  author =       "Yaron Lipman and Daniel Cohen-Or and David Levin and
                 Hillel Tal-Ezer",
  title =        "Parameterization-free projection for geometry
                 reconstruction",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "22:1--22:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276405",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce a Locally Optimal Projection operator
                 (LOP) for surface approximation from point-set data.
                 The operator is parameterization free, in the sense
                 that it does not rely on estimating a local normal,
                 fitting a local plane, or using any other local
                 parametric representation. Therefore, it can deal with
                 noisy data which clutters the orientation of the
                 points. The method performs well in cases of ambiguous
                 orientation, e.g. , if two folds of a surface lie near
                 each other, and other cases of complex geometry in
                 which methods based upon local plane fitting may fail.
                 Although defined by a global minimization problem, the
                 method is effectively local, and it provides a second
                 order approximation to smooth surfaces. Hence allowing
                 good surface approximation without using any explicit
                 or implicit approximation space. Furthermore, we show
                 that LOP is highly robust to noise and outliers and
                 demonstrate its effectiveness by applying it to raw
                 scanned data of complex shapes.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "geometry projection operator; point-cloud; surface
                 reconstruction",
}

@Article{Guennebaud:2007:APS,
  author =       "Ga{\"e}l Guennebaud and Markus Gross",
  title =        "Algebraic point set surfaces",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "23:1--23:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276406",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper we present a new Point Set Surface (PSS)
                 definition based on moving least squares (MLS) fitting
                 of algebraic spheres. Our surface representation can be
                 expressed by either a projection procedure or in
                 implicit form. The central advantages of our approach
                 compared to existing planar MLS include significantly
                 improved stability of the projection under low sampling
                 rates and in the presence of high curvature. The method
                 can approximate or interpolate the input point set and
                 naturally handles planar point clouds. In addition, our
                 approach provides a reliable estimate of the mean
                 curvature of the surface at no additional cost and
                 allows for the robust handling of sharp features and
                 boundaries. It processes a simple point set as input,
                 but can also take significant advantage of surface
                 normals to improve robustness, quality and performance.
                 We also present a novel normal estimation procedure
                 which exploits the properties of the spherical fit for
                 both direction estimation and orientation propagation.
                 Very efficient computational procedures enable us to
                 compute the algebraic sphere fitting with up to 40
                 million points per second on latest generation GPUs.",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "moving least square surfaces; point based graphics;
                 sharp features; surface representation",
}

@Article{Katz:2007:DVP,
  author =       "Sagi Katz and Ayellet Tal and Ronen Basri",
  title =        "Direct visibility of point sets",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "24:1--24:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276407",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper proposes a simple and fast operator, the
                 `Hidden' Point Removal operator, which determines the
                 visible points in a point cloud, as viewed from a given
                 viewpoint. Visibility is determined without
                 reconstructing a surface or estimating normals. It is
                 shown that extracting the points that reside on the
                 convex hull of a transformed point cloud, amounts to
                 determining the visible points. This operator is
                 general - it can be applied to point clouds at various
                 dimensions, on both sparse and dense point clouds, and
                 on viewpoints internal as well as external to the
                 cloud. It is demonstrated that the operator is useful
                 in visualizing point clouds, in view-dependent
                 reconstruction and in shadow casting.",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "point-based graphics; visibility; visualizing point
                 sets",
}

@Article{Ragan-Kelley:2007:LAI,
  author =       "Jonathan Ragan-Kelley and Charlie Kilpatrick and Brian
                 W. Smith and Doug Epps and Paul Green and Christophe
                 Hery and Fr{\'e}do Durand",
  title =        "The lightspeed automatic interactive lighting preview
                 system",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "25:1--25:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276409",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an automated approach for high-quality
                 preview of feature-film rendering during lighting
                 design. Similar to previous work, we use a
                 deep-framebuffer shaded on the GPU to achieve
                 interactive performance. Our first contribution is to
                 generate the deep-framebuffer and corresponding shaders
                 automatically through data-flow analysis and
                 compilation of the original scene. Cache compression
                 reduces automatically-generated deep-framebuffers to
                 reasonable size for complex production scenes and
                 shaders. We also propose a new structure, the indirect
                 framebuffer, that decouples shading samples from final
                 pixels and allows a deep-framebuffer to handle
                 antialiasing, motion blur and transparency efficiently.
                 Progressive refinement enables fast feedback at coarser
                 resolution. We demonstrate our approach in real-world
                 production.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "data-flow analysis; GPUs; interactive rendering;
                 lighting preview; programmable shading; RenderMan",
}

@Article{Hasan:2007:MRC,
  author =       "Milo{\v{s}} Ha{\v{s}}an and Fabio Pellacini and Kavita
                 Bala",
  title =        "Matrix row-column sampling for the many-light
                 problem",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "26:1--26:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276410",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Rendering complex scenes with indirect illumination,
                 high dynamic range environment lighting, and many
                 direct light sources remains a challenging problem.
                 Prior work has shown that all these effects can be
                 approximated by many point lights. This paper presents
                 a scalable solution to the many-light problem suitable
                 for a GPU implementation. We view the problem as a
                 large matrix of sample-light interactions; the ideal
                 final image is the sum of the matrix columns. We
                 propose an algorithm for approximating this sum by
                 sampling entire rows and columns of the matrix on the
                 GPU using shadow mapping. The key observation is that
                 the inherent structure of the transfer matrix can be
                 revealed by sampling just a small number of rows and
                 columns. Our prototype implementation can compute the
                 light transfer within a few seconds for scenes with
                 indirect and environment illumination, area lights,
                 complex geometry and arbitrary shaders. We believe this
                 approach can be very useful for rapid previewing in
                 applications like cinematic and architectural lighting
                 design.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "global illumination; GPU; many lights; sampling",
}

@Article{Sun:2007:IRD,
  author =       "Xin Sun and Kun Zhou and Yanyun Chen and Stephen Lin
                 and Jiaoying Shi and Baining Guo",
  title =        "Interactive relighting with dynamic {BRDFs}",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "27:1--27:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276411",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a technique for interactive relighting in
                 which source radiance, viewing direction, and BRDFs can
                 all be changed on the fly. In handling dynamic BRDFs,
                 our method efficiently accounts for the effects of BRDF
                 modification on the reflectance and incident radiance
                 at a surface point. For reflectance, we develop a BRDF
                 tensor representation that can be factorized into
                 adjustable terms for lighting, viewing, and BRDF
                 parameters. For incident radiance, there exists a
                 non-linear relationship between indirect lighting and
                 BRDFs in a scene, which makes linear light transport
                 frameworks such as PRT unsuitable. To overcome this
                 problem, we introduce precomputed transfer tensors
                 (PTTs) which decompose indirect lighting into
                 precomputable components that are each a function of
                 BRDFs in the scene, and can be rapidly combined at run
                 time to correctly determine incident radiance. We
                 additionally describe a method for efficient handling
                 of high-frequency specular reflections by separating
                 them from the BRDF tensor representation and processing
                 them using precomputed visibility information. With
                 relighting based on PTTs, interactive performance with
                 indirect lighting is demonstrated in applications to
                 BRDF animation and material tuning.",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bidirectional reflectance distribution function;
                 global illumination; precomputed radiance transfer;
                 relighting; tensor factorization",
}

@Article{Han:2007:FDN,
  author =       "Charles Han and Bo Sun and Ravi Ramamoorthi and Eitan
                 Grinspun",
  title =        "Frequency domain normal map filtering",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "28:1--28:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276412",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Filtering is critical for representing detail, such as
                 color textures or normal maps, across a variety of
                 scales. While MIP-mapping texture maps is commonplace,
                 accurate normal map filtering remains a challenging
                 problem because of nonlinearities in shading---we
                 cannot simply average nearby surface normals. In this
                 paper, we show analytically that normal map filtering
                 can be formalized as a spherical convolution of the
                 normal distribution function (NDF) and the BRDF, for a
                 large class of common BRDFs such as Lambertian,
                 microfacet and factored measurements. This theoretical
                 result explains many previous filtering techniques as
                 special cases, and leads to a generalization to a
                 broader class of measured and analytic BRDFs. Our
                 practical algorithms leverage a significant body of
                 work that has studied lighting-BRDF convolution. We
                 show how spherical harmonics can be used to filter the
                 NDF for Lambertian and low-frequency specular BRDFs,
                 while spherical von Mises-Fisher distributions can be
                 used for high-frequency materials.",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Xu:2007:IGM,
  author =       "Jie Xu and Craig S. Kaplan",
  title =        "Image-guided maze construction",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "29:1--29:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276414",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a set of graphical and combinatorial
                 algorithms for designing mazes based on images. The
                 designer traces regions of interest in an image and
                 annotates the regions with style parameters. They can
                 optionally specify a solution path, which provides a
                 rough guide for laying out the maze's actual solution.
                 The system uses novel extensions to well-known maze
                 construction algorithms to build mazes that approximate
                 the tone of the source image, express the desired style
                 in each region, and conform to the user's solution
                 path.",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "halftoning; labyrinth; line drawing; maze;
                 streamline",
}

@Article{Asente:2007:DPM,
  author =       "Paul Asente and Mike Schuster and Teri Pettit",
  title =        "Dynamic planar map illustration",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "30:1--30:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276415",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "There are many types of illustrations that are easier
                 to create in planar-map-based illustration systems than
                 in the more common stacking-based systems. One weakness
                 shared by all existing planar-map-based systems is that
                 the editability of the drawing is severely hampered
                 once coloring has begun. The paths that define the
                 areas to be filled become divided wherever they
                 intersect, making it difficult or impossible to edit
                 them as a whole.\par

                 Live Paint is a new metaphor that allows
                 planar-map-based coloring while maintaining all the
                 original paths unchanged. When a user makes a change,
                 the regions and edges defined by the new paths take on
                 fill and stroke attributes from the previous regions
                 and edges. This results in greater editing flexibility
                 and ease of use. Live Paint uses a set of heuristics to
                 match each region and edge in a changed illustration
                 with a region or edge in the previous version, a task
                 that is more difficult than it at first appears. It
                 then transfers fill and stroke attributes
                 accordingly.",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "dynamic; gap detection; graphics editor; planar map;
                 recoloring; vector illustration",
}

@Article{Li:2007:ICI,
  author =       "Wilmot Li and Lincoln Ritter and Maneesh Agrawala and
                 Brian Curless and David Salesin",
  title =        "Interactive cutaway illustrations of complex {$3$D}
                 models",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "31:1--31:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276416",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a system for authoring and viewing
                 interactive cutaway illustrations of complex 3D models
                 using conventions of traditional scientific and
                 technical illustration. Our approach is based on the
                 two key ideas that (1) cuts should respect the geometry
                 of the parts being cut, and (2) cutaway illustrations
                 should support interactive exploration. In our
                 approach, an author instruments a 3D model with
                 auxiliary parameters, which we call `rigging,' that
                 define how cutaways of that structure are formed. We
                 provide an authoring interface that automates most of
                 the rigging process. We also provide a viewing
                 interface that allows viewers to explore rigged models
                 using high-level interactions. In particular, the
                 viewer can just select a set of target structures, and
                 the system will automatically generate a cutaway
                 illustration that exposes those parts. We have tested
                 our system on a variety of CAD and anatomical models,
                 and our results demonstrate that our approach can be
                 used to create and view effective interactive cutaway
                 illustrations for a variety of complex objects with
                 little user effort.",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cutaway illustration; interactive; visualization",
}

@Article{Weyrich:2007:DBR,
  author =       "Tim Weyrich and Jia Deng and Connelly Barnes and
                 Szymon Rusinkiewicz and Adam Finkelstein",
  title =        "Digital bas-relief from {$3$D} scenes",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "32:1--32:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276417",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a system for semi-automatic creation of
                 bas-relief sculpture. As an artistic medium, relief
                 spans the continuum between 2D drawing or painting and
                 full 3D sculpture. Bas-relief (or low relief) presents
                 the unique challenge of squeezing shapes into a
                 nearly-flat surface while maintaining as much as
                 possible the perception of the full 3D scene. Our
                 solution to this problem adapts methods from the
                 tone-mapping literature, which addresses the similar
                 problem of squeezing a high dynamic range image into
                 the (low) dynamic range available on typical display
                 devices. However, the bas-relief medium imposes its own
                 unique set of requirements, such as maintaining small,
                 fixed-size depth discontinuities. Given a 3D model,
                 camera, and a few parameters describing the relative
                 attenuation of different frequencies in the shape, our
                 system creates a relief that gives the illusion of the
                 3D shape from a given vantage point while conforming to
                 a greatly compressed height.",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "geometry generation; non-photorealistic rendering;
                 sculpture; tone mapping",
}

@Article{Bickel:2007:MSC,
  author =       "Bernd Bickel and Mario Botsch and Roland Angst and
                 Wojciech Matusik and Miguel Otaduy and Hanspeter
                 Pfister and Markus Gross",
  title =        "Multi-scale capture of facial geometry and motion",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "33:1--33:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276419",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel multi-scale representation and
                 acquisition method for the animation of high-resolution
                 facial geometry and wrinkles. We first acquire a static
                 scan of the face including reflectance data at the
                 highest possible quality. We then augment a traditional
                 marker-based facial motion-capture system by two
                 synchronized video cameras to track expression
                 wrinkles. The resulting model consists of
                 high-resolution geometry, motion-capture data, and
                 expression wrinkles in 2D parametric form. This
                 combination represents the facial shape and its salient
                 features at multiple scales. During motion synthesis
                 the motion-capture data deforms the high-resolution
                 geometry using a linear shell-based mesh-deformation
                 method. The wrinkle geometry is added to the facial
                 base mesh using nonlinear energy optimization. We
                 present the results of our approach for performance
                 replay as well as for wrinkle editing.",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; face modeling; motion capture",
}

@Article{White:2007:CAO,
  author =       "Ryan White and Keenan Crane and D. A. Forsyth",
  title =        "Capturing and animating occluded cloth",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "34:1--34:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276420",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We capture the shape of moving cloth using a custom
                 set of color markers printed on the surface of the
                 cloth. The output is a sequence of triangle meshes with
                 static connectivity and with detail at the scale of
                 individual markers in both smooth and folded regions.
                 We compute markers' coordinates in space using
                 correspondence across multiple synchronized video
                 cameras. Correspondence is determined from color
                 information in small neighborhoods and refined using a
                 novel strain pruning process. Final correspondence does
                 not require neighborhood information. We use a novel
                 data driven hole-filling technique to fill occluded
                 regions. Our results include several challenging
                 examples: a wrinkled shirt sleeve, a dancing pair of
                 pants, and a rag tossed onto a cup. Finally, we
                 demonstrate that cloth capture is reusable by animating
                 a pair of pants using human motion capture data.",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Vlasic:2007:PMC,
  author =       "Daniel Vlasic and Rolf Adelsberger and Giovanni
                 Vannucci and John Barnwell and Markus Gross and
                 Wojciech Matusik and Jovan Popovi{\'c}",
  title =        "Practical motion capture in everyday surroundings",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "35:1--35:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276421",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Commercial motion-capture systems produce excellent
                 in-studio reconstructions, but offer no comparable
                 solution for acquisition in everyday environments. We
                 present a system for acquiring motions almost anywhere.
                 This wearable system gathers ultrasonic time-of-flight
                 and inertial measurements with a set of inexpensive
                 miniature sensors worn on the garment. After recording,
                 the information is combined using an Extended Kalman
                 Filter to reconstruct joint configurations of a body.
                 Experimental results show that even motions that are
                 traditionally difficult to acquire are recorded with
                 ease within their natural settings. Although our
                 prototype does not reliably recover the global
                 transformation, we show that the resulting motions are
                 visually similar to the original ones, and that the
                 combined acoustic and inertial system reduces the drift
                 commonly observed in purely inertial systems. Our final
                 results suggest that this system could become a
                 versatile input device for a variety of
                 augmented-reality applications.",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "augmented reality; motion capture",
}

@Article{Raskar:2007:PLA,
  author =       "Ramesh Raskar and Hideaki Nii and Bert deDecker and
                 Yuki Hashimoto and Jay Summet and Dylan Moore and Yong
                 Zhao and Jonathan Westhues and Paul Dietz and John
                 Barnwell and Shree Nayar and Masahiko Inami and
                 Philippe Bekaert and Michael Noland and Vlad Branzoi
                 and Erich Bruns",
  title =        "Prakash: lighting aware motion capture using
                 photosensing markers and multiplexed illuminators",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "36:1--36:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276422",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we present a high speed optical motion
                 capture method that can measure three dimensional
                 motion, orientation, and incident illumination at
                 tagged points in a scene. We use tracking tags that
                 work in natural lighting conditions and can be
                 imperceptibly embedded in attire or other objects. Our
                 system supports an unlimited number of tags in a scene,
                 with each tag uniquely identified to eliminate marker
                 reacquisition issues. Our tags also provide incident
                 illumination data which can be used to match scene
                 lighting when inserting synthetic elements. The
                 technique is therefore ideal for on-set motion capture
                 or real-time broadcasting of virtual sets.\par

                 Unlike previous methods that employ high speed cameras
                 or scanning lasers, we capture the scene appearance
                 using the simplest possible optical devices - a
                 light-emitting diode (LED) with a passive binary mask
                 used as the transmitter and a photosensor used as the
                 receiver. We strategically place a set of optical
                 transmitters to spatio-temporally encode the volume of
                 interest. Photosensors attached to scene points
                 demultiplex the coded optical signals from multiple
                 transmitters, allowing us to compute not only receiver
                 location and orientation but also their incident
                 illumination and the reflectance of the surfaces to
                 which the photosensors are attached. We use our
                 untethered tag system, called Prakash, to demonstrate
                 methods of adding special effects to captured videos
                 that cannot be accomplished using pure vision
                 techniques that rely on camera images.",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Talvala:2007:VGH,
  author =       "Eino-Ville Talvala and Andrew Adams and Mark Horowitz
                 and Marc Levoy",
  title =        "Veiling glare in high dynamic range imaging",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "37:1--37:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276424",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The ability of a camera to record a high dynamic range
                 image, whether by taking one snapshot or a sequence, is
                 limited by the presence of veiling glare - the tendency
                 of bright objects in the scene to reduce the contrast
                 everywhere within the field of view. Veiling glare is a
                 global illumination effect that arises from multiple
                 scattering of light inside the camera's body and lens
                 optics. By measuring separately the direct and indirect
                 components of the intra-camera light transport, one can
                 increase the maximum dynamic range a particular camera
                 is capable of recording. In this paper, we quantify the
                 presence of veiling glare and related optical artifacts
                 for several types of digital cameras, and we describe
                 two methods for removing them: deconvolution by a
                 measured glare spread function, and a novel
                 direct-indirect separation of the lens transport using
                 a structured occlusion mask. In the second method, we
                 selectively block the light that contributes to veiling
                 glare, thereby attaining significantly higher
                 signal-to-noise ratios than with deconvolution.
                 Finally, we demonstrate our separation method for
                 several combinations of cameras and realistic scenes.",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational photography; global illumination; HDR
                 imaging; structured occlusion mask; veiling glare",
}

@Article{Akyuz:2007:DHD,
  author =       "Ahmet O{\u{g}}uz Aky{\"u}z and Roland Fleming and
                 Bernhard E. Riecke and Erik Reinhard and Heinrich H.
                 B{\"u}lthoff",
  title =        "Do {HDR} displays support {LDR} content?: a
                 psychophysical evaluation",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "38:1--38:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276425",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The development of high dynamic range (HDR) imagery
                 has brought us to the verge of arguably the largest
                 change in image display technologies since the
                 transition from black-and-white to color television.
                 Novel capture and display hardware will soon enable
                 consumers to enjoy the HDR experience in their own
                 homes. The question remains, however, of what to do
                 with existing images and movies, which are
                 intrinsically low dynamic range (LDR). Can this
                 enormous volume of legacy content also be displayed
                 effectively on HDR displays? We have carried out a
                 series of rigorous psychophysical investigations to
                 determine how LDR images are best displayed on a
                 state-of-the-art HDR monitor, and to identify which
                 stages of the HDR imaging pipeline are perceptually
                 most critical. Our main findings are: (1) As expected,
                 HDR displays outperform LDR ones. (2) Surprisingly, HDR
                 images that are tone-mapped for display on standard
                 monitors are often no better than the best single LDR
                 exposure from a bracketed sequence. (3) Most
                 importantly of all, LDR data does not necessarily
                 require sophisticated treatment to produce a compelling
                 HDR experience. Simply boosting the range of an LDR
                 image linearly to fit the HDR display can equal or even
                 surpass the appearance of a true HDR image. Thus the
                 potentially tricky process of inverse tone mapping can
                 be largely circumvented.",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "high dynamic range (HDR) imaging; high dynamic range
                 display devices; psychophysics; tone mapping",
}

@Article{Rempel:2007:LFR,
  author =       "Allan G. Rempel and Matthew Trentacoste and Helge
                 Seetzen and H. David Young and Wolfgang Heidrich and
                 Lorne Whitehead and Greg Ward",
  title =        "Ldr2Hdr: on-the-fly reverse tone mapping of legacy
                 video and photographs",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "39:1--39:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276426",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "New generations of display devices promise to provide
                 significantly improved dynamic range over conventional
                 display technology. In the long run, evolving camera
                 technology and file formats will provide high fidelity
                 content for these display devices. In the near term,
                 however, the vast majority of images and video will
                 only be available in low dynamic range formats.\par

                 In this paper we describe a method for boosting the
                 dynamic range of legacy video and photographs for
                 viewing on high dynamic range displays. Our emphasis is
                 on real-time processing of video streams, such as web
                 streams or the signal from a DVD player. We place
                 particular emphasis on robustness of the method, and
                 its ability to deal with a wide range of content
                 without user adjusted parameters or visible artifacts.
                 The method can be implemented on both graphics hardware
                 and on signal processors that are directly integrated
                 in the HDR displays.",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "image and video processing - high dynamic range/tone
                 mapping; methods and applications - signal processing",
}

@Article{Jones:2007:RIL,
  author =       "Andrew Jones and Ian McDowall and Hideshi Yamada and
                 Mark Bolas and Paul Debevec",
  title =        "Rendering for an interactive 360{$^\circ$} light field
                 display",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "40:1--40:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276427",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We describe a set of rendering techniques for an
                 autostereoscopic light field display able to present
                 interactive 3D graphics to multiple simultaneous
                 viewers 360 degrees around the display. The display
                 consists of a high-speed video projector, a spinning
                 mirror covered by a holographic diffuser, and FPGA
                 circuitry to decode specially rendered DVI video
                 signals. The display uses a standard programmable
                 graphics card to render over 5,000 images per second of
                 interactive 3D graphics, projecting 360-degree views
                 with 1.25 degree separation up to 20 updates per
                 second. We describe the system's projection geometry
                 and its calibration process, and we present a
                 multiple-center-of-projection rendering technique for
                 creating perspective-correct images from arbitrary
                 viewpoints around the display. Our projection technique
                 allows correct vertical perspective and parallax to be
                 rendered for any height and distance when these
                 parameters are known, and we demonstrate this effect
                 with interactive raster graphics using a tracking
                 system to measure the viewer's height and distance. We
                 further apply our projection technique to the display
                 of photographed light fields with accurate horizontal
                 and vertical parallax. We conclude with a discussion of
                 the display's visual accommodation performance and
                 discuss techniques for displaying color imagery.",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "autostereocopic displays; graphics hardware;
                 image-based rendering; light field; real-time
                 rendering",
}

@Article{Nealen:2007:FDF,
  author =       "Andrew Nealen and Takeo Igarashi and Olga Sorkine and
                 Marc Alexa",
  title =        "{FiberMesh}: designing freeform surfaces with {$3$D}
                 curves",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "41:1--41:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276429",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents a system for designing freeform
                 surfaces with a collection of 3D curves. The user first
                 creates a rough 3D model by using a sketching
                 interface. Unlike previous sketching systems, the
                 user-drawn strokes stay on the model surface and serve
                 as handles for controlling the geometry. The user can
                 add, remove, and deform these control curves easily, as
                 if working with a 2D line drawing. The curves can have
                 arbitrary topology; they need not be connected to each
                 other. For a given set of curves, the system
                 automatically constructs a smooth surface embedding by
                 applying functional optimization. Our system provides
                 real-time algorithms for both control curve deformation
                 and the subsequent surface optimization. We show that
                 one can create sophisticated models using this system,
                 which have not yet been seen in previous sketching or
                 functional optimization systems.",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "deformations; differential representations; fair
                 surface design; sketch based interfaces and modeling;
                 sketching",
}

@Article{Ju:2007:ETM,
  author =       "Tao Ju and Qian-Yi Zhou and Shi-Min Hu",
  title =        "Editing the topology of {$3$D} models by sketching",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "42:1--42:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276430",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a method for modifying the topology of a 3D
                 model with user control. The heart of our method is a
                 guided topology editing algorithm. Given a source model
                 and a user-provided target shape, the algorithm
                 modifies the source so that the resulting model is
                 topologically consistent with the target. Our algorithm
                 permits removing or adding various topological features
                 (e.g. , handles, cavities and islands) in a common
                 framework and ensures that each topological change is
                 made by minimal modification to the source model. To
                 create the target shape, we have also designed a
                 convenient 2D sketching interface for drawing 3D line
                 skeletons. As demonstrated in a suite of examples, the
                 use of sketching allows more accurate removal of
                 topological artifacts than previous methods, and
                 enables creative designs with specific topological
                 goals.",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "skeleton; sketching; topology repair",
}

@Article{Sharf:2007:ITA,
  author =       "Andrei Sharf and Thomas Lewiner and Gil Shklarski and
                 Sivan Toledo and Daniel Cohen-Or",
  title =        "Interactive topology-aware surface reconstruction",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "43:1--43:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276431",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The reconstruction of a complete watertight model from
                 scan data is still a difficult process. In particular,
                 since scanned data is often incomplete, the
                 reconstruction of the expected shape is an ill-posed
                 problem. Techniques that reconstruct poorly-sampled
                 areas without any user intervention fail in many cases
                 to faithfully reconstruct the topology of the model.
                 The method that we introduce in this paper is
                 topology-aware: it uses minimal user input to make
                 correct decisions at regions where the topology of the
                 model cannot be automatically induced with a reasonable
                 degree of confidence. We first construct a continuous
                 function over a three-dimensional domain. This function
                 is constructed by minimizing a penalty function
                 combining the data points, user constraints, and a
                 regularization term. The optimization problem is
                 formulated in a mesh-independent manner, and mapped
                 onto a specific mesh using the finite-element method.
                 The zero level-set of this function is a first
                 approximation of the reconstructed surface. At complex
                 under-sampled regions, the constraints might be
                 insufficient. Hence, we analyze the local topological
                 stability of the zero level-set to detect weak regions
                 of the surface. These regions are suggested to the user
                 for adding local inside/outside constraints by merely
                 scribbling over a 2D tablet. Each new user constraint
                 modifies the minimization problem, which is solved
                 incrementally. The process is repeated, converging to a
                 topology-stable reconstruction. Reconstructions of
                 models acquired by a structured-light scanner with a
                 small number of scribbles demonstrate the effectiveness
                 of the method.",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "interactive tools; surface reconstruction",
}

@Article{Wu:2007:SIN,
  author =       "Tai-Pang Wu and Chi-Keung Tang and Michael S. Brown
                 and Heung-Yeung Shum",
  title =        "{ShapePalettes}: interactive normal transfer via
                 sketching",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "44:1--44:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276432",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a simple interactive approach to specify 3D
                 shape in a single view using `shape palettes'. The
                 interaction is as follows: draw a simple 2D primitive
                 in the 2D view and then specify its 3D orientation by
                 drawing a corresponding primitive on a shape palette.
                 The shape palette is presented as an image of some
                 familiar shape whose local 3D orientation is readily
                 understood and can be easily marked over. The 3D
                 orientation from the shape palette is transferred to
                 the 2D primitive based on the markup. As we will
                 demonstrate, only sparse markup is needed to generate
                 expressive and detailed 3D surfaces. This markup
                 approach can be used to model freehand 3D surfaces
                 drawn in a single view, or combined with image-snapping
                 tools to quickly extract surfaces from images and
                 photographs.",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "human-computer interaction; image-based modeling;
                 interactive modeling",
}

@Article{Mori:2007:PID,
  author =       "Yuki Mori and Takeo Igarashi",
  title =        "Plushie: an interactive design system for plush toys",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "45:1--45:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276433",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce Plushie, an interactive system that
                 allows nonprofessional users to design their own
                 original plush toys. To design a plush toy, one needs
                 to construct an appropriate two-dimensional (2D)
                 pattern. However, it is difficult for non-professional
                 users to appropriately design a 2D pattern. Some recent
                 systems automatically generate a 2D pattern for a given
                 three-dimensional (3D) model, but constructing a 3D
                 model is itself a challenge. Furthermore, an arbitrary
                 3D model cannot necessarily be realized as a real plush
                 toy, and the final sewn result can be very different
                 from the original 3D model. We avoid this mismatch by
                 constructing appropriate 2D patterns and applying
                 simple physical simulation to it on the fly during 3D
                 modeling. In this way, the model on the screen is
                 always a good approximation of the final sewn result,
                 which makes the design process much more efficient. We
                 use a sketching interface for 3D modeling and also
                 provide various editing operations tailored for plush
                 toy design. Internally, the system constructs a 2D
                 cloth pattern in such a way that the simulation result
                 matches the user's input stroke. Our goal is to show
                 that relatively simple algorithms can provide fast,
                 satisfactory results to the user whereas the pursuit of
                 optimal layout and simulation accuracy lies outside
                 this paper's scope. We successfully demonstrated that
                 non-professional users could design plush toys or
                 balloon easily using Plushie.",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cloth simulation; plush toys; sketch-based modeling",
}

@Article{Bridson:2007:CNP,
  author =       "Robert Bridson and Jim Houriham and Marcus
                 Nordenstam",
  title =        "Curl-noise for procedural fluid flow",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "46:1--46:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276435",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Procedural methods for animating turbulent fluid are
                 often preferred over simulation, both for speed and for
                 the degree of animator control. We offer an extremely
                 simple approach to efficiently generating turbulent
                 velocity fields based on Perlin noise, with a formula
                 that is exactly incompressible (necessary for the
                 characteristic look of everyday fluids), exactly
                 respects solid boundaries (not allowing fluid to flow
                 through arbitrarily-specified surfaces), and whose
                 amplitude can be modulated in space as desired. In
                 addition, we demonstrate how to combine this with
                 procedural primitives for flow around moving rigid
                 objects, vortices, etc.",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "fluids; noise; procedural animation; turbulence",
}

@Article{Hong:2007:WFC,
  author =       "Jeong-Mo Hong and Tamar Shinar and Ronald Fedkiw",
  title =        "Wrinkled flames and cellular patterns",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "47:1--47:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276436",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We model flames and fire using the Navier--Stokes
                 equations combined with the level set method and jump
                 conditions to model the reaction front. Previous works
                 modeled the flame using a combination of propagation in
                 the normal direction and a curvature term which leads
                 to a level set equation that is parabolic in nature and
                 thus overly dissipative and smooth. Asymptotic theory
                 shows that one can obtain more interesting velocities
                 and fully hyperbolic (as opposed to parabolic)
                 equations for the level set evolution. In particular,
                 researchers in the field of detonation shock dynamics
                 (DSD) have derived a set of equations which exhibit
                 characteristic cellular patterns. We show how to make
                 use of the DSD framework in the context of computer
                 graphics simulations of flames and fire to obtain
                 interesting features such as flame wrinkling and
                 cellular patterns.",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cellular patterns; combustion; fire; flame",
}

@Article{Adams:2007:ASP,
  author =       "Bart Adams and Mark Pauly and Richard Keiser and
                 Leonidas J. Guibas",
  title =        "Adaptively sampled particle fluids",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "48:1--48:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276437",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present novel adaptive sampling algorithms for
                 particle-based fluid simulation. We introduce a
                 sampling condition based on geometric local feature
                 size that allows focusing computational resources in
                 geometrically complex regions, while reducing the
                 number of particles deep inside the fluid or near thick
                 flat surfaces. Further performance gains are achieved
                 by varying the sampling density according to visual
                 importance. In addition, we propose a novel fluid
                 surface definition based on approximate
                 particle-to-surface distances that are carried along
                 with the particles and updated appropriately. The
                 resulting surface reconstruction method has several
                 advantages over existing methods, including stability
                 under particle resampling and suitability for
                 representing smooth flat surfaces. We demonstrate how
                 our adaptive sampling and distance-based surface
                 reconstruction algorithms lead to significant
                 improvements in time and memory as compared to single
                 resolution particle simulations, without significantly
                 affecting the fluid flow behavior.",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Goldenthal:2007:ESI,
  author =       "Rony Goldenthal and David Harmon and Raanan Fattal and
                 Michel Bercovier and Eitan Grinspun",
  title =        "Efficient simulation of inextensible cloth",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "49:1--49:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276438",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Many textiles do not noticeably stretch under their
                 own weight. Unfortunately, for better performance many
                 cloth solvers disregard this fact. We propose a method
                 to obtain very low strain along the warp and weft
                 direction using Constrained Lagrangian Mechanics and a
                 novel fast projection method. The resulting algorithm
                 acts as a velocity filter that easily integrates into
                 existing simulation code.",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cloth simulation; constrained Lagrangian mechanics;
                 constraints; inextensibility; isometry;
                 physically-based modeling; stretching",
}

@Article{Bergou:2007:TTD,
  author =       "Mikl{\'o}s Bergou and Saurabh Mathur and Max Wardetzky
                 and Eitan Grinspun",
  title =        "{TRACKS}: toward directable thin shells",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "50:1--50:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276439",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We combine the often opposing forces of artistic
                 freedom and mathematical determinism to enrich a given
                 animation or simulation of a surface with physically
                 based detail. We present a process called tracking,
                 which takes as input a rough animation or simulation
                 and enhances it with physically simulated detail.
                 Building on the foundation of constrained Lagrangian
                 mechanics, we propose weak-form constraints for
                 tracking the input motion. This method allows the
                 artist to choose where to add details such as
                 characteristic wrinkles and folds of various thin shell
                 materials and dynamical effects of physical forces. We
                 demonstrate multiple applications ranging from
                 enhancing an artist's animated character to guiding a
                 simulated inanimate object.",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "directable animation; Galerkin; rigging; thin shells;
                 tracking",
}

@Article{Fattal:2007:MSD,
  author =       "Raanan Fattal and Maneesh Agrawala and Szymon
                 Rusinkiewicz",
  title =        "Multiscale shape and detail enhancement from
                 multi-light image collections",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "51:1--51:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276441",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new image-based technique for enhancing
                 the shape and surface details of an object. The input
                 to our system is a small set of photographs taken from
                 a fixed viewpoint, but under varying lighting
                 conditions. For each image we compute a multiscale
                 decomposition based on the bilateral filter and then
                 reconstruct an enhanced image that combines detail
                 information at each scale across all the input images.
                 Our approach does not require any information about
                 light source positions, or camera calibration, and can
                 produce good results with 3 to 5 input images. In
                 addition our system provides a few high-level
                 parameters for controlling the amount of enhancement
                 and does not require pixel-level user input. We show
                 that the bilateral filter is a good choice for our
                 multiscale algorithm because it avoids the halo
                 artifacts commonly associated with the traditional
                 Laplacian image pyramid. We also develop a new scheme
                 for computing our multiscale bilateral decomposition
                 that is simple to implement, fast O ( N 2 log N ) and
                 accurate.",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bilateral filter; image enhancement; multiscale image
                 processing; NPR; relighting; shape depiction",
}

@Article{Peers:2007:PPF,
  author =       "Pieter Peers and Naoki Tamura and Wojciech Matusik and
                 Paul Debevec",
  title =        "Post-production facial performance relighting using
                 reflectance transfer",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "52:1--52:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276442",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose a novel post-production facial performance
                 relighting system for human actors. Our system uses
                 just a dataset of view-dependent facial appearances
                 with a neutral expression, captured for a static
                 subject using a Light Stage apparatus. For the actual
                 performance, however, a potentially different actor is
                 captured under known, but static, illumination. During
                 post-production, the reflectance field of the reference
                 dataset actor is transferred onto the dynamic
                 performance, enabling image-based relighting of the
                 entire sequence. Our approach makes post-production
                 relighting more practical and could easily be
                 incorporated in a traditional production pipeline since
                 it does not require additional hardware during
                 principal photography. Additionally, we show that our
                 system is suitable for real-time post-production
                 illumination editing.",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "image-based relighting; interactive lighting design;
                 reflectance transfer",
}

@Article{Kautz:2007:IEM,
  author =       "Jan Kautz and Solomon Boulos and Fr{\'e}do Durand",
  title =        "Interactive editing and modeling of bidirectional
                 texture functions",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "53:1--53:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276443",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "While measured Bidirectional Texture Functions (BTF)
                 enable impressive realism in material appearance, they
                 offer little control, which limits their use for
                 content creation. In this work, we interactively
                 manipulate BTFs and create new BTFs from flat textures.
                 We present an out-of-core approach to manage the size
                 of BTFs and introduce new editing operations that
                 modify the appearance of a material. These tools
                 achieve their full potential when selectively applied
                 to subsets of the BTF through the use of new selection
                 operators. We further analyze the use of our editing
                 operators for the modification of important visual
                 characteristics such as highlights, roughness, and
                 fuzziness. Results compare favorably to the direct
                 alteration of micro-geometry and reflectances of
                 synthetic reference data.",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "BTFs; editing; material appearance",
}

@Article{Pellacini:2007:AEM,
  author =       "Fabio Pellacini and Jason Lawrence",
  title =        "{AppWand}: editing measured materials using
                 appearance-driven optimization",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "54:1--54:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276444",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We investigate a new approach to editing spatially-
                 and temporally-varying measured materials that adopts a
                 stroke-based workflow. In our system, a user specifies
                 a small number of editing constraints with a 3-D
                 painting interface which are smoothly propagated to the
                 entire dataset through an optimization that enforces
                 similar edits are applied to areas with similar
                 appearance. The sparse nature of this appearance-driven
                 optimization permits the use of efficient solvers,
                 allowing the designer to interactively refine the
                 constraints. We have found this approach supports
                 specifying a wide range of complex edits that would not
                 be easy with existing techniques which present the user
                 with a fixed segmentation of the data. Furthermore, it
                 is independent of the underlying reflectance model and
                 we show edits to both analytic and non-parametric
                 representations in examples from several material
                 databases.",
  acknowledgement = ack-nhfb,
  articleno =    "54",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "material editing; painting interface; TSVBRDF",
}

@Article{Palacios:2007:RSF,
  author =       "Jonathan Palacios and Eugene Zhang",
  title =        "Rotational symmetry field design on surfaces",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "55:1--55:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276446",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Designing rotational symmetries on surfaces is a
                 necessary task for a wide variety of graphics
                 applications, such as surface parameterization and
                 remeshing, painterly rendering and pen-and-ink
                 sketching, and texture synthesis. In these
                 applications, the topology of a rotational symmetry
                 field such as singularities and separatrices can have a
                 direct impact on the quality of the results. In this
                 paper, we present a design system that provides control
                 over the topology of rotational symmetry fields on
                 surfaces.\par

                 As the foundation of our system, we provide
                 comprehensive analysis for rotational symmetry fields
                 on surfaces and present efficient algorithms to
                 identify singularities and separatrices. We also
                 describe design operations that allow a rotational
                 symmetry field to be created and modified in an
                 intuitive fashion by using the idea of basis fields and
                 relaxation. In particular, we provide control over the
                 topology of a rotational symmetry field by allowing the
                 user to remove singularities from the field or to move
                 them to more desirable locations.\par

                 At the core of our analysis and design implementations
                 is the observations that N -way rotational symmetries
                 can be described by symmetric N -th order tensors,
                 which allows an efficient vector-based representation
                 that not only supports coherent definitions of
                 arithmetic operations on rotational symmetries but also
                 enables many analysis and design operations for vector
                 fields to be adapted to rotational symmetry
                 fields.\par

                 To demonstrate the effectiveness of our approach, we
                 apply our design system to pen-and-ink sketching and
                 geometry remeshing.",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "field analysis; field design; non-photorealistic
                 rendering; remeshing; rotational symmetry; surfaces;
                 topology",
}

@Article{Fisher:2007:DTV,
  author =       "Matthew Fisher and Peter Schr{\"o}der and Mathieu
                 Desbrun and Hugues Hoppe",
  title =        "Design of tangent vector fields",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "56:1--56:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276447",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Tangent vector fields are an essential ingredient in
                 controlling surface appearance for applications ranging
                 from anisotropic shading to texture synthesis and
                 non-photorealistic rendering. To achieve a desired
                 effect one is typically interested in smoothly varying
                 fields that satisfy a sparse set of user-provided
                 constraints. Using tools from Discrete Exterior
                 Calculus, we present a simple and efficient algorithm
                 for designing such fields over arbitrary triangle
                 meshes. By representing the field as scalars over mesh
                 edges ( i.e. , discrete 1-forms), we obtain an
                 intrinsic, coordinate-free formulation in which field
                 smoothness is enforced through discrete Laplace
                 operators. Unlike previous methods, such a formulation
                 leads to a linear system whose sparsity permits
                 efficient pre-factorization. Constraints are
                 incorporated through weighted least squares and can be
                 updated rapidly enough to enable interactive design, as
                 we demonstrate in the context of anisotropic texture
                 synthesis.",
  acknowledgement = ack-nhfb,
  articleno =    "56",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "constrained Laplace and Poisson problems for 1-forms;
                 discrete differential 1-forms; discrete exterior
                 calculus; texture synthesis",
}

@Article{Labelle:2007:ISF,
  author =       "Fran{\c{c}}ois Labelle and Jonathan Richard Shewchuk",
  title =        "Isosurface stuffing: fast tetrahedral meshes with good
                 dihedral angles",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "57:1--57:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276448",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The isosurface stuffing algorithm fills an isosurface
                 with a uniformly sized tetrahedral mesh whose dihedral
                 angles are bounded between 10.7{$^\circ$} and 164.
                 8{$^\circ$}, or (with a change in parameters) between
                 8.9{$^\circ$} and 158.8{$^\circ$}. The algorithm is
                 whip fast, numerically robust, and easy to implement
                 because, like Marching Cubes, it generates tetrahedra
                 from a small set of precomputed stencils. A variant of
                 the algorithm creates a mesh with internal grading: on
                 the boundary, where high resolution is generally
                 desired, the elements are fine and uniformly sized, and
                 in the interior they may be coarser and vary in size.
                 This combination of features makes isosurface stuffing
                 a powerful tool for dynamic fluid simulation,
                 large-deformation mechanics, and applications that
                 require interactive remeshing or use objects defined by
                 smooth implicit surfaces. It is the first algorithm
                 that rigorously guarantees the suitability of
                 tetrahedra for finite element methods in domains whose
                 shapes are substantially more challenging than boxes.
                 Our angle bounds are guaranteed by a computer-assisted
                 proof. If the isosurface is a smooth 2-manifold with
                 bounded curvature, and the tetrahedra are sufficiently
                 small, then the boundary of the mesh is guaranteed to
                 be a geometrically and topologically accurate
                 approximation of the isosurface.",
  acknowledgement = ack-nhfb,
  articleno =    "57",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "dihedral angle; isosurface; tetrahedral mesh
                 generation",
}

@Article{Pascucci:2007:RLC,
  author =       "Valerio Pascucci and Giorgio Scorzelli and Peer-Timo
                 Bremer and Ajith Mascarenhas",
  title =        "Robust on-line computation of {Reeb} graphs:
                 simplicity and speed",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "58:1--58:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276449",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Reeb graphs are a fundamental data structure for
                 understanding and representing the topology of shapes.
                 They are used in computer graphics, solid modeling, and
                 visualization for applications ranging from the
                 computation of similarities and finding defects in
                 complex models to the automatic selection of
                 visualization parameters.\par

                 We introduce an on-line algorithm that reads a stream
                 of elements (vertices, triangles, tetrahedra, etc. )
                 and continuously maintains the Reeb graph of all
                 elements already reed. The algorithm is robust in
                 handling non-manifold meshes and general in its
                 applicability to input models of any
                 dimension.\par

                 Optionally, we construct a skeleton-like embedding of
                 the Reeb graph, and/or remove topological noise to
                 reduce the output size.\par

                 For interactive multi-resolution navigation we also
                 build a hierarchical data structure which allows
                 real-time extraction of approximated Reeb graphs
                 containing all topological features above a given error
                 threshold.\par

                 Our extensive experiments show both high performance
                 and practical linear scalability for meshes ranging
                 from thousands to hundreds of millions of triangles. We
                 apply our algorithm to the largest, most general,
                 triangulated surfaces available to us, including 3D, 4D
                 and 5D simplicial meshes. To demonstrate one important
                 application we use Reeb graphs to find and highlight
                 topological defects in meshes, including some widely
                 believed to be `clean.'",
  acknowledgement = ack-nhfb,
  articleno =    "58",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ihrke:2007:ERE,
  author =       "Ivo Ihrke and Gernot Ziegler and Art Tevs and
                 Christian Theobalt and Marcus Magnor and Hans-Peter
                 Seidel",
  title =        "Eikonal rendering: efficient light transport in
                 refractive objects",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "59:1--59:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276451",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new method for real-time rendering of
                 sophisticated lighting effects in and around refractive
                 objects. It enables us to realistically display
                 refractive objects with complex material properties,
                 such as arbitrarily varying refractive index,
                 inhomogeneous attenuation, as well as spatially-varying
                 anisotropic scattering and reflectance properties.
                 User-controlled changes of lighting positions only
                 require a few seconds of update time. Our method is
                 based on a set of ordinary differential equations
                 derived from the eikonal equation, the main postulate
                 of geometric optics. This set of equations allows for
                 fast casting of bent light rays with the complexity of
                 a particle tracer. Based on this concept, we also
                 propose an efficient light propagation technique using
                 adaptive wavefront tracing. Efficient GPU
                 implementations for our algorithmic concepts enable us
                 to render a combination of visual effects that were
                 previously not reproducible in real-time.",
  acknowledgement = ack-nhfb,
  articleno =    "59",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "geometric optics; light transport; real-time
                 rendering; refractive objects",
}

@Article{Frisvad:2007:CSP,
  author =       "Jeppe Revall Frisvad and Niels J{\o}rgen Christensen
                 and Henrik Wann Jensen",
  title =        "Computing the scattering properties of participating
                 media using {Lorenz-Mie} theory",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "60:1--60:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276452",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper introduces a theoretical model for
                 computing the scattering properties of participating
                 media and translucent materials. The model takes as
                 input a description of the components of a medium and
                 computes all the parameters necessary to render it.
                 These parameters are the extinction and scattering
                 coefficients, the phase function, and the index of
                 refraction, Our theory is based on a robust
                 generalization of the Lorenz-Mie theory. Previous
                 models using Lorenz-Mie theory have been limited to
                 non-absorbing media with spherical particles such as
                 paints and clouds. Our generalized theory is capable of
                 handling both absorbing host media and non-spherical
                 particles, which significantly extends the classes of
                 media and materials that can be modeled. We use the
                 theory to computer optical properties for different
                 types of ice and ocean water, and we derive a novel
                 appearance model for milk parameterized by the fat and
                 protein contents. Our results show that we are able to
                 match measured scattering properties in cases where the
                 classical Lorez-Mie theory breaks down, and we can
                 compute properties for media that cannot be measured
                 using existing techniques in computer graphics.",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "appearance modeling; Lorenz-Mie theory; optical
                 properties; participating media; realistic rendering",
}

@Article{Dachsbacher:2007:IVA,
  author =       "Carsten Dachsbacher and Marc Stamminger and George
                 Drettakis and Fr{\'e}do Durand",
  title =        "Implicit visibility and antiradiance for interactive
                 global illumination",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "61:1--61:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276453",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We reformulate the rendering equation to alleviate the
                 need for explicit visibility computation, thus enabling
                 interactive global illumination on graphics hardware.
                 This is achieved by treating visibility implicitly and
                 propagating an additional quantity, called
                 antiradiance, to compensate for light transmitted
                 extraneously. Our new algorithm shifts visibility
                 computation to simple local iterations by maintaining
                 additional directional antiradiance information with
                 samples in the scene. It is easy to parallelize on a
                 GPU. By correctly treating discretization and
                 filtering, we can compute indirect illumination in
                 scenes with dynamic objects much faster than
                 traditional methods. Our results show interactive
                 update of indirect illumination with moving characters
                 and lights.",
  acknowledgement = ack-nhfb,
  articleno =    "61",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "global illumination; GPU; visibility",
}

@Article{Mahajan:2007:TLL,
  author =       "Dhruv Mahajan and Ira Kemelmacher Shlizerman and Ravi
                 Ramamoorthi and Peter Belhumeur",
  title =        "A theory of locally low dimensional light transport",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "62:1--62:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276454",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Blockwise or Clustered Principal Component Analysis
                 (CPCA) is commonly used to achieve real-time rendering
                 of shadows and glossy reflections with precomputed
                 radiance transfer (PRT). The vertices or pixels are
                 partitioned into smaller coherent regions, and light
                 transport in each region is approximated by a locally
                 low-dimensional subspace using PCA. Many earlier
                 techniques such as surface light field and reflectance
                 field compression use a similar paradigm. However,
                 there has been no clear theoretical understanding of
                 how light transport dimensionality increases with local
                 patch size, nor of the optimal block size or number of
                 clusters.\par

                 In this paper, we develop a theory of locally low
                 dimensional light transport, by using Szego's
                 eigenvalue theorem to analytically derive the
                 eigenvalues of the covariance matrix for canonical
                 cases. We show mathematically that for symmetric
                 patches of area A, the number of basis functions for
                 glossy reflections increases linearly with A, while for
                 simple cast shadows, it often increases as {\surd} A.
                 These results are confirmed numerically on a number of
                 test scenes. Next, we carry out an analysis of the cost
                 of rendering, trading off local dimensionality and the
                 number of patches, deriving an optimal block size.
                 Based on this analysis, we provide useful practical
                 insights for setting parameters in CPCA and also derive
                 a new adaptive subdivision algorithm. Moreover, we show
                 that rendering time scales sub-linearly with the
                 resolution of the image, allowing for interactive
                 all-frequency relighting of 1024 x 1024 images.",
  acknowledgement = ack-nhfb,
  articleno =    "62",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "all-frequency relighting; dimensionality analysis;
                 local light transport; rendering cost analysis",
}

@Article{Mitra:2007:S,
  author =       "Niloy J. Mitra and Leonidas J. Guibas and Mark Pauly",
  title =        "Symmetrization",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "63:1--63:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276456",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a symmetrization algorithm for geometric
                 objects. Our algorithm enhances approximate symmetries
                 of a model while minimally altering its shape.
                 Symmetrizing deformations are formulated as an
                 optimization process that couples the spatial domain
                 with a transformation configuration space, where
                 symmetries can be expressed more naturally and
                 compactly as parametrized point-pair mappings. We
                 derive closed-form solution for the optimal symmetry
                 transformations, given a set of corresponding sample
                 pairs. The resulting optimal displacement vectors are
                 used to drive a constrained deformation model that
                 pulls the shape towards symmetry. We show how our
                 algorithm successfully symmetrizes both the geometry
                 and the discretization of complex 2D and 3D shapes and
                 discuss various applications of such symmetrizing
                 deformations.",
  acknowledgement = ack-nhfb,
  articleno =    "63",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "correspondence; matching; shape analysis; shape
                 optimization; symmetry",
}

@Article{Kilian:2007:GMS,
  author =       "Martin Kilian and Niloy J. Mitra and Helmut Pottmann",
  title =        "Geometric modeling in shape space",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "64:1--64:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276457",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel framework to treat shapes in the
                 setting of Riemannian geometry. Shapes -- triangular
                 meshes or more generally straight line graphs in
                 Euclidean space -- are treated as points in a shape
                 space. We introduce useful Riemannian metrics in this
                 space to aid the user in design and modeling tasks,
                 especially to explore the space of (approximately)
                 isometric deformations of a given shape. Much of the
                 work relies on an efficient algorithm to compute
                 geodesics in shape spaces; to this end, we present a
                 multi-resolution framework to solve the interpolation
                 problem -- which amounts to solving a boundary value
                 problem -- as well as the extrapolation problem -- an
                 initial value problem -- in shape space. Based on these
                 two operations, several classical concepts like
                 parallel transport and the exponential map can be used
                 in shape space to solve various geometric modeling and
                 geometry processing tasks. Applications include shape
                 morphing, shape deformation, deformation transfer, and
                 intuitive shape exploration.",
  acknowledgement = ack-nhfb,
  articleno =    "64",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "geodesic; isometric deformation; parallel transport;
                 Riemannian geometry; shape exploration; shape space",
}

@Article{Pottmann:2007:GML,
  author =       "Helmut Pottmann and Yang Liu and Johannes Wallner and
                 Alexander Bobenko and Wenping Wang",
  title =        "Geometry of multi-layer freeform structures for
                 architecture",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "65:1--65:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276458",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The geometric challenges in the architectural design
                 of freeform shapes come mainly from the physical
                 realization of beams and nodes. We approach them via
                 the concept of parallel meshes, and present methods of
                 computation and optimization. We discuss planar faces,
                 beams of controlled height, node geometry, and
                 multilayer constructions. Beams of constant height are
                 achieved with the new type of edge offset meshes. Mesh
                 parallelism is also the main ingredient in a novel
                 discrete theory of curvatures. These methods are
                 applied to the construction of quadrilateral,
                 pentagonal and hexagonal meshes, discrete minimal
                 surfaces, discrete constant mean curvature surfaces,
                 and their geometric transforms. We show how to design
                 geometrically optimal shapes, and how to find a
                 meaningful meshing and beam layout for existing
                 shapes.",
  acknowledgement = ack-nhfb,
  articleno =    "65",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "curvatures; discrete differential geometry; edge
                 offset; hexagonal mesh; Koebe polyhedron; multi-layer
                 construction; offset mesh; parallel mesh; support
                 structure; surfaces in architecture",
}

@Article{Mullen:2007:VAE,
  author =       "Patrick Mullen and Alexander McKenzie and Yiying Tong
                 and Mathieu Desbrun",
  title =        "A variational approach to {Eulerian} geometry
                 processing",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "66:1--66:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276459",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a purely Eulerian framework for geometry
                 processing of surfaces and foliations. Contrary to
                 current Eulerian methods used in graphics, we use
                 conservative methods and a variational interpretation,
                 offering a unified framework for routine surface
                 operations such as smoothing, offsetting, and
                 animation. Computations are performed on a fixed
                 volumetric grid without recourse to Lagrangian
                 techniques such as triangle meshes, particles, or path
                 tracing. At the core of our approach is the use of the
                 Coarea Formula to express area integrals over
                 isosurfaces as volume integrals. This enables the
                 simultaneous processing of multiple isosurfaces, while
                 a single interface can be treated as the special case
                 of a dense foliation. We show that our method is a
                 powerful alternative to conventional geometric
                 representations in delicate cases such as the handling
                 of high-genus surfaces, weighted offsetting, foliation
                 smoothing of medical datasets, and incompressible fluid
                 animation.",
  acknowledgement = ack-nhfb,
  articleno =    "66",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "digital geometry processing; fluids; foliations; mean
                 curvature flow; normal flows; offset surfaces",
}

@Article{Moreno-Noguer:2007:ARI,
  author =       "Francesc Moreno-Noguer and Peter N. Belhumeur and
                 Shree K. Nayar",
  title =        "Active refocusing of images and videos",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "67:1--67:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276461",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a system for refocusing images and videos
                 of dynamic scenes using a novel, single-view depth
                 estimation method. Our method for obtaining depth is
                 based on the defocus of a sparse set of dots projected
                 onto the scene. In contrast to other active
                 illumination techniques, the projected pattern of dots
                 can be removed from each captured image and its
                 brightness easily controlled in order to avoid under-
                 or over-exposure. The depths corresponding to the
                 projected dots and a color segmentation of the image
                 are used to compute an approximate depth map of the
                 scene with clean region boundaries. The depth map is
                 used to refocus the acquired image after the dots are
                 removed, simulating realistic depth of field effects.
                 Experiments on a wide variety of scenes, including
                 close-ups and live action, demonstrate the
                 effectiveness of our method.",
  acknowledgement = ack-nhfb,
  articleno =    "67",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "active illumination; computational photography; depth
                 from defocus; depth of field; image segmentation;
                 refocusing",
}

@Article{Green:2007:MAP,
  author =       "Paul Green and Wenyang Sun and Wojciech Matusik and
                 Fr{\'e}do Durand",
  title =        "Multi-aperture photography",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "68:1--68:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276462",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The emergent field of computational photography is
                 proving that, by coupling generalized imaging optics
                 with software processing, the quality and flexibility
                 of imaging systems can be increased. In this paper, we
                 capture and manipulate multiple images of a scene taken
                 with different aperture settings ( f -numbers). We
                 design and implement a prototype optical system and
                 associated algorithms to capture four images of the
                 scene in a single exposure, each taken with a different
                 aperture setting. Our system can be used with
                 commercially available DSLR cameras and photographic
                 lenses without modification to either. We leverage the
                 fact that defocus blur is a function of scene depth and
                 f /# to estimate a depth map. We demonstrate several
                 applications of our multi-aperture camera, such as
                 post-exposure editing of the depth of field, including
                 extrapolation beyond the physical limits of the lens,
                 synthetic refocusing, and depth-guided deconvolution.",
  acknowledgement = ack-nhfb,
  articleno =    "68",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational imaging; defocus gradient map; depth of
                 field extrapolation; image processing; multi-aperture;
                 optics",
}

@Article{Veeraraghavan:2007:DPM,
  author =       "Ashok Veeraraghavan and Ramesh Raskar and Amit Agrawal
                 and Ankit Mohan and Jack Tumblin",
  title =        "Dappled photography: mask enhanced cameras for
                 heterodyned light fields and coded aperture
                 refocusing",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "69:1--69:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276463",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We describe a theoretical framework for reversibly
                 modulating 4D light fields using an attenuating mask in
                 the optical path of a lens based camera. Based on this
                 framework, we present a novel design to reconstruct the
                 4D light field from a 2D camera image without any
                 additional refractive elements as required by previous
                 light field cameras. The patterned mask attenuates
                 light rays inside the camera instead of bending them,
                 and the attenuation recoverably encodes the rays on the
                 2D sensor. Our mask-equipped camera focuses just as a
                 traditional camera to capture conventional 2D photos at
                 full sensor resolution, but the raw pixel values also
                 hold a modulated 4D light field. The light field can be
                 recovered by rearranging the tiles of the 2D Fourier
                 transform of sensor values into 4D planes, and
                 computing the inverse Fourier transform. In addition,
                 one can also recover the full resolution image
                 information for the in-focus parts of the scene.\par

                 We also show how a broadband mask placed at the lens
                 enables us to compute refocused images at full sensor
                 resolution for layered Lambertian scenes. This partial
                 encoding of 4D ray-space data enables editing of image
                 contents by depth, yet does not require computational
                 recovery of the complete 4D light field.",
  acknowledgement = ack-nhfb,
  articleno =    "69",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Levin:2007:IDC,
  author =       "Anat Levin and Rob Fergus and Fr{\'e}do Durand and
                 William T. Freeman",
  title =        "Image and depth from a conventional camera with a
                 coded aperture",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "70:1--70:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276464",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "A conventional camera captures blurred versions of
                 scene information away from the plane of focus. Camera
                 systems have been proposed that allow for recording
                 all-focus images, or for extracting depth, but to
                 record both simultaneously has required more extensive
                 hardware and reduced spatial resolution. We propose a
                 simple modification to a conventional camera that
                 allows for the simultaneous recovery of both (a) high
                 resolution image information and (b) depth information
                 adequate for semi-automatic extraction of a layered
                 depth representation of the image.\par

                 Our modification is to insert a patterned occluder
                 within the aperture of the camera lens, creating a
                 coded aperture. We introduce a criterion for depth
                 discriminability which we use to design the preferred
                 aperture pattern. Using a statistical model of images,
                 we can recover both depth information and an all-focus
                 image from single photographs taken with the modified
                 camera. A layered depth map is then extracted,
                 requiring user-drawn strokes to clarify layer
                 assignments in some cases. The resulting sharp image
                 and layered depth map can be combined for various
                 photographic applications, including automatic scene
                 segmentation, post-exposure refocusing, or re-rendering
                 of the scene from an alternate viewpoint.",
  acknowledgement = ack-nhfb,
  articleno =    "70",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "coded imaging; computational photography; deblurring;
                 depth of field; image statistics; range estimation",
}

@Article{Joshi:2007:HCC,
  author =       "Pushkar Joshi and Mark Meyer and Tony DeRose and Brian
                 Green and Tom Sanocki",
  title =        "Harmonic coordinates for character articulation",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "71:1--71:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276466",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper we consider the problem of creating and
                 controlling volume deformations used to articulate
                 characters for use in high-end applications such as
                 computer generated feature films. We introduce a method
                 we call harmonic coordinates that significantly
                 improves upon existing volume deformation techniques.
                 Our deformations are controlled using a topologically
                 flexible structure, called a cage, that consists of a
                 closed three dimensional mesh. The cage can optionally
                 be augmented with additional interior vertices, edges,
                 and faces to more precisely control the interior
                 behavior of the deformation. We show that harmonic
                 coordinates are generalized barycentric coordinates
                 that can be extended to any dimension. Moreover, they
                 are the first system of generalized barycentric
                 coordinates that are non-negative even in strongly
                 concave situations, and their magnitude falls off with
                 distance as measured within the cage.",
  acknowledgement = ack-nhfb,
  articleno =    "71",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "barycentric coordinates; free form deformations; mean
                 value coordinates; rigging",
}

@Article{Baran:2007:ARA,
  author =       "Ilya Baran and Jovan Popovi{\'c}",
  title =        "Automatic rigging and animation of {$3$D} characters",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "72:1--72:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276467",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Animating an articulated 3D character currently
                 requires manual rigging to specify its internal
                 skeletal structure and to define how the input motion
                 deforms its surface. We present a method for animating
                 characters automatically. Given a static character mesh
                 and a generic skeleton, our method adapts the skeleton
                 to the character and attaches it to the surface,
                 allowing skeletal motion data to animate the character.
                 Because a single skeleton can be used with a wide range
                 of characters, our method, in conjunction with a
                 library of motions for a few skeletons, enables a
                 user-friendly animation system for novices and
                 children. Our prototype implementation, called
                 Pinocchio, typically takes under a minute to rig a
                 character on a modern midrange PC.",
  acknowledgement = ack-nhfb,
  articleno =    "72",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; deformations; geometric modeling",
}

@Article{Wang:2007:RTE,
  author =       "Robert Y. Wang and Kari Pulli and Jovan Popovi{\'c}",
  title =        "Real-time enveloping with rotational regression",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "73:1--73:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276468",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Enveloping, or the mapping of skeletal controls to the
                 deformations of a surface, is key to driving realistic
                 animated characters. Despite its widespread use,
                 enveloping still relies on slow or inaccurate
                 deformation methods. We propose a method that is both
                 fast, accurate and example-based. Our technique
                 introduces a rotational regression model that captures
                 common skinning deformations such as muscle bulging,
                 twisting, and challenging areas such as the shoulders.
                 Our improved treatment of rotational quantities is made
                 practical by model reduction that ensures real-time
                 solution of least-squares problems, independent of the
                 mesh size. Our method is significantly more accurate
                 than linear blend skinning and almost as fast,
                 suggesting its use as a replacement for linear blend
                 skinning when examples are available.",
  acknowledgement = ack-nhfb,
  articleno =    "73",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; deformation; enveloping; model reduction;
                 skinning",
}

@Article{Meyer:2007:KPS,
  author =       "Mark Meyer and John Anderson",
  title =        "Key {Point Subspace Acceleration} and soft caching",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "74:1--74:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276469",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Many applications in Computer Graphics contain
                 computationally expensive calculations. These
                 calculations are often performed at many points to
                 produce a full solution, even though the subspace of
                 reasonable solutions may be of a relatively low
                 dimension. The calculation of facial articulation and
                 rendering of scenes with global illumination are two
                 example applications that require these sort of
                 computations. In this paper, we present Key Point
                 Subspace Acceleration and Soft Caching, a technique for
                 accelerating these types of computations.\par

                 Key Point Subspace Acceleration (KPSA) is a statistical
                 acceleration scheme that uses examples to compute a
                 statistical subspace and a set of characteristic key
                 points. The full calculation is then computed only at
                 these key points and these points are used to provide a
                 subspace based estimate of the entire calculation. The
                 soft caching process is an extension to the KPSA
                 technique where the key points are also used to provide
                 a confidence estimate for the KPSA result. In cases
                 with high anticipated error the calculation will then
                 `fail through' to a full evaluation of all points (a
                 cache miss), while frames with low error can use the
                 accelerated statistical evaluation (a cache hit).",
  acknowledgement = ack-nhfb,
  articleno =    "74",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; statistical models; subspace analysis",
}

@Article{Hersch:2007:CIV,
  author =       "Roger D. Hersch and Philipp Donz{\'e} and Sylvain
                 Chosson",
  title =        "Color images visible under {UV} light",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "75:1--75:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276471",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The present contribution aims at creating color images
                 printed with fluorescent inks that are only visible
                 under UV light. The considered fluorescent inks absorb
                 light in the UV wavelength range and reemit part of it
                 in the visible wavelength range. In contrast to normal
                 color printing which relies on the spectral absorption
                 of light by the inks, at low concentration fluorescent
                 inks behave additively, i.e. their light emission
                 spectra sum up. We first analyze to which extent
                 different fluorescent inks can be superposed. Due to
                 the quenching effect, at high concentrations of the
                 fluorescent molecules, the fluorescent effect
                 diminishes. With an ink-jet printer capable of printing
                 pixels at reduced dot sizes, we reduce the
                 concentration of the individual fluorescent inks and
                 are able to create from the blue, red and
                 greenish-yellow inks the new colorants white and
                 magenta. In order to avoid quenching effects, we
                 propose a color halftoning method relying on diagonally
                 oriented pre-computed screen dots, which are printed
                 side by side. For gamut mapping and color separation,
                 we create a 3D representation of the fluorescent ink
                 gamut in CIELAB space by predicting halftone
                 fluorescent emission spectra according to the spectral
                 Neugebauer model. Thanks to gamut mapping and
                 juxtaposed halftoning, we create color images, which
                 are invisible under daylight and have, under UV light,
                 a high resemblance with the original images.",
  acknowledgement = ack-nhfb,
  articleno =    "75",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "fluorescent emission spectrum; fluorescent ink images;
                 gamut mapping; juxtaposed halftoning; spectral
                 prediction model",
}

@Article{Ramanarayanan:2007:VET,
  author =       "Ganesh Ramanarayanan and James Ferwerda and Bruce
                 Walter and Kavita Bala",
  title =        "Visual equivalence: towards a new standard for image
                 fidelity",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "76:1--76:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276472",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Efficient, realistic rendering of complex scenes is
                 one of the grand challenges in computer graphics.
                 Perceptually based rendering addresses this challenge
                 by taking advantage of the limits of human vision.
                 However, existing methods, based on predicting visible
                 image differences, are too conservative because some
                 kinds of image differences do not matter to human
                 observers. In this paper, we introduce the concept of
                 visual equivalence, a new standard for image fidelity
                 in graphics. Images are visually equivalent if they
                 convey the same impressions of scene appearance, even
                 if they are visibly different. To understand this
                 phenomenon, we conduct a series of experiments that
                 explore how object geometry, material, and illumination
                 interact to provide information about appearance, and
                 we characterize how two kinds of transformations on
                 illumination maps (blurring and warping) affect these
                 appearance attributes. We then derive visual
                 equivalence predictors (VEPs): metrics for predicting
                 when images rendered with transformed illumination maps
                 will be visually equivalent to images rendered with
                 reference maps. We also run a confirmatory study to
                 validate the effectiveness of these VEPs for general
                 scenes. Finally, we show how VEPs can be used to
                 improve the efficiency of two rendering algorithms:
                 Light-cuts and precomputed radiance transfer. This work
                 represents some promising first steps towards
                 developing perceptual metrics based on higher order
                 aspects of visual coding.",
  acknowledgement = ack-nhfb,
  articleno =    "76",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "appearance; human visual system; perception",
}

@Article{Vangorp:2007:ISP,
  author =       "Peter Vangorp and Jurgen Laurijssen and Philip
                 Dutr{\'e}",
  title =        "The influence of shape on the perception of material
                 reflectance",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "77:1--77:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276473",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Visual observation is our principal source of
                 information in determining the nature of objects,
                 including shape, material or roughness. The
                 physiological and cognitive processes that resolve
                 visual input into an estimate of the material of an
                 object are influenced by the illumination and the shape
                 of the object. This affects our ability to select
                 materials by observing them on a point-lit sphere, as
                 is common in current 3D modeling applications.\par

                 In this paper we present an exploratory psychophysical
                 experiment to study various influences on material
                 discrimination in a realistic setting. The resulting
                 data set is analyzed using a wide range of statistical
                 techniques. Analysis of variance is used to estimate
                 the magnitude of the influence of geometry, and fitted
                 psychometric functions produce significantly diverse
                 material discrimination thresholds across different
                 shapes and materials.\par

                 Suggested improvements to traditional material pickers
                 include direct visualization on the target object,
                 environment illumination, and the use of discrimination
                 thresholds as a step size for parameter adjustments.",
  acknowledgement = ack-nhfb,
  articleno =    "77",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "geometry; material editing; psychophysics; shading;
                 visual perception",
}

@Article{Ostromoukhov:2007:SP,
  author =       "Victor Ostromoukhov",
  title =        "Sampling with polyominoes",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "78:1--78:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276475",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new general-purpose method for fast
                 hierarchical importance sampling with blue-noise
                 properties. Our approach is based on self-similar
                 tiling of the plane or the surface of a sphere with
                 rectifiable polyominoes. Sampling points are associated
                 with polyominoes, one point per polyomino. Each
                 polyomino is recursively subdivided until the desired
                 local density of samples is reached. A numerical code
                 generated during the subdivision process is used for
                 thresholding to accept or reject the sample. The exact
                 position of the sampling point within the polyomino is
                 determined according to a structural index, which
                 indicates the polyomino's local neighborhood. The
                 variety of structural indices and associated sampling
                 point positions are computed during the offline
                 optimization process, and tabulated. Consequently, the
                 sampling itself is extremely fast. The method allows
                 both deterministic and pseudo-non-deterministic
                 sampling. It can be successfully applied in a large
                 variety of graphical applications, where fast sampling
                 with good spectral and visual properties is required.
                 The prime application is rendering.",
  acknowledgement = ack-nhfb,
  articleno =    "78",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "blue noise; deterministic sampling; importance
                 sampling; non-periodic tiling; polyominoes",
}

@Article{Cook:2007:SSA,
  author =       "Robert L. Cook and John Halstead and Maxwell Planck
                 and David Ryu",
  title =        "Stochastic simplification of aggregate detail",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "79:1--79:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276476",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Many renderers perform poorly on scenes that contain a
                 lot of detailed geometry. The load on the renderer can
                 be alleviated by simplification techniques, which
                 create less expensive representations of geometry that
                 is small on the screen. Current simplification
                 techniques for high-quality surface-based rendering
                 tend to work best with element detail (i.e. , detail
                 due to the complexity of individual elements) but not
                 as well with aggregate detail (i.e. , detail due to the
                 large number of elements). To address this latter type
                 of detail, we introduce a stochastic technique related
                 to some approaches used for point-based renderers.
                 Scenes are rendered by randomly selecting a subset of
                 the geometric elements and altering those elements
                 statistically to preserve the overall appearance of the
                 scene. The amount of simplification can depend on a
                 number of factors, including screen size, motion blur,
                 and depth of field.",
  acknowledgement = ack-nhfb,
  articleno =    "79",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "level of detail; simplification; stochastic sampling",
}

@Article{Sumner:2007:EDS,
  author =       "Robert W. Sumner and Johannes Schmid and Mark Pauly",
  title =        "Embedded deformation for shape manipulation",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "80:1--80:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276478",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an algorithm that generates natural and
                 intuitive deformations via direct manipulation for a
                 wide range of shape representations and editing
                 scenarios. Our method builds a space deformation
                 represented by a collection of affine transformations
                 organized in a graph structure. One transformation is
                 associated with each graph node and applies a
                 deformation to the nearby space. Positional constraints
                 are specified on the points of an embedded object. As
                 the user manipulates the constraints, a nonlinear
                 minimization problem is solved to find optimal values
                 for the affine transformations. Feature preservation is
                 encoded directly in the objective function by measuring
                 the deviation of each transformation from a true
                 rotation. This algorithm addresses the problem of
                 `embedded deformation' since it deforms space through
                 direct manipulation of objects embedded within it,
                 while preserving the embedded objects' features. We
                 demonstrate our method by editing meshes, polygon
                 soups, mesh animations, and animated particle
                 systems.",
  acknowledgement = ack-nhfb,
  articleno =    "80",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "deformation; geometric modeling; shape editing",
}

@Article{Shi:2007:MPC,
  author =       "Xiaohan Shi and Kun Zhou and Yiying Tong and Mathieu
                 Desbrun and Hujun Bao and Baining Guo",
  title =        "Mesh puppetry: cascading optimization of mesh
                 deformation with inverse kinematics",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "81:1--81:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276479",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present mesh puppetry, a variational framework for
                 detail-preserving mesh manipulation through a set of
                 high-level, intuitive, and interactive design tools.
                 Our approach builds upon traditional rigging by
                 optimizing skeleton position and vertex weights in an
                 integrated manner. New poses and animations are created
                 by specifying a few desired constraints on vertex
                 positions, balance of the character, length and
                 rigidity preservation, joint limits, and/or
                 self-collision avoidance. Our algorithm then adjusts
                 the skeleton and solves for the deformed mesh
                 simultaneously through a novel cascading optimization
                 procedure, allowing realtime manipulation of meshes
                 with 50K+ vertices for fast design of pleasing and
                 realistic poses. We demonstrate the potential of our
                 framework through an interactive deformation platform
                 and various applications such as deformation transfer
                 and motion retargeting.",
  acknowledgement = ack-nhfb,
  articleno =    "81",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "geometry processing; inverse kinematics; mesh
                 deformation; nonlinear optimization",
}

@Article{Rivers:2007:FFL,
  author =       "Alec R. Rivers and Doug L. James",
  title =        "{FastLSM}: fast lattice shape matching for robust
                 real-time deformation",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "82:1--82:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276480",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce a simple technique that enables robust
                 approximation of volumetric, large-deformation dynamics
                 for real-time or large-scale offline simulations. We
                 propose Lattice Shape Matching, an extension of
                 deformable shape matching to regular lattices with
                 embedded geometry; lattice vertices are smoothed by
                 convolution of rigid shape matching operators on local
                 lattice regions, with the effective mechanical
                 stiffness specified by the amount of smoothing via
                 region width. Since the na{\"\i}ve method can be very
                 slow for stiff models - per-vertex costs scale
                 cubically with region width - we provide a fast
                 summation algorithm, Fast Lattice Shape Matching
                 (FastLSM), that exploits the inherent summation
                 redundancy of shape matching and can provide
                 large-region matching at constant per-vertex cost. With
                 this approach, large lattices can be simulated in
                 linear time. We present several examples and benchmarks
                 of an efficient CPU implementation, including many
                 dozens of soft bodies simulated at real-time rates on a
                 typical desktop machine.",
  acknowledgement = ack-nhfb,
  articleno =    "82",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "domain embedding; fast summation; fracturing;
                 free-form deformation; interactive dynamics; large
                 deformation; polar decomposition; shape matching; soft
                 body; summed-area tables; video game physics",
}

@Article{Au:2007:HAI,
  author =       "Oscar Kin-Chung Au and Hongbo Fu and Chiew-Lan Tai and
                 Daniel Cohen-Or",
  title =        "Handle-aware isolines for scalable shape editing",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "83:1--83:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276481",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Handle-based mesh deformation is essentially a
                 nonlinear problem. To allow scalability, the original
                 deformation problem can be approximately represented by
                 a compact set of control variables. We show the direct
                 relation between the locations of handles on the mesh
                 and the local rigidity under deformation, and introduce
                 the notion of handle-aware rigidity. Then, we present a
                 reduced model whose control variables are intelligently
                 distributed across the surface, respecting the rigidity
                 information and the geometry. Specifically, for each
                 handle, the control variables are the transformations
                 of the isolines of a harmonic scalar field representing
                 the deformation propagation from that handle. The
                 isolines constitute a virtual skeletal structure
                 similar to the bones in skinning deformation, thus
                 correctly capturing the low-frequency shape
                 deformation. To interpolate the transformations from
                 the isolines to the original mesh, we design a method
                 which is local, linear and geometry-dependent. This
                 novel interpolation scheme and the transformation-based
                 reduced domain allow each iteration of the nonlinear
                 solver to be fully computed over the reduced domain.
                 This makes the per-iteration cost dependent on only the
                 number of isolines and enables compelling deformation
                 of highly detailed shapes at interactive rates. In
                 addition, we show how the handle-driven isolines
                 provide an efficient means for deformation transfer
                 without full shape correspondence.",
  acknowledgement = ack-nhfb,
  articleno =    "83",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "handle-aware; harmonic fields; isolines;
                 rigidity-aware; scalable shape editing",
}

@Article{Xu:2007:GDE,
  author =       "Weiwei Xu and Kun Zhou and Yizhou Yu and Qifeng Tan
                 and Qunsheng Peng and Baining Guo",
  title =        "Gradient domain editing of deforming mesh sequences",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "84:1--84:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276482",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Many graphics applications, including computer games
                 and 3D animated films, make heavy use of deforming mesh
                 sequences. In this paper, we generalize gradient domain
                 editing to deforming mesh sequences. Our framework is
                 keyframe based. Given sparse and irregularly
                 distributed constraints at unevenly spaced keyframes,
                 our solution first adjusts the meshes at the keyframes
                 to satisfy these constraints, and then smoothly
                 propagate the constraints and deformations at keyframes
                 to the whole sequence to generate new deforming mesh
                 sequence. To achieve convenient keyframe editing, we
                 have developed an efficient alternating least-squares
                 method. It harnesses the power of subspace deformation
                 and two-pass linear methods to achieve high-quality
                 deformations. We have also developed an effective
                 algorithm to define boundary conditions for all frames
                 using handle trajectory editing. Our deforming mesh
                 editing framework has been successfully applied to a
                 number of editing scenarios with increasing complexity,
                 including footprint editing, path editing, temporal
                 filtering, handle-based deformation mixing, and
                 spacetime morphing.",
  acknowledgement = ack-nhfb,
  articleno =    "84",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "control meshes; handle trajectory; keyframes; local
                 frames; mesh deformation; rotation interpolation",
}

@Article{Muller:2007:IBP,
  author =       "Pascal M{\"u}ller and Gang Zeng and Peter Wonka and
                 Luc Van Gool",
  title =        "Image-based procedural modeling of facades",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "85:1--85:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276484",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper describes algorithms to automatically
                 derive 3D models of high visual quality from single
                 facade images of arbitrary resolutions. We combine the
                 procedural modeling pipeline of shape grammars with
                 image analysis to derive a meaningful hierarchical
                 facade subdivision. Our system gives rise to three
                 exciting applications: urban reconstruction based on
                 low resolution oblique aerial imagery, reconstruction
                 of facades based on higher resolution ground-based
                 imagery, and the automatic derivation of shape grammar
                 rules from facade images to build a rule base for
                 procedural modeling technology.",
  acknowledgement = ack-nhfb,
  articleno =    "85",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "architecture; design computation; image-based
                 modeling; procedural modeling; urban reconstruction",
}

@Article{vandenHengel:2007:VRI,
  author =       "Anton van den Hengel and Anthony Dick and Thorsten
                 Thorm{\"a}hlen and Ben Ward and Philip H. S. Torr",
  title =        "{VideoTrace}: rapid interactive scene modelling from
                 video",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "86:1--86:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276485",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "VideoTrace is a system for interactively generating
                 realistic 3D models of objects from video---models that
                 might be inserted into a video game, a simulation
                 environment, or another video sequence. The user
                 interacts with VideoTrace by tracing the shape of the
                 object to be modelled over one or more frames of the
                 video. By interpreting the sketch drawn by the user in
                 light of 3D information obtained from computer vision
                 techniques, a small number of simple 2D interactions
                 can be used to generate a realistic 3D model. Each of
                 the sketching operations in VideoTrace provides an
                 intuitive and powerful means of modelling shape from
                 video, and executes quickly enough to be used
                 interactively. Immediate feedback allows the user to
                 model rapidly those parts of the scene which are of
                 interest and to the level of detail required. The
                 combination of automated and manual reconstruction
                 allows VideoTrace to model parts of the scene not
                 visible, and to succeed in cases where purely automated
                 approaches would fail.",
  acknowledgement = ack-nhfb,
  articleno =    "86",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "image-based modelling; model-based reconstruction;
                 structure-from-motion",
}

@Article{Tan:2007:IBT,
  author =       "Ping Tan and Gang Zeng and Jingdong Wang and Sing Bing
                 Kang and Long Quan",
  title =        "Image-based tree modeling",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "87:1--87:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276486",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we propose an approach for generating
                 3D models of natural-looking trees from images that has
                 the additional benefit of requiring little user
                 intervention. While our approach is primarily
                 image-based, we do not model each leaf directly from
                 images due to the large leaf count, small image
                 footprint, and widespread occlusions. Instead, we
                 populate the tree with leaf replicas from segmented
                 source images to reconstruct the overall tree shape. In
                 addition, we use the shape patterns of visible branches
                 to predict those of obscured branches. We demonstrate
                 our approach on a variety of trees.",
  acknowledgement = ack-nhfb,
  articleno =    "87",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Neubert:2007:AIB,
  author =       "Boris Neubert and Thomas Franken and Oliver Deussen",
  title =        "Approximate image-based tree-modeling using particle
                 flows",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "88:1--88:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276487",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a method for producing 3D tree models from
                 input photographs with only limited user intervention.
                 An approximate voxel-based tree volume is estimated
                 using image information. The density values of the
                 voxels are used to produce initial positions for a set
                 of particles. Performing a 3D flow simulation, the
                 particles are traced downwards to the tree basis and
                 are combined to form twigs and branches. If possible,
                 the trunk and the first-order branches are determined
                 in the input photographs and are used as attractors for
                 particle simulation. The geometry of the tree skeleton
                 is produced using botanical rules for branch
                 thicknesses and branching angles. Finally, leaves are
                 added. Different initial seeds for particle simulation
                 lead to a variety, yet similar-looking branching
                 structures for a single set of photographs.",
  acknowledgement = ack-nhfb,
  articleno =    "88",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "botanics; image-based modeling; plant models",
}

@Article{Sander:2007:FTR,
  author =       "Pedro V. Sander and Diego Nehab and Joshua Barczak",
  title =        "Fast triangle reordering for vertex locality and
                 reduced overdraw",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "89:1--89:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276489",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present novel algorithms that optimize the order in
                 which triangles are rendered, to improve post-transform
                 vertex cache efficiency as well as for view-independent
                 overdraw reduction. The resulting triangle orders
                 perform on par with previous methods, but are orders
                 magnitude faster to compute.\par

                 The improvements in processing speed allow us to
                 perform the optimization right after a model is loaded,
                 when more information on the host hardware is
                 available. This allows our vertex cache optimization to
                 often outperform other methods. In fact, our algorithms
                 can even be executed interactively, allowing for
                 re-optimization in case of changes to geometry or
                 topology, which happen often in CAD/CAM applications.
                 We believe that most real-time rendering applications
                 will immediately benefit from these new results.",
  acknowledgement = ack-nhfb,
  articleno =    "89",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Weyrich:2007:HAS,
  author =       "Tim Weyrich and Cyril Flaig and Simon Heinzle and
                 Simon Mall and Timo Aila and Kaspar Rohrer and Daniel
                 B. Fasnacht and Norbert Felber and Stephan Oetiker and
                 Hubert Kaeslin and Mario Botsch and Markus Gross",
  title =        "A hardware architecture for surface splatting",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "90:1--90:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276490",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel architecture for
                 hardware-accelerated rendering of point primitives. Our
                 pipeline implements a refined version of EWA splatting,
                 a high quality method for antialiased rendering of
                 point sampled representations. A central feature of our
                 design is the seamless integration of the architecture
                 into conventional, OpenGL-like graphics pipelines so as
                 to complement triangle-based rendering. The specific
                 properties of the EWA algorithm required a variety of
                 novel design concepts including a ternary depth test
                 and using an on-chip pipelined heap data structure for
                 making the memory accesses of splat primitives more
                 coherent. In addition, we developed a computationally
                 stable evaluation scheme for perspectively corrected
                 splats. We implemented our architecture both on
                 reconfigurable FPGA boards and as an ASIC prototype,
                 and we integrated it into an OpenGL-like software
                 implementation. Our evaluation comprises a detailed
                 performance analysis using scenes of varying
                 complexity.",
  acknowledgement = ack-nhfb,
  articleno =    "90",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "3D graphics hardware; data structures; point-based
                 rendering; rasterization; reordering; surface
                 splatting",
}

@Article{Zhou:2007:DMS,
  author =       "Kun Zhou and Xin Huang and Weiwei Xu and Baining Guo
                 and Heung-Yeung Shum",
  title =        "Direct manipulation of subdivision surfaces on
                 {GPUs}",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "91:1--91:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276491",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an algorithm for interactive deformation of
                 subdivision surfaces, including displaced subdivision
                 surfaces and subdivision surfaces with geometric
                 textures. Our system lets the user directly manipulate
                 the surface using freely-selected surface points as
                 handles. During deformation the control mesh vertices
                 are automatically adjusted such that the deforming
                 surface satisfies the handle position constraints while
                 preserving the original surface shape and details. To
                 best preserve surface details, we develop a gradient
                 domain technique that incorporates the handle position
                 constraints and detail preserving objectives into the
                 deformation energy. For displaced subdivision surfaces
                 and surfaces with geometric textures, the deformation
                 energy is highly nonlinear and cannot be handled with
                 existing iterative solvers. To address this issue, we
                 introduce a shell deformation solver, which replaces
                 each numerically unstable iteration step with two
                 stable mesh deformation operations. Our deformation
                 algorithm only uses local operations and is thus
                 suitable for GPU implementation. The result is a
                 real-time deformation system running orders of
                 magnitude faster than the state-of-the-art multigrid
                 mesh deformation solver. We demonstrate our technique
                 with a variety of examples, including examples of
                 creating visually pleasing character animations in
                 real-time by driving a subdivision surface with motion
                 capture data.",
  acknowledgement = ack-nhfb,
  articleno =    "91",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "detail preservation; displacement mapping; geometric
                 texture; subdivision surface",
}

@Article{Hasselgren:2007:PPC,
  author =       "Jon Hasselgren and Thomas Akenine-M{\"o}ller",
  title =        "{PCU}: the programmable culling unit",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "92:1--92:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276492",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Culling techniques have always been a central part of
                 computer graphics, but graphics hardware still lack
                 efficient and flexible support for culling. To improve
                 the situation, we introduce the programmable culling
                 unit, which is as flexible as the fragment program unit
                 and capable of quickly culling entire blocks of
                 fragments. Furthermore, it is very easy for the
                 developer to use the PCU as culling programs can be
                 automatically derived from fragment programs containing
                 a discard instruction. Our PCU can be integrated into
                 an existing fragment program unit with a modest
                 hardware overhead of only about 10\%. Using the PCU, we
                 have observed shader speedups between 1.4 and 2.1 for
                 relevant scenes.",
  acknowledgement = ack-nhfb,
  articleno =    "92",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "culling; hardware; rasterization; shaders",
}

@Article{Kopf:2007:CVG,
  author =       "Johannes Kopf and Matt Uyttendaele and Oliver Deussen
                 and Michael F. Cohen",
  title =        "Capturing and viewing gigapixel images",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "93:1--93:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276494",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a system to capture and view `Gigapixel
                 images': very high resolution, high dynamic range, and
                 wide angle imagery consisting of several billion pixels
                 each. A specialized camera mount, in combination with
                 an automated pipeline for alignment, exposure
                 compensation, and stitching, provide the means to
                 acquire Gigapixel images with a standard camera and
                 lens. More importantly, our novel viewer enables
                 exploration of such images at interactive rates over a
                 network, while dynamically and smoothly interpolating
                 the projection between perspective and curved
                 projections, and simultaneously modifying the
                 tone-mapping to ensure an optimal view of the portion
                 of the scene being viewed.",
  acknowledgement = ack-nhfb,
  articleno =    "93",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Agarwala:2007:EGD,
  author =       "Aseem Agarwala",
  title =        "Efficient gradient-domain compositing using
                 quadtrees",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "94:1--94:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276495",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We describe a hierarchical approach to improving the
                 efficiency of gradient-domain compositing, a technique
                 that constructs seamless composites by combining the
                 gradients of images into a vector field that is then
                 integrated to form a composite. While gradient-domain
                 compositing is powerful and widely used, it suffers
                 from poor scalability. Computing an n pixel composite
                 requires solving a linear system with n variables;
                 solving such a large system quickly overwhelms the main
                 memory of a standard computer when performed for
                 multi-megapixel composites, which are common in
                 practice. In this paper we show how to perform
                 gradient-domain compositing approximately by solving an
                 O(p) linear system, where p is the total length of the
                 seams between image regions in the composite; for
                 typical cases, p is O ({\surd} n ). We achieve this
                 reduction by transforming the problem into a space
                 where much of the solution is smooth, and then utilize
                 the pattern of this smoothness to adaptively subdivide
                 the problem domain using quadtrees. We demonstrate the
                 merits of our approach by performing panoramic
                 stitching and image region copy-and-paste in
                 significantly reduced time and memory while achieving
                 visually identical results.",
  acknowledgement = ack-nhfb,
  articleno =    "94",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Fattal:2007:IUI,
  author =       "Raanan Fattal",
  title =        "Image upsampling via imposed edge statistics",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "95:1--95:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276496",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper we propose a new method for upsampling
                 images which is capable of generating sharp edges with
                 reduced input-resolution grid-related artifacts. The
                 method is based on a statistical edge dependency
                 relating certain edge features of two different
                 resolutions, which is generically exhibited by
                 real-world images. While other solutions assume some
                 form of smoothness, we rely on this distinctive edge
                 dependency as our prior knowledge in order to increase
                 image resolution. In addition to this relation we
                 require that intensities are conserved; the output
                 image must be identical to the input image when
                 downsampled to the original resolution. Altogether the
                 method consists of solving a constrained optimization
                 problem, attempting to impose the correct edge relation
                 and conserve local intensities with respect to the
                 low-resolution input image. Results demonstrate the
                 visual importance of having such edge features properly
                 matched, and the method's capability to produce images
                 in which sharp edges are successfully reconstructed.",
  acknowledgement = ack-nhfb,
  articleno =    "95",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "image enhancement; image interpolation; Markov random
                 field image modeling; super-resolution",
}

@Article{Kopf:2007:JBU,
  author =       "Johannes Kopf and Michael F. Cohen and Dani Lischinski
                 and Matt Uyttendaele",
  title =        "Joint bilateral upsampling",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "96:1--96:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276497",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Image analysis and enhancement tasks such as tone
                 mapping, colorization, stereo depth, and photomontage,
                 often require computing a solution (e.g. , for
                 exposure, chromaticity, disparity, labels) over the
                 pixel grid. Computational and memory costs often
                 require that a smaller solution be run over a
                 downsampled image. Although general purpose upsampling
                 methods can be used to interpolate the low resolution
                 solution to the full resolution, these methods
                 generally assume a smoothness prior for the
                 interpolation.\par

                 We demonstrate that in cases, such as those above, the
                 available high resolution input image may be leveraged
                 as a prior in the context of a joint bilateral
                 upsampling procedure to produce a better high
                 resolution solution. We show results for each of the
                 applications above and compare them to traditional
                 upsampling methods.",
  acknowledgement = ack-nhfb,
  articleno =    "96",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bilateral filter; upsampling",
}

@Article{Cleary:2007:BFL,
  author =       "Paul W. Cleary and Soon Hyoung Pyo and Mahesh Prakash
                 and Bon Ki Koo",
  title =        "Bubbling and frothing liquids",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "97:1--97:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276499",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a discrete particle based method capable of
                 creating very realistic animations of bubbles in
                 fluids. It allows for the generation (nucleation) of
                 bubbles from gas dissolved in the fluid, the motion of
                 the discrete bubbles including bubble collisions and
                 drag interactions with the liquid which could be
                 undergoing complex free surface motion, the formation
                 and motion of coupled foams and the final dissipation
                 of bubbles. This allows comprehensive simulations of
                 dynamic bubble behavior. The underlying fluid
                 simulation is based on the mesh-free Smoothed Particle
                 Hydrodynamics method. Each particle representing the
                 liquid contains an amount of dissolved gas. Gas is
                 transferred from the continuum fluid model to the
                 discrete bubble model at nucleation sites on the
                 surface of solid bodies. The rate of gas transport to
                 the nucleation sites controls the rate of bubble
                 generation, producing very natural time variations in
                 bubble numbers. Rising bubbles also grow by gathering
                 more gas from the surrounding liquid as they move. This
                 model contains significant bubble scale physics and
                 allows, in principle, the capturing of many important
                 processes that cannot be directly modeled by
                 traditional methods. The method is used here to
                 realistically animate the pouring of a glass of beer,
                 starting with a stream of fresh beer entering the
                 glass, the formation of a dense cloud of bubbles, which
                 rise to create a good head as the beer reaches the top
                 of the glass.",
  acknowledgement = ack-nhfb,
  articleno =    "97",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bubbles; discrete element method; fluid dynamics;
                 natural phenomena; smoothed particles hydrodynamics",
}

@Article{Kim:2007:SBF,
  author =       "Byungmoon Kim and Yingjie Liu and Ignacio Llamas and
                 Xiangmin Jiao and Jarek Rossignac",
  title =        "Simulation of bubbles in foam with the volume control
                 method",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "98:1--98:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276500",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Liquid and gas interactions often produce bubbles that
                 stay for a long time without bursting on the surface,
                 making a dry foam structure. Such long lasting bubbles
                 simulated by the level set method can suffer from a
                 small but steady volume error that accumulates to a
                 visible amount of volume change. We propose to address
                 this problem by using the volume control method. We
                 track the volume change of each connected region, and
                 apply a carefully computed divergence that compensates
                 undesired volume changes. To compute the divergence, we
                 construct a mathematical model of the volume change,
                 choose control strategies that regulate the modeled
                 volume error, and establish methods to compute the
                 control gains that provide robust and fast reduction of
                 the volume error, and (if desired) the control of how
                 the volume changes over time.",
  acknowledgement = ack-nhfb,
  articleno =    "98",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Yuksel:2007:WP,
  author =       "Cem Yuksel and Donald H. House and John Keyser",
  title =        "Wave particles",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "99:1--99:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276501",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new method for the real-time simulation
                 of fluid surface waves and their interactions with
                 floating objects. The method is based on the new
                 concept of wave particles, which offers a simple, fast,
                 and unconditionally stable approach to wave simulation.
                 We show how graphics hardware can be used to convert
                 wave particles to a height field surface, which is
                 warped horizontally to account for local wave-induced
                 flow. The method is appropriate for most fluid
                 simulation situations that do not involve significant
                 global flow. It is demonstrated to work well in
                 constrained areas, including wave reflections off of
                 boundaries, and in unconstrained areas, such as an
                 ocean surface. Interactions with floating objects are
                 easily integrated by including wave forces on the
                 objects and wave generation due to object motion.
                 Theoretical foundations and implementation details are
                 provided, and experiments demonstrate that we achieve
                 plausible realism. Timing studies show that the method
                 is scalable to allow simulation of wave interaction
                 with several hundreds of objects at real-time rates.",
  acknowledgement = ack-nhfb,
  articleno =    "99",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "fluid-object interaction; GPU algorithms; real-time
                 simulation; wave particles; waves",
}

@Article{Batty:2007:FVF,
  author =       "Christopher Batty and Florence Bertails and Robert
                 Bridson",
  title =        "A fast variational framework for accurate solid-fluid
                 coupling",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "100:1--100:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276502",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Physical simulation has emerged as a compelling
                 animation technique, yet current approaches to coupling
                 simulations of fluids and solids with irregular
                 boundary geometry are inefficient or cannot handle some
                 relevant scenarios robustly. We propose a new
                 variational approach which allows robust and accurate
                 solution on relatively coarse Cartesian grids, allowing
                 possibly orders of magnitude faster simulation. By
                 rephrasing the classical pressure projection step as a
                 kinetic energy minimization, broadly similar to modern
                 approaches to rigid body contact, we permit a robust
                 coupling between fluid and arbitrary solid simulations
                 that always gives a well-posed symmetric positive
                 semi-definite linear system. We provide several
                 examples of efficient fluid-solid interaction and rigid
                 body coupling with sub-grid cell flow. In addition, we
                 extend the framework with a new boundary condition for
                 free-surface flow, allowing fluid to separate naturally
                 from solids.",
  acknowledgement = ack-nhfb,
  articleno =    "100",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "fluid simulation; fluid-solid coupling;
                 physically-based animation",
}

@Article{Sunkavalli:2007:FTL,
  author =       "Kalyan Sunkavalli and Wojciech Matusik and Hanspeter
                 Pfister and Szymon Rusinkiewicz",
  title =        "Factored time-lapse video",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "101:1--101:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276504",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We describe a method for converting time-lapse
                 photography captured with outdoor cameras into Factored
                 Time-Lapse Video (FTLV): a video in which time appears
                 to move faster (i.e. , lapsing) and where data at each
                 pixel has been factored into shadow, illumination, and
                 reflectance components. The factorization allows a user
                 to easily relight the scene, recover a portion of the
                 scene geometry (normals), and to perform advanced image
                 editing operations. Our method is easy to implement,
                 robust, and provides a compact representation with good
                 reconstruction characteristics. We show results using
                 several publicly available time-lapse sequences.",
  acknowledgement = ack-nhfb,
  articleno =    "101",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational photography; image-based rendering and
                 lighting; inverse problems; reflectance",
}

@Article{Bennett:2007:CTL,
  author =       "Eric P. Bennett and Leonard McMillan",
  title =        "Computational time-lapse video",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "102:1--102:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276505",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present methods for generating novel time-lapse
                 videos that address the inherent sampling issues that
                 arise with traditional photographic techniques.
                 Starting with video-rate footage as input, our
                 post-process downsamples the source material into a
                 time-lapse video and provides user controls for
                 retaining, removing, and resampling events. We employ
                 two techniques for selecting and combining source
                 frames to form the output. First, we present a
                 non-uniform sampling method, based on dynamic
                 programming, which optimizes the sampling of the input
                 video to match the user's desired duration and visual
                 objectives. We present multiple error metrics for this
                 optimization, each resulting in different sampling
                 characteristics. To complement the non-uniform
                 sampling, we present the virtual shutter, a non-linear
                 filtering technique that synthetically extends the
                 exposure time of time-lapse frames.",
  acknowledgement = ack-nhfb,
  articleno =    "102",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "aliasing; camera simulation; computational
                 photography; non-uniform sampling; summarization;
                 time-lapse; video",
}

@Article{Chen:2007:RTE,
  author =       "Jiawen Chen and Sylvain Paris and Fr{\'e}do Durand",
  title =        "Real-time edge-aware image processing with the
                 bilateral grid",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "103:1--103:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276506",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new data structure---the bilateral grid,
                 that enables fast edge-aware image processing. By
                 working in the bilateral grid, algorithms such as
                 bilateral filtering, edge-aware painting, and local
                 histogram equalization become simple manipulations that
                 are both local and independent. We parallelize our
                 algorithms on modern GPUs to achieve real-time frame
                 rates on high-definition video. We demonstrate our
                 method on a variety of applications such as image
                 editing, transfer of photographic look, and contrast
                 enhancement of medical images.",
  acknowledgement = ack-nhfb,
  articleno =    "103",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bilateral filter; computational photography;
                 edge-aware image processing; real-time video
                 processing",
}

@Article{Bousseau:2007:VWU,
  author =       "Adrien Bousseau and Fabrice Neyret and Jo{\"e}lle
                 Thollot and David Salesin",
  title =        "Video watercolorization using bidirectional texture
                 advection",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "104:1--104:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276507",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we present a method for creating
                 watercolor-like animation, starting from video as
                 input. The method involves two main steps: applying
                 textures that simulate a watercolor appearance; and
                 creating a simplified, abstracted version of the video
                 to which the texturing operations are applied. Both of
                 these steps are subject to highly visible temporal
                 artifacts, so the primary technical contributions of
                 the paper are extensions of previous methods for
                 texturing and abstraction to provide temporal coherence
                 when applied to video sequences. To maintain coherence
                 for textures, we employ texture advection along lines
                 of optical flow. We furthermore extend previous
                 approaches by incorporating advection in both forward
                 and reverse directions through the video, which allows
                 for minimal texture distortion, particularly in areas
                 of disocclusion that are otherwise highly problematic.
                 To maintain coherence for abstraction, we employ
                 mathematical morphology extended to the temporal
                 domain, using filters whose temporal extents are
                 locally controlled by the degree of distortions in the
                 optical flow. Together, these techniques provide the
                 first practical and robust approach for producing
                 watercolor animations from video, which we demonstrate
                 with a number of examples.",
  acknowledgement = ack-nhfb,
  articleno =    "104",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "abstract stylization; animated textures;
                 non-photorealistic rendering; temporal coherence",
}

@Article{Yin:2007:SSB,
  author =       "KangKang Yin and Kevin Loken and Michiel van de
                 Panne",
  title =        "{SIMBICON}: simple biped locomotion control",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "105:1--105:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276509",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Physics-based simulation and control of biped
                 locomotion is difficult because bipeds are unstable,
                 underactuated, high-dimensional dynamical systems. We
                 develop a simple control strategy that can be used to
                 generate a large variety of gaits and styles in
                 real-time, including walking in all directions
                 (forwards, backwards, sideways, turning), running,
                 skipping, and hopping. Controllers can be authored
                 using a small number of parameters, or their
                 construction can be informed by motion capture data.
                 The controllers are applied to 2D and 3D
                 physically-simulated character models. Their robustness
                 is demonstrated with respect to pushes in all
                 directions, unexpected steps and slopes, and unexpected
                 variations in kinematic and dynamic parameters. Direct
                 transitions between controllers are demonstrated as
                 well as parameterized control of changes in direction
                 and speed. Feedback-error learning is applied to learn
                 predictive torque models, which allows for the low-gain
                 control that typifies many natural motions as well as
                 producing smoother simulated motion.",
  acknowledgement = ack-nhfb,
  articleno =    "105",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Safonova:2007:COS,
  author =       "Alla Safonova and Jessica K. Hodgins",
  title =        "Construction and optimal search of interpolated motion
                 graphs",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "106:1--106:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276510",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Many compelling applications would become feasible if
                 novice users had the ability to synthesize high quality
                 human motion based only on a simple sketch and a few
                 easily specified constraints. We approach this problem
                 by representing the desired motion as an interpolation
                 of two time-scaled paths through a motion graph. The
                 graph is constructed to support interpolation and
                 pruned for efficient search. We use an anytime version
                 of A* search to find a globally optimal solution in
                 this graph that satisfies the user's specification. Our
                 approach retains the natural transitions of motion
                 graphs and the ability to synthesize physically
                 realistic variations provided by interpolation. We
                 demonstrate the power of this approach by synthesizing
                 optimal or near optimal motions that include a variety
                 of behaviors in a single motion.",
  acknowledgement = ack-nhfb,
  articleno =    "106",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "human animation; motion capture; motion graph; motion
                 interpolation; motion planning",
}

@Article{Sok:2007:SBB,
  author =       "Kwang Won Sok and Manmyung Kim and Jehee Lee",
  title =        "Simulating biped behaviors from human motion data",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "107:1--107:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1275808.1276511",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Physically based simulation of human motions is an
                 important issue in the context of computer animation,
                 robotics and biomechanics. We present a new technique
                 for allowing our physically-simulated planar biped
                 characters to imitate human behaviors. Our contribution
                 is twofold. We developed an optimization method that
                 transforms any (either motion-captured or kinematically
                 synthesized) biped motion into a physically-feasible,
                 balance-maintaining simulated motion. Our optimization
                 method allows us to collect a rich set of training data
                 that contains stylistic, personality-rich human
                 behaviors. Our controller learning algorithm
                 facilitates the creation and composition of robust
                 dynamic controllers that are learned from training
                 data. We demonstrate a planar articulated character
                 that is dynamically simulated in real time, equipped
                 with an integrated repertoire of motor skills, and
                 controlled interactively to perform desired motions.",
  acknowledgement = ack-nhfb,
  articleno =    "107",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "biped walk and balance; controller learning; human
                 motion; motion capture; physically based simulation",
}

@Article{Guenter:2007:ESD,
  author =       "Brian Guenter",
  title =        "Efficient symbolic differentiation for graphics
                 applications",
  journal =      j-TOG,
  volume =       "26",
  number =       "3",
  pages =        "108:1--108:??",
  month =        jul,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1276377.1276512",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:09:11 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Functions with densely interconnected expression
                 graphs, which arise in computer graphics applications
                 such as dynamics, space-time optimization, and PRT, can
                 be difficult to efficiently differentiate using
                 existing symbolic or automatic differentiation
                 techniques. Our new algorithm, D*, computes efficient
                 symbolic derivatives for these functions by
                 symbolically executing the expression graph at compile
                 time to eliminate common subexpressions and by
                 exploiting the special nature of the graph that
                 represents the derivative of a function. This graph has
                 a sum of products form; the new algorithm computes a
                 factorization of this derivative graph along with an
                 efficient grouping of product terms into
                 subexpressions. For the problems in our test suite D*
                 generates symbolic derivatives which are up to $4.6
                 \times 10^3$ times faster than those computed by the
                 symbolic math program Mathematica and up to $2.2 \times
                 10^5$ times faster than the non-symbolic automatic
                 differentiation program CppAD. In some cases the D*
                 derivatives rival the best manually derived
                 solutions.",
  acknowledgement = ack-nhfb,
  articleno =    "108",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "symbolic differentiation",
}

@Article{Lehtinen:2007:FPC,
  author =       "Jaakko Lehtinen",
  title =        "A framework for precomputed and captured light
                 transport",
  journal =      j-TOG,
  volume =       "26",
  number =       "4",
  pages =        "13:1--13:22",
  month =        oct,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1289603.1289604",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Several types of methods precompute or capture light
                 transport operators in either virtual or real scenes.
                 Precomputed radiance transfer methods interactively
                 render realistic images of static scenes under dynamic
                 incident illumination, while reflectance field
                 techniques capture an appearance model of a real scene
                 for relighting purposes. In this article we present a
                 unifying mathematical framework for methods that
                 precompute or capture light transport operators, and
                 characterize a large body of earlier work in its terms.
                 The framework is given in the form of an operator
                 equation that extends the rendering equation to account
                 for a constrained space of emissions. The connections
                 between traditional global illumination methods and
                 precomputed transfer techniques become apparent through
                 the explicit equation. Based on insight provided by the
                 unifying view, we outline possibilities for new
                 methods, particularly the wider adaptation of previous,
                 hierarchical finite element techniques for efficient
                 computation of the transport operators.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "global illumination; Precomputed light transport;
                 precomputed radiance transfer; relighting",
}

@Article{Karciauskas:2007:BPS,
  author =       "K{\c{e}}stutis Kar{\v{c}}iauskas and J{\"o}rg Peters",
  title =        "Bicubic polar subdivision",
  journal =      j-TOG,
  volume =       "26",
  number =       "4",
  pages =        "14:1--14:6",
  month =        oct,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1289603.1289605",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We describe and analyze a subdivision scheme that
                 generalizes bicubic spline subdivision to control nets
                 with polar structure. Such control nets appear
                 naturally for surfaces with the combinatorial structure
                 of objects of revolution and at points of high valence
                 in subdivision meshes. The resulting surfaces are $C_2$
                 except at a finite number of isolated points where the
                 surface is $C_1$ and the curvature is bounded.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bicubic; Catmull--Clark; curvature continuity; polar
                 layout; polar net; Subdivision",
}

@Article{Acar:2007:LSD,
  author =       "R{\"u}yam Acar",
  title =        "Level set driven flows",
  journal =      j-TOG,
  volume =       "26",
  number =       "4",
  pages =        "15:1--15:15",
  month =        oct,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1289603.1289606",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In 2D, incompressible flows, the Stokes equations that
                 represent the dynamics of very viscous flows and
                 vorticity formulation of hydrodynamic equations both
                 reduce to a scalar stream-function representation in
                 terms of elliptic equations. By making use of this
                 simplification and the properties of Fourier space
                 representation of elliptic equations, we use a common
                 spectral method to solve both of these equations. Based
                 on this system of equations, we propose a level set
                 based input description which provides a flexible
                 environment for the user to model a wide range of flows
                 and artistic effects in 2D. This input type allows the
                 modeling of vortex sheet patterns and other complex
                 flows with a very practical approach and chaotic,
                 dynamic flows, even with viscous Stokes equations. A
                 user interface is developed for the level set input
                 which allows the user to draw the strokes or edit the
                 level set data by applying transformation functions or
                 perturbations. To sum up, this model can be used for
                 the simulation of very viscous flows, vorticity
                 dynamics, vortex sheet patterns, turbulent and chaotic
                 flows as well as other artistic effects such as the
                 traditional marbling patterns, with a simple, fast and
                 stable system at high resolutions.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Fluid modeling; level set methods; spectral methods;
                 stream-function equations",
}

@Article{Nielsen:2007:CCL,
  author =       "Michael B. Nielsen and Ola Nilsson and Andreas
                 S{\"o}derstr{\"o}m and Ken Museth",
  title =        "Out-of-core and compressed level set methods",
  journal =      j-TOG,
  volume =       "26",
  number =       "4",
  pages =        "16:1--16:26",
  month =        oct,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1289603.1289607",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This article presents a generic framework for the
                 representation and deformation of level set surfaces at
                 extreme resolutions. The framework is composed of two
                 modules that each utilize optimized and application
                 specific algorithms: (1) A fast out-of-core data
                 management scheme that allows for resolutions of the
                 deforming geometry limited only by the available disk
                 space as opposed to memory, and (2) compact and fast
                 compression strategies that reduce both offline storage
                 requirements and online memory footprints during
                 simulation. Out-of-core and compression techniques have
                 been applied to a wide range of computer graphics
                 problems in recent years, but this article is the first
                 to apply it in the context of level set and fluid
                 simulations. Our framework is generic and flexible in
                 the sense that the two modules can transparently be
                 integrated, separately or in any combination, into
                 existing level set and fluid simulation software based
                 on recently proposed narrow band data structures like
                 the DT-Grid of Nielsen and Museth [2006] and the H-RLE
                 of Houston et al [2006]. The framework can be applied
                 to narrow band signed distances, fluid velocities,
                 scalar fields, particle properties as well as standard
                 graphics attributes like colors, texture coordinates,
                 normals, displacements etc. In fact, our framework is
                 applicable to a large body of computer graphics
                 problems that involve sequential or random access to
                 very large co-dimension one (level set) and zero (e.g.
                 fluid) data sets. We demonstrate this with several
                 applications, including fluid simulations interacting
                 with large boundaries ($\approx 1500^3$), surface
                 deformations ($\approx 2048^3$), the solution of
                 partial differential equations on large surfaces
                 ($\approx 4096^3$) and mesh-to-level set scan
                 conversions of resolutions up to $\approx 35000^3$ (7
                 billion voxels in the narrow band). Our out-of-core
                 framework is shown to be several times faster than
                 current state-of-the-art level set data structures
                 relying on OS paging. In particular we show sustained
                 throughput (grid points/sec) for gigabyte sized level
                 sets as high as 65\% of state-of-the-art throughput for
                 in-core simulations. We also demonstrate that our
                 compression techniques out-perform state-of-the-art
                 compression algorithms for narrow bands.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "adaptive distance fields; compression; computational
                 fluid dynamics; deformable surfaces; geometric
                 modeling; implicit surfaces; Level set methods; mesh
                 scan conversion; morphology; out-of-core; shape;
                 streaming",
}

@Article{James:2007:MEM,
  author =       "Doug L. James and Christopher D. Twigg and Andrew Cove
                 and Robert Y. Wang",
  title =        "Mesh {Ensemble Motion Graphs}: {Data-driven} mesh
                 animation with constraints",
  journal =      j-TOG,
  volume =       "26",
  number =       "4",
  pages =        "17:1--17:16",
  month =        oct,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1289603.1289608",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We explore the use of space-time cuts to smoothly
                 transition between stochastic mesh animation clips
                 involving numerous deformable mesh groups while subject
                 to physical constraints. These transitions are used to
                 construct Mesh Ensemble Motion Graphs for interactive
                 data-driven animation of high-dimensional mesh
                 animation datasets, such as those arising from
                 expensive physical simulations of deformable objects
                 blowing in the wind. We formulate the transition
                 computation as an integer programming problem, and
                 introduce a novel randomized algorithm to compute
                 transitions subject to geometric nonpenetration
                 constraints. We present examples for several physically
                 based motion datasets, with real-time display and
                 optional interactive control over wind intensity via
                 transitions between wind levels. We discuss challenges
                 and opportunities for future work and practical
                 application.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Collision detection; constraint satisfaction; integer
                 programming; motion graphs; nonpenetration",
}

@Article{Reitsma:2007:EMG,
  author =       "Paul S. A. Reitsma and Nancy S. Pollard",
  title =        "Evaluating motion graphs for character animation",
  journal =      j-TOG,
  volume =       "26",
  number =       "4",
  pages =        "18:1--18:24",
  month =        oct,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1289603.1289609",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Realistic and directable humanlike characters are an
                 ongoing goal in animation. Motion graph data structures
                 hold much promise for achieving this goal; however, the
                 quality of the results obtainable from a motion graph
                 may not be easy to predict from its input motion clips.
                 This article describes a method for using task-based
                 metrics to evaluate the capability of a motion graph to
                 create the set of animations required by a particular
                 application. We examine this capability for typical
                 motion graphs across a range of tasks and environments.
                 We find that motion graph capability degrades rapidly
                 with increases in the complexity of the target
                 environment or required tasks, and that addressing
                 deficiencies in a brute-force manner tends to lead to
                 large, unwieldy motion graphs. The results of this
                 method can be used to evaluate the extent to which a
                 motion graph will fulfill the requirements of a
                 particular application, lessening the risk of the data
                 structure performing poorly at an inopportune moment.
                 The method can also be used to characterize the
                 deficiencies of motion graphs whose performance will
                 not be sufficient, and to evaluate the relative
                 effectiveness of different options for improving those
                 motion graphs.",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "capability metrics; editing model; human motion;
                 Motion capability; motion capture; motion graph
                 embedding; motion graphs",
}

@Article{Xu:2007:KHB,
  author =       "Hui Xu and Nathan Gossett and Baoquan Chen",
  title =        "Knowledge and heuristic-based modeling of
                 laser-scanned trees",
  journal =      j-TOG,
  volume =       "26",
  number =       "4",
  pages =        "19:1--19:13",
  month =        oct,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1289603.1289610",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a semi-automatic and efficient method for
                 producing full polygonal models of range scanned trees,
                 which are initially represented as sparse point clouds.
                 First, a skeleton of the trunk and main branches of the
                 tree is produced based on the scanned point clouds. Due
                 to the unavoidable incompleteness of the point clouds
                 produced by range scans of trees, steps are taken to
                 synthesize additional branches to produce plausible
                 support for the tree crown. Appropriate dimensions for
                 each branch section are estimated using allometric
                 theory. Using this information, a mesh is produced
                 around the full skeleton. Finally, leaves are
                 positioned, oriented and connected to nearby branches.
                 Our process requires only minimal user interaction, and
                 the full process including scanning and modeling can be
                 completed within minutes.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Digitizing and scanning; knowledge-based modeling",
}

@Article{Lefohn:2007:RMS,
  author =       "Aaron E. Lefohn and Shubhabrata Sengupta and John D.
                 Owens",
  title =        "Resolution-matched shadow maps",
  journal =      j-TOG,
  volume =       "26",
  number =       "4",
  pages =        "20:1--20:17",
  month =        oct,
  year =         "2007",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1289603.1289611",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:27 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This article presents resolution-matched shadow maps
                 (RMSM), a modified adaptive shadow map (ASM) algorithm,
                 that is practical for interactive rendering of dynamic
                 scenes. Adaptive shadow maps, which build a quadtree of
                 shadow samples to match the projected resolution of
                 each shadow texel in eye space, offer a robust solution
                 to projective and perspective aliasing in shadow maps.
                 However, their use for interactive dynamic scenes is
                 plagued by an expensive iterative edge-finding
                 algorithm that takes a highly variable amount of time
                 per frame and is not guaranteed to converge to a
                 correct solution. This article introduces a simplified
                 algorithm that is up to ten times faster than ASMs, has
                 more predictable performance, and delivers more
                 accurate shadows. Our main contribution is the
                 observation that it is more efficient to forgo the
                 iterative refinement analysis in favor of generating
                 all shadow texels requested by the pixels in the
                 eye-space image. The practicality of this approach is
                 based on the insight that, for surfaces continuously
                 visible from the eye, adjacent eye-space pixels map to
                 adjacent shadow texels in quadtree shadow space. This
                 means that the number of contiguous regions of shadow
                 texels (which can be efficiently generated with a
                 rasterizer) is proportional to the number of
                 continuously visible surfaces in the scene. Moreover,
                 these regions can be coalesced to further reduce the
                 number of render passes required to shadow an image.
                 The secondary contribution of this paper is
                 demonstrating the design and use of data-parallel
                 algorithms inseparably mixed with traditional graphics
                 programming to implement a novel interactive rendering
                 algorithm. For the scenes described in this paper, we
                 achieve 60--80 frames per second on static scenes and
                 20--60 frames per second on dynamic scenes for 512 2
                 and 1024 2 images with a maximum effective shadow
                 resolution of 32,768 2 texels.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "adaptive shadow maps; GPGPU; GPU; graphics hardware;
                 scan; shadow maps; Shadows",
}

@Article{Wang:2008:SEL,
  author =       "Jing Wang and Bobby Bodenheimer",
  title =        "Synthesis and evaluation of linear motion
                 transitions",
  journal =      j-TOG,
  volume =       "27",
  number =       "1",
  pages =        "1:1--1:22",
  month =        mar,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1330511.1330512",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This article develops methods for determining visually
                 appealing motion transitions using linear blending.
                 Motion transitions are segues between two sequences of
                 animation, and are important components for generating
                 compelling animation streams in virtual environments
                 and computer games. Methods involving linear blending
                 are studied because of their efficiency, computational
                 speed, and widespread use. Two methods of transition
                 specification are detailed, center-aligned and
                 start-end transitions. First, we compute a set of
                 optimal weights for an underlying cost metric used to
                 determine the transition points. We then evaluate the
                 optimally weighted cost metric for generalizability,
                 appeal, and robustness through a cross-validation and
                 user study. Next, we develop methods for computing
                 visually appealing blend lengths for two broad
                 categories of motion. We empirically evaluate these
                 results through user studies. Finally, we assess the
                 importance of these techniques by determining the
                 minimum sensitivity of viewers to transition durations,
                 the just noticeable difference, for both center-aligned
                 and start-end specifications.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Animation; linear blending; motion transitions;
                 perception",
}

@Article{Wang:2008:CRM,
  author =       "Wenping Wang and Bert J{\"u}ttler and Dayue Zheng and
                 Yang Liu",
  title =        "Computation of rotation minimizing frames",
  journal =      j-TOG,
  volume =       "27",
  number =       "1",
  pages =        "2:1--2:19",
  month =        mar,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1330511.1330513",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Due to its minimal twist, the rotation minimizing
                 frame (RMF) is widely used in computer graphics,
                 including sweep or blending surface modeling, motion
                 design and control in computer animation and robotics,
                 streamline visualization, and tool path planning in
                 CAD/CAM. We present a novel simple and efficient method
                 for accurate and stable computation of RMF of a curve
                 in 3D. This method, called the double reflection
                 method, uses two reflections to compute each frame from
                 its preceding one to yield a sequence of frames to
                 approximate an exact RMF. The double reflection method
                 has the fourth order global approximation error, thus
                 it is much more accurate than the two currently
                 prevailing methods with the second order approximation
                 error---the projection method by Klok and the rotation
                 method by Bloomenthal, while all these methods have
                 nearly the same per-frame computational cost.
                 Furthermore, the double reflection method is much
                 simpler and faster than using the standard fourth order
                 Runge--Kutta method to integrate the defining ODE of
                 the RMF, though they have the same accuracy. We also
                 investigate further properties and extensions of the
                 double reflection method, and discuss the variational
                 principles in design moving frames with boundary
                 conditions, based on RMF.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Curve; differential geometry; motion; motion design;
                 rotation minimizing frame; sweep surface",
}

@Article{Parilov:2008:RTR,
  author =       "Evgueni Parilov and Denis Zorin",
  title =        "Real-time rendering of textures with feature curves",
  journal =      j-TOG,
  volume =       "27",
  number =       "1",
  pages =        "3:1--3:15",
  month =        mar,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1330511.1330514",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The standard bilinear interpolation on normal maps
                 results in visual artifacts along sharp features, which
                 are common for surfaces with creases, wrinkles, and
                 dents. In many cases, spatially varying features, like
                 the normals near discontinuity curves, are best
                 represented as functions of the distance to the curve
                 and the position along the curve. For high-quality
                 interactive rendering at arbitrary magnifications, one
                 needs to interpolate the distance field preserving
                 discontinuity curves exactly.\par

                 We present a real-time, GPU-based method for distance
                 function and distance gradient interpolation which
                 preserves discontinuity feature curves. The feature
                 curves are represented by a set of quadratic Bezier
                 curves, with minimal restrictions on their
                 intersections. We demonstrate how this technique can be
                 used for real-time rendering of complex feature
                 patterns and blending normal maps with procedurally
                 defined profiles near normal discontinuities.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Curvilinear feature rendering; distance function; GPU
                 algorithms; normal mapping; resolution independence",
}

@Article{Lessig:2008:SOS,
  author =       "Christian Lessig and Eugene Fiume",
  title =        "{SOHO}: {Orthogonal} and symmetric {Haar} wavelets on
                 the sphere",
  journal =      j-TOG,
  volume =       "27",
  number =       "1",
  pages =        "4:1--4:11",
  month =        mar,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1330511.1330515",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose the SOHO wavelet basis---the first
                 spherical Haar wavelet basis that is both orthogonal
                 and symmetric, making it particularly well suited for
                 the approximation and processing of all-frequency
                 signals on the sphere. We obtain the basis with a novel
                 spherical subdivision scheme that defines a partition
                 acting as the domain of the basis functions. Our
                 construction refutes earlier claims doubting the
                 existence of a basis that is both orthogonal and
                 symmetric. Experimental results for the representation
                 of spherical signals verify that the superior
                 theoretical properties of the SOHO wavelet basis are
                 also relevant in practice.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "spherical signals; Wavelet transform",
}

@Article{Neff:2008:GMA,
  author =       "Michael Neff and Michael Kipp and Irene Albrecht and
                 Hans-Peter Seidel",
  title =        "Gesture modeling and animation based on a
                 probabilistic re-creation of speaker style",
  journal =      j-TOG,
  volume =       "27",
  number =       "1",
  pages =        "5:1--5:24",
  month =        mar,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1330511.1330516",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Animated characters that move and gesticulate
                 appropriately with spoken text are useful in a wide
                 range of applications. Unfortunately, this class of
                 movement is very difficult to generate, even more so
                 when a unique, individual movement style is required.
                 We present a system that, with a focus on arm gestures,
                 is capable of producing full-body gesture animation for
                 given input text in the style of a particular
                 performer. Our process starts with video of a person
                 whose gesturing style we wish to animate. A
                 tool-assisted annotation process is performed on the
                 video, from which a statistical model of the person's
                 particular gesturing style is built. Using this model
                 and input text tagged with theme, rheme and focus, our
                 generation algorithm creates a gesture script. As
                 opposed to isolated singleton gestures, our gesture
                 script specifies a stream of continuous gestures
                 coordinated with speech. This script is passed to an
                 animation system, which enhances the gesture
                 description with additional detail. It then generates
                 either kinematic or physically simulated motion based
                 on this description. The system is capable of
                 generating gesture animations for novel text that are
                 consistent with a given performer's style, as was
                 successfully validated in an empirical user study.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "character animation; gesture; Human modeling",
}

@Article{Weidlich:2008:RRB,
  author =       "Andrea Weidlich and Alexander Wilkie",
  title =        "Realistic rendering of birefringency in uniaxial
                 crystals",
  journal =      j-TOG,
  volume =       "27",
  number =       "1",
  pages =        "6:1--6:12",
  month =        mar,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1330511.1330517",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this article we derive the complete set of formulas
                 needed to generate physically plausible images of
                 uniaxial crystals. So far no computer graphics
                 publication contains all the formulas one needs to
                 compute the interaction of light with such crystals in
                 a form that is usable by a graphics application,
                 especially if a polarization-aware rendering system is
                 being used.\par

                 This paper contains the complete derivation of the
                 Fresnel coefficients for birefringent transparent
                 materials, as well as for the direction cosines of the
                 extraordinary ray and the Mueller matrices necessary to
                 describe polarization effects. The formulas we derive
                 can be directly used in a ray based renderer, and we
                 demonstrate these capabilities in test scenes.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Birefringence; crystals; polarization",
}

@Article{Jarosz:2008:RCP,
  author =       "Wojciech Jarosz and Craig Donner and Matthias Zwicker
                 and Henrik Wann Jensen",
  title =        "Radiance caching for participating media",
  journal =      j-TOG,
  volume =       "27",
  number =       "1",
  pages =        "7:1--7:11",
  month =        mar,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1330511.1330518",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this article we present a novel radiance caching
                 method for efficiently rendering participating media
                 using Monte Carlo ray tracing. Our method handles all
                 types of light scattering including anisotropic
                 scattering, and it works in both homogeneous and
                 heterogeneous media. A key contribution in the article
                 is a technique for computing gradients of radiance
                 evaluated in participating media. These gradients take
                 the full path of the scattered light into account
                 including the changing properties of the medium in the
                 case of heterogeneous media. The gradients can be
                 computed simultaneously with the inscattered radiance
                 with negligible overhead. We compute gradients for
                 single scattering from lights and surfaces and for
                 multiple scattering, and we use a spherical harmonics
                 representation in media with anisotropic scattering.
                 Our second contribution is a new radiance caching
                 scheme for participating media. This caching scheme
                 uses the information in the radiance gradients to
                 sparsely sample as well as interpolate radiance within
                 the medium utilizing a novel, perceptually based error
                 metric. Our method provides several orders of magnitude
                 speedup compared to path tracing and produces higher
                 quality results than volumetric photon mapping.
                 Furthermore, it is view-driven and well suited for
                 large scenes where methods such as photon mapping
                 become costly.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Global illumination; gradients; irradiance caching;
                 Monte Carlo ray tracing; participating media; ray
                 marching; rendering; spherical harmonics",
}

@Article{Loop:2008:ACC,
  author =       "Charles Loop and Scott Schaefer",
  title =        "Approximating {Catmull--Clark} subdivision surfaces
                 with bicubic patches",
  journal =      j-TOG,
  volume =       "27",
  number =       "1",
  pages =        "8:1--8:11",
  month =        mar,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1330511.1330519",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a simple and computationally efficient
                 algorithm for approximating Catmull--Clark subdivision
                 surfaces using a minimal set of bicubic patches. For
                 each quadrilateral face of the control mesh, we
                 construct a geometry patch and a pair of tangent
                 patches. The geometry patches approximate the shape and
                 silhouette of the Catmull--Clark surface and are smooth
                 everywhere except along patch edges containing an
                 extraordinary vertex where the patches are C 0. To make
                 the patch surface appear smooth, we provide a pair of
                 tangent patches that approximate the tangent fields of
                 the Catmull--Clark surface. These tangent patches are
                 used to construct a continuous normal field (through
                 their cross-product) for shading and displacement
                 mapping. Using this bifurcated representation, we are
                 able to define an accurate proxy for Catmull--Clark
                 surfaces that is efficient to evaluate on
                 next-generation GPU architectures that expose a
                 programmable tessellation unit.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Catmull--Clark subdivision; GPU tessellation;
                 subdivision surfaces",
}

@Article{Wang:2008:MRH,
  author =       "Jiaping Wang and Shuang Zhao and Xin Tong and Stephen
                 Lin and Zhouchen Lin and Yue Dong and Baining Guo and
                 Heung-Yeung Shum",
  title =        "Modeling and rendering of heterogeneous translucent
                 materials using the diffusion equation",
  journal =      j-TOG,
  volume =       "27",
  number =       "1",
  pages =        "9:1--9:19",
  month =        mar,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1330511.1330520",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:12:47 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this article, we propose techniques for modeling
                 and rendering of heterogeneous translucent materials
                 that enable acquisition from measured samples,
                 interactive editing of material attributes, and
                 real-time rendering. The materials are assumed to be
                 optically dense such that multiple scattering can be
                 approximated by a diffusion process described by the
                 diffusion equation. For modeling heterogeneous
                 materials, we present the inverse diffusion algorithm
                 for acquiring material properties from appearance
                 measurements. This modeling algorithm incorporates a
                 regularizer to handle the ill-conditioning of the
                 inverse problem, an adjoint method to dramatically
                 reduce the computational cost, and a hierarchical GPU
                 implementation for further speedup. To render an object
                 with known material properties, we present the polygrid
                 diffusion algorithm, which solves the diffusion
                 equation with a boundary condition defined by the given
                 illumination environment. This rendering technique is
                 based on representation of an object by a polygrid, a
                 grid with regular connectivity and an irregular shape,
                 which facilitates solution of the diffusion equation in
                 arbitrary volumes. Because of the regular connectivity,
                 our rendering algorithm can be implemented on the GPU
                 for real-time performance. We demonstrate our
                 techniques by capturing materials from physical samples
                 and performing real-time rendering and editing with
                 these materials.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Appearance modeling and rendering; diffusion
                 approximation; subsurface scattering",
}

@Article{Ray:2008:SDF,
  author =       "Nicolas Ray and Bruno Vallet and Wan Chiu Li and Bruno
                 L{\'e}vy",
  title =        "{N}-symmetry direction field design",
  journal =      j-TOG,
  volume =       "27",
  number =       "2",
  pages =        "10:1--10:13",
  month =        apr,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1356682.1356683",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:13:04 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Many algorithms in computer graphics and geometry
                 processing use two orthogonal smooth direction fields
                 (unit tangent vector fields) defined over a surface.
                 For instance, these direction fields are used in
                 texture synthesis, in geometry processing or in
                 nonphotorealistic rendering to distribute and orient
                 elements on the surface. Such direction fields can be
                 designed in fundamentally different ways, according to
                 the symmetry requested: inverting a direction or
                 swapping two directions might be allowed or
                 not.\par

                 Despite the advances realized in the last few years in
                 the domain of geometry processing, a unified formalism
                 is still lacking for the mathematical object that
                 characterizes these generalized direction fields. As a
                 consequence, existing direction field design algorithms
                 are limited to using nonoptimum local relaxation
                 procedures.\par

                 In this article, we formalize N -symmetry direction
                 fields, a generalization of classical direction fields.
                 We give a new definition of their singularities to
                 explain how they relate to the topology of the surface.
                 Specifically, we provide an accessible demonstration of
                 the Poincar{\'e}-Hopf theorem in the case of N
                 -symmetry direction fields on 2-manifolds. Based on
                 this theorem, we explain how to control the topology of
                 N -symmetry direction fields on meshes. We demonstrate
                 the validity and robustness of this formalism by
                 deriving a highly efficient algorithm to design a
                 smooth field interpolating user-defined singularities
                 and directions.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "N -symmetry direction field; topology; Vector field
                 design",
}

@Article{Chen:2008:SRR,
  author =       "Xuejin Chen and Sing Bing Kang and Ying-Qing Xu and
                 Julie Dorsey and Heung-Yeung Shum",
  title =        "Sketching reality: {Realistic} interpretation of
                 architectural designs",
  journal =      j-TOG,
  volume =       "27",
  number =       "2",
  pages =        "11:1--11:15",
  month =        apr,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1356682.1356684",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:13:04 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this article, we introduce sketching reality, the
                 process of converting a freehand sketch into a
                 realistic-looking model. We apply this concept to
                 architectural designs. As the sketch is being drawn,
                 our system periodically interprets its 2.5D-geometry by
                 identifying new junctions, edges, and faces, and then
                 analyzing the extracted topology. The user can add
                 detailed geometry and textures through sketches as
                 well. This is possible through the use of databases
                 that match partial sketches to models of detailed
                 geometry and textures. The final product is a realistic
                 texture-mapped 2.5D-model of the building. We show a
                 variety of buildings that have been created using this
                 system.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "realistic imagery; shape; Sketching",
}

@Article{Kircher:2008:FFM,
  author =       "Scott Kircher and Michael Garland",
  title =        "Free-form motion processing",
  journal =      j-TOG,
  volume =       "27",
  number =       "2",
  pages =        "12:1--12:13",
  month =        apr,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1356682.1356685",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:13:04 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Motion is the center of attention in many applications
                 of computer graphics. Skeletal motion for articulated
                 characters can be processed and altered in a variety of
                 ways to increase the versatility of each motion clip.
                 However, analogous techniques have not yet been
                 developed for free-form deforming surfaces like cloth
                 and faces. Given the time-consuming nature of producing
                 each free-form motion clip, the ability to alter and
                 reuse free-form motion would be very desirable. We
                 present a novel method for processing free-form motion
                 that opens up a broad range of possible motion
                 alterations including motion blending, keyframe
                 insertion, and temporal signal processing. Our method
                 is based on a simple yet powerful differential surface
                 representation that is invariant under rotation and
                 translation and which is well suited for surface
                 editing in both space and time.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Deforming surfaces; mesh editing; motion blending;
                 motion editing; rotation-invariant surface
                 representation; temporal signal processing",
}

@Article{Ben-Artzi:2008:PPR,
  author =       "Aner Ben-Artzi and Kevin Egan and Ravi Ramamoorthi and
                 Fr{\'e}do Durand",
  title =        "A precomputed polynomial representation for
                 interactive {BRDF} editing with global illumination",
  journal =      j-TOG,
  volume =       "27",
  number =       "2",
  pages =        "13:1--13:14",
  month =        apr,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1356682.1356686",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Jun 13 19:13:04 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The ability to interactively edit BRDFs in their final
                 placement within a computer graphics scene is vital to
                 making informed choices for material properties. We
                 significantly extend previous work on BRDF editing for
                 static scenes (with fixed lighting and view) by
                 developing a precomputed polynomial representation that
                 enables interactive BRDF editing with global
                 illumination. Unlike previous precomputation-based
                 rendering techniques, the image is not linear in the
                 BRDF when considering interreflections. We introduce a
                 framework for precomputing a multibounce tensor of
                 polynomial coefficients that encapsulates the nonlinear
                 nature of the task. Significant reductions in
                 complexity are achieved by leveraging the low-frequency
                 nature of indirect light. We use a high-quality
                 representation for the BRDFs at the first bounce from
                 the eye and lower-frequency (often diffuse) versions
                 for further bounces. This approximation correctly
                 captures the general global illumination in a scene,
                 including color-bleeding, near-field object
                 reflections, and even caustics. We adapt Monte Carlo
                 path tracing for precomputing the tensor of
                 coefficients for BRDF basis functions. At runtime, the
                 high-dimensional tensors can be reduced to a simple dot
                 product at each pixel for rendering. We present a
                 number of examples of editing BRDFs in complex scenes
                 with interactive feedback rendered with global
                 illumination.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bidirectional reflectance distribution function;
                 global illumination; Material editing",
}

@Article{Wang:2008:FRC,
  author =       "Huamin Wang and Yonatan Wexler and Eyal Ofek and
                 Hugues Hoppe",
  title =        "Factoring repeated content within and among images",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "14:1--14:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360613",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We reduce transmission bandwidth and memory space for
                 images by factoring their repeated content. A transform
                 map and a condensed epitome are created such that all
                 image blocks can be reconstructed from transformed
                 epitome patches. The transforms may include affine
                 deformation and color scaling to account for
                 perspective and tonal variations across the image. The
                 factored representation allows efficient random-access
                 through a simple indirection, and can therefore be used
                 for real-time texture mapping without expansion in
                 memory. Our scheme is orthogonal to traditional image
                 compression, in the sense that the epitome is amenable
                 to further compression such as DXT. Moreover it allows
                 a new mode of progressivity, whereby generic features
                 appear before unique detail. Factoring is also
                 effective across a collection of images, particularly
                 in the context of image-based rendering. Eliminating
                 redundant content lets us include textures that are
                 several times as large in the same memory space.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "image compression; image epitomes; progressive
                 images",
}

@Article{Snavely:2008:FPT,
  author =       "Noah Snavely and Rahul Garg and Steven M. Seitz and
                 Richard Szeliski",
  title =        "Finding paths through the world's photos",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "15:1--15:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360614",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "When a scene is photographed many times by different
                 people, the viewpoints often cluster along certain
                 paths. These paths are largely specific to the scene
                 being photographed, and follow interesting regions and
                 viewpoints. We seek to discover a range of such paths
                 and turn them into controls for image-based rendering.
                 Our approach takes as input a large set of community or
                 personal photos, reconstructs camera viewpoints, and
                 automatically computes orbits, panoramas, canonical
                 views, and optimal paths between views. The scene can
                 then be interactively browsed in 3D using these
                 controls or with six degree-of-freedom free-viewpoint
                 control. As the user browses the scene, nearby views
                 are continuously selected and transformed, using
                 control-adaptive reprojection techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Rubinstein:2008:ISC,
  author =       "Michael Rubinstein and Ariel Shamir and Shai Avidan",
  title =        "Improved seam carving for video retargeting",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "16:1--16:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360615",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Video, like images, should support content aware
                 resizing. We present video retargeting using an
                 improved seam carving operator. Instead of removing 1D
                 seams from 2D images we remove 2D seam manifolds from
                 3D space-time volumes. To achieve this we replace the
                 dynamic programming method of seam carving with graph
                 cuts that are suitable for 3D volumes. In the new
                 formulation, a seam is given by a minimal cut in the
                 graph and we show how to construct a graph such that
                 the resulting cut is a valid seam. That is, the cut is
                 monotonic and connected. In addition, we present a
                 novel energy criterion that improves the visual quality
                 of the retargeted images and videos. The original seam
                 carving operator is focused on removing seams with the
                 least amount of energy, ignoring energy that is
                 introduced into the images and video by applying the
                 operator. To counter this, the new criterion is looking
                 forward in time - removing seams that introduce the
                 least amount of energy into the retargeted result. We
                 show how to encode the improved criterion into graph
                 cuts (for images and video) as well as dynamic
                 programming (for images). We apply our technique to
                 images and videos and present results of various
                 applications.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "forward energy; image retargeting; seam carving; video
                 editing; video retargeting",
}

@Article{Rav-Acha:2008:UMN,
  author =       "Alex Rav-Acha and Pushmeet Kohli and Carsten Rother
                 and Andrew Fitzgibbon",
  title =        "Unwrap mosaics: a new representation for video
                 editing",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "17:1--17:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360616",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce a new representation for video which
                 facilitates a number of common editing tasks. The
                 representation has some of the power of a full
                 reconstruction of 3D surface models from video, but is
                 designed to be easy to recover from {\em a priori\/}
                 unseen and uncalibrated footage. By modelling the
                 image-formation process as a 2D-to-2D transformation
                 from an object's texture map to the image, modulated by
                 an object-space occlusion mask, we can recover a
                 representation which we term the `unwrap mosaic'. Many
                 editing operations can be performed on the unwrap
                 mosaic, and then re-composited into the original
                 sequence, for example resizing objects, repainting
                 textures, copying/cutting/pasting objects, and
                 attaching effects layers to deforming objects.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "layers; mosaicing; motion estimation; video editing",
}

@Article{Seiler:2008:LMC,
  author =       "Larry Seiler and Doug Carmean and Eric Sprangle and
                 Tom Forsyth and Michael Abrash and Pradeep Dubey and
                 Stephen Junkins and Adam Lake and Jeremy Sugerman and
                 Robert Cavin and Roger Espasa and Ed Grochowski and
                 Toni Juan and Pat Hanrahan",
  title =        "Larrabee: a many-core x86 architecture for visual
                 computing",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "18:1--18:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360617",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents a many-core visual computing
                 architecture code named Larrabee, a new software
                 rendering pipeline, a manycore programming model, and
                 performance analysis for several applications. Larrabee
                 uses multiple in-order x86 CPU cores that are augmented
                 by a wide vector processor unit, as well as some fixed
                 function logic blocks. This provides dramatically
                 higher performance per watt and per unit of area than
                 out-of-order CPUs on highly parallel workloads. It also
                 greatly increases the flexibility and programmability
                 of the architecture as compared to standard GPUs. A
                 coherent on-die 2$^{nd}$ level cache allows efficient
                 inter-processor communication and high-bandwidth local
                 data access by CPU cores. Task scheduling is performed
                 entirely with software in Larrabee, rather than in
                 fixed function logic. The customizable software
                 graphics rendering pipeline for this architecture uses
                 binning in order to reduce required memory bandwidth,
                 minimize lock contention, and increase opportunities
                 for parallelism relative to standard GPUs. The Larrabee
                 native programming model supports a variety of highly
                 parallel applications that use irregular data
                 structures. Performance analysis on those applications
                 demonstrates Larrabee's potential for a broad range of
                 parallel computation.",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "GPGPU; graphics architecture; many-core computing;
                 parallel processing; realtime graphics; SIMD; software
                 rendering; throughput computing; visual computing",
}

@Article{Hou:2008:BBS,
  author =       "Qiming Hou and Kun Zhou and Baining Guo",
  title =        "{BSGP}: bulk-synchronous {GPU} programming",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "19:1--19:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360618",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present BSGP, a new programming language for
                 general purpose computation on the GPU. A BSGP program
                 looks much the same as a sequential C program.
                 Programmers only need to supply a bare minimum of extra
                 information to describe parallel processing on GPUs. As
                 a result, BSGP programs are easy to read, write, and
                 maintain. Moreover, the ease of programming does not
                 come at the cost of performance. A well-designed BSGP
                 compiler converts BSGP programs to kernels and combines
                 them using optimally allocated temporary streams. In
                 our benchmark, BSGP programs achieve similar or better
                 performance than well-optimized CUDA programs, while
                 the source code complexity and programming time are
                 significantly reduced. To test BSGP's code efficiency
                 and ease of programming, we implemented a variety of
                 GPU applications, including a highly sophisticated X3D
                 parser that would be extremely difficult to develop
                 with existing GPU programming languages.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bulk synchronous parallel programming; programable
                 graphics hardware; stream processing; thread
                 manipulation",
}

@Article{Wei:2008:PPD,
  author =       "Li-Yi Wei",
  title =        "Parallel {Poisson} disk sampling",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "20:1--20:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360619",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Sampling is important for a variety of graphics
                 applications include rendering, imaging, and geometry
                 processing. However, producing sample sets with desired
                 efficiency and blue noise statistics has been a major
                 challenge, as existing methods are either sequential
                 with limited speed, or are parallel but only through
                 pre-computed datasets and thus fall short in producing
                 samples with blue noise statistics. We present a
                 Poisson disk sampling algorithm that runs in parallel
                 and produces all samples on the fly with desired blue
                 noise properties. Our main idea is to subdivide the
                 sample domain into grid cells and we draw samples
                 concurrently from multiple cells that are sufficiently
                 far apart so that their samples cannot conflict one
                 another. We present a parallel implementation of our
                 algorithm running on a GPU with constant cost per
                 sample and constant number of computation passes for a
                 target number of samples. Our algorithm also works in
                 arbitrary dimension, and allows adaptive sampling from
                 a user-specified importance field. Furthermore, our
                 algorithm is simple and easy to implement, and runs
                 faster than existing techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "blue noise; GPU techniques; parallel computation;
                 Poisson disk; sampling; texture synthesis",
}

@Article{Kazhdan:2008:SMG,
  author =       "Michael Kazhdan and Hugues Hoppe",
  title =        "Streaming multigrid for gradient-domain operations on
                 large images",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "21:1--21:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360620",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce a new tool to solve the large linear
                 systems arising from gradient-domain image processing.
                 Specifically, we develop a streaming multigrid solver,
                 which needs just two sequential passes over out-of-core
                 data. This fast solution is enabled by a combination of
                 three techniques: (1) use of second-order finite
                 elements (rather than traditional finite differences)
                 to reach sufficient accuracy in a single V-cycle, (2)
                 temporally blocked relaxation, and (3) multi-level
                 streaming to pipeline the restriction and prolongation
                 phases into single streaming passes. A key contribution
                 is the extension of the B-spline finite-element method
                 to be compatible with the forward-difference gradient
                 representation commonly used with images. Our streaming
                 solver is also efficient for in-memory images, due to
                 its fast convergence and excellent cache behavior.
                 Remarkably, it can outperform spatially adaptive
                 solvers that exploit application-specific knowledge. We
                 demonstrate seamless stitching and tone-mapping of
                 gigapixel images in about an hour on a notebook PC.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "B-spline finite elements; gigapixel images;
                 multi-level streaming; out-of-core multigrid solver;
                 Poisson equation",
}

@Article{Lee:2008:SJM,
  author =       "Sung-Hee Lee and Demetri Terzopoulos",
  title =        "Spline joints for multibody dynamics",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "22:1--22:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360621",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "{\em Spline joints\/} are a novel class of joints that
                 can model general scleronomic constraints for multibody
                 dynamics based on the minimal-coordinates formulation.
                 The main idea is to introduce spline curves and
                 surfaces in the modeling of joints: We model 1-DOF
                 joints using splines on SE(3), and construct multi-DOF
                 joints as the product of exponentials of splines in
                 Euclidean space. We present efficient recursive
                 algorithms to compute the derivatives of the spline
                 joint, as well as geometric algorithms to determine
                 optimal parameters in order to achieve the desired
                 joint motion. Our spline joints can be used to create
                 interesting new simulated mechanisms for computer
                 animation and they can more accurately model complex
                 biomechanical joints such as the knee and shoulder.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "biological joints; multibody dynamics; scleronomic
                 joints; splines",
}

@Article{Harmon:2008:RTS,
  author =       "David Harmon and Etienne Vouga and Rasmus Tamstorf and
                 Eitan Grinspun",
  title =        "Robust treatment of simultaneous collisions",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "23:1--23:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360622",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Robust treatment of complex collisions is a
                 challenging problem in cloth simulation. Some state of
                 the art methods resolve collisions iteratively,
                 invoking a fail-safe when a bound on iteration count is
                 exceeded. The best-known fail-safe rigidifies the
                 contact region, causing simulation artifacts. We
                 present a fail-safe that cancels impact but not sliding
                 motion, considerably reducing artificial dissipation.
                 We equip the proposed fail-safe with an approximation
                 of Coulomb friction, allowing finer control of sliding
                 dissipation.",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cloth; collision; configuration space; contact;
                 shells; simulation",
}

@Article{Bonneel:2008:FMS,
  author =       "Nicolas Bonneel and George Drettakis and Nicolas
                 Tsingos and Isabelle Viaud-Delmon and Doug James",
  title =        "Fast modal sounds with scalable frequency-domain
                 synthesis",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "24:1--24:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360623",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Audio rendering of impact sounds, such as those caused
                 by falling objects or explosion debris, adds realism to
                 interactive 3D audiovisual applications, and can be
                 convincingly achieved using modal sound synthesis.
                 Unfortunately, mode-based computations can become
                 prohibitively expensive when many objects, each with
                 many modes, are impacted simultaneously. We introduce a
                 fast sound synthesis approach, based on short-time
                 Fourier Tranforms, that exploits the inherent sparsity
                 of modal sounds in the frequency domain. For our test
                 scenes, this `fast mode summation' can give speedups of
                 5--8 times compared to a time-domain solution, with
                 slight degradation in quality. We discuss different
                 reconstruction windows, affecting the quality of impact
                 sound `attacks'. Our Fourier-domain processing method
                 allows us to introduce a scalable, real-time, audio
                 processing pipeline for both recorded and modal sounds,
                 with auditory masking and sound source clustering. To
                 avoid abrupt computation peaks, such as during the
                 simultaneous impacts of an explosion, we use crossmodal
                 perception results on audiovisual synchrony to effect
                 temporal scheduling. We also conducted a pilot
                 perceptual user evaluation of our method. Our
                 implementation results show that we can treat complex
                 audiovisual scenes in real time with high quality.",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "modal synthesis; physically based animation; real-time
                 audio rendering; sound synthesis",
}

@Article{Twigg:2008:BSR,
  author =       "Christopher D. Twigg and Doug L. James",
  title =        "Backward steps in rigid body simulation",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "25:1--25:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360624",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Physically based simulation of rigid body dynamics is
                 commonly done by time-stepping systems {\em forward\/}
                 in time. In this paper, we propose methods to allow
                 time-stepping rigid body systems {\em back-ward\/} in
                 time. Unfortunately, reverse-time integration of rigid
                 bodies involving frictional contact is mathematically
                 ill-posed, and can lack unique solutions. We instead
                 propose time-reversed rigid body integrators that can
                 sample {\em possible\/} solutions when unique ones do
                 not exist. We also discuss challenges related to
                 dissipation-related energy gain, sensitivity to initial
                 conditions, stacking, constraints and articulation,
                 rolling, sliding, skidding, bouncing, high angular
                 velocities, rapid velocity growth from
                 micro-collisions, and other problems encountered when
                 going against the usual flow of time.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "frictional contact; ill-posedness; inverse problems;
                 linear complementarity; motion planning; rigid body
                 dynamics",
}

@Article{McDonnell:2008:CAP,
  author =       "Rachel McDonnell and Mich{\'e}al Larkin and Simon
                 Dobbyn and Steven Collins and Carol O'Sullivan",
  title =        "Clone attack! {Perception} of crowd variety",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "26:1--26:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360625",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "When simulating large crowds, it is inevitable that
                 the models and motions of many virtual characters will
                 be cloned. However, the perceptual impact of this
                 trade-off has never been studied. In this paper, we
                 consider the ways in which an impression of variety can
                 be created and the perceptual consequences of certain
                 design choices. In a series of experiments designed to
                 test people's perception of variety in crowds, we found
                 that clones of appearance are far easier to detect than
                 motion clones. Furthermore, we established that cloned
                 models can be masked by color variation, random
                 orientation, and motion. Conversely, the perception of
                 cloned motions remains unaffected by the model on which
                 they are displayed. Other factors that influence the
                 ability to detect clones were examined, such as
                 proximity, model type and characteristic motion. Our
                 results provide novel insights and useful thresholds
                 that will assist in creating more realistic,
                 heterogeneous crowds.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; crowds; perception; variety",
}

@Article{Hecker:2008:RTM,
  author =       "Chris Hecker and Bernd Raabe and Ryan W. Enslow and
                 John DeWeese and Jordan Maynard and Kees van Prooijen",
  title =        "Real-time motion retargeting to highly varied
                 user-created morphologies",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "27:1--27:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360626",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Character animation in video games---whether manually
                 keyframed or motion captured---has traditionally relied
                 on codifying skeletons early in a game's development,
                 and creating animations rigidly tied to these fixed
                 skeleton morphologies. This paper introduces a novel
                 system for animating characters whose morphologies are
                 unknown at the time the animation is created. Our
                 authoring tool allows animators to describe motion
                 using familiar posing and key-framing methods. The
                 system records the data in a morphology-independent
                 form, preserving both the animation's structural
                 relationships and its stylistic information. At
                 runtime, the generalized data are applied to specific
                 characters to yield pose goals that are supplied to a
                 robust and efficient inverse kinematics solver. This
                 system allows us to animate characters with highly
                 varying skeleton morphologies that did not exist when
                 the animation was authored, and, indeed, may be
                 radically different than anything the original animator
                 envisioned.",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "character animation; games; inverse kinematics; motion
                 retargeting; procedural animation; user generated
                 content",
}

@Article{Kass:2008:AOM,
  author =       "Michael Kass and John Anderson",
  title =        "Animating oscillatory motion with overlap: wiggly
                 splines",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "28:1--28:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360627",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Oscillatory motion is ubiquitous in computer graphics,
                 yet existing animation techniques are ill-suited to its
                 authoring. We introduce a new type of spline for this
                 purpose, known as a `Wiggly Spline.' The spline
                 generalizes traditional piecewise cubics when its
                 resonance and damping are set to zero, but creates
                 oscillatory animation when its resonance and damping
                 are changed. The spline provides a combination of
                 direct manipulation and physical realism. To create
                 overlapped and propagating motion, we generate phase
                 shifts of the Wiggly Spline, and use these to control
                 appropriate degrees of freedom in a model. The phase
                 shifts can be created directly by procedural techniques
                 or through a paint-like interface. A further option is
                 to derive the phase shifts statistically by analyzing a
                 time-series of a simulation. In this case, the Wiggly
                 Spline makes it possible to canonicalize a simulation,
                 generalize it by providing frequency and damping
                 controls and control it through direct manipulation.",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "spacetime constraints; splines",
}

@Article{Shi:2008:EBD,
  author =       "Xiaohan Shi and Kun Zhou and Yiying Tong and Mathieu
                 Desbrun and Hujun Bao and Baining Guo",
  title =        "Example-based dynamic skinning in real time",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "29:1--29:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360628",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper we present an approach to enrich
                 skeleton-driven animations with physically-based
                 secondary deformation in real time. To achieve this
                 goal, we propose a novel, surface-based deformable
                 model that can interactively emulate the dynamics of
                 both low-and high-frequency volumetric effects. Given a
                 surface mesh and a few sample sequences of its physical
                 behavior, a set of motion parameters of the material
                 are learned during an off-line preprocessing step. The
                 deformable model is then applicable to any given
                 skeleton-driven animation of the surface mesh.
                 Additionally, our dynamic skinning technique can be
                 entirely implemented on GPUs and executed with great
                 efficiency. Thus, with minimal changes to the
                 conventional graphics pipeline, our approach can
                 drastically enhance the visual experience of
                 skeleton-driven animations by adding secondary
                 deformation in real time.",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "finite element method; physically-based animation;
                 secondary motion; skeleton-driven mesh deformation",
}

@Article{Paris:2008:HPG,
  author =       "Sylvain Paris and Will Chang and Oleg I. Kozhushnyan
                 and Wojciech Jarosz and Wojciech Matusik and Matthias
                 Zwicker and Fr{\'e}do Durand",
  title =        "Hair photobooth: geometric and photometric acquisition
                 of real hairstyles",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "30:1--30:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360629",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We accurately capture the shape and appearance of a
                 person's hairstyle. We use triangulation and a sweep
                 with planes of light for the geometry. Multiple
                 projectors and cameras address the challenges raised by
                 the reflectance and intricate geometry of hair. We
                 introduce the use of structure tensors to infer the
                 hidden geometry between the hair surface and the scalp.
                 Our triangulation approach affords substantial accuracy
                 improvement and we are able to measure elaborate hair
                 geometry including complex curls and concavities. To
                 reproduce the hair appearance, we capture a
                 six-dimensional reflectance field. We introduce a new
                 reflectance interpolation technique that leverages an
                 analytical reflectance model to alleviate cross-fading
                 artifacts caused by linear methods. Our results closely
                 match the real hairstyles and can be used for
                 animation.",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "active vision; hair; image-based rendering",
}

@Article{Moon:2008:EMS,
  author =       "Jonathan T. Moon and Bruce Walter and Steve
                 Marschner",
  title =        "Efficient multiple scattering in hair using spherical
                 harmonics",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "31:1--31:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360630",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Previous research has shown that a global multiple
                 scattering simulation is needed to achieve physically
                 realistic renderings of hair, particularly
                 light-colored hair with low absorption. However,
                 previous methods have either sacrificed accuracy or
                 have been too computationally expensive for practical
                 use. In this paper we describe a physically based,
                 volumetric rendering method that computes multiple
                 scattering solutions, including directional effects,
                 much faster than previous accurate methods. Our
                 two-pass method first traces light paths through a
                 volumetric representation of the hair, contributing
                 power to a 3D grid of spherical harmonic coefficients
                 that store the directional distribution of scattered
                 radiance everywhere in the hair volume. Then, in a ray
                 tracing pass, multiple scattering is computed by
                 integrating the stored radiance against the scattering
                 functions of visible fibers using an efficient matrix
                 multiplication. Single scattering is computed using
                 conventional direct illumination methods. In our
                 comparisons the new method produces quality similar to
                 that of the best previous methods, but computes
                 multiple scattering more than 10 times faster.",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "hair; multiple scattering; spherical harmonics",
}

@Article{Zinke:2008:DSA,
  author =       "Arno Zinke and Cem Yuksel and Andreas Weber and John
                 Keyser",
  title =        "Dual scattering approximation for fast multiple
                 scattering in hair",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "32:1--32:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360631",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "When rendering light colored hair, multiple fiber
                 scattering is essential for the right perception of the
                 overall hair color. In this context, we present a novel
                 technique to efficiently approximate multiple fiber
                 scattering for a full head of human hair or a similar
                 fiber based geometry. In contrast to previous ad-hoc
                 approaches, our method relies on the physically
                 accurate concept of the Bidirectional Scattering
                 Distribution Functions and gives physically plausible
                 results with no need for parameter tweaking. We show
                 that complex scattering effects can be approximated
                 very well by using aggressive simplifications based on
                 this theoretical model. When compared to unbiased
                 Monte-Carlo path tracing, our approximations preserve
                 photo-realism in most settings but with rendering times
                 at least two-orders of magnitude lower. Time and space
                 complexity are much lower compared to photon
                 mapping-based techniques and we can even achieve
                 realistic results in real-time on a standard PC with
                 consumer graphics hardware.",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "GPU algorithms; hair rendering; multiple scattering",
}

@Article{Hachisuka:2008:MAS,
  author =       "Toshiya Hachisuka and Wojciech Jarosz and Richard
                 Peter Weistroffer and Kevin Dale and Greg Humphreys and
                 Matthias Zwicker and Henrik Wann Jensen",
  title =        "Multidimensional adaptive sampling and reconstruction
                 for ray tracing",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "33:1--33:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360632",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new adaptive sampling strategy for ray
                 tracing. Our technique is specifically designed to
                 handle multidimensional sample domains, and it is well
                 suited for efficiently generating images with effects
                 such as soft shadows, motion blur, and depth of field.
                 These effects are problematic for existing image based
                 adaptive sampling techniques as they operate on pixels,
                 which are possibly noisy results of a Monte Carlo ray
                 tracing process. Our sampling technique operates on
                 samples in the multidimensional space given by the
                 rendering equation and as a consequence the value of
                 each sample is noise-free. Our algorithm consists of
                 two passes. In the first pass we adaptively generate
                 samples in the multidimensional space, focusing on
                 regions where the local contrast between samples is
                 high. In the second pass we reconstruct the image by
                 integrating the multidimensional function along all but
                 the image dimensions. We perform a high quality
                 anisotropic reconstruction by determining the extent of
                 each sample in the multidimensional space using a
                 structure tensor. We demonstrate our method on scenes
                 with a 3 to 5 dimensional space, including soft
                 shadows, motion blur, and depth of field. The results
                 show that our method uses fewer samples than
                 Mittchell's adaptive sampling technique while producing
                 images with less noise.",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "global illumination; ray tracing; rendering equation;
                 sampling and reconstruction",
}

@Article{Annen:2008:RTA,
  author =       "Thomas Annen and Zhao Dong and Tom Mertens and
                 Philippe Bekaert and Hans-Peter Seidel and Jan Kautz",
  title =        "Real-time, all-frequency shadows in dynamic scenes",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "34:1--34:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360633",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Shadow computation in dynamic scenes under complex
                 illumination is a challenging problem. Methods based on
                 precomputation provide accurate, real-time solutions,
                 but are hard to extend to dynamic scenes. Specialized
                 approaches for soft shadows can deal with dynamic
                 objects but are not fast enough to handle more than one
                 light source. In this paper, we present a technique for
                 rendering dynamic objects under arbitrary environment
                 illumination, which does not require any
                 precomputation. The key ingredient is a fast,
                 approximate technique for computing soft shadows, which
                 achieves several hundred frames per second for a single
                 light source. This allows for approximating environment
                 illumination with a sparse collection of area light
                 sources and yields real-time frame rates.",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "convolution; environment maps; soft shadows",
}

@Article{Sun:2008:IRD,
  author =       "Xin Sun and Kun Zhou and Eric Stollnitz and Jiaoying
                 Shi and Baining Guo",
  title =        "Interactive relighting of dynamic refractive objects",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "35:1--35:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360634",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new technique for interactive relighting
                 of dynamic refractive objects with complex material
                 properties. We describe our technique in terms of a
                 rendering pipeline in which each stage runs entirely on
                 the GPU. The rendering pipeline converts surfaces to
                 volumetric data, traces the curved paths of photons as
                 they refract through the volume, and renders arbitrary
                 views of the resulting radiance distribution. Our
                 rendering pipeline is fast enough to permit interactive
                 updates to lighting, materials, geometry, and viewing
                 parameters without any precomputation. Applications of
                 our technique include the visualization of caustics,
                 absorption, and scattering while running physical
                 simulations or while manipulating surfaces in real
                 time.",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "interactive relighting; photon tracing; ray tracing;
                 refractive objects",
}

@Article{Zhou:2008:RTS,
  author =       "Kun Zhou and Zhong Ren and Stephen Lin and Hujun Bao
                 and Baining Guo and Heung-Yeung Shum",
  title =        "Real-time smoke rendering using compensated ray
                 marching",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "36:1--36:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360635",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a real-time algorithm called {\em
                 compensated ray marching\/} for rendering of smoke
                 under dynamic low-frequency environment lighting. Our
                 approach is based on a decomposition of the input smoke
                 animation, represented as a sequence of volumetric
                 density fields, into a set of radial basis functions
                 (RBFs) and a sequence of residual fields. To expedite
                 rendering, the source radiance distribution within the
                 smoke is computed from only the low-frequency RBF
                 approximation of the density fields, since the
                 high-frequency residuals have little impact on global
                 illumination under low-frequency environment lighting.
                 Furthermore, in computing source radiances the
                 contributions from single and multiple scattering are
                 evaluated at only the RBF centers and then approximated
                 at other points in the volume using an RBF-based
                 interpolation. A slice-based integration of these
                 source radiances along each view ray is then performed
                 to render the final image. The high-frequency residual
                 fields, which are a critical component in the local
                 appearance of smoke, are compensated back into the
                 radiance integral during this ray march to generate
                 images of high detail.\par

                 The runtime algorithm, which includes both light
                 transfer simulation and ray marching, can be easily
                 implemented on the GPU, and thus allows for real-time
                 manipulation of viewpoint and lighting, as well as
                 interactive editing of smoke attributes such as
                 extinction cross section, scattering albedo, and phase
                 function. Only moderate preprocessing time and storage
                 is needed. This approach provides the first method for
                 real-time smoke rendering that includes single and
                 multiple scattering while generating results comparable
                 in quality to offline algorithms like ray tracing.",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "environment lighting; multiple scattering;
                 participating media; perfect hashing; single
                 scattering",
}

@Article{Lehtinen:2008:MHR,
  author =       "Jaakko Lehtinen and Matthias Zwicker and Emmanuel
                 Turquin and Janne Kontkanen and Fr{\'e}do Durand and
                 Fran{\c{c}}ois X. Sillion and Timo Aila",
  title =        "A meshless hierarchical representation for light
                 transport",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "37:1--37:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360636",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce a meshless hierarchical representation
                 for solving light transport problems. Precomputed
                 radiance transfer (PRT) and finite elements require a
                 discrete representation of illumination over the scene.
                 Non-hierarchical approaches such as per-vertex values
                 are simple to implement, but lead to long
                 precomputation. Hierarchical bases like wavelets lead
                 to dramatic acceleration, but in their basic form they
                 work well only on flat or smooth surfaces. We introduce
                 a hierarchical function basis induced by scattered data
                 approximation. It is decoupled from the geometric
                 representation, allowing the hierarchical
                 representation of illumination on complex objects. We
                 present simple data structures and algorithms for
                 constructing and evaluating the basis functions. Due to
                 its hierarchical nature, our representation adapts to
                 the complexity of the illumination, and can be queried
                 at different scales. We demonstrate the power of the
                 new basis in a novel precomputed direct-to-indirect
                 light transport algorithm that greatly increases the
                 complexity of scenes that can be handled by PRT
                 approaches.",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "global illumination; meshless basis functions;
                 pre-computed radiance transfer; scattered data",
}

@Article{Leyvand:2008:DDE,
  author =       "Tommer Leyvand and Daniel Cohen-Or and Gideon Dror and
                 Dani Lischinski",
  title =        "Data-driven enhancement of facial attractiveness",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "38:1--38:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360637",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "When human raters are presented with a collection of
                 shapes and asked to rank them according to their
                 aesthetic appeal, the results often indicate that there
                 is a statistical consensus among the raters. Yet it
                 might be difficult to define a succinct set of rules
                 that capture the aesthetic preferences of the raters.
                 In this work, we explore a data-driven approach to
                 aesthetic enhancement of such shapes. Specifically, we
                 focus on the challenging problem of enhancing the
                 aesthetic appeal (or the {\em attractiveness\/}) of
                 human faces in frontal photographs (portraits), while
                 maintaining close similarity with the original.\par

                 The key component in our approach is an automatic
                 facial attractiveness engine trained on datasets of
                 faces with accompanying facial attractiveness ratings
                 collected from groups of human raters. Given a new
                 face, we extract a set of distances between a variety
                 of facial feature locations, which define a point in a
                 high-dimensional `face space'. We then search the face
                 space for a nearby point with a higher predicted
                 attractiveness rating. Once such a point is found, the
                 corresponding facial distances are embedded in the
                 plane and serve as a target to define a 2D warp field
                 which maps the original facial features to their
                 adjusted locations. The effectiveness of our technique
                 was experimentally validated by independent rating
                 experiments, which indicate that it is indeed capable
                 of increasing the facial attractiveness of most
                 portraits that we have experimented with.",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "facial attractiveness; machine learning; optimization;
                 warping",
}

@Article{Bitouk:2008:FSA,
  author =       "Dmitri Bitouk and Neeraj Kumar and Samreen Dhillon and
                 Peter Belhumeur and Shree K. Nayar",
  title =        "Face swapping: automatically replacing faces in
                 photographs",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "39:1--39:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360638",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we present a complete system for
                 automatic face replacement in images. Our system uses a
                 large library of face images created automatically by
                 downloading images from the Internet, extracting faces
                 using face detection software, and aligning each
                 extracted face to a common coordinate system. This
                 library is constructed off-line, once, and can be
                 efficiently accessed during face replacement. Our
                 replacement algorithm has three main stages. First,
                 given an input image, we detect all faces that are
                 present, align them to the coordinate system used by
                 our face library, and select candidate face images from
                 our face library that are similar to the input face in
                 appearance and pose. Second, we adjust the pose,
                 lighting, and color of the candidate face images to
                 match the appearance of those in the input image, and
                 seamlessly blend in the results. Third, we rank the
                 blended candidate replacements by computing a match
                 distance over the overlap region. Our approach requires
                 no 3D model, is fully automatic, and generates highly
                 plausible results across a wide range of skin tones,
                 lighting conditions, and viewpoints. We show how our
                 approach can be used for a variety of applications
                 including face de-identification and the creation of
                 appealing group photographs from a set of images. We
                 conclude with a user study that validates the high
                 quality of our replacement results, and a discussion on
                 the current limitations of our system.",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational photography; face replacement; image
                 databases; image-based rendering",
}

@Article{An:2008:AAP,
  author =       "Xiaobo An and Fabio Pellacini",
  title =        "{AppProp}: all-pairs appearance-space edit
                 propagation",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "40:1--40:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360639",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an intuitive and efficient method for
                 editing the appearance of complex spatially-varying
                 datasets, such as images and measured materials. In our
                 framework, users specify rough adjustments that are
                 refined interactively by enforcing the policy that
                 similar edits are applied to spatially-close regions of
                 similar appearance. Rather than proposing a specific
                 user interface, our method allows artists to quickly
                 and imprecisely specify the initial edits with any
                 method or workflow they feel most comfortable with. An
                 energy optimization formulation is used to propagate
                 the initial rough adjustments to the final refined ones
                 by enforcing the editing policy over all pairs of
                 points in the dataset. We show that this formulation is
                 equivalent to solving a large linear system defined by
                 a dense matrix. We derive an approximate algorithm to
                 compute such a solution interactively by taking
                 advantage of the inherent structure of the matrix. We
                 demonstrate our approach by editing images, HDR
                 radiance maps, and measured materials. Finally, we show
                 that our framework generalizes prior methods while
                 providing significant improvements in generality,
                 robustness and efficiency.",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wang:2008:MAS,
  author =       "Jiaping Wang and Shuang Zhao and Xin Tong and John
                 Snyder and Baining Guo",
  title =        "Modeling anisotropic surface reflectance with
                 example-based microfacet synthesis",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "41:1--41:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360640",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new technique for the visual modeling of
                 spatiallyvarying anisotropic reflectance using data
                 captured from a single view. Reflectance is represented
                 using a microfacet-based BRDF which tabulates the
                 facets' normal distribution (NDF) as a function of
                 surface location. Data from a single view provides a 2D
                 slice of the 4D BRDF at each surface point from which
                 we fit a partial NDF. The fitted NDF is partial because
                 the single view direction coupled with the set of light
                 directions covers only a portion of the `half-angle'
                 hemisphere. We complete the NDF at each point by
                 applying a novel variant of texture synthesis using
                 similar, overlapping partial NDFs from other points.
                 Our similarity measure allows azimuthal rotation of
                 partial NDFs, under the assumption that reflectance is
                 spatially redundant but the local frame may be
                 arbitrarily oriented. Our system includes a simple
                 acquisition device that collects images over a 2D set
                 of light directions by scanning a linear array of LEDs
                 over a flat sample. Results demonstrate that our
                 approach preserves spatial and directional BRDF details
                 and generates a visually compelling match to measured
                 materials.",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Fu:2008:UOM,
  author =       "Hongbo Fu and Daniel Cohen-Or and Gideon Dror and Alla
                 Sheffer",
  title =        "Upright orientation of man-made objects",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "42:1--42:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360641",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Humans usually associate an upright orientation with
                 objects, placing them in a way that they are most
                 commonly seen in our surroundings. While it is an open
                 challenge to recover the functionality of a shape from
                 its geometry alone, this paper shows that it is often
                 possible to infer its upright orientation by analyzing
                 its geometry. Our key idea is to reduce the
                 two-dimensional (spherical) orientation space to a
                 small set of orientation candidates using
                 functionality-related geometric properties of the
                 object, and then determine the best orientation using
                 an assessment function of several functional geometric
                 attributes defined with respect to each candidate.
                 Specifically we focus on obtaining the upright
                 orientation for man-made objects that typically stand
                 on some flat surface (ground, floor, table, etc.),
                 which include the vast majority of objects in our
                 everyday surroundings. For these types of models
                 orientation candidates can be defined according to
                 static equilibrium. For each candidate, we introduce a
                 set of discriminative attributes linking shape to
                 function. We learn an assessment function of these
                 attributes from a training set using a combination of
                 Random Forest classifier and Support Vector Machine
                 classifier. Experiments demonstrate that our method
                 generalizes well and achieves about 90\% prediction
                 accuracy for both a 10-fold cross-validation over the
                 training set and a validation with an independent test
                 set.",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Pauly:2008:DSR,
  author =       "Mark Pauly and Niloy J. Mitra and Johannes Wallner and
                 Helmut Pottmann and Leonidas J. Guibas",
  title =        "Discovering structural regularity in {$3$D} geometry",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "43:1--43:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360642",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce a computational framework for discovering
                 regular or repeated geometric structures in 3D shapes.
                 We describe and classify possible regular structures
                 and present an effective algorithm for detecting such
                 repeated geometric patterns in point- or meshbased
                 models. Our method assumes no prior knowledge of the
                 geometry or spatial location of the individual elements
                 that define the pattern. Structure discovery is made
                 possible by a careful analysis of pairwise similarity
                 transformations that reveals prominent lattice
                 structures in a suitable model of transformation space.
                 We introduce an optimization method for detecting such
                 uniform grids specifically designed to deal with
                 outliers and missing elements. This yields a robust
                 algorithm that successfully discovers complex regular
                 structures amidst clutter, noise, and missing geometry.
                 The accuracy of the extracted generating
                 transformations is further improved using a novel
                 simultaneous registration method in the spatial domain.
                 We demonstrate the effectiveness of our algorithm on a
                 variety of examples and show applications to
                 compression, model repair, and geometry synthesis.",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "regular structure; repetitive pattern; shape analysis;
                 similarity transformation; transformation group",
}

@Article{Au:2008:SEM,
  author =       "Oscar Kin-Chung Au and Chiew-Lan Tai and Hung-Kuo Chu
                 and Daniel Cohen-Or and Tong-Yee Lee",
  title =        "Skeleton extraction by mesh contraction",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "44:1--44:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360643",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Extraction of curve-skeletons is a fundamental problem
                 with many applications in computer graphics and
                 visualization. In this paper, we present a simple and
                 robust skeleton extraction method based on mesh
                 contraction. The method works directly on the mesh
                 domain, without pre-sampling the mesh model into a
                 volumetric representation. The method first contracts
                 the mesh geometry into zero-volume skeletal shape by
                 applying implicit Laplacian smoothing with global
                 positional constraints. The contraction does not alter
                 the mesh connectivity and retains the key features of
                 the original mesh. The contracted mesh is then
                 converted into a 1D curve-skeleton through a
                 connectivity surgery process to remove all the
                 collapsed faces while preserving the shape of the
                 contracted mesh and the original topology. The
                 centeredness of the skeleton is refined by exploiting
                 the induced skeleton-mesh mapping. In addition to
                 producing a curve skeleton, the method generates other
                 valuable information about the object's geometry, in
                 particular, the skeleton-vertex correspondence and the
                 local thickness, which are useful for various
                 applications. We demonstrate its effectiveness in mesh
                 segmentation and skinning animation.",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Laplacian; mesh contraction; segmentation; skeleton;
                 skinning; smoothing",
}

@Article{Dey:2008:CGA,
  author =       "Tamal K. Dey and Kuiyu Li and Jian Sun and David
                 Cohen-Steiner",
  title =        "Computing geometry-aware handle and tunnel loops in
                 {$3$D} models",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "45:1--45:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360644",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Many applications such as topology repair, model
                 editing, surface parameterization, and feature
                 recognition benefit from computing loops on surfaces
                 that wrap around their `handles' and `tunnels'.
                 Computing such loops while optimizing their geometric
                 lengths is difficult. On the other hand, computing such
                 loops without considering geometry is easy but may not
                 be very useful. In this paper we strike a balance by
                 computing topologically correct loops that are also
                 geometrically relevant. Our algorithm is a novel
                 application of the concepts from topological
                 persistence introduced recently in computational
                 topology. The usability of the computed loops is
                 demonstrated with some examples in feature
                 identification and topology simplification.",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "feature identification; persistent homology; shape
                 analysis; surface loop; topology; topology repair",
}

@Article{Robinson-Mosher:2008:TWC,
  author =       "Avi Robinson-Mosher and Tamar Shinar and Jon
                 Gretarsson and Jonathan Su and Ronald Fedkiw",
  title =        "Two-way coupling of fluids to rigid and deformable
                 solids and shells",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "46:1--46:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360645",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose a novel solid/fluid coupling method that
                 treats the coupled system in a fully implicit manner
                 making it stable for arbitrary time steps, large
                 density ratios, etc. In contrast to previous work in
                 computer graphics, we derive our method using a simple
                 back-of-the-envelope approach which lumps the solid and
                 fluid momenta together, and which we show exactly
                 conserves the momentum of the coupled system. Notably,
                 our method uses the standard Cartesian fluid
                 discretization and does not require (moving) conforming
                 tetrahedral meshes or ALE frameworks. Furthermore, we
                 use a standard Lagrangian framework for the solid, thus
                 supporting arbitrary solid constitutive models, both
                 implicit and explicit time integration, etc. The method
                 is quite general, working for smoke, water, and
                 multiphase fluids as well as both rigid and deformable
                 solids, and both volumes and thin shells. Rigid shells
                 and cloth are handled automatically without special
                 treatment, and we support fully one-sided
                 discretizations without leaking. Our equations are
                 fully symmetric, allowing for the use of fast solvers,
                 which is a natural result of properly conserving
                 momentum. Finally, for simple explicit time integration
                 of rigid bodies, we show that our equations reduce to
                 form similar to previous work via a single block
                 Gaussian elimination operation, but that this approach
                 scales poorly, i.e. as though four spatial dimensions
                 rather than three.",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "stability; two-way solid/fluid coupling",
}

@Article{Wojtan:2008:FVB,
  author =       "Chris Wojtan and Greg Turk",
  title =        "Fast viscoelastic behavior with thin features",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "47:1--47:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360646",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce a method for efficiently animating a wide
                 range of deformable materials. We combine a high
                 resolution surface mesh with a tetrahedral finite
                 element simulator that makes use of frequent
                 re-meshing. This combination allows for fast and
                 detailed simulations of complex elastic and plastic
                 behavior. We significantly expand the range of physical
                 parameters that can be simulated with a single
                 technique, and the results are free from common
                 artifacts such as volume-loss, smoothing, popping, and
                 the absence of thin features like strands and sheets.
                 Our decision to couple a high resolution surface with
                 low-resolution physics leads to efficient simulation
                 and detailed surface features, and our approach to
                 creating the tetrahedral mesh leads to an
                 order-of-magnitude speedup over previous techniques in
                 the time spent re-meshing. We compute masses,
                 collisions, and surface tension forces on the scale of
                 the fine mesh, which helps avoid visual artifacts due
                 to the differing mesh resolutions. The result is a
                 method that can simulate a large array of different
                 material behaviors with high resolution features in a
                 short amount of time.",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational fluid dynamics; deformable models;
                 explicit surface; finite element method; free-form
                 deformation; viscoelastic behavior",
}

@Article{Hong:2008:BA,
  author =       "Jeong-Mo Hong and Ho-Young Lee and Jong-Chul Yoon and
                 Chang-Hun Kim",
  title =        "Bubbles alive",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "48:1--48:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360647",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose a hybrid method for simulating multiphase
                 fluids such as bubbly water. The appearance of subgrid
                 visual details is improved by incorporating a new
                 bubble model based on smoothed particle hydrodynamics
                 (SPH) into an Eulerian grid-based simulation that
                 handles background flows of large bodies of water and
                 air. To overcome the difficulty in simulating small
                 bubbles in the context of the multiphase flows on a
                 coarse grid, we heuristically model the interphase
                 properties of water and air by means of the
                 interactions between bubble particles. As a result, we
                 can animate lively motion of bubbly water with small
                 scale details efficiently.",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bubbles; fluid simulation; grid-based simulation;
                 multiphase fluids; smoothed particle hydrodynamics",
}

@Article{Lenaerts:2008:PFP,
  author =       "Toon Lenaerts and Bart Adams and Philip Dutr{\'e}",
  title =        "Porous flow in particle-based fluid simulations",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "49:1--49:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360648",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents the simulation of a fluid flowing
                 through a porous deformable material. We introduce the
                 physical principles governing porous flow, expressed by
                 the Law of Darcy, into the Smoothed Particle
                 Hydrodynamics (SPH) framework for simulating fluids and
                 deformable objects. Contrary to previous SPH
                 approaches, we simulate porous flow at a macroscopic
                 scale, making abstraction of individual pores or
                 cavities inside the material. Thus, the number of
                 computational elements is kept low, while at the same
                 time realistic simulations can be achieved. Our
                 algorithm models the changing behavior of the wet
                 material as well as the full two-way coupling between
                 the fluid and the porous material. This enables various
                 new effects, such as the simulation of sponge-like
                 elastic bodies and water-absorbing sticky cloth.",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "absorption; deformables; particle fluids; porous flow;
                 smoothed particle hydrodynamics",
}

@Article{Kim:2008:WTF,
  author =       "Theodore Kim and Nils Th{\"u}rey and Doug James and
                 Markus Gross",
  title =        "Wavelet turbulence for fluid simulation",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "50:1--50:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360649",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel wavelet method for the simulation
                 of fluids at high spatial resolution. The algorithm
                 enables large- and small-scale detail to be edited
                 separately, allowing high-resolution detail to be added
                 as a post-processing step. Instead of solving the
                 Navier--Stokes equations over a highly refined mesh, we
                 use the wavelet decomposition of a low-resolution
                 simulation to determine the location and energy
                 characteristics of missing high-frequency components.
                 We then synthesize these missing components using a
                 novel incompressible turbulence function, and provide a
                 method to maintain the temporal coherence of the
                 resulting structures. There is no linear system to
                 solve, so the method parallelizes trivially and
                 requires only a few auxiliary arrays. The method
                 guarantees that the new frequencies will not interfere
                 with existing frequencies, allowing animators to set up
                 a low resolution simulation quickly and later add
                 details without changing the overall fluid motion.",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "fluids; noise; simulation control; turbulence;
                 wavelets",
}

@Article{Han:2008:MTS,
  author =       "Charles Han and Eric Risser and Ravi Ramamoorthi and
                 Eitan Grinspun",
  title =        "Multiscale texture synthesis",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "51:1--51:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360650",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Example-based texture synthesis algorithms have gained
                 widespread popularity for their ability to take a
                 single input image and create a perceptually similar
                 non-periodic texture. However, previous methods rely on
                 single input exemplars that can capture only a limited
                 band of spatial scales. For example, synthesizing a
                 continent-like appearance at a variety of zoom levels
                 would require an impractically high input resolution.
                 In this paper, we develop a multiscale texture
                 synthesis algorithm. We propose a novel example-based
                 representation, which we call an exemplar graph, that
                 simply requires a few low-resolution input exemplars at
                 different scales. Moreover, by allowing loops in the
                 graph, we can create infinite zooms and infinitely
                 detailed textures that are impossible with current
                 example-based methods. We also introduce a technique
                 that ameliorates inconsistencies in the user's input,
                 and show that the application of this method yields
                 improved interscale coherence and higher visual
                 quality. We demonstrate optimizations for both CPU and
                 GPU implementations of our method, and use them to
                 produce animations with zooming and panning at multiple
                 scales, as well as static gigapixel-sized images with
                 features spanning many spatial scales.",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Wei:2008:ITS,
  author =       "Li-Yi Wei and Jianwei Han and Kun Zhou and Hujun Bao
                 and Baining Guo and Heung-Yeung Shum",
  title =        "Inverse texture synthesis",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "52:1--52:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360651",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The quality and speed of most texture synthesis
                 algorithms depend on a 2D input sample that is small
                 and contains enough texture variations. However, little
                 research exists on how to acquire such sample. For
                 homogeneous patterns this can be achieved via manual
                 cropping, but no adequate solution exists for
                 inhomogeneous or {\em globally varying\/} textures,
                 i.e. patterns that are local but not stationary, such
                 as rusting over an iron statue with appearance
                 conditioned on varying moisture levels.\par

                 We present {\em inverse texture synthesis\/} to address
                 this issue. Our inverse synthesis runs in the opposite
                 direction with respect to traditional forward
                 synthesis: given a large globally varying texture, our
                 algorithm automatically produces a small texture
                 compaction that best summarizes the original. This
                 small compaction can be used to reconstruct the
                 original texture or to re-synthesize new textures under
                 user-supplied controls. More important, our technique
                 allows real-time synthesis of globally varying textures
                 on a GPU, where the texture memory is usually too small
                 for large textures. We propose an optimization
                 framework for inverse texture synthesis, ensuring that
                 each input region is properly encoded in the output
                 compaction. Our optimization process also automatically
                 computes orientation fields for anisotropic textures
                 containing both low- and high-frequency regions, a
                 situation difficult to handle via existing
                 techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "GPU techniques; texture mapping; texture synthesis",
}

@Article{Takayama:2008:LST,
  author =       "Kenshi Takayama and Makoto Okabe and Takashi Ijiri and
                 Takeo Igarashi",
  title =        "Lapped solid textures: filling a model with
                 anisotropic textures",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "53:1--53:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360652",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a method for representing solid objects
                 with spatially-varying oriented textures by repeatedly
                 pasting solid texture exemplars. The underlying concept
                 is to extend the 2D texture patch-pasting approach of
                 lapped textures to 3D solids using a tetrahedral mesh
                 and 3D texture patches. The system places texture
                 patches according to the user-defined volumetric tensor
                 fields over the mesh to represent oriented textures. We
                 have also extended the original technique to handle
                 nonhomogeneous textures for creating solid models whose
                 textural patterns change gradually along the depth
                 fields. We identify several texture types considering
                 the amount of anisotropy and spatial variation and
                 provide a tailored user interface for each. With our
                 simple framework, large-scale realistic solid models
                 can be created easily with little memory and
                 computational cost. We demonstrate the effectiveness of
                 our approach with several examples including trees,
                 fruits, and vegetables.",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "lapped textures; solid texture; tensor field",
}

@Article{Goldberg:2008:AN,
  author =       "Alexander Goldberg and Matthias Zwicker and Fr{\'e}do
                 Durand",
  title =        "Anisotropic noise",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "54:1--54:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360653",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Programmable graphics hardware makes it possible to
                 generate procedural noise textures on the fly for
                 interactive rendering. However, filtering and
                 antialiasing procedural noise involves a tradeoff
                 between aliasing artifacts and loss of detail. In this
                 paper we present a technique, targeted at interactive
                 applications, that provides high-quality anisotropic
                 filtering for noise textures. We generate noise tiles
                 directly in the frequency domain by partitioning the
                 frequency domain into oriented subbands. We then
                 compute weighted sums of the subband textures to
                 accurately approximate noise with a desired spectrum.
                 This allows us to achieve high-quality anisotropic
                 filtering. Our approach is based solely on 2D textures,
                 avoiding the memory overhead of techniques based on 3D
                 noise tiles. We devise a technique to compensate for
                 texture distortions to generate uniform noise on
                 arbitrary meshes. We develop a GPU-based implementation
                 of our technique that achieves similar rendering
                 performance as state-of-the-art algorithms for
                 procedural noise. In addition, it provides anisotropic
                 filtering and achieves superior image quality.",
  acknowledgement = ack-nhfb,
  articleno =    "54",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Liang:2008:PAP,
  author =       "Chia-Kai Liang and Tai-Hsu Lin and Bing-Yi Wong and
                 Chi Liu and Homer H. Chen",
  title =        "Programmable aperture photography: multiplexed light
                 field acquisition",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "55:1--55:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360654",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we present a system including a novel
                 component called programmable aperture and two
                 associated post-processing algorithms for high-quality
                 light field acquisition. The shape of the programmable
                 aperture can be adjusted and used to capture light
                 field at full sensor resolution through multiple
                 exposures without any additional optics and without
                 moving the camera. High acquisition efficiency is
                 achieved by employing an optimal multiplexing scheme,
                 and quality data is obtained by using the two
                 post-processing algorithms designed for self
                 calibration of photometric distortion and for
                 multi-view depth estimation. View-dependent depth maps
                 thus generated help boost the angular resolution of
                 light field. Various post-exposure photographic effects
                 are given to demonstrate the effectiveness of the
                 system and the quality of the captured light field.",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Raskar:2008:GAP,
  author =       "Ramesh Raskar and Amit Agrawal and Cyrus A. Wilson and
                 Ashok Veeraraghavan",
  title =        "Glare aware photography: {$4$D} ray sampling for
                 reducing glare effects of camera lenses",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "56:1--56:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360655",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Glare arises due to multiple scattering of light
                 inside the camera's body and lens optics and reduces
                 image contrast. While previous approaches have analyzed
                 glare in 2D image space, we show that glare is
                 inherently a 4D ray-space phenomenon. By statistically
                 analyzing the ray-space inside a camera, we can
                 classify and remove glare artifacts. In ray-space,
                 glare behaves as high frequency noise and can be
                 reduced by outlier rejection. While such analysis can
                 be performed by capturing the light field inside the
                 camera, it results in the loss of spatial resolution.
                 Unlike light field cameras, we do not need to
                 reversibly encode the spatial structure of the
                 ray-space, leading to simpler designs. We explore masks
                 for uniform and non-uniform ray sampling and show a
                 practical solution to analyze the 4D statistics without
                 significantly compromising image resolution. Although
                 diffuse scattering of the lens introduces 4D
                 low-frequency glare, we can produce useful solutions in
                 a variety of common scenarios. Our approach handles
                 photography looking into the sun and photos taken
                 without a hood, removes the effect of lens smudges and
                 reduces loss of contrast due to camera body
                 reflections. We show various applications in contrast
                 enhancement and glare manipulation.",
  acknowledgement = ack-nhfb,
  articleno =    "56",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational photography; flare; glare; light fields;
                 masks",
}

@Article{Cossairt:2008:LFT,
  author =       "Oliver Cossairt and Shree Nayar and Ravi Ramamoorthi",
  title =        "Light field transfer: global illumination between real
                 and synthetic objects",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "57:1--57:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360656",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel image-based method for compositing
                 real and synthetic objects in the same scene with a
                 high degree of visual realism. Ours is the first
                 technique to allow global illumination and near-field
                 lighting effects between both real and synthetic
                 objects at interactive rates, without needing a
                 geometric and material model of the real scene. We
                 achieve this by using a light field interface between
                 real and synthetic components---thus, indirect
                 illumination can be simulated using only two 4D light
                 fields, one captured from and one projected onto the
                 real scene. Multiple bounces of interreflections are
                 obtained simply by iterating this approach. The
                 interactivity of our technique enables its use with
                 time-varying scenes, including dynamic objects. This is
                 in sharp contrast to the alternative approach of using
                 6D or 8D light transport functions of real objects,
                 which are very expensive in terms of acquisition and
                 storage and hence not suitable for real-time
                 applications. In our method, 4D radiance fields are
                 simultaneously captured and projected by using a lens
                 array, video camera, and digital projector. The method
                 supports full global illumination with restricted
                 object placement, and accommodates moderately specular
                 materials. We implement a complete system and show
                 several example scene compositions that demonstrate
                 global illumination effects between dynamic real and
                 synthetic objects. Our implementation requires a single
                 point light source and dark background.",
  acknowledgement = ack-nhfb,
  articleno =    "57",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "augmented reality; global illumination; image-based
                 relighting; light field",
}

@Article{Fuchs:2008:TPR,
  author =       "Martin Fuchs and Ramesh Raskar and Hans-Peter Seidel
                 and Hendrik P. A. Lensch",
  title =        "Towards passive 6{D} reflectance field displays",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "58:1--58:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360657",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Traditional flat screen displays present 2D images. 3D
                 and 4D displays have been proposed making use of
                 lenslet arrays to shape a fixed outgoing light field
                 for horizontal or bidirectional parallax. In this
                 article, we present different designs of
                 multi-dimensional displays which passively react to the
                 light of the environment behind. The prototypes
                 physically implement a reflectance field and generate
                 different light fields depending on the incident
                 illumination, for example light falling through a
                 window. We discretize the incident light field using an
                 optical system, and modulate it with a 2D pattern,
                 creating a flat display which is view {\em and\/}
                 illumination-dependent. It is free from electronic
                 components. For distant light and a fixed observer
                 position, we demonstrate a passive optical
                 configuration which directly renders a 4D reflectance
                 field in the real-world illumination behind it. We
                 further propose an optical setup that allows for
                 projecting out different angular distributions
                 depending on the incident light direction. Combining
                 multiple of these devices we build a display that
                 renders a 6D experience, where the incident 2D
                 illumination influences the outgoing light field, both
                 in the spatial and in the angular domain. Possible
                 applications of this technology are time-dependent
                 displays driven by sunlight, object virtualization and
                 programmable light benders / ray blockers without
                 moving parts.",
  acknowledgement = ack-nhfb,
  articleno =    "58",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "image-based relighting with natural light; passive
                 reflectance field display",
}

@Article{Glencross:2008:PVM,
  author =       "Mashhuda Glencross and Gregory J. Ward and Francho
                 Melendez and Caroline Jay and Jun Liu and Roger
                 Hubbold",
  title =        "A perceptually validated model for surface depth
                 hallucination",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "59:1--59:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360658",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Capturing detailed surface geometry currently requires
                 specialized equipment such as laser range scanners,
                 which despite their high accuracy, leave gaps in the
                 surfaces that must be reconciled with photographic
                 capture for relighting applications. Using only a
                 standard digital camera and a single view, we present a
                 method for recovering models of predominantly diffuse
                 textured surfaces that can be plausibly relit and
                 viewed from any angle under any illumination. Our
                 multiscale shape-from-shading technique uses
                 diffuse-lit/flash-lit image pairs to produce an albedo
                 map and textured height field. Using two lighting
                 conditions enables us to subtract one from the other to
                 estimate albedo. In the absence of a flash-lit image of
                 a surface for which we already have a similar exemplar
                 pair, we approximate both albedo and diffuse shading
                 images using histogram matching. Our depth estimation
                 is based on local visibility. Unlike other
                 depth-from-shading approaches, all operations are
                 performed on the diffuse shading image in image space,
                 and we impose no constant albedo restrictions. An
                 experimental validation shows our method works for a
                 broad range of textured surfaces, and viewers are
                 frequently unable to identify our results as synthetic
                 in a randomized presentation. Furthermore, in
                 side-by-side comparisons, subjects found a rendering of
                 our depth map equally plausible to one generated from a
                 laser range scan. We see this method as a significant
                 advance in acquiring surface detail for texturing using
                 a standard digital camera, with applications in
                 architecture, archaeological reconstruction, games and
                 special effects.",
  acknowledgement = ack-nhfb,
  articleno =    "59",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "albedo estimation; computational photography;
                 perception; relighting; shape-from-shading; textured
                 surfaces",
}

@Article{Ramanarayanan:2008:PCA,
  author =       "Ganesh Ramanarayanan and Kavita Bala and James A.
                 Ferwerda",
  title =        "Perception of complex aggregates",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "60:1--60:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360659",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Aggregates of individual objects, such as forests,
                 crowds, and piles of fruit, are a common source of
                 complexity in computer graphics scenes. When viewing an
                 aggregate, observers attend less to individual objects
                 and focus more on overall properties such as
                 numerosity, variety, and arrangement. Paradoxically,
                 rendering and modeling costs increase with aggregate
                 complexity, exactly when observers are attending less
                 to individual objects.\par

                 In this paper we take some first steps to characterize
                 the limits of visual coding of aggregates to
                 efficiently represent their appearance in scenes. We
                 describe psychophysical experiments that explore the
                 roles played by the geometric and material properties
                 of individual objects in observers' abilities to
                 discriminate different aggregate collections. Based on
                 these experiments we derive metrics to predict when two
                 aggregates have the same appearance, even when composed
                 of different objects. In a follow-up experiment we
                 confirm that these metrics can be used to predict the
                 appearance of a range of realistic aggregates. Finally,
                 as a proof-of-concept we show how these new aggregate
                 perception metrics can be applied to simplify scenes by
                 allowing substitution of geometrically simpler
                 aggregates for more complex ones without changing
                 appearance.",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "aggregates; complexity; perceptually-based modeling",
}

@Article{Chong:2008:PBC,
  author =       "Hamilton Y. Chong and Steven J. Gortler and Todd
                 Zickler",
  title =        "A perception-based color space for
                 illumination-invariant image processing",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "61:1--61:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360660",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Motivated by perceptual principles, we derive a new
                 color space in which the associated metric approximates
                 perceived distances and color displacements capture
                 relationships that are robust to spectral changes in
                 illumination. The resulting color space can be used
                 with existing image processing algorithms with little
                 or no change to the methods.",
  acknowledgement = ack-nhfb,
  articleno =    "61",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "color space; image processing; perception",
}

@Article{Chi:2008:SAI,
  author =       "Ming-Te Chi and Tong-Yee Lee and Yingge Qu and
                 Tien-Tsin Wong",
  title =        "Self-animating images: illusory motion using repeated
                 asymmetric patterns",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "62:1--62:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360661",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Illusory motion in a still image is a fascinating
                 research topic in the study of human motion perception.
                 Physiologists and psychologists have attempted to
                 understand this phenomenon by constructing simple,
                 color repeated asymmetric patterns (RAP) and have found
                 several useful rules to enhance the strength of
                 illusory motion. Based on their knowledge, we propose a
                 computational method to generate self-animating images.
                 First, we present an optimized RAP placement on
                 streamlines to generate illusory motion for a given
                 static vector field. Next, a general coloring scheme
                 for RAP is proposed to render streamlines. Furthermore,
                 to enhance the strength of illusion and respect the
                 shape of the region, a smooth vector field with
                 opposite directional flow is automatically generated
                 given an input image. Examples generated by our method
                 are shown as evidence of the illusory effect and the
                 potential applications for entertainment and design
                 purposes.",
  acknowledgement = ack-nhfb,
  articleno =    "62",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "illusory motion; repeated asymmetric pattern (RAP)",
}

@Article{Bergou:2008:DER,
  author =       "Mikl{\'o}s Bergou and Max Wardetzky and Stephen
                 Robinson and Basile Audoly and Eitan Grinspun",
  title =        "Discrete elastic rods",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "63:1--63:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360662",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a discrete treatment of adapted framed
                 curves, parallel transport, and holonomy, thus
                 establishing the language for a discrete geometric
                 model of thin flexible rods with arbitrary cross
                 section and undeformed configuration. Our approach
                 differs from existing simulation techniques in the
                 graphics and mechanics literature both in the kinematic
                 description---we represent the material frame by its
                 angular deviation from the natural Bishop frame---as
                 well as in the dynamical treatment---we treat the
                 centerline as dynamic and the material frame as
                 quasistatic. Additionally, we describe a manifold
                 projection method for coupling rods to rigid-bodies and
                 simultaneously enforcing rod inextensibility. The use
                 of quasistatics and constraints provides an efficient
                 treatment for stiff twisting and stretching modes; at
                 the same time, we retain the dynamic bending of the
                 centerline and accurately reproduce the coupling
                 between bending and twisting modes. We validate the
                 discrete rod model via quantitative buckling,
                 stability, and coupled-mode experiments, and via
                 qualitative knot-tying comparisons.",
  acknowledgement = ack-nhfb,
  articleno =    "63",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "discrete differential geometry; discrete holonomy;
                 rods; strands",
}

@Article{Selle:2008:MSM,
  author =       "Andrew Selle and Michael Lentine and Ronald Fedkiw",
  title =        "A mass spring model for hair simulation",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "64:1--64:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360663",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Our goal is to simulate the full hair geometry,
                 consisting of approximately one hundred thousand hairs
                 on a typical human head. This will require scalable
                 methods that can simulate every hair as opposed to only
                 a few guide hairs. Novel to this approach is that the
                 individual hair/hair interactions can be modeled with
                 physical parameters (friction, static attraction, etc.)
                 at the scale of a single hair as opposed to clumped or
                 continuum interactions. In this vein, we first propose
                 a new altitude spring model for preventing collapse in
                 the simulation of volumetric tetrahedra, and we show
                 that it is also applicable both to bending in cloth and
                 torsion in hair. We demonstrate that this new torsion
                 model for hair behaves in a fashion similar to more
                 sophisticated models with significantly reduced
                 computational cost. For added efficiency, we introduce
                 a semi-implicit discretization of standard springs that
                 makes them truly linear in multiple spatial dimensions
                 and thus unconditionally stable without requiring
                 Newton--Raphson iteration. We also simulate complex
                 hair/hair interactions including sticking and clumping
                 behavior, collisions with objects (e.g. head and
                 shoulders) and self-collisions. Notably, in line with
                 our goal to simulate the full head of hair, we do not
                 generate any new hairs at render time.",
  acknowledgement = ack-nhfb,
  articleno =    "64",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "hair simulation; mass-spring models",
}

@Article{Kaldor:2008:SKC,
  author =       "Jonathan M. Kaldor and Doug L. James and Steve
                 Marschner",
  title =        "Simulating knitted cloth at the yarn level",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "65:1--65:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360664",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Knitted fabric is widely used in clothing because of
                 its unique and stretchy behavior, which is
                 fundamentally different from the behavior of woven
                 cloth. The properties of knits come from the nonlinear,
                 three-dimensional kinematics of long, inter-looping
                 yarns, and despite significant advances in cloth
                 animation we still do not know how to simulate knitted
                 fabric faithfully. Existing cloth simulators mainly
                 adopt elastic-sheet mechanical models inspired by woven
                 materials, focusing less on the model itself than on
                 important simulation challenges such as efficiency,
                 stability, and robustness. We define a new
                 computational model for knits in terms of the motion of
                 yarns, rather than the motion of a sheet. Each yarn is
                 modeled as an inextensible, yet otherwise flexible,
                 B-spline tube. To simulate complex knitted garments, we
                 propose an implicit-explicit integrator, with yarn
                 inextensibility constraints imposed using efficient
                 projections. Friction among yarns is approximated using
                 rigid-body velocity filters, and key yarn-yarn
                 interactions are mediated by stiff penalty forces. Our
                 results show that this simple model predicts the key
                 mechanical properties of different knits, as
                 demonstrated by qualitative comparisons to observed
                 deformations of actual samples in the laboratory, and
                 that the simulator can scale up to substantial
                 animations with complex dynamic motion.",
  acknowledgement = ack-nhfb,
  articleno =    "65",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cloth; constraints; knits; knitwear; simulation;
                 yarn",
}

@Article{English:2008:ADS,
  author =       "Elliot English and Robert Bridson",
  title =        "Animating developable surfaces using nonconforming
                 elements",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "66:1--66:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360665",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new discretization for the physics-based
                 animation of developable surfaces. Constrained to not
                 deform at all in-plane but free to bend out-of-plane,
                 these are an excellent approximation for many
                 materials, including most cloth, paper, and stiffer
                 materials. Unfortunately the conforming (geometrically
                 continuous) discretizations used in graphics break down
                 in this limit. Our nonconforming approach solves this
                 problem, allowing us to simulate surfaces with zero
                 in-plane deformation as a hard constraint. However, it
                 produces discontinuous meshes, so we further couple
                 this with a `ghost' conforming mesh for collision
                 processing and rendering. We also propose a new second
                 order accurate constrained mechanics time integration
                 method that greatly reduces the numerical damping
                 present in the usual first order methods used in
                 graphics, for virtually no extra cost and sometimes
                 significant speed-up.",
  acknowledgement = ack-nhfb,
  articleno =    "66",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cloth; constraints; developable surface; finite
                 elements",
}

@Article{Farbman:2008:EPD,
  author =       "Zeev Farbman and Raanan Fattal and Dani Lischinski and
                 Richard Szeliski",
  title =        "Edge-preserving decompositions for multi-scale tone
                 and detail manipulation",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "67:1--67:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360666",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Many recent computational photography techniques
                 decompose an image into a piecewise smooth base layer,
                 containing large scale variations in intensity, and a
                 residual detail layer capturing the smaller scale
                 details in the image. In many of these applications, it
                 is important to control the spatial scale of the
                 extracted details, and it is often desirable to
                 manipulate details at multiple scales, while avoiding
                 visual artifacts.\par

                 In this paper we introduce a new way to construct
                 edge-preserving multi-scale image decompositions. We
                 show that current basedetail decomposition techniques,
                 based on the bilateral filter, are limited in their
                 ability to extract detail at arbitrary scales. Instead,
                 we advocate the use of an alternative edge-preserving
                 smoothing operator, based on the weighted least squares
                 optimization framework, which is particularly well
                 suited for progressive coarsening of images and for
                 multi-scale detail extraction. After describing this
                 operator, we show how to use it to construct
                 edge-preserving multi-scale decompositions, and compare
                 it to the bilateral filter, as well as to other
                 schemes. Finally, we demonstrate the effectiveness of
                 our edge-preserving decompositions in the context of
                 LDR and HDR tone mapping, detail enhancement, and other
                 applications.",
  acknowledgement = ack-nhfb,
  articleno =    "67",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bilateral filter; detail enhancement; digital
                 darkroom; edge-preserving smoothing; high dynamic
                 range; image abstraction; multi-scale image
                 decomposition; tone mapping",
}

@Article{Mantiuk:2008:DAT,
  author =       "Rafa{\l} Mantiuk and Scott Daly and Louis Kerofsky",
  title =        "Display adaptive tone mapping",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "68:1--68:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360667",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose a tone mapping operator that can minimize
                 visible contrast distortions for a range of output
                 devices, ranging from e-paper to HDR displays. The
                 operator weights contrast distortions according to
                 their visibility predicted by the model of the human
                 visual system. The distortions are minimized given a
                 display model that enforces constraints on the
                 solution. We show that the problem can be solved very
                 efficiently by employing higher order image statistics
                 and quadratic programming. Our tone mapping technique
                 can adjust image or video content for optimum contrast
                 visibility taking into account ambient illumination and
                 display characteristics. We discuss the differences
                 between our method and previous approaches to the tone
                 mapping problem.",
  acknowledgement = ack-nhfb,
  articleno =    "68",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "display-adaptive; high dynamic range; image
                 reproduction; optimization; tone mapping; viewing
                 conditions; visual perception",
}

@Article{Aydin:2008:DRI,
  author =       "Tun{\c{c}} Ozan Aydin and Rafa{\l} Mantiuk and Karol
                 Myszkowski and Hans-Peter Seidel",
  title =        "Dynamic range independent image quality assessment",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "69:1--69:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360668",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The diversity of display technologies and introduction
                 of high dynamic range imagery introduces the necessity
                 of comparing images of radically different dynamic
                 ranges. Current quality assessment metrics are not
                 suitable for this task, as they assume that both
                 reference and test images have the same dynamic range.
                 Image fidelity measures employed by a majority of
                 current metrics, based on the difference of pixel
                 intensity or contrast values between test and reference
                 images, result in meaningless predictions if this
                 assumption does not hold. We present a novel image
                 quality metric capable of operating on an image pair
                 where both images have arbitrary dynamic ranges. Our
                 metric utilizes a model of the human visual system, and
                 its central idea is a new definition of visible
                 distortion based on the detection and classification of
                 visible changes in the image structure. Our metric is
                 carefully calibrated and its performance is validated
                 through perceptual experiments. We demonstrate possible
                 applications of our metric to the evaluation of direct
                 and inverse tone mapping operators as well as the
                 analysis of the image appearance on displays with
                 various characteristics.",
  acknowledgement = ack-nhfb,
  articleno =    "69",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "high dynamic range images; image quality metrics; tone
                 reproduction; visual perception",
}

@Article{Hsu:2008:LME,
  author =       "Eugene Hsu and Tom Mertens and Sylvain Paris and Shai
                 Avidan and Fr{\'e}do Durand",
  title =        "Light mixture estimation for spatially varying white
                 balance",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "70:1--70:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360669",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "White balance is a crucial step in the photographic
                 pipeline. It ensures the proper rendition of images by
                 eliminating color casts due to differing illuminants.
                 Digital cameras and editing programs provide white
                 balance tools that assume a single type of light per
                 image, such as daylight. However, many photos are taken
                 under mixed lighting. We propose a white balance
                 technique for scenes with two light types that are
                 specified by the user. This covers many typical
                 situations involving indoor/outdoor or flash/ambient
                 light mixtures. Since we work from a single image, the
                 problem is highly underconstrained. Our method recovers
                 a set of dominant material colors which allows us to
                 estimate the local intensity mixture of the two light
                 types. Using this mixture, we can neutralize the light
                 colors and render visually pleasing images. Our method
                 can also be used to achieve post-exposure relighting
                 effects.",
  acknowledgement = ack-nhfb,
  articleno =    "70",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "color constancy; computational photography; image
                 processing; white balance",
}

@Article{Levin:2008:MIP,
  author =       "Anat Levin and Peter Sand and Taeg Sang Cho and
                 Fr{\'e}do Durand and William T. Freeman",
  title =        "Motion-invariant photography",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "71:1--71:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360670",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Object motion during camera exposure often leads to
                 noticeable blurring artifacts. Proper elimination of
                 this blur is challenging because the blur kernel is
                 unknown, varies over the image as a function of object
                 velocity, and destroys high frequencies. In the case of
                 motions along a 1D direction (e.g. horizontal) we show
                 that these challenges can be addressed using a camera
                 that moves during the exposure. Through the analysis of
                 motion blur as space-time integration, we show that a
                 parabolic integration (corresponding to constant sensor
                 acceleration) leads to motion blur that is invariant to
                 object velocity. Thus, a single deconvolution kernel
                 can be used to remove blur and create sharp images of
                 scenes with objects moving at different speeds, without
                 requiring any segmentation and without knowledge of the
                 object speeds. Apart from motion invariance, we prove
                 that the derived parabolic motion preserves image
                 frequency content nearly optimally. That is, while
                 static objects are degraded relative to their image
                 from a static camera, a reliable reconstruction of all
                 moving objects within a given velocities range is made
                 possible. We have built a prototype camera and present
                 successful deblurring results over a wide variety of
                 human motions.",
  acknowledgement = ack-nhfb,
  articleno =    "71",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "coded imaging; computational photography; motion
                 deblurring; space-time",
}

@Article{Fattal:2008:SID,
  author =       "Raanan Fattal",
  title =        "Single image dehazing",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "72:1--72:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360671",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper we present a new method for estimating
                 the optical transmission in hazy scenes given a single
                 input image. Based on this estimation, the scattered
                 light is eliminated to increase scene visibility and
                 recover haze-free scene contrasts. In this new approach
                 we formulate a refined image formation model that
                 accounts for surface shading in addition to the
                 transmission function. This allows us to resolve
                 ambiguities in the data by searching for a solution in
                 which the resulting shading and transmission functions
                 are locally statistically uncorrelated. A similar
                 principle is used to estimate the color of the haze.
                 Results demonstrate the new method abilities to remove
                 the haze layer as well as provide a reliable
                 transmission estimate which can be used for additional
                 applications such as image refocusing and novel view
                 synthesis.",
  acknowledgement = ack-nhfb,
  articleno =    "72",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational photography; image dehazing/defogging;
                 image enhancement; image restoration; Markov random
                 field image modeling",
}

@Article{Shan:2008:HQM,
  author =       "Qi Shan and Jiaya Jia and Aseem Agarwala",
  title =        "High-quality motion deblurring from a single image",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "73:1--73:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360672",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new algorithm for removing motion blur
                 from a single image. Our method computes a deblurred
                 image using a unified probabilistic model of {\em
                 both\/} blur kernel estimation and unblurred image
                 restoration. We present an analysis of the causes of
                 common artifacts found in current deblurring methods,
                 and then introduce several novel terms within this
                 probabilistic model that are inspired by our analysis.
                 These terms include a model of the spatial randomness
                 of noise in the blurred image, as well a new local
                 smoothness prior that reduces ringing artifacts by
                 constraining contrast in the unblurred image wherever
                 the blurred image exhibits low contrast. Finally, we
                 describe an efficient optimization scheme that
                 alternates between blur kernel estimation and unblurred
                 image restoration until convergence. As a result of
                 these steps, we are able to produce high quality
                 deblurred results in low computation time. We are even
                 able to produce results of comparable quality to
                 techniques that require additional input images beyond
                 a single blurry photograph, and to methods that require
                 additional hardware.",
  acknowledgement = ack-nhfb,
  articleno =    "73",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "filtering; image enhancement; motion deblurring;
                 ringing artifacts",
}

@Article{Yuan:2008:PIS,
  author =       "Lu Yuan and Jian Sun and Long Quan and Heung-Yeung
                 Shum",
  title =        "Progressive inter-scale and intra-scale non-blind
                 image deconvolution",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "74:1--74:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360673",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Ringing is the most disturbing artifact in the image
                 deconvolution. In this paper, we present a progressive
                 inter-scale and intra-scale non-blind image
                 deconvolution approach that significantly reduces
                 ringing. Our approach is built on a novel
                 edge-preserving deconvolution algorithm called {\em
                 bilateral Richardson-Lucy (BRL)\/} which uses a large
                 spatial support to handle large blur. We progressively
                 recover the image from a coarse scale to a fine scale
                 (inter-scale), and progressively restore image details
                 within every scale (intra-scale). To perform the
                 inter-scale deconvolution, we propose a {\em joint
                 bilateral Richardson-Lucy (JBRL)\/} algorithm so that
                 the recovered image in one scale can guide the
                 deconvolution in the next scale. In each scale, we
                 propose an iterative residual deconvolution to
                 progressively recover image details. The experimental
                 results show that our progressive deconvolution can
                 produce images with very little ringing for large blur
                 kernels.",
  acknowledgement = ack-nhfb,
  articleno =    "74",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kilian:2008:CF,
  author =       "Martin Kilian and Simon Fl{\"o}ry and Zhonggui Chen
                 and Niloy J. Mitra and Alla Sheffer and Helmut
                 Pottmann",
  title =        "Curved folding",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "75:1--75:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360674",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Fascinating and elegant shapes may be folded from a
                 single planar sheet of material without stretching,
                 tearing or cutting, if one incorporates curved folds
                 into the design. We present an optimization-based
                 computational framework for design and digital
                 reconstruction of surfaces which can be produced by
                 curved folding. Our work not only contributes to
                 applications in architecture and industrial design, but
                 it also provides a new way to study the complex and
                 largely unexplored phenomena arising in curved
                 folding.",
  acknowledgement = ack-nhfb,
  articleno =    "75",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "architectural geometry; computational differential
                 geometry; computational origami; curved fold;
                 developable surface; digital reconstruction; folding;
                 industrial design; isometry",
}

@Article{Pottmann:2008:FSS,
  author =       "Helmut Pottmann and Alexander Schiftner and Pengbo Bo
                 and Heinz Schmiedhofer and Wenping Wang and Niccolo
                 Baldassini and Johannes Wallner",
  title =        "Freeform surfaces from single curved panels",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "76:1--76:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360675",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Motivated by applications in architecture and
                 manufacturing, we discuss the problem of covering a
                 freeform surface by single curved panels. This leads to
                 the new concept of semi-discrete surface
                 representation, which constitutes a link between smooth
                 and discrete surfaces. The basic entity we are working
                 with is the developable strip model. It is the
                 semi-discrete equivalent of a quad mesh with planar
                 faces, or a conjugate parametrization of a smooth
                 surface. We present a B-spline based optimization
                 framework for efficient computing with D-strip models.
                 In particular we study conical and circular models,
                 which semi-discretize the network of principal
                 curvature lines, and which enjoy elegant geometric
                 properties. Together with geodesic models and
                 cylindrical models they offer a rich source of
                 solutions for surface panelization problems.",
  acknowledgement = ack-nhfb,
  articleno =    "76",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "architectural geometry; circular strip model; conical
                 strip model; developable strip model; developable
                 surface; discrete differential geometry; focal surface;
                 freeform surface; geodesic strip model; panelization;
                 principal strip model; semi-discrete surface",
}

@Article{Springborn:2008:CET,
  author =       "Boris Springborn and Peter Schr{\"o}der and Ulrich
                 Pinkall",
  title =        "Conformal equivalence of triangle meshes",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "77:1--77:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360676",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new algorithm for conformal mesh
                 parameterization. It is based on a precise notion of
                 {\em discrete conformal equivalence\/} for triangle
                 meshes which mimics the notion of conformal equivalence
                 for smooth surfaces. The problem of finding a flat mesh
                 that is discretely conformally equivalent to a given
                 mesh can be solved efficiently by minimizing a convex
                 energy function, whose Hessian turns out to be the well
                 known cot-Laplace operator. This method can also be
                 used to map a surface mesh to a parameter domain which
                 is flat except for isolated cone singularities, and we
                 show how these can be placed automatically in order to
                 reduce the distortion of the parameterization. We
                 present the salient features of the theory and
                 elaborate the algorithms with a number of examples.",
  acknowledgement = ack-nhfb,
  articleno =    "77",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cone singularities; conformal equivalence; conformal
                 parameterization; discrete differential geometry;
                 discrete Riemannian metric; texture mapping",
}

@Article{Lipman:2008:GC,
  author =       "Yaron Lipman and David Levin and Daniel Cohen-Or",
  title =        "Green {Coordinates}",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "78:1--78:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360677",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce Green Coordinates for closed polyhedral
                 cages. The coordinates are motivated by Green's third
                 integral identity and respect both the vertices
                 position and faces orientation of the cage. We show
                 that Green Coordinates lead to space deformations with
                 a shape-preserving property. In particular, in 2D they
                 induce conformal mappings, and extend naturally to
                 quasi-conformal mappings in 3D. In both cases we derive
                 closed-form expressions for the coordinates, yielding a
                 simple and fast algorithm for cage-based space
                 deformation. We compare the performance of Green
                 Coordinates with those of Mean Value Coordinates and
                 Harmonic Coordinates and show that the advantage of the
                 shape-preserving property is not achieved at the
                 expense of speed or simplicity. We also show that the
                 new coordinates extend the mapping in a natural
                 analytic manner to the exterior of the cage, allowing
                 the employment of partial cages.",
  acknowledgement = ack-nhfb,
  articleno =    "78",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sederberg:2008:WTN,
  author =       "Thomas W. Sederberg and G. Thomas Finnigan and Xin Li
                 and Hongwei Lin and Heather Ipson",
  title =        "Watertight trimmed {NURBS}",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "79:1--79:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360678",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper addresses the long-standing problem of the
                 unavoidable gaps that arise when expressing the
                 intersection of two NURBS surfaces using conventional
                 trimmed-NURBS representation. The solution converts
                 each trimmed NURBS into an untrimmed T-Spline, and then
                 merges the untrimmed T-Splines into a single,
                 watertight model. The solution enables watertight
                 fillets of NURBS models, as well as arbitrary feature
                 curves that do not have to follow iso-parameter curves.
                 The resulting T-Spline representation can be exported
                 without error as a collection of NURBS surfaces.",
  acknowledgement = ack-nhfb,
  articleno =    "79",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Booleans; NURBS; surface intersection; T-splines",
}

@Article{Kwon:2008:GME,
  author =       "Taesoo Kwon and Kang Hoon Lee and Jehee Lee and Shigeo
                 Takahashi",
  title =        "Group motion editing",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "80:1--80:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360679",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Animating a crowd of characters is an important
                 problem in computer graphics. The latest techniques
                 enable highly realistic group motions to be produced in
                 feature animation films and video games. However,
                 interactive methods have not emerged yet for editing
                 the existing group motion of multiple characters. We
                 present an approach to editing group motion as a whole
                 while maintaining its neighborhood formation and
                 individual moving trajectories in the original
                 animation as much as possible. The user can deform a
                 group motion by pinning or dragging individuals.
                 Multiple group motions can be stitched or merged to
                 form a longer or larger group motion while avoiding
                 collisions. These editing operations rely on a novel
                 graph structure, in which vertices represent positions
                 of individuals at specific frames and edges encode
                 neighborhood formations and moving trajectories. We
                 employ a shape-manipulation technique to minimize the
                 distortion of relative arrangements among adjacent
                 vertices while editing the graph structure. The
                 usefulness and flexibility of our approach is
                 demonstrated through examples in which the user creates
                 and edits complex crowd animations interactively using
                 a collection of group motion clips.",
  acknowledgement = ack-nhfb,
  articleno =    "80",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "character animation; crowd simulation; group motion
                 editing; human motion",
}

@Article{Yin:2008:CMA,
  author =       "KangKang Yin and Stelian Coros and Philippe Beaudoin
                 and Michiel van de Panne",
  title =        "Continuation methods for adapting simulated skills",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "81:1--81:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360680",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Modeling the large space of possible human motions
                 requires scalable techniques. Generalizing from example
                 motions or example controllers is one way to provide
                 the required scalability. We present techniques for
                 generalizing a controller for physics-based walking to
                 significantly different tasks, such as climbing a large
                 step up, or pushing a heavy object. Continuation
                 methods solve such problems using a progressive
                 sequence of problems that trace a path from an existing
                 solved problem to the final desired-but-unsolved
                 problem. Each step in the continuation sequence makes
                 progress towards the target problem while further
                 adapting the solution. We describe and evaluate a
                 number of choices in applying continuation methods to
                 adapting walking gaits for tasks involving interaction
                 with the environment. The methods have been
                 successfully applied to automatically adapt a regular
                 cyclic walk to climbing a 65 {\em cm\/} step, stepping
                 over a 55 {\em cm\/} sill, pushing heavy furniture,
                 walking up steep inclines, and walking on ice. The
                 continuation path further provides parameterized
                 solutions to these problems.",
  acknowledgement = ack-nhfb,
  articleno =    "81",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{daSilva:2008:ISS,
  author =       "Marco da Silva and Yeuhi Abe and Jovan Popovi{\'c}",
  title =        "Interactive simulation of stylized human locomotion",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "82:1--82:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360681",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Animating natural human motion in dynamic environments
                 is difficult because of complex geometric and physical
                 interactions. Simulation provides an automatic solution
                 to parts of this problem, but it needs control systems
                 to produce lifelike motions. This paper describes the
                 systematic computation of controllers that can
                 reproduce a range of locomotion styles in interactive
                 simulations. Given a reference motion that describes
                 the desired style, a derived control system can
                 reproduce that style in simulation and in new
                 environments. Because it produces high-quality motions
                 that are both geometrically and physically consistent
                 with simulated surroundings, interactive animation
                 systems could begin to use this approach along with
                 more established kinematic methods.",
  acknowledgement = ack-nhfb,
  articleno =    "82",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Sueda:2008:MSH,
  author =       "Shinjiro Sueda and Andrew Kaufman and Dinesh K. Pai",
  title =        "Musculotendon simulation for hand animation",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "83:1--83:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360682",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We describe an automatic technique for generating the
                 motion of tendons and muscles under the skin of a
                 traditionally animated character. This is achieved by
                 integrating the traditional animation pipeline with a
                 novel biomechanical simulator capable of dynamic
                 simulation with complex routing constraints on muscles
                 and tendons. We also describe an algorithm for
                 computing the activation levels of muscles required to
                 track the input animation. We demonstrate the results
                 with several animations of the human hand.",
  acknowledgement = ack-nhfb,
  articleno =    "83",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "character animation; musculoskeletal simulation;
                 secondary motion",
}

@Article{Brown:2008:SHV,
  author =       "Benedict J. Brown and Corey Toler-Franklin and Diego
                 Nehab and Michael Burns and David Dobkin and Andreas
                 Vlachopoulos and Christos Doumas and Szymon
                 Rusinkiewicz and Tim Weyrich",
  title =        "A system for high-volume acquisition and matching of
                 fresco fragments: reassembling {Theran} wall
                 paintings",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "84:1--84:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360683",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Although mature technologies exist for acquiring
                 images, geometry, and normals of small objects, they
                 remain cumbersome and time-consuming for non-experts to
                 employ on a large scale. In an archaeological setting,
                 a practical acquisition system for routine use on {\em
                 every\/} artifact and fragment would open new
                 possibilities for archiving, analysis, and
                 dissemination. We present an inexpensive system for
                 acquiring all three types of information, and
                 associated metadata, for small objects such as
                 fragments of wall paintings. The acquisition system
                 requires minimal supervision, so that a single,
                 non-expert user can scan at least 10 fragments per
                 hour. To achieve this performance, we introduce new
                 algorithms to robustly and automatically align range
                 scans, register 2-D scans to 3-D geometry, and compute
                 normals from 2-D scans. As an illustrative application,
                 we present a novel 3-D matching algorithm that
                 efficiently searches for matching fragments using the
                 scanned geometry.",
  acknowledgement = ack-nhfb,
  articleno =    "84",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Aiger:2008:PCS,
  author =       "Dror Aiger and Niloy J. Mitra and Daniel Cohen-Or",
  title =        "4-points congruent sets for robust pairwise surface
                 registration",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "85:1--85:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360684",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce 4PCS, a fast and robust alignment scheme
                 for 3D point sets that uses wide bases, which are known
                 to be resilient to noise and outliers. The algorithm
                 allows registering raw noisy data, possibly
                 contaminated with outliers, without pre-filtering or
                 denoising the data. Further, the method significantly
                 reduces the number of trials required to establish a
                 reliable registration between the underlying surfaces
                 in the presence of noise, without any assumptions about
                 starting alignment. Our method is based on a novel
                 technique to extract all coplanar 4-points sets from a
                 3D point set that are approximately congruent, under
                 rigid transformation, to a given set of coplanar
                 4-points. This extraction procedure runs in roughly
                 {\em O(n$^2$ + k)\/} time, where $n$ is the number of
                 candidate points and {\em k\/} is the number of
                 reported 4-points sets. In practice, when noise level
                 is low and there is sufficient overlap, using local
                 descriptors the time complexity reduces to {\em O(n +
                 k)}. We also propose an extension to handle similarity
                 and affine transforms. Our technique achieves an order
                 of magnitude asymptotic acceleration compared to common
                 randomized alignment techniques. We demonstrate the
                 robustness of our algorithm on several sets of multiple
                 range scans with varying degree of noise, outliers, and
                 extent of overlap.",
  acknowledgement = ack-nhfb,
  articleno =    "85",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "affine invariant ratio; computational geometry;
                 largest common pointset (LCP) measure; pairwise surface
                 registration; partial shape matching; scan alignment",
}

@Article{Thormahlen:2008:MOI,
  author =       "Thorsten Thorm{\"a}hlen and Hans-Peter Seidel",
  title =        "{$3$D}-modeling by ortho-image generation from image
                 sequences",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "86:1--86:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360685",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "A semi-automatic approach is presented that enables
                 the generation of a high-quality 3D model of a static
                 object from an image sequence that was taken by a
                 moving, uncalibrated consumer camera. A bounding box is
                 placed around the object, and orthographic projections
                 onto the sides of the bounding box are automatically
                 generated out of the image sequence. These ortho-images
                 can be imported as background maps in the orthographic
                 views (e.g., the top, side, and front view) of any
                 modeling package. Modelers can now use these
                 ortho-images to guide their modeling by tracing the
                 shape of the object over the ortho-images. This greatly
                 improves the accuracy and efficiency of the manual
                 modeling process. An additional advantage over existing
                 semi-automatic systems is that modelers can use the
                 modeling package that they are trained in and can
                 thereby increase their productivity by applying the
                 advanced modeling features the package offers. The
                 results presented show that accurate 3D models can even
                 be generated for translucent or specular surfaces, and
                 the approach is therefore still applicable in cases
                 where today's fully automatic image-based approaches or
                 laser scanners would fail.",
  acknowledgement = ack-nhfb,
  articleno =    "86",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "image-based modelling; image-based rendering;
                 structure-from-motion",
}

@Article{Hullin:2008:FIR,
  author =       "Matthias B. Hullin and Martin Fuchs and Ivo Ihrke and
                 Hans-Peter Seidel and Hendrik P. A. Lensch",
  title =        "Fluorescent immersion range scanning",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "87:1--87:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360686",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The quality of a 3D range scan should not depend on
                 the surface properties of the object. Most active range
                 scanning techniques, however, assume a diffuse
                 reflector to allow for a robust detection of incident
                 light patterns. In our approach we embed the object
                 into a fluorescent liquid. By analyzing the light rays
                 that become visible due to fluorescence rather than
                 analyzing their reflections off the surface, we can
                 detect the intersection points between the projected
                 laser sheet and the object surface for a wide range of
                 different materials. For transparent objects we can
                 even directly depict a slice through the object in just
                 one image by matching its refractive index to the one
                 of the embedding liquid. This enables a direct sampling
                 of the object geometry without the need for
                 computational reconstruction. This way, a
                 high-resolution 3D volume can be assembled simply by
                 sweeping a laser plane through the object. We
                 demonstrate the effectiveness of our light sheet range
                 scanning approach on a set of objects manufactured from
                 a variety of materials and material mixes, including
                 dark, translucent and transparent objects.",
  acknowledgement = ack-nhfb,
  articleno =    "87",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "3D scanning; fluorescent dye; transparent surfaces",
}

@Article{Cole:2008:WDP,
  author =       "Forrester Cole and Aleksey Golovinskiy and Alex
                 Limpaecher and Heather Stoddart Barros and Adam
                 Finkelstein and Thomas Funkhouser and Szymon
                 Rusinkiewicz",
  title =        "Where do people draw lines?",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "88:1--88:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360687",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents the results of a study in which
                 artists made line drawings intended to convey specific
                 3D shapes. The study was designed so that drawings
                 could be registered with rendered images of 3D models,
                 supporting an analysis of how well the locations of the
                 artists' lines correlate with other artists', with
                 current computer graphics line definitions, and with
                 the underlying differential properties of the 3D
                 surface. Lines drawn by artists in this study largely
                 overlapped one another (75\% are within 1mm of another
                 line), particularly along the occluding contours of the
                 object. Most lines that do not overlap contours overlap
                 large gradients of the image intensity, and correlate
                 strongly with predictions made by recent line drawing
                 algorithms in computer graphics. 14\% were not well
                 described by any of the local properties considered in
                 this study. The result of our work is a publicly
                 available data set of aligned drawings, an analysis of
                 where lines appear in that data set based on local
                 properties of 3D models, and algorithms to predict
                 where artists will draw lines for new scenes.",
  acknowledgement = ack-nhfb,
  articleno =    "88",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Pang:2008:SAH,
  author =       "Wai-Man Pang and Yingge Qu and Tien-Tsin Wong and
                 Daniel Cohen-Or and Pheng-Ann Heng",
  title =        "Structure-aware halftoning",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "89:1--89:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360688",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents an optimization-based halftoning
                 technique that preserves the structure and tone
                 similarities between the original and the halftone
                 images. By optimizing an objective function consisting
                 of both the structure and the tone metrics, the
                 generated halftone images preserve visually sensitive
                 texture details as well as the local tone. It possesses
                 the blue-noise property and does not introduce annoying
                 patterns. Unlike the existing edge-enhancement
                 halftoning, the proposed method does not suffer from
                 the deficiencies of edge detector. Our method is tested
                 on various types of images. In multiple experiments and
                 the user study, our method consistently obtains the
                 best scores among all tested methods.",
  acknowledgement = ack-nhfb,
  articleno =    "89",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ritschel:2008:UMS,
  author =       "Tobias Ritschel and Kaleigh Smith and Matthias Ihrke
                 and Thorsten Grosch and Karol Myszkowski and Hans-Peter
                 Seidel",
  title =        "{$3$D} unsharp masking for scene coherent
                 enhancement",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "90:1--90:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360689",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new approach for enhancing local scene
                 contrast by unsharp masking over arbitrary surfaces
                 under any form of illumination. Our adaptation of a
                 well-known 2D technique to 3D interactive scenarios is
                 designed to aid viewers in tasks like understanding
                 complex or detailed geometric models, medical
                 visualization and navigation in virtual environments.
                 Our holistic approach enhances the depiction of various
                 visual cues, including gradients from surface shading,
                 surface reflectance, shadows, and highlights, to ease
                 estimation of viewpoint, lighting conditions, shapes of
                 objects and their world-space organization. Motivated
                 by recent perceptual findings on 3D aspects of the
                 Cornsweet illusion, we create scene coherent
                 enhancements by treating cues in terms of their 3D
                 context; doing so has a stronger effect than approaches
                 that operate in a 2D image context and also achieves
                 temporal coherence. We validate our unsharp masking in
                 3D with psychophysical experiments showing that the
                 enhanced images are perceived to have better contrast
                 and are preferred over unenhanced originals. Our
                 operator runs at real-time rates on a GPU and the
                 effect is easily controlled interactively within the
                 rendering pipeline.",
  acknowledgement = ack-nhfb,
  articleno =    "90",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "apparent contrast enhancement; Cornsweet illusion;
                 enhanced rendering; temporal coherence; visual
                 perception",
}

@Article{Feng:2008:RTD,
  author =       "Wei-Wen Feng and Byung-Uck Kim and Yizhou Yu",
  title =        "Real-time data driven deformation using kernel
                 canonical correlation analysis",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "91:1--91:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360690",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Achieving intuitive control of animated surface
                 deformation while observing a specific style is an
                 important but challenging task in computer graphics.
                 Solutions to this task can find many applications in
                 data-driven skin animation, computer puppetry, and
                 computer games. In this paper, we present an intuitive
                 and powerful animation interface to simultaneously
                 control the deformation of a large number of local
                 regions on a deformable surface with a minimal number
                 of control points. Our method learns suitable
                 deformation subspaces from training examples, and
                 generate new deformations on the fly according to the
                 movements of the control points. Our contributions
                 include a novel deformation regression method based on
                 kernel Canonical Correlation Analysis (CCA) and a
                 Poisson-based translation solving technique for easy
                 and fast deformation control based on examples. Our
                 run-time algorithm can be implemented on GPUs and can
                 achieve a few hundred frames per second even for large
                 datasets with hundreds of training examples.",
  acknowledgement = ack-nhfb,
  articleno =    "91",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; Poisson equation; regression; skinning",
}

@Article{Orzan:2008:DCV,
  author =       "Alexandrina Orzan and Adrien Bousseau and Holger
                 Winnem{\"o}ller and Pascal Barla and Jo{\"e}lle Thollot
                 and David Salesin",
  title =        "Diffusion curves: a vector representation for
                 smooth-shaded images",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "92:1--92:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360691",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We describe a new vector-based primitive for creating
                 smooth-shaded images, called the {\em diffusion curve}.
                 A diffusion curve partitions the space through which it
                 is drawn, defining different colors on either side.
                 These colors may vary smoothly along the curve. In
                 addition, the sharpness of the color transition from
                 one side of the curve to the other can be controlled.
                 Given a set of diffusion curves, the final image is
                 constructed by solving a Poisson equation whose
                 constraints are specified by the set of gradients
                 across all diffusion curves. Like all vector-based
                 primitives, diffusion curves conveniently support a
                 variety of operations, including geometry-based
                 editing, keyframe animation, and ready stylization.
                 Moreover, their representation is compact and
                 inherently resolution-independent. We describe a
                 GPU-based implementation for rendering images defined
                 by a set of diffusion curves in realtime. We then
                 demonstrate an interactive drawing system for allowing
                 artists to create artworks using diffusion curves,
                 either by drawing the curves in a freehand style, or by
                 tracing existing imagery. The system is simple and
                 intuitive: we show results created by artists after
                 just a few minutes of instruction. Furthermore, we
                 describe a completely automatic conversion process for
                 taking an image and turning it into a set of diffusion
                 curves that closely approximate the original image
                 content.",
  acknowledgement = ack-nhfb,
  articleno =    "92",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "color diffusion; gradient mesh; image creation; image
                 reconstruction; vector graphics; vectorization",
}

@Article{McCann:2008:RTG,
  author =       "James McCann and Nancy S. Pollard",
  title =        "Real-time gradient-domain painting",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "93:1--93:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360692",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an image editing program which allows
                 artists to paint in the gradient domain with real-time
                 feedback on megapixel-sized images. Along with a
                 pedestrian, though powerful, gradient-painting brush
                 and gradient-clone tool, we introduce an {\em edge
                 brush\/} designed for edge selection and replay. These
                 brushes, coupled with special blending modes, allow
                 users to accomplish global lighting and contrast
                 adjustments using only local image manipulations ---
                 e.g. strengthening a given edge or removing a shadow
                 boundary. Such operations would be tedious in a
                 conventional intensity-based paint program and hard for
                 users to get right in the gradient domain without
                 real-time feedback. The core of our paint program is a
                 simple-to-implement GPU multigrid method which allows
                 integration of megapixel-sized full-color gradient
                 fields at over 20 frames per second on modest hardware.
                 By way of evaluation, we present example images
                 produced with our program and characterize the
                 iteration time and convergence rate of our integration
                 method.",
  acknowledgement = ack-nhfb,
  articleno =    "93",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "gradient; interactive; multigrid; painting;
                 real-time",
}

@Article{Dobashi:2008:FCC,
  author =       "Yoshinori Dobashi and Katsutoshi Kusumoto and Tomoyuki
                 Nishita and Tsuyoshi Yamamoto",
  title =        "Feedback control of cumuliform cloud formation based
                 on computational fluid dynamics",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "94:1--94:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360693",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Clouds play an important role for creating realistic
                 images of outdoor scenes. In order to generate
                 realistic clouds, many methods have been developed for
                 modeling and animating clouds. One of the most
                 effective approaches for synthesizing realistic clouds
                 is to simulate cloud formation processes based on the
                 atmospheric fluid dynamics. Although this approach can
                 create realistic clouds, the resulting shapes and
                 motion depend on many simulation parameters and the
                 initial status. Therefore, it is very difficult to
                 adjust those parameters so that the clouds form the
                 desired shapes. This paper addresses this problem and
                 presents a method for controlling the simulation of
                 cloud formation. In this paper, we focus on controlling
                 cumuliform cloud formation. The user specifies the
                 overall shape of the clouds. Then, our method
                 automatically adjusts parameters during the simulation
                 in order to generate clouds forming the specified
                 shape. Our method can generate realistic clouds while
                 their shapes closely match to the desired shape.",
  acknowledgement = ack-nhfb,
  articleno =    "94",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "clouds; fluid dynamics; simulation control",
}

@Article{Gingold:2008:SBS,
  author =       "Yotam Gingold and Denis Zorin",
  title =        "Shading-based surface editing",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "95:1--95:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360694",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a system for free-form surface modeling
                 that allows a user to modify a shape by changing its
                 rendered, shaded image using stroke-based drawing
                 tools. User input is translated into a set of tangent
                 and positional constraints on the surface. A new shape,
                 whose rendered image closely approximates user input,
                 is computed using an efficient and stable surface
                 optimization procedure. We demonstrate how several
                 types of free-form surface edits which may be difficult
                 to cast in terms of standard deformation approaches can
                 be easily performed using our system.",
  acknowledgement = ack-nhfb,
  articleno =    "95",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "deformations; image-based modeling; interactive
                 modeling; sketch-based modeling",
}

@Article{Park:2008:DDM,
  author =       "Sang Il Park and Jessica K. Hodgins",
  title =        "Data-driven modeling of skin and muscle deformation",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "96:1--96:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360695",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we present a data-driven technique for
                 synthesizing skin deformation from skeletal motion. We
                 first create a database of dynamic skin deformations by
                 recording the motion of the surface of the skin with a
                 very large set of motion capture markers. We then build
                 a statistical model of the deformations by dividing
                 them into two parts: static and dynamic. Static
                 deformations are modeled as a function of pose. Dynamic
                 deformations are caused by the actions of the muscles
                 as they move the joints and the inertia of muscles and
                 fat. We approximate these effects by fitting a set of
                 dynamic equations to the pre-recorded data. We
                 demonstrate the viability of this approach by
                 generating skin deformations from the skeletal motion
                 of an actor. We compare the generated animation both to
                 synchronized video of the actor and to ground truth
                 animation created directly from the large marker set.",
  acknowledgement = ack-nhfb,
  articleno =    "96",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "human animation; motion capture; skin deformation",
}

@Article{Vlasic:2008:AMA,
  author =       "Daniel Vlasic and Ilya Baran and Wojciech Matusik and
                 Jovan Popovi{\'c}",
  title =        "Articulated mesh animation from multi-view
                 silhouettes",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "97:1--97:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1360612.1360696",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Details in mesh animations are difficult to generate
                 but they have great impact on visual quality. In this
                 work, we demonstrate a practical software system for
                 capturing such details from multi-view video
                 recordings. Given a stream of synchronized video images
                 that record a human performance from multiple
                 viewpoints and an articulated template of the
                 performer, our system captures the motion of both the
                 skeleton and the shape. The output mesh animation is
                 enhanced with the details observed in the image
                 silhouettes. For example, a performance in casual
                 loose-fitting clothes will generate mesh animations
                 with flowing garment motions. We accomplish this with a
                 fast pose tracking method followed by nonrigid
                 deformation of the template to fit the silhouettes. The
                 entire process takes less than sixteen seconds per
                 frame and requires no markers or texture cues. Captured
                 meshes are in full correspondence making them readily
                 usable for editing operations including texturing,
                 deformation transfer, and deformation model learning.",
  acknowledgement = ack-nhfb,
  articleno =    "97",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "deformation; motion capture",
}

@Article{deAguiar:2008:PCS,
  author =       "Edilson de Aguiar and Carsten Stoll and Christian
                 Theobalt and Naveed Ahmed and Hans-Peter Seidel and
                 Sebastian Thrun",
  title =        "Performance capture from sparse multi-view video",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "98:1--98:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360697",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper proposes a new marker-less approach to
                 capturing human performances from multi-view video. Our
                 algorithm can jointly reconstruct spatio-temporally
                 coherent geometry, motion and textural surface
                 appearance of actors that perform complex and rapid
                 moves. Furthermore, since our algorithm is purely
                 meshbased and makes as few as possible prior
                 assumptions about the type of subject being tracked, it
                 can even capture performances of people wearing wide
                 apparel, such as a dancer wearing a skirt. To serve
                 this purpose our method efficiently and effectively
                 combines the power of surface- and volume-based shape
                 deformation techniques with a new mesh-based
                 analysis-through-synthesis framework. This framework
                 extracts motion constraints from video and makes the
                 laser-scan of the tracked subject mimic the recorded
                 performance. Also small-scale time-varying shape detail
                 is recovered by applying model-guided multi-view stereo
                 to refine the model surface. Our method delivers
                 captured performance data at high level of detail, is
                 highly versatile, and is applicable to many complex
                 types of scenes that could not be handled by
                 alternative marker-based or marker-free recording
                 techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "98",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "marker-less scene reconstruction; multi-view video
                 analysis; performance capture",
}

@Article{Bradley:2008:MGC,
  author =       "Derek Bradley and Tiberiu Popa and Alla Sheffer and
                 Wolfgang Heidrich and Tamy Boubekeur",
  title =        "Markerless garment capture",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "99:1--99:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360698",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "A lot of research has recently focused on the problem
                 of capturing the geometry and motion of garments. Such
                 work usually relies on special markers printed on the
                 fabric to establish temporally coherent correspondences
                 between points on the garment's surface at different
                 times. Unfortunately, this approach is tedious and
                 prevents the capture of off-the-shelf clothing made
                 from interesting fabrics.\par

                 In this paper, we describe a marker-free approach to
                 capturing garment motion that avoids these downsides.
                 We establish temporally coherent parameterizations
                 between incomplete geometries that we extract at each
                 timestep with a multiview stereo algorithm. We then
                 fill holes in the geometry using a template. This
                 approach, for the first time, allows us to capture the
                 geometry and motion of unpatterned, off-the-shelf
                 garments made from a range of different fabrics.",
  acknowledgement = ack-nhfb,
  articleno =    "99",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cloth modeling; image processing; motion capture;
                 object scanning/acquisition; surface reconstruction",
}

@Article{Grabler:2008:AGT,
  author =       "Floraine Grabler and Maneesh Agrawala and Robert W.
                 Sumner and Mark Pauly",
  title =        "Automatic generation of tourist maps",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "100:1--100:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360699",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Tourist maps are essential resources for visitors to
                 an unfamiliar city because they visually highlight
                 landmarks and other points of interest. Yet,
                 hand-designed maps are static representations that
                 cannot adapt to the needs and tastes of the individual
                 tourist. In this paper we present an automated system
                 for designing tourist maps that selects and highlights
                 the information that is most important to tourists. Our
                 system determines the salience of map elements using
                 bottom-up vision-based image analysis and top-down
                 web-based information extraction techniques. It then
                 generates a map that emphasizes the most important
                 elements, using a combination of multiperspective
                 rendering to increase visibility of streets and
                 landmarks, and cartographic generalization techniques
                 such as simplification, deformation, and displacement
                 to emphasize landmarks and de-emphasize less important
                 buildings. We show a number of automatically generated
                 tourist maps of San Francisco and compare them to
                 existing automated and manual approaches.",
  acknowledgement = ack-nhfb,
  articleno =    "100",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "non-realistic rendering; visualization; WWW
                 applications",
}

@Article{Li:2008:AGI,
  author =       "Wilmot Li and Maneesh Agrawala and Brian Curless and
                 David Salesin",
  title =        "Automated generation of interactive {$3$D} exploded
                 view diagrams",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "101:1--101:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360700",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a system for creating and viewing
                 interactive exploded views of complex 3D models. In our
                 approach, a 3D input model is organized into an {\em
                 explosion graph\/} that encodes how parts explode with
                 respect to each other. We present an automatic method
                 for computing explosion graphs that takes into account
                 part hierarchies in the input models and handles common
                 classes of interlocking parts. Our system also includes
                 an interface that allows users to interactively explore
                 our exploded views using both direct controls and
                 higher-level interaction modes.",
  acknowledgement = ack-nhfb,
  articleno =    "101",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "exploded view illustration; interactive;
                 visualization",
}

@Article{Lipp:2008:IVE,
  author =       "Markus Lipp and Peter Wonka and Michael Wimmer",
  title =        "Interactive visual editing of grammars for procedural
                 architecture",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "102:1--102:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360701",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce a real-time interactive visual editing
                 paradigm for shape grammars, allowing the creation of
                 rulebases from scratch without text file editing. In
                 previous work, shape-grammar based procedural
                 techniques were successfully applied to the creation of
                 architectural models. However, those methods are text
                 based, and may therefore be difficult to use for
                 artists with little computer science background.
                 Therefore the goal was to enable a visual work-flow
                 combining the power of shape grammars with traditional
                 modeling techniques. We extend previous shape grammar
                 approaches by providing direct and persistent local
                 control over the generated instances, avoiding the
                 combinatorial explosion of grammar rules for
                 modifications that should not affect all instances. The
                 resulting visual editor is flexible: All elements of a
                 complex state-of-the-art grammar can be created and
                 modified visually.",
  acknowledgement = ack-nhfb,
  articleno =    "102",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "architectural modeling; procedural modeling; shape
                 grammars; usability",
}

@Article{Chen:2008:IPS,
  author =       "Guoning Chen and Gregory Esch and Peter Wonka and
                 Pascal M{\"u}ller and Eugene Zhang",
  title =        "Interactive procedural street modeling",
  journal =      j-TOG,
  volume =       "27",
  number =       "3",
  pages =        "103:1--103:??",
  month =        aug,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1399504.1360702",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 12 13:40:36 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper addresses the problem of interactively
                 modeling large street networks. We introduce an
                 intuitive and flexible modeling framework in which a
                 user can create a street network from scratch or modify
                 an existing street network. This is achieved through
                 designing an underlying tensor field and editing the
                 graph representing the street network. The framework is
                 intuitive because it uses tensor fields to guide the
                 generation of a street network. The framework is
                 flexible because it allows the user to combine various
                 global and local modeling operations such as brush
                 strokes, smoothing, constraints, noise and rotation
                 fields. Our results will show street networks and
                 three-dimensional urban geometry of high visual
                 quality.",
  acknowledgement = ack-nhfb,
  articleno =    "103",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "procedural modeling; street modeling; street networks;
                 tensor field design; tensor fields",
}

@Article{Weber:2008:PAA,
  author =       "Ofir Weber and Yohai S. Devir and Alexander M.
                 Bronstein and Michael M. Bronstein and Ron Kimmel",
  title =        "Parallel algorithms for approximation of distance maps
                 on parametric surfaces",
  journal =      j-TOG,
  volume =       "27",
  number =       "4",
  pages =        "104:1--104:16",
  month =        oct,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409625.1409626",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Nov 11 15:42:18 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an efficient O($n$) numerical algorithm for
                 first-order approximation of geodesic distances on
                 geometry images, where $n$ is the number of points on
                 the surface. The structure of our algorithm allows
                 efficient implementation on parallel architectures. Two
                 implementations on a SIMD processor and on a GPU are
                 discussed. Numerical results demonstrate up to four
                 orders of magnitude improvement in execution time
                 compared to the state-of-the-art algorithms.",
  acknowledgement = ack-nhfb,
  articleno =    "104",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Eikonal equation; fast marching; geodesic distances;
                 geometry image; GPU; multiple charts; parallel
                 algorithms; SIMD",
}

@Article{Kavan:2008:GSA,
  author =       "Ladislav Kavan and Steven Collins and Ji{\v{r}}{\'\i}
                 {\v{Z}}{\'a}ra and Carol O'Sullivan",
  title =        "Geometric skinning with approximate dual quaternion
                 blending",
  journal =      j-TOG,
  volume =       "27",
  number =       "4",
  pages =        "105:1--105:23",
  month =        oct,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409625.1409627",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Nov 11 15:42:18 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Skinning of skeletally deformable models is
                 extensively used for real-time animation of characters,
                 creatures and similar objects. The standard solution,
                 linear blend skinning, has some serious drawbacks that
                 require artist intervention. Therefore, a number of
                 alternatives have been proposed in recent years. All of
                 them successfully combat some of the artifacts, but
                 none challenge the simplicity and efficiency of linear
                 blend skinning. As a result, linear blend skinning is
                 still the number one choice for the majority of
                 developers. In this article, we present a novel
                 skinning algorithm based on linear combination of dual
                 quaternions. Even though our proposed method is
                 approximate, it does not exhibit any of the artifacts
                 inherent in previous methods and still permits an
                 efficient GPU implementation. Upgrading an existing
                 animation system from linear to dual quaternion
                 skinning is very easy and has a relatively minor impact
                 on runtime performance.",
  acknowledgement = ack-nhfb,
  articleno =    "105",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "dual quaternions; linear combinations; rigid
                 transformations; Skinning; transformation blending",
}

@Article{Lloyd:2008:LPS,
  author =       "D. Brandon Lloyd and Naga K. Govindaraju and Cory
                 Quammen and Steven E. Molnar and Dinesh Manocha",
  title =        "Logarithmic perspective shadow maps",
  journal =      j-TOG,
  volume =       "27",
  number =       "4",
  pages =        "106:1--106:32",
  month =        oct,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409625.1409628",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Nov 11 15:42:18 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel shadow map parameterization to
                 reduce perspective aliasing artifacts for both point
                 and directional light sources. We derive the aliasing
                 error equations for both types of light sources in
                 general position. Using these equations we compute
                 tight bounds on the aliasing error. From these bounds
                 we derive our shadow map parameterization, which is a
                 simple combination of a perspective projection with a
                 logarithmic transformation. We formulate several types
                 of logarithmic perspective shadow maps (LogPSMs) by
                 replacing the parameterization of existing algorithms
                 with our own. We perform an extensive error analysis
                 for both LogPSMs and existing algorithms. This analysis
                 is a major contribution of this paper and is useful for
                 gaining insight into existing techniques. We show that
                 compared with competing algorithms, LogPSMs can produce
                 significantly less aliasing error. Equivalently, for
                 the same error as competing algorithms, LogPSMs can
                 produce significant savings in both storage and
                 bandwidth. We demonstrate the benefit of LogPSMs for
                 several models of varying complexity.",
  acknowledgement = ack-nhfb,
  articleno =    "106",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "antialiasing; Shadow maps",
}

@Article{Gain:2008:SSD,
  author =       "James Gain and Dominique Bechmann",
  title =        "A survey of spatial deformation from a user-centered
                 perspective",
  journal =      j-TOG,
  volume =       "27",
  number =       "4",
  pages =        "107:1--107:32",
  month =        oct,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409625.1409629",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Nov 11 15:42:18 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The spatial deformation methods are a family of
                 modeling and animation techniques for indirectly
                 reshaping an object by warping the surrounding space,
                 with results that are similar to molding a highly
                 malleable substance. They have the virtue of being
                 computationally efficient (and hence interactive) and
                 applicable to a variety of object
                 representations.\par

                 In this article we survey the state of the art in
                 spatial deformation. Since manipulating ambient space
                 directly is infeasible, deformations are controlled by
                 tools of varying dimension --- points, curves, surfaces
                 and volumes --- and it is on this basis that we
                 classify them. Unlike previous surveys that concentrate
                 on providing a single underlying mathematical
                 formalism, we use the user-centered criteria of
                 versatility, ease of use, efficiency and correctness to
                 compare techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "107",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Free-form deformation; spatial deformation; warping",
}

@Article{Tan:2008:SIT,
  author =       "Ping Tan and Tian Fang and Jianxiong Xiao and Peng
                 Zhao and Long Quan",
  title =        "Single image tree modeling",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "108:1--108:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409061",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we introduce a simple sketching method
                 to generate a realistic 3D tree model from a single
                 image. The user draws at least two strokes in the tree
                 image: the first crown stroke around the tree crown to
                 mark up the leaf region, the second branch stroke from
                 the tree root to mark up the main trunk, and possibly
                 few other branch strokes for refinement. The method
                 automatically generates a 3D tree model including
                 branches and leaves. Branches are synthesized by a
                 growth engine from a small library of elementary
                 subtrees that are pre-defined or built on the fly from
                 the recovered visible branches. The visible branches
                 are automatically traced from the drawn branch strokes
                 according to image statistics on the strokes. Leaves
                 are generated from the region bounded by the first
                 crown stroke to complete the tree. We demonstrate our
                 method on a variety of examples.",
  acknowledgement = ack-nhfb,
  articleno =    "108",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Chen:2008:SBT,
  author =       "Xuejin Chen and Boris Neubert and Ying-Qing Xu and
                 Oliver Deussen and Sing Bing Kang",
  title =        "Sketch-based tree modeling using {Markov} random
                 field",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "109:1--109:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409062",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we describe a new system for converting
                 a user's freehand sketch of a tree into a full 3D model
                 that is both complex and realistic-looking. Our system
                 does this by probabilistic optimization based on
                 parameters obtained from a database of tree models. The
                 best matching model is selected by comparing its 2D
                 projections with the sketch. Branch interaction is
                 modeled by a Markov random field, subject to the
                 constraint of 3D projection to sketch. Our system then
                 uses the notion of self-similarity to add new branches
                 before finally populating all branches with leaves of
                 the user's choice. We show a variety of natural-looking
                 tree models generated from freehand sketches with only
                 a few strokes.",
  acknowledgement = ack-nhfb,
  articleno =    "109",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "geometric modeling; Markov random field; sketching;
                 tree modeling",
}

@Article{Sharf:2008:STS,
  author =       "Andrei Sharf and Dan A. Alcantara and Thomas Lewiner
                 and Chen Greif and Alla Sheffer and Nina Amenta and
                 Daniel Cohen-Or",
  title =        "Space-time surface reconstruction using incompressible
                 flow",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "110:1--110:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409063",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce a volumetric space-time technique for the
                 reconstruction of moving and deforming objects from
                 point data. The output of our method is a
                 four-dimensional space-time solid, made up of spatial
                 slices, each of which is a three-dimensional solid
                 bounded by a watertight manifold. The motion of the
                 object is described as an incompressible flow of
                 material through time. We optimize the flow so that the
                 distance material moves from one time frame to the next
                 is bounded, the density of material remains constant,
                 and the object remains compact. This formulation
                 overcomes deficiencies in the acquired data, such as
                 persistent occlusions, errors, and missing frames. We
                 demonstrate the performance of our flow-based technique
                 by reconstructing coherent sequences of watertight
                 models from incomplete scanner data.",
  acknowledgement = ack-nhfb,
  articleno =    "110",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "reconstruction; space-time; volumetric techniques",
}

@Article{Kraevoy:2008:NHR,
  author =       "Vladislav Kraevoy and Alla Sheffer and Ariel Shamir
                 and Daniel Cohen-Or",
  title =        "Non-homogeneous resizing of complex models",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "111:1--111:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409064",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Resizing of 3D models can be very useful when creating
                 new models or placing models inside different scenes.
                 However, uniform scaling is limited in its
                 applicability while straightforward non-uniform scaling
                 can destroy features and lead to serious visual
                 artifacts. Our goal is to define a method that protects
                 model features and structures during resizing. We
                 observe that typically, during scaling some parts of
                 the models are more vulnerable than others, undergoing
                 undesirable deformation. We automatically detect
                 vulnerable regions and carry this information to a
                 protective grid defined around the object, defining a
                 vulnerability map. The 3D model is then resized by a
                 space-deformation technique which scales the grid
                 non-homogeneously while respecting this map. Using
                 space-deformation allows processing of common models of
                 man-made objects that consist of multiple components
                 and contain non-manifold structures. We show that our
                 technique resizes models while suppressing undesirable
                 distortion, creating models that preserve the structure
                 and features of the original ones.",
  acknowledgement = ack-nhfb,
  articleno =    "111",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "3D meshes; resizing; scaling; transformations",
}

@Article{Ye:2008:ARC,
  author =       "Yuting Ye and C. Karen Liu",
  title =        "Animating responsive characters with dynamic
                 constraints in near-unactuated coordinates",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "112:1--112:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409065",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents a technique to enhance a
                 kinematically controlled virtual character with a
                 generic class of dynamic responses to small
                 perturbations. Given an input motion sequence, our
                 technique can synthesize reactive motion to arbitrary
                 external forces with a specific style customized to the
                 input motion. Our method re-parameterizes the motion
                 degrees of freedom based on joint actuations in the
                 input motion. By only enforcing the equations of motion
                 in the less actuated coordinates, our approach can
                 create physically responsive motion based on kinematic
                 pose control without explicitly computing the joint
                 actuations. We demonstrate the simplicity and
                 robustness of our technique by showing a variety of
                 examples generated with the same set of parameters. Our
                 formulation focuses on the type of perturbations that
                 significantly disrupt the upper body poses and
                 dynamics, but have limited effect on the whole-body
                 balance state.",
  acknowledgement = ack-nhfb,
  articleno =    "112",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "motion capture; physically based animation",
}

@Article{Coros:2008:SCW,
  author =       "Stelian Coros and Philippe Beaudoin and Kang Kang Yin
                 and Michiel van de Pann",
  title =        "Synthesis of constrained walking skills",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "113:1--113:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409066",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Simulated characters in simulated worlds require
                 simulated skills. We develop control strategies that
                 enable physically-simulated characters to dynamically
                 navigate environments with significant stepping
                 constraints, such as sequences of gaps. We present a
                 synthesis-analysis-synthesis framework for this type of
                 problem. First, an offline optimization method is
                 applied in order to compute example control solutions
                 for randomly-generated example problems from the given
                 task domain. Second, the example motions and their
                 underlying control patterns are analyzed to build a
                 low-dimensional step-to-step model of the dynamics.
                 Third, this model is exploited by a planner to solve
                 new instances of the task at interactive rates. We
                 demonstrate real-time navigation across constrained
                 terrain for physics-based simulations of 2D and 3D
                 characters. Because the framework sythesizes its own
                 example data, it can be applied to bipedal characters
                 for which no motion data is available.",
  acknowledgement = ack-nhfb,
  articleno =    "113",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Shum:2008:IPM,
  author =       "Hubert P. H. Shum and Taku Komura and Masashi
                 Shiraishi and Shuntaro Yamazaki",
  title =        "Interaction patches for multi-character animation",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "114:1--114:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409067",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose a data-driven approach to automatically
                 generate a scene where tens to hundreds of characters
                 densely interact with each other. During off-line
                 processing, the close interactions between characters
                 are precomputed by expanding a game tree, and these are
                 stored as data structures called {\em interaction
                 patches.\/} Then, during run-time, the system
                 spatio-temporally concatenates the interaction patches
                 to create scenes where a large number of characters
                 closely interact with one another. Using our method, it
                 is possible to automatically or interactively produce
                 animations of crowds interacting with each other in a
                 stylized way. The method can be used for a variety of
                 applications including TV programs, advertisements and
                 movies.",
  acknowledgement = ack-nhfb,
  articleno =    "114",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "character animation; crowd simulation; human motion",
}

@Article{Assa:2008:MOH,
  author =       "Jackie Assa and Daniel Cohen-Or and I-Cheng Yeh and
                 Tong-Yee Lee",
  title =        "Motion overview of human actions",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "115:1--115:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409068",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "During the last decade, motion capture data has
                 emerged and gained a leading role in animations, games
                 and 3D environments. Many of these applications require
                 the creation of expressive overview video clips
                 capturing the human motion, however sufficient
                 attention has not been given to this problem. In this
                 paper, we present a technique that generates an
                 overview video based on the analysis of motion capture
                 data. Our method is targeted for applications of 3D
                 character based animations, automating, for example,
                 the action summary and gameplay overview in simulations
                 and computer games. We base our method on quantum
                 annealing optimization with an objective function that
                 respects the analysis of the character motion and the
                 camera movement constraints. It automatically generates
                 a smooth camera control path, splitting it to several
                 shots if required. To evaluate our method, we introduce
                 a novel camera placement metric which is evaluated
                 against previous work and conduct a user study
                 comparing our results with the various systems.",
  acknowledgement = ack-nhfb,
  articleno =    "115",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; animation summary; camera; mocap; salient
                 action; viewpoint selection",
}

@Article{Kopf:2008:DPM,
  author =       "Johannes Kopf and Boris Neubert and Billy Chen and
                 Michael Cohen and Daniel Cohen-Or and Oliver Deussen
                 and Matt Uyttendaele and Dani Lischinski",
  title =        "Deep photo: model-based photograph enhancement and
                 viewing",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "116:1--116:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409069",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we introduce a novel system for
                 browsing, enhancing, and manipulating casual outdoor
                 photographs by combining them with already existing
                 georeferenced digital terrain and urban models. A
                 simple interactive registration process is used to
                 align a photograph with such a model. Once the
                 photograph and the model have been registered, an
                 abundance of information, such as depth, texture, and
                 GIS data, becomes immediately available to our system.
                 This information, in turn, enables a variety of
                 operations, ranging from dehazing and relighting the
                 photograph, to novel view synthesis, and overlaying
                 with geographic information. We describe the
                 implementation of a number of these applications and
                 discuss possible extensions. Our results show that
                 augmenting photographs with already available 3D models
                 of the world supports a wide variety of new ways for us
                 to experience and interact with our everyday
                 snapshots.",
  acknowledgement = ack-nhfb,
  articleno =    "116",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "dehazing; image completion; image-based modeling;
                 image-based rendering; photo browsing; relighting",
}

@Article{Xu:2008:AAM,
  author =       "Xuemiao Xu and Liang Wan and Xiaopei Liu and Tien-Tsin
                 Wong and Liansheng Wang and Chi-Sing Leung",
  title =        "Animating animal motion from still",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "117:1--117:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409070",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Even though the temporal information is lost, a still
                 picture of moving animals hints at their motion. In
                 this paper, we infer motion cycle of animals from the
                 `motion snapshots' (snapshots of different individuals)
                 captured in a still picture. By finding the motion path
                 in the graph connecting motion snapshots, we can infer
                 the order of motion snapshots with respect to time, and
                 hence the motion cycle. Both `half-cycle' and
                 `full-cycle' motions can be inferred in a unified
                 manner. Therefore, we can animate a still picture of a
                 moving animal group by morphing among the ordered
                 snapshots. By refining the pose, morphology, and
                 appearance consistencies, smooth and realistic animal
                 motion can be synthesized. Our results demonstrate the
                 applicability of the proposed method to a wide range of
                 species, including birds, fishes, mammals, and
                 reptiles.",
  acknowledgement = ack-nhfb,
  articleno =    "117",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animal group; consistency refinement; motion cycle;
                 motion inference; still picture",
}

@Article{Wang:2008:OSS,
  author =       "Yu-Shuen Wang and Chiew-Lan Tai and Olga Sorkine and
                 Tong-Yee Lee",
  title =        "Optimized scale-and-stretch for image resizing",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "118:1--118:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409071",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a `scale-and-stretch' warping method that
                 allows resizing images into arbitrary aspect ratios
                 while preserving visually prominent features. The
                 method operates by iteratively computing optimal local
                 scaling factors for each local region and updating a
                 warped image that matches these scaling factors as
                 closely as possible. The amount of deformation of the
                 image content is guided by a significance map that
                 characterizes the visual attractiveness of each pixel;
                 this significance map is computed automatically using a
                 novel combination of gradient and salience-based
                 measures. Our technique allows diverting the distortion
                 due to resizing to image regions with homogeneous
                 content, such that the impact on perceptually important
                 features is minimized. Unlike previous approaches, our
                 method distributes the distortion in all spatial
                 directions, even when the resizing operation is only
                 applied horizontally or vertically, thus fully
                 utilizing the available homogeneous regions to absorb
                 the distortion. We develop an efficient formulation for
                 the nonlinear optimization involved in the warping
                 function computation, allowing interactive image
                 resizing.",
  acknowledgement = ack-nhfb,
  articleno =    "118",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "arbitrary image resizing; nonlinear optimization;
                 visual saliency",
}

@Article{Wu:2008:INR,
  author =       "Tai-Pang Wu and Jian Sun and Chi-Keung Tang and
                 Heung-Yeung Shum",
  title =        "Interactive normal reconstruction from a single
                 image",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "119:1--119:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409072",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an interactive system for reconstructing
                 surface normals from a single image. Our approach has
                 two complementary contributions. First, we introduce a
                 novel shape-from-shading algorithm (SfS) that produces
                 faithful normal reconstruction for local image region
                 (high-frequency component), but it fails to faithfully
                 recover the overall global structure (low-frequency
                 component). Our second contribution consists of an
                 approach that corrects low-frequency error using a
                 simple markup procedure. This approach, aptly called
                 {\em rotation palette}, allows the user to specify
                 large scale corrections of surface normals by drawing
                 simple stroke correspondences between the normal map
                 and a sphere image which represents rotation
                 directions. Combining these two approaches, we can
                 produce high-quality surfaces quickly from single
                 images.",
  acknowledgement = ack-nhfb,
  articleno =    "119",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Gutierrez:2008:DPC,
  author =       "Diego Gutierrez and Francisco J. Seron and Jorge
                 Lopez-Moreno and Maria P. Sanchez and Jorge Fandos and
                 Erik Reinhard",
  title =        "Depicting procedural caustics in single images",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "120:1--120:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409073",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a powerful technique to simulate and
                 approximate caustics in images. Our algorithm is
                 designed to produce good results without the need to
                 painstakingly paint over pixels. The ability to edit
                 global illumination through image processing allows
                 interaction with images at a level which has not yet
                 been demonstrated, and significantly augments and
                 extends current image-based material editing
                 approaches. We show by means of a set of psychophysical
                 experiments that the resulting imagery is visually
                 plausible and on par with photon mapping, albeit
                 without the need for hand-modeling the underlying
                 geometry.",
  acknowledgement = ack-nhfb,
  articleno =    "120",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "high dynamic range imaging; image processing;
                 image-based material editing",
}

@Article{Ma:2008:FPS,
  author =       "Wan-Chun Ma and Andrew Jones and Jen-Yuan Chiang and
                 Tim Hawkins and Sune Frederiksen and Pieter Peers and
                 Marko Vukovic and Ming Ouhyoung and Paul Debevec",
  title =        "Facial performance synthesis using deformation-driven
                 polynomial displacement maps",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "121:1--121:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409074",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel method for acquisition, modeling,
                 compression, and synthesis of realistic facial
                 deformations using polynomial displacement maps. Our
                 method consists of an analysis phase where the
                 relationship between motion capture markers and
                 detailed facial geometry is inferred, and a synthesis
                 phase where novel detailed animated facial geometry is
                 driven solely by a sparse set of motion capture
                 markers. For analysis, we record the actor wearing
                 facial markers while performing a set of training
                 expression clips. We capture real-time high-resolution
                 facial deformations, including dynamic wrinkle and pore
                 detail, using interleaved structured light 3D scanning
                 and photometric stereo. Next, we compute displacements
                 between a neutral mesh driven by the motion capture
                 markers and the high-resolution captured expressions.
                 These geometric displacements are stored in a {\em
                 polynomial displacement map\/} which is parameterized
                 according to the local deformations of the motion
                 capture dots. For synthesis, we drive the polynomial
                 displacement map with new motion capture data. This
                 allows the recreation of large-scale muscle
                 deformation, medium and fine wrinkles, and dynamic skin
                 pore detail. Applications include the compression of
                 existing performance data and the synthesis of new
                 performances. Our technique is independent of the
                 underlying geometry capture system and can be used to
                 automatically generate high-frequency wrinkle and pore
                 details on top of many existing facial animation
                 systems.",
  acknowledgement = ack-nhfb,
  articleno =    "121",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "facial performance synthesis; polynomial displacement
                 maps",
}

@Article{Ju:2008:RST,
  author =       "Tao Ju and Qian-Yi Zhou and Michiel van de Panne and
                 Daniel Cohen-Or and Ulrich Neumann",
  title =        "Reusable skinning templates using cage-based
                 deformations",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "122:1--122:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409075",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Character skinning determines how the shape of the
                 surface geometry changes as a function of the pose of
                 the underlying skeleton. In this paper we describe
                 skinning templates, which define common deformation
                 behaviors for common joint types. This abstraction
                 allows skinning solutions to be shared and reused, and
                 they allow a user to quickly explore many possible
                 alternatives for the skinning behavior of a character.
                 The skinning templates are implemented using cage-based
                 deformations, which offer a flexible design space
                 within which to develop reusable skinning behaviors. We
                 demonstrate the interactive use of skinning templates
                 to quickly explore alternate skinning behaviors for 3D
                 models.",
  acknowledgement = ack-nhfb,
  articleno =    "122",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; cage-based deformation; skinning;
                 templates",
}

@Article{Shiratori:2008:ABU,
  author =       "Takaaki Shiratori and Jessica K. Hodgins",
  title =        "Accelerometer-based user interfaces for the control of
                 a physically simulated character",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "123:1--123:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409076",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In late 2006, Nintendo released a new game controller,
                 the Wiimote, which included a three-axis accelerometer.
                 Since then, a large variety of novel applications for
                 these controllers have been developed by both
                 independent and commercial developers. We add to this
                 growing library with three performance interfaces that
                 allow the user to control the motion of a dynamically
                 simulated, animated character through the motion of his
                 or her arms, wrists, or legs. For comparison, we also
                 implement a traditional joystick/button interface. We
                 assess these interfaces by having users test them on a
                 set of tracks containing turns and pits. Two of the
                 interfaces (legs and wrists) were judged to be more
                 immersive and were better liked than the
                 joystick/button interface by our subjects. All three of
                 the Wiimote interfaces provided better control than the
                 joystick interface based on an analysis of the failures
                 seen during the user study.",
  acknowledgement = ack-nhfb,
  articleno =    "123",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "character animation; physical simulation; user
                 interface; Wiimotes",
}

@Article{Barnes:2008:VPP,
  author =       "Connelly Barnes and David E. Jacobs and Jason Sanders
                 and Dan B. Goldman and Szymon Rusinkiewicz and Adam
                 Finkelstein and Maneesh Agrawala",
  title =        "Video puppetry: a performative interface for cutout
                 animation",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "124:1--124:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409077",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a video-based interface that allows users
                 of all skill levels to quickly create cutout-style
                 animations by performing the character motions. The
                 puppeteer first creates a cast of physical puppets
                 using paper, markers and scissors. He then physically
                 moves these puppets to tell a story. Using an
                 inexpensive overhead camera our system tracks the
                 motions of the puppets and renders them on a new
                 background while removing the puppeteer's hands. Our
                 system runs in real-time (at 30 fps) so that the
                 puppeteer and the audience can immediately see the
                 animation that is created. Our system also supports a
                 variety of constraints and effects including
                 articulated characters, multi-track animation, scene
                 changes, camera controls, 2 1/2-D environments,
                 shadows, and animation cycles. Users have evaluated our
                 system both quantitatively and qualitatively: In tests
                 of low-level dexterity, our system has similar accuracy
                 to a mouse interface. For simple story telling, users
                 prefer our system over either a mouse interface or
                 traditional puppetry. We demonstrate that even
                 first-time users, including an eleven-year-old, can use
                 our system to quickly turn an original story idea into
                 an animation.",
  acknowledgement = ack-nhfb,
  articleno =    "124",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; real-time; tangible user interface;
                 vision",
}

@Article{DiLorenzo:2008:LLC,
  author =       "Paul C. DiLorenzo and Victor B. Zordan and Benjamin L.
                 Sanders",
  title =        "Laughing out loud: control for modeling anatomically
                 inspired laughter using audio",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "125:1--125:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409078",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel technique for generating animation
                 of laughter for a character. Our approach utilizes an
                 anatomically inspired, physics-based model of a human
                 torso that includes a mix of rigid-body and deformable
                 components and is driven by Hill-type muscles. We
                 propose a hierarchical control method which synthesizes
                 laughter from a simple set of input signals. In
                 addition, we present a method for automatically
                 creating an animation from a soundtrack of an
                 individual laughing. We show examples of laugh
                 animations generated by hand-selected input parameters
                 and by our audio-driven optimization approach. We also
                 include results for other behaviors, such as coughing
                 and a sneeze, created using the same model. These
                 animations demonstrate the range of possible motions
                 that can be generated using the proposed system. We
                 compare our technique with both data-driven and
                 procedural animations of laughter.",
  acknowledgement = ack-nhfb,
  articleno =    "125",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "human animation; human simulation; laughter",
}

@Article{Zhou:2008:RTK,
  author =       "Kun Zhou and Qiming Hou and Rui Wang and Baining Guo",
  title =        "Real-time {KD}-tree construction on graphics
                 hardware",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "126:1--126:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409079",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an algorithm for constructing kd-trees on
                 GPUs. This algorithm achieves real-time performance by
                 exploiting the GPU's streaming architecture at all
                 stages of kd-tree construction. Unlike previous
                 parallel kd-tree algorithms, our method builds tree
                 nodes completely in BFS (breadth-first search) order.
                 We also develop a special strategy for large nodes at
                 upper tree levels so as to further exploit the
                 fine-grained parallelism of GPUs. For these nodes, we
                 parallelize the computation over all geometric
                 primitives instead of nodes at each level. Finally, in
                 order to maintain kd-tree quality, we introduce novel
                 schemes for fast evaluation of node split costs.\par

                 As far as we know, ours is the first real-time kd-tree
                 algorithm on the GPU. The kd-trees built by our
                 algorithm are of comparable quality as those
                 constructed by off-line CPU algorithms. In terms of
                 speed, our algorithm is significantly faster than
                 well-optimized single-core CPU algorithms and
                 competitive with multi-core CPU algorithms. Our
                 algorithm provides a general way for handling dynamic
                 scenes on the GPU. We demonstrate the potential of our
                 algorithm in applications involving dynamic scenes,
                 including GPU ray tracing, interactive photon mapping,
                 and point cloud modeling.",
  acknowledgement = ack-nhfb,
  articleno =    "126",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "kd-tree; photon mapping; point cloud modeling;
                 programable graphics hardware; ray tracing",
}

@Article{Sitthi-amorn:2008:ARB,
  author =       "Pitchaya Sitthi-amorn and Jason Lawrence and Lei Yang
                 and Pedro V. Sander and Diego Nehab and Jiahe Xi",
  title =        "Automated reprojection-based pixel shader
                 optimization",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "127:1--127:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409080",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a framework and supporting algorithms to
                 automate the use of temporal data reprojection as a
                 general tool for optimizing procedural shaders.
                 Although the general strategy of caching and reusing
                 expensive intermediate shading calculations across
                 consecutive frames has previously been shown to provide
                 an effective trade-off between speed and accuracy, the
                 critical choices of what to reuse and at what rate to
                 refresh cached entries have been left to a designer.
                 The fact that these decisions require a deep
                 understanding of a procedure's semantic structure makes
                 it challenging to select optimal candidates among
                 possibly hundreds of alternatives. Our automated
                 approach relies on parametric models of the way
                 possible caching decisions affect the shader's
                 performance and visual fidelity. These models are
                 trained using a sample rendering session and drive an
                 interactive profiler in which the user can explore the
                 error/performance trade-offs associated with
                 incorporating temporal reprojection. We evaluate the
                 proposed models and selection algorithm with a
                 prototype system used to optimize several complex
                 shaders and compare our approach to current
                 alternatives.",
  acknowledgement = ack-nhfb,
  articleno =    "127",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "code optimization; procedural shading; real-time
                 rendering; temporal reprojection",
}

@Article{Cheslack-Postava:2008:FRL,
  author =       "Ewen Cheslack-Postava and Rui Wang and Oskar Akerlund
                 and Fabio Pellacini",
  title =        "Fast, realistic lighting and material design using
                 nonlinear cut approximation",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "128:1--128:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409081",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an efficient computational algorithm for
                 functions represented by a nonlinear piecewise constant
                 approximation called {\em cuts.\/} Our main
                 contribution is a single traversal algorithm for
                 merging cuts that allows for arbitrary pointwise
                 computation, such as addition, multiplication, linear
                 interpolation, and multi-product integration. A
                 theoretical error bound of this approach can be proved
                 using a statistical interpretation of cuts. Our
                 algorithm extends naturally to computation with many
                 cuts and maps easily to modern GPUs, leading to
                 significant advantages over existing methods based on
                 wavelet approximation. We apply this technique to the
                 problem of realistic lighting and material design under
                 complex illumination with arbitrary BRDFs. Our system
                 smoothly integrates all-frequency relighting of shadows
                 and reflections with dynamic per-pixel shading effects,
                 such as bump mapping and spatially varying BRDFs. This
                 combination of capabilities is typically missing in
                 current systems. We represent illumination and
                 precomputed visibility as nonlinear sparse vectors; we
                 then use our cut merging algorithm to simultaneously
                 interpolate visibility cuts at each pixel, and compute
                 the triple product integral of the illumination,
                 interpolated visibility, and dynamic BRDF samples.
                 Finally, we present a two-pass, data-driven approach
                 that exploits pilot visibility samples to optimize the
                 construction of the light tree, leading to more
                 efficient cuts and reduced datasets.",
  acknowledgement = ack-nhfb,
  articleno =    "128",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ritschel:2008:ISM,
  author =       "T. Ritschel and T. Grosch and M. H. Kim and H.-P.
                 Seidel and C. Dachsbacher and J. Kautz",
  title =        "Imperfect shadow maps for efficient computation of
                 indirect illumination",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "129:1--129:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409082",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a method for interactive computation of
                 indirect illumination in large and fully dynamic scenes
                 based on approximate visibility queries. While the
                 high-frequency nature of direct lighting requires
                 accurate visibility, indirect illumination mostly
                 consists of smooth gradations, which tend to mask
                 errors due to incorrect visibility. We exploit this by
                 approximating visibility for indirect illumination with
                 {\em imperfect shadow maps\/} ---low-resolution shadow
                 maps rendered from a crude point-based representation
                 of the scene. These are used in conjunction with a
                 global illumination algorithm based on virtual point
                 lights enabling indirect illumination of dynamic scenes
                 at real-time frame rates. We demonstrate that imperfect
                 shadow maps are a valid approximation to visibility,
                 which makes the simulation of global illumination an
                 order of magnitude faster than using accurate
                 visibility.",
  acknowledgement = ack-nhfb,
  articleno =    "129",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "global illumination; real-time rendering; visibility",
}

@Article{Hachisuka:2008:PPM,
  author =       "Toshiya Hachisuka and Shinji Ogaki and Henrik Wann
                 Jensen",
  title =        "Progressive photon mapping",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "130:1--130:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409083",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper introduces a simple and robust progressive
                 global illumination algorithm based on photon mapping.
                 Progressive photon mapping is a multi-pass algorithm
                 where the first pass is ray tracing followed by any
                 number of photon tracing passes. Each photon tracing
                 pass results in an increasingly accurate global
                 illumination solution that can be visualized in order
                 to provide progressive feedback. Progressive photon
                 mapping uses a new radiance estimate that converges to
                 the correct radiance value as more photons are used. It
                 is not necessary to store the full photon map, and
                 unlike standard photon mapping it possible to compute a
                 global illumination solution with any desired accuracy
                 using a limited amount of memory. Compared with
                 existing Monte Carlo ray tracing methods progressive
                 photon mapping provides an efficient and robust
                 alternative in the presence of complex light transport
                 such as caustics and in particular reflections of
                 caustics.",
  acknowledgement = ack-nhfb,
  articleno =    "130",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "density estimation; global illumination; photon
                 mapping; sampling and reconstruction",
}

@Article{Lanman:2008:SFM,
  author =       "Douglas Lanman and Ramesh Raskar and Amit Agrawal and
                 Gabriel Taubin",
  title =        "Shield fields: modeling and capturing {$3$D}
                 occluders",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "131:1--131:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409084",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We describe a unified representation of occluders in
                 light transport and photography using shield fields:
                 the 4D attenuation function which acts on any light
                 field incident on an occluder. Our key theoretical
                 result is that shield fields can be used to decouple
                 the effects of occluders and incident illumination. We
                 first describe the properties of shield fields in the
                 frequency-domain and briefly analyze the `forward'
                 problem of efficiently computing cast shadows.
                 Afterwards, we apply the shield field signal-processing
                 framework to make several new observations regarding
                 the `inverse' problem of reconstructing 3D occluders
                 from cast shadows -- extending previous work on
                 shape-from-silhouette and visual hull methods. From
                 this analysis we develop the first single-camera,
                 single-shot approach to capture visual hulls without
                 requiring moving or programmable illumination. We
                 analyze several competing camera designs, ultimately
                 leading to the development of a new large-format,
                 mask-based light field camera that exploits optimal
                 tiled-broadband codes for light-efficient shield field
                 capture. We conclude by presenting a detailed
                 experimental analysis of shield field capture and 3D
                 occluder reconstruction.",
  acknowledgement = ack-nhfb,
  articleno =    "131",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cast shadows; coded aperture imaging; computational
                 photography; light fields; light transport; visual
                 hull",
}

@Article{Atcheson:2008:TRC,
  author =       "Bradley Atcheson and Ivo Ihrke and Wolfgang Heidrich
                 and Art Tevs and Derek Bradley and Marcus Magnor and
                 Hans-Peter Seidel",
  title =        "Time-resolved {$3$D} capture of non-stationary gas
                 flows",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "132:1--132:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409085",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Fluid simulation is one of the most active research
                 areas in computer graphics. However, it remains
                 difficult to obtain measurements of real fluid flows
                 for validation of the simulated data.\par

                 In this paper, we take a step in the direction of
                 capturing flow data for such purposes. Specifically, we
                 present the first time-resolved Schlieren tomography
                 system for capturing full 3D, non-stationary gas flows
                 on a dense volumetric grid. Schlieren tomography uses
                 2D ray deflection measurements to reconstruct a
                 time-varying grid of 3D refractive index values, which
                 directly correspond to physical properties of the flow.
                 We derive a new solution for this reconstruction
                 problem that lends itself to efficient algorithms that
                 robustly work with relatively small numbers of cameras.
                 Our physical system is easy to set up, and consists of
                 an array of relatively low cost rolling-shutter
                 camcorders that are synchronized with a new approach.
                 We demonstrate our method with real measurements, and
                 analyze precision with synthetic data for which ground
                 truth information is available.",
  acknowledgement = ack-nhfb,
  articleno =    "132",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational cameras and optics; image processing;
                 object scanning/acquisition",
}

@Article{Holroyd:2008:PAE,
  author =       "Michael Holroyd and Jason Lawrence and Greg Humphreys
                 and Todd Zickler",
  title =        "A photometric approach for estimating normals and
                 tangents",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "133:1--133:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409086",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents a technique for acquiring the
                 shape of real-world objects with complex isotropic and
                 anisotropic reflectance. Our method estimates the local
                 normal and tangent vectors at each pixel in a reference
                 view from a sequence of images taken under varying
                 point lighting. We show that for many real-world
                 materials and a restricted set of light positions, the
                 2D slice of the BRDF obtained by fixing the local view
                 direction is symmetric under reflections of the halfway
                 vector across the normal-tangent and normal-binormal
                 planes. Based on this analysis, we develop an
                 optimization that estimates the local surface frame by
                 identifying these planes of symmetry in the measured
                 BRDF. As with other photometric methods, a key benefit
                 of our approach is that the input is easy to acquire
                 and is less sensitive to calibration errors than stereo
                 or multi-view techniques. Unlike prior work, our
                 approach allows estimating the surface tangent in the
                 case of anisotropic reflectance. We confirm the
                 accuracy and reliability of our approach with analytic
                 and measured data, present several normal and tangent
                 fields acquired with our technique, and demonstrate
                 applications to appearance editing.",
  acknowledgement = ack-nhfb,
  articleno =    "133",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "anisotropic; BRDF; normal map; photometric stereo;
                 symmetry; tangent map",
}

@Article{Bando:2008:EDM,
  author =       "Yosuke Bando and Bing-Yu Chen and Tomoyuki Nishita",
  title =        "Extracting depth and matte using a color-filtered
                 aperture",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "134:1--134:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409087",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents a method for automatically
                 extracting a scene depth map and the alpha matte of a
                 foreground object by capturing a scene through RGB
                 color filters placed in the camera lens aperture. By
                 dividing the aperture into three regions through which
                 only light in one of the RGB color bands can pass, we
                 can acquire three shifted views of a scene in the RGB
                 planes of an image in a single exposure. In other
                 words, a captured image has depth-dependent color
                 misalignment. We develop a color alignment measure to
                 estimate disparities between the RGB planes for depth
                 reconstruction. We also exploit color misalignment cues
                 in our matting algorithm in order to disambiguate
                 between the foreground and background regions even
                 where their colors are similar. Based on the extracted
                 depth and matte, the color misalignment in the captured
                 image can be canceled, and various image editing
                 operations can be applied to the reconstructed image,
                 including novel view synthesis, postexposure
                 refocusing, and composition over different
                 backgrounds.",
  acknowledgement = ack-nhfb,
  articleno =    "134",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "alpha matting; color correlation; color filters;
                 computational camera; computational photography; depth
                 estimation",
}

@Article{Nehab:2008:RAR,
  author =       "Diego Nehab and Hugues Hoppe",
  title =        "Random-access rendering of general vector graphics",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "135:1--135:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409088",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce a novel representation for random-access
                 rendering of antialiased vector graphics on the GPU,
                 along with efficient encoding and rendering algorithms.
                 The representation supports a broad class of vector
                 primitives, including multiple layers of
                 semitransparent filled and stroked shapes, with
                 quadratic outlines and color gradients. Our approach is
                 to create a coarse lattice in which each cell contains
                 a variable-length encoding of the graphics primitives
                 it overlaps. These cell-specialized encodings are
                 interpreted at runtime within a pixel shader.
                 Advantages include localized memory access and the
                 ability to map vector graphics onto arbitrary surfaces,
                 or under arbitrary deformations. Most importantly, we
                 perform both prefiltering and supersampling within a
                 single pixel shader invocation, achieving
                 inter-primitive antialiasing at no added memory
                 bandwidth cost. We present an efficient encoding
                 algorithm, and demonstrate high-quality real-time
                 rendering of complex, real-world examples.",
  acknowledgement = ack-nhfb,
  articleno =    "135",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tai:2008:TAR,
  author =       "Yu-Wing Tai and Michael S. Brown and Chi-Keung Tang
                 and Heung-Yeung Shum",
  title =        "Texture amendment: reducing texture distortion in
                 constrained parameterization",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "136:1--136:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409089",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Constrained parameterization is an effective way to
                 establish texture coordinates between a 3D surface and
                 an existing image or photograph. A known drawback to
                 constrained parameterization is visual distortion that
                 arises when the 3D geometry is mismatched to highly
                 textured image regions. This paper introduces an
                 approach to reduce visual distortion by expanding image
                 regions via texture synthesis to better fit the 3D
                 geometry. The result is a new {\em amended texture\/}
                 that maintains the essence of the input texture image
                 but exhibits significantly less distortion when mapped
                 onto the 3D model.",
  acknowledgement = ack-nhfb,
  articleno =    "136",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "image enhancement; texture synthesis; texture-mapping;
                 user-assistance",
}

@Article{Garcia:2008:IIG,
  author =       "Ismael Garc{\'\i}a and Gustavo Patow",
  title =        "{IGT}: inverse geometric textures",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "137:1--137:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409090",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Preserving details from a high resolution reference
                 model onto lower resolution models is a complex, and
                 sometimes daunting, task as manual intervention is
                 required to correct texture misplacements. Inverse
                 Geometric Textures (IGT) is a
                 parameterization-independent texturing technique that
                 allows preservation of texture details from a high
                 resolution reference model onto lower resolutions,
                 generated with any given simplification method. IGT
                 uses a parameterization defined on the reference model
                 to generate an inversely parameterized texture that
                 stores, for each texel, a list with information about
                 all the triangles mapped onto it. In this way, for any
                 valid texture coordinate, IGT can identify the point
                 and the triangle of the detailed model that was
                 projected, allowing details from the reference model to
                 be applied onto the fragment from the low-resolution
                 model. IGT is encoded in compact data structures and
                 can be evaluated quickly. Furthermore, the high
                 resolution model can have its own independent {\em
                 artist-provided}, unmodified parameterization, so that
                 no additional effort is required to directly use
                 artist-designed content.",
  acknowledgement = ack-nhfb,
  articleno =    "137",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "appearance preserving simplification; computer games;
                 detail-recovery; LoD; parameterizations; texturing",
}

@Article{Filip:2008:PVM,
  author =       "Ji{\v{r}}{\'\i} Filip and Michael J. Chantler and
                 Patrick R. Green and Michal Haindl",
  title =        "A psychophysically validated metric for bidirectional
                 texture data reduction",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "138:1--138:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409091",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Bidirectional Texture Functions (BTF) are commonly
                 thought to provide the most realistic perceptual
                 experience of materials from rendered images. The key
                 to providing efficient compression of BTFs is the
                 decision as to how much of the data should be
                 preserved. We use psychophysical experiments to show
                 that this decision depends critically upon the material
                 concerned. Furthermore, we develop a BTF derived metric
                 that enables us to automatically set a material's
                 compression parameters in such a way as to provide
                 users with a predefined perceptual quality. We
                 investigate the correlation of three different BTF
                 metrics with psychophysically derived data. Eight
                 materials were presented to eleven naive observers who
                 were asked to judge the perceived quality of BTF
                 renderings as the amount of preserved data was varied.
                 The metric showing the highest correlation with the
                 thresholds set by the observers was the mean variance
                 of individual BTF images. This metric was then used to
                 automatically determine the material-specific
                 compression parameters used in a vector quantisation
                 scheme. The results were successfully validated in an
                 experiment with six additional materials and eighteen
                 observers. We show that using the psychophysically
                 reduced BTF data significantly improves performance of
                 a PCA-based compression method. On average, we were
                 able to increase the compression ratios, and decrease
                 processing times, by a factor of four without any
                 differences being perceived.",
  acknowledgement = ack-nhfb,
  articleno =    "138",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "BTF; perceptual metric; phychophysical experiment;
                 surface texture; texture compression; texture
                 perception",
}

@Article{Ghosh:2008:PMA,
  author =       "Abhijeet Ghosh and Tim Hawkins and Pieter Peers and
                 Sune Frederiksen and Paul Debevec",
  title =        "Practical modeling and acquisition of layered facial
                 reflectance",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "139:1--139:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409092",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a practical method for modeling layered
                 facial reflectance consisting of specular reflectance,
                 single scattering, and shallow and deep subsurface
                 scattering. We estimate parameters of appropriate
                 reflectance models for each of these layers from just
                 20 photographs recorded in a few seconds from a single
                 viewpoint. We extract spatially-varying specular
                 reflectance and single-scattering parameters from
                 polarization-difference images under spherical and
                 point source illumination. Next, we employ
                 direct-indirect separation to decompose the remaining
                 multiple scattering observed under cross-polarization
                 into shallow and deep scattering components to model
                 the light transport through multiple layers of skin.
                 Finally, we match appropriate diffusion models to the
                 extracted shallow and deep scattering components for
                 different regions on the face. We validate our
                 technique by comparing renderings of subjects to
                 reference photographs recorded from novel viewpoints
                 and under novel illumination conditions.",
  acknowledgement = ack-nhfb,
  articleno =    "139",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Donner:2008:LHR,
  author =       "Craig Donner and Tim Weyrich and Eugene d'Eon and Ravi
                 Ramamoorthi and Szymon Rusinkiewicz",
  title =        "A layered, heterogeneous reflectance model for
                 acquiring and rendering human skin",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "140:1--140:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409093",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce a layered, heterogeneous spectral
                 reflectance model for human skin. The model captures
                 the inter-scattering of light among layers, each of
                 which may have an independent set of spatially-varying
                 absorption and scattering parameters. For greater
                 physical accuracy and control, we introduce an
                 infinitesimally thin absorbing layer between scattering
                 layers. To obtain parameters for our model, we use a
                 novel acquisition method that begins with
                 multi-spectral photographs. By using an inverse
                 rendering technique, along with known chromophore
                 spectra, we optimize for the best set of parameters for
                 each pixel of a patch. Our method finds close matches
                 to a wide variety of inputs with low residual
                 error.\par

                 We apply our model to faithfully reproduce the complex
                 variations in skin pigmentation. This is in contrast to
                 most previous work, which assumes that skin is
                 homogeneous or composed of homogeneous layers. We
                 demonstrate the accuracy and flexibility of our model
                 by creating complex skin visual effects such as veins,
                 tattoos, rashes, and freckles, which would be difficult
                 to author using only albedo textures at the skin's
                 outer surface. Also, by varying the parameters to our
                 model, we simulate effects from external forces, such
                 as visible changes in blood flow within the skin due to
                 external pressure.",
  acknowledgement = ack-nhfb,
  articleno =    "140",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "BSSRDF; layered materials; light transport; reflection
                 models; skin reflectance; subsurface scattering",
}

@Article{Boubekeur:2008:PT,
  author =       "Tamy Boubekeur and Marc Alexa",
  title =        "{Phong Tessellation}",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "141:1--141:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409094",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Modern 3D engines used in real-time applications
                 provide shading that hides the lack of higher order
                 continuity inside the shapes using modulated normals,
                 textures, and tone-mapping -- artifacts remain only on
                 interior contours and silhouettes if the surface
                 geometry is not smooth. The basic idea in this paper is
                 to apply a purely local refinement strategy that
                 inflates the geometry enough to avoid these artifacts.
                 Our technique is a geometric version of Phong normal
                 interpolation, not applied on normals but on the vertex
                 positions. We call this strategy Phong Tessellation.",
  acknowledgement = ack-nhfb,
  articleno =    "141",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "mesh refinement; real-time tessellation; visual
                 continuity",
}

@Article{Alexa:2008:SS,
  author =       "Marc Alexa and Tamy Boubekeur",
  title =        "Subdivision shading",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "142:1--142:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409095",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The idea of Phong Shading is applied to subdivision
                 surfaces: normals are associated with vertices and the
                 same construction is used for both locations and
                 normals. This creates vertex positions {\em and\/}
                 normals. The vertex normals are smoother than the
                 normals of the subdivision surface and using vertex
                 normals for shading attenuates the well known visual
                 artifacts of many subdivision schemes. We demonstrate
                 how to apply subdivision to normals and how blend and
                 combine different normals for achieving a variety of
                 effects.",
  acknowledgement = ack-nhfb,
  articleno =    "142",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "irregular vertices; shading; subdivision; visual
                 quality",
}

@Article{Patney:2008:RTR,
  author =       "Anjul Patney and John D. Owens",
  title =        "Real-time {Reyes}-style adaptive surface subdivision",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "143:1--143:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409096",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a GPU based implementation of Reyes-style
                 adaptive surface subdivision, known in Reyes
                 terminology as the Bound/Split and Dice stages. The
                 performance of this task is important for the Reyes
                 pipeline to map efficiently to graphics hardware, but
                 its recursive nature and irregular and unbounded memory
                 requirements present a challenge to an efficient
                 implementation. Our solution begins by characterizing
                 Reyes subdivision as a work queue with irregular
                 computation, targeted to a massively parallel GPU. We
                 propose efficient solutions to these general problems
                 by casting our solution in terms of the fundamental
                 primitives of prefix-sum and reduction, often
                 encountered in parallel and GPGPU environments.\par

                 Our results indicate that real-time Reyes subdivision
                 can indeed be obtained on today's GPUs. We are able to
                 subdivide a complex model to subpixel accuracy within
                 15 ms. Our measured performance is several times better
                 than that of Pixar's RenderMan. Our implementation
                 scales well with the input size and depth of
                 subdivision. We also address concerns of memory size
                 and bandwidth, and analyze the feasibility of
                 conventional ideas on screen-space buckets.",
  acknowledgement = ack-nhfb,
  articleno =    "143",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "adaptive surface subdivision; GPGPU; graphics
                 hardware; Reyes",
}

@Article{Sander:2008:ETM,
  author =       "Pedro V. Sander and Diego Nehab and Eden Chlamtac and
                 Hugues Hoppe",
  title =        "Efficient traversal of mesh edges using adjacency
                 primitives",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "144:1--144:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409097",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Processing of mesh edges lies at the core of many
                 advanced realtime rendering techniques, ranging from
                 shadow and silhouette computations, to motion blur and
                 fur rendering. We present a scheme for efficient
                 traversal of mesh edges that builds on the adjacency
                 primitives and programmable geometry shaders introduced
                 in recent graphics hardware. Our scheme aims to
                 minimize the number of primitives while maximizing SIMD
                 parallelism. These objectives reduce to a set of
                 discrete optimization problems on the dual graph of the
                 mesh, and we develop practical solutions to these graph
                 problems. In addition, we extend two existing vertex
                 cache optimization algorithms to produce
                 cache-efficient traversal orderings for adjacency
                 primitives. We demonstrate significant runtime speedups
                 for several practical real-time rendering algorithms.",
  acknowledgement = ack-nhfb,
  articleno =    "144",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "programmable geometry shader; real-time rendering;
                 shadow volumes; silhouettes; vertex locality",
}

@Article{Golovinskiy:2008:RCM,
  author =       "Aleksey Golovinskiy and Thomas Funkhouser",
  title =        "Randomized cuts for {$3$D} mesh analysis",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "145:1--145:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409098",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The goal of this paper is to investigate a new shape
                 analysis method based on randomized cuts of 3D surface
                 meshes. The general strategy is to generate a random
                 set of mesh segmentations and then to measure how often
                 each edge of the mesh lies on a segmentation boundary
                 in the randomized set. The resulting `partition
                 function' defined on edges provides a continuous
                 measure of where natural part boundaries occur in a
                 mesh, and the set of `most consistent cuts' provides a
                 stable list of global shape features. The paper
                 describes methods for generating random distributions
                 of mesh segmentations, studies sensitivity of the
                 resulting partition functions to noise, tessellation,
                 pose, and intra-class shape variations, and
                 investigates applications in mesh visualization,
                 segmentation, deformation, and registration.",
  acknowledgement = ack-nhfb,
  articleno =    "145",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "mesh segmentation; shape analysis",
}

@Article{Lin:2008:DIS,
  author =       "Shujin Lin and Fang You and Xiaonan Luo and Zheng Li",
  title =        "Deducing interpolating subdivision schemes from
                 approximating subdivision schemes",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "146:1--146:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409099",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper we describe a method for directly
                 deducing new interpolating subdivision masks for meshes
                 from corresponding approximating subdivision masks. The
                 purpose is to avoid complex computation for producing
                 interpolating subdivision masks on extraordinary
                 vertices. The method can be applied to produce new
                 interpolating subdivision schemes, solve some
                 limitations in existing interpolating subdivision
                 schemes and satisfy some application needs. As cases,
                 in this paper a new interpolating subdivision scheme
                 for polygonal meshes is produced by deducing from the
                 Catmull--Clark subdivision scheme. It can directly
                 operate on polygonal meshes, which solves the
                 limitation of Kobbelt's interpolating subdivision
                 scheme. A new \sqrt 3 interpolating subdivision scheme
                 for triangle meshes and a new \sqrt 2 interpolating
                 subdivision scheme for quadrilateral meshes are also
                 presented in the paper by deducing from \sqrt 3
                 subdivision schemes and 4-8 subdivision schemes
                 respectively. They both produce {\em C\/}$^1$
                 continuous limit surfaces and avoid the blemish in the
                 existing interpolating \sqrt 3 and \sqrt 2 subdivision
                 masks where the weight coefficients on extraordinary
                 vertices can not be described by formulation
                 explicitly. In addition, by adding a parameter to
                 control the transition from approximation to
                 interpolation, they can produce surfaces intervening
                 between approximating and interpolating which can be
                 used to solve the `popping effect' problem when
                 switching between meshes at different levels of
                 resolution. They can also force surfaces to interpolate
                 chosen vertices.",
  acknowledgement = ack-nhfb,
  articleno =    "146",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "approximating subdivision; interpolating subdivision",
}

@Article{Huang:2008:SQO,
  author =       "Jin Huang and Muyang Zhang and Jin Ma and Xinguo Liu
                 and Leif Kobbelt and Hujun Bao",
  title =        "Spectral quadrangulation with orientation and
                 alignment control",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "147:1--147:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409100",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents a new quadrangulation algorithm,
                 extending the spectral surface quadrangulation approach
                 where the coarse quadrangular structure is derived from
                 the Morse--Smale complex of an eigenfunction of the
                 Laplacian operator on the input mesh. In contrast to
                 the original scheme, we provide flexible explicit
                 controls of the shape, size, orientation and feature
                 alignment of the quadrangular faces. We achieve this by
                 proper selection of the optimal eigenvalue (shape), by
                 adaption of the area term in the Laplacian operator
                 (size), and by adding special constraints to the
                 Laplace eigenproblem (orientation and alignment). By
                 solving a generalized eigen-problem we can generate a
                 scalar field on the mesh whose Morse--Smale complex is
                 of high quality and satisfies all the user
                 requirements. The final quadrilateral mesh is generated
                 from the Morse--Smale complex by computing a globally
                 smooth parametrization. Here we additionally introduce
                 edge constraints to preserve user specified feature
                 lines accurately.",
  acknowledgement = ack-nhfb,
  articleno =    "147",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "constrained optimization; Laplacian eigenfunctions;
                 quadrangular remeshing",
}

@Article{Daniels:2008:QMS,
  author =       "Joel Daniels and Cl{\'a}udio T. Silva and Jason
                 Shepherd and Elaine Cohen",
  title =        "Quadrilateral mesh simplification",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "148:1--148:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409101",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce a simplification algorithm for meshes
                 composed of quadrilateral elements. It is reminiscent
                 of edge-collapse based methods for triangle meshes, but
                 takes a novel approach to the challenging problem of
                 maintaining the quadrilateral connectivity during
                 level-of-detail creation. The method consists of a set
                 of unit operations applied to the dual of the mesh,
                 each designed to improve mesh structure and maintain
                 topological genus. Geometric shape is maintained by an
                 extension of a quadric error metric to quad meshes. The
                 technique is straightforward to implement and efficient
                 enough to be applied to real-world models. Our
                 technique can handle models with sharp features, and
                 can be used to re-mesh general polygonal, i.e. tri- and
                 quad-dominant, meshes into quadonly meshes.",
  acknowledgement = ack-nhfb,
  articleno =    "148",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Aliaga:2008:VRS,
  author =       "Daniel G. Aliaga and Alvin J. Law and Yu Hong Yeung",
  title =        "A virtual restoration stage for real-world objects",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "149:1--149:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409102",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we introduce a system to virtually
                 restore damaged or historically significant objects
                 without needing to physically change the object in any
                 way. Our work addresses both creating a restored
                 synthetic version of the object as viewed from a camera
                 and projecting the necessary light, using digital
                 projectors, to give the illusion of the object being
                 restored. The restoration algorithm uses an energy
                 minimization method to enforce a set of criteria over
                 the surface of the object and provides an interactive
                 tool to the user which can compute a restoration in a
                 few minutes. The visual compensation method develops a
                 formulation that is particularly concerned with
                 obtaining bright compensations under a specified
                 maximum amount of light. The bound on the amount of
                 light is of crucial importance when viewing and
                 restoring old and potentially fragile objects. Finally,
                 we demonstrate our system by restoring several
                 deteriorated and old objects enabling the observer to
                 view the original or restored object at will.",
  acknowledgement = ack-nhfb,
  articleno =    "149",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "digitization; energy minimization; image completion;
                 light transport; radiometric calibration; restoration",
}

@Article{Bimber:2008:SDR,
  author =       "Oliver Bimber and Daisuke Iwai",
  title =        "Superimposing dynamic range",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "150:1--150:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409103",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a simple and cost-efficient way of
                 extending contrast, perceived tonal resolution, and
                 color space of reflective media, such as paper prints,
                 hardcopy photographs, or electronic paper displays. A
                 calibrated projector-camera system is applied for
                 automatic registration, radiometric scanning and
                 superimposition. A second modulation of the projected
                 light on the surface of such media results in a high
                 dynamic range visualization. This holds application
                 potential for a variety of domains, such as radiology,
                 astronomy, optical microscopy, conservation and
                 restoration of historic art, modern art and
                 entertainment installations.",
  acknowledgement = ack-nhfb,
  articleno =    "150",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "hardcopy image; HDR display; HDR splitting; inverse
                 tone-mapping; luminance quantization; projector-camera
                 system",
}

@Article{Grundhofer:2008:VDV,
  author =       "Anselm Grundh{\"o}fer and Oliver Bimber",
  title =        "{VirtualStudio2Go}: digital video composition for real
                 environments",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "151:1--151:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409104",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We synchronize film cameras and LED lighting with
                 off-the-shelf video projectors. Radiometric
                 compensation allows displaying keying patterns and
                 other spatial codes on arbitrary real world surfaces. A
                 fast temporal multiplexing of coded projection and
                 flash illumination enables professional keying,
                 environment matting, displaying moderator information,
                 scene reconstruction, and camera tracking for
                 non-studio film sets without being limited to the
                 constraints of a virtual studio. This makes digital
                 video composition more flexible, since static studio
                 equipment, such as blue screens, teleprompters, or
                 tracking devices, is not required. Authentic film
                 locations can be supported with our portable system
                 without causing a lot of installation effort.",
  acknowledgement = ack-nhfb,
  articleno =    "151",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "digital video composition; projector-camera systems;
                 radiometric compensation",
}

@Article{Liu:2008:IC,
  author =       "Xiaopei Liu and Liang Wan and Yingge Qu and Tien-Tsin
                 Wong and Stephen Lin and Chi-Sing Leung and Pheng-Ann
                 Heng",
  title =        "Intrinsic colorization",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "152:1--152:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409105",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we present an example-based
                 colorization technique robust to illumination
                 differences between grayscale target and color
                 reference images. To achieve this goal, our method
                 performs color transfer in an illumination-independent
                 domain that is relatively free of shadows and
                 highlights. It first recovers an
                 illumination-independent {\em intrinsic reflectance
                 image\/} of the target scene from multiple color
                 references obtained by web search. The reference images
                 from the web search may be taken from different vantage
                 points, under different illumination conditions, and
                 with different cameras. Grayscale versions of these
                 reference images are then used in decomposing the
                 grayscale target image into its intrinsic reflectance
                 and illumination components. We transfer color from the
                 color reflectance image to the grayscale reflectance
                 image, and obtain the final result by relighting with
                 the illumination component of the target image. We
                 demonstrate via several examples that our method
                 generates results with excellent color consistency.",
  acknowledgement = ack-nhfb,
  articleno =    "152",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "colorization; intrinsic images",
}

@Article{Shan:2008:FIV,
  author =       "Qi Shan and Zhaorong Li and Jiaya Jia and Chi-Keung
                 Tang",
  title =        "Fast image\slash video upsampling",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "153:1--153:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409106",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose a simple but effective upsampling method
                 for automatically enhancing the image/video resolution,
                 while preserving the essential structural information.
                 The main advantage of our method lies in a
                 feedback-control framework which faithfully recovers
                 the high-resolution image information from the input
                 data, {\em without\/} imposing additional local
                 structure constraints learned from other examples. This
                 makes our method independent of the quality and number
                 of the selected examples, which are issues typical of
                 learning-based algorithms, while producing high-quality
                 results without observable unsightly artifacts. Another
                 advantage is that our method naturally extends to video
                 upsampling, where the temporal coherence is maintained
                 automatically. Finally, our method runs very fast. We
                 demonstrate the effectiveness of our algorithm by
                 experimenting with different image/video data.",
  acknowledgement = ack-nhfb,
  articleno =    "153",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "image deconvolution; image/video enhancement;
                 image/video upsampling",
}

@Article{Burns:2008:ACC,
  author =       "Michael Burns and Adam Finkelstein",
  title =        "Adaptive cutaways for comprehensible rendering of
                 polygonal scenes",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "154:1--154:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409107",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In 3D renderings of complex scenes, objects of
                 interest may be occluded by those of secondary
                 importance. Cutaway renderings address this problem by
                 omitting portions of secondary objects so as to expose
                 the objects of interest. This paper introduces a method
                 for generating cutaway renderings of polygonal scenes
                 at interactive frame rates, using illustrative and
                 non-photorealistic rendering cues to expose objects of
                 interest in the context of surrounding objects. We
                 describe a method for creating a view-dependent cutaway
                 shape along with modifications to the polygonal
                 rendering pipeline to create cutaway renderings.
                 Applications for this technique include architectural
                 modeling, path planning, and computer games.",
  acknowledgement = ack-nhfb,
  articleno =    "154",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cutaway diagram; distance transform; NPR; visibility",
}

@Article{Qu:2008:RPM,
  author =       "Yingge Qu and Wai-Man Pang and Tien-Tsin Wong and
                 Pheng-Ann Heng",
  title =        "Richness-preserving manga screening",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "155:1--155:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409108",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Due to the tediousness and labor intensive cost, some
                 manga artists have already employed computer-assisted
                 methods for converting color photographs to manga
                 backgrounds. However, existing bitonal image generation
                 methods usually produce unsatisfactory uniform
                 screening results that are not consistent with
                 traditional mangas, in which the artist employs a rich
                 set of screens. In this paper, we propose a novel
                 method for generating bitonal manga backgrounds from
                 color photographs. Our goal is to preserve the visual
                 richness in the original photograph by utilizing not
                 only screen density, but also the variety of screen
                 patterns. To achieve the goal, we select screens for
                 different regions in order to preserve the tone
                 similarity, texture similarity, and chromaticity
                 distinguishability. The multi-dimensional scaling
                 technique is employed in such a color-to-pattern
                 matching for maintaining pattern dissimilarity of the
                 screens. Users can control the mapping by a few
                 parameters and interactively fine-tune the result.
                 Several results are presented to demonstrate the
                 effectiveness and convenience of the proposed method.",
  acknowledgement = ack-nhfb,
  articleno =    "155",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "manga; multidimensional scaling; non-photorealistic
                 rendering; screening",
}

@Article{Kim:2008:LAI,
  author =       "Yongjin Kim and Jingyi Yu and Xuan Yu and Seungyong
                 Lee",
  title =        "Line-art illustration of dynamic and specular
                 surfaces",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "156:1--156:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409109",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Line-art illustrations are effective tools for
                 conveying shapes and shading of complex objects. We
                 present a set of new algorithms to render line-art
                 illustrations of dynamic and specular (reflective and
                 refractive) surfaces. We first introduce a real-time
                 principal direction estimation algorithm to determine
                 the line stroke directions on dynamic opaque objects
                 using neighboring normal ray triplets. To render
                 reflections or refractions in a line-art style, we
                 develop a stroke direction propagation algorithm by
                 using multi-perspective projections to propagate the
                 stroke directions from the nearby opaque objects onto
                 specular surfaces. Finally, we present an image-space
                 stroke mapping method to draw line strokes using the
                 computed or propagated stroke directions. We implement
                 these algorithms using a GPU and demonstrate real-time
                 illustrations of scenes with dynamic and specular 3D
                 models in line-art styles.",
  acknowledgement = ack-nhfb,
  articleno =    "156",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "dynamic surfaces; hatching; line-art illustration;
                 principal direction; real-time rendering; reflection
                 and refraction",
}

@Article{Kolomenkin:2008:DCS,
  author =       "Michael Kolomenkin and Ilan Shimshoni and Ayellet
                 Tal",
  title =        "Demarcating curves for shape illustration",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "157:1--157:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409110",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Curves on objects can convey the inherent features of
                 the shape. This paper defines a new class of
                 view-independent curves, denoted {\em demarcating
                 curves.\/} In a nutshell, demarcating curves are the
                 loci of the `strongest' inflections on the surface. Due
                 to their appealing capabilities to extract and
                 emphasize 3D textures, they are applied to artifact
                 illustration in archaeology, where they can serve as a
                 worthy alternative to the expensive, time-consuming,
                 and biased manual depiction currently used.",
  acknowledgement = ack-nhfb,
  articleno =    "157",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Merrell:2008:CMS,
  author =       "Paul Merrell and Dinesh Manocha",
  title =        "Continuous model synthesis",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "158:1--158:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409111",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel method for procedurally modeling
                 large complex shapes. Our approach is general-purpose
                 and takes as input any 3D polyhedral model provided by
                 a user. The algorithm exploits the connectivity between
                 the adjacent boundary features of the input model and
                 computes an output model that has similar connected
                 features and resembles the input. No additional user
                 input is needed to guide the model generation and the
                 algorithm proceeds automatically. In practice, our
                 algorithm is simple to implement and can generate a
                 variety of complex shapes representing buildings,
                 landscapes, and 3D fractal shapes in a few minutes.",
  acknowledgement = ack-nhfb,
  articleno =    "158",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "model synthesis; procedural modeling",
}

@Article{Sinha:2008:IAM,
  author =       "Sudipta N. Sinha and Drew Steedly and Richard Szeliski
                 and Maneesh Agrawala and Marc Pollefeys",
  title =        "Interactive {$3$D} architectural modeling from
                 unordered photo collections",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "159:1--159:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409112",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an interactive system for generating
                 photorealistic, textured, piecewise-planar 3D models of
                 architectural structures and urban scenes from
                 unordered sets of photographs. To reconstruct 3D
                 geometry in our system, the user draws outlines
                 overlaid on 2D photographs. The 3D structure is then
                 automatically computed by combining the 2D interaction
                 with the multi-view geometric information recovered by
                 performing structure from motion analysis on the input
                 photographs. We utilize vanishing point constraints at
                 multiple stages during the reconstruction, which is
                 particularly useful for architectural scenes where
                 parallel lines are abundant. Our approach enables us to
                 accurately model polygonal faces from 2D interactions
                 in a single image. Our system also supports useful
                 operations such as edge snapping and
                 extrusions.\par

                 Seamless texture maps are automatically generated by
                 combining multiple input photographs using graph cut
                 optimization and Poisson blending. The user can add
                 brush strokes as hints during the texture generation
                 stage to remove artifacts caused by unmodeled geometric
                 structures. We build models for a variety of
                 architectural scenes from collections of up to about a
                 hundred photographs.",
  acknowledgement = ack-nhfb,
  articleno =    "159",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Aliaga:2008:IEB,
  author =       "Daniel G. Aliaga and Carlos A. Vanegas and
                 Bed{\v{r}}ich Bene{\v{s}}",
  title =        "Interactive example-based urban layout synthesis",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "160:1--160:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409113",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an interactive system for synthesizing
                 urban layouts by example. Our method simultaneously
                 performs both a structure-based synthesis and an
                 image-based synthesis to generate a complete urban
                 layout with a plausible street network and with
                 aerial-view imagery. Our approach uses the structure
                 and image data of real-world urban areas and a
                 synthesis algorithm to provide several high-level
                 operations to easily and interactively generate complex
                 layouts by example. The user can create new urban
                 layouts by a sequence of operations such as join,
                 expand, and blend without being concerned about
                 low-level structural details. Further, the ability to
                 blend example urban layout fragments provides a
                 powerful way to generate new synthetic content. We
                 demonstrate our system by creating urban layouts using
                 example fragments from several real-world cities, each
                 ranging from hundreds to thousands of city blocks and
                 parcels.",
  acknowledgement = ack-nhfb,
  articleno =    "160",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "content-aware image editing; example-based; procedural
                 modeling; texture and image synthesis",
}

@Article{Xiao:2008:IBF,
  author =       "Jianxiong Xiao and Tian Fang and Ping Tan and Peng
                 Zhao and Eyal Ofek and Long Quan",
  title =        "Image-based fa{\c{c}}ade modeling",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "161:1--161:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409114",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose in this paper a semi-automatic image-based
                 approach to fa{\c{c}}ade modeling that uses images
                 captured along streets and relies on structure from
                 motion to recover camera positions and point clouds
                 automatically as the initial stage for modeling. We
                 start by considering a building fa{\c{c}}ade as a flat
                 rectangular plane or a developable surface with an
                 associated texture image composited from the multiple
                 visible images. A fa{\c{c}}ade is then decomposed and
                 structured into a Directed Acyclic Graph of rectilinear
                 elementary patches. The decomposition is carried out
                 top-down by a recursive subdivision, and followed by a
                 bottom-up merging with the detection of the
                 architectural bilateral symmetry and repetitive
                 patterns. Each subdivided patch of the flat
                 fa{\c{c}}ade is augmented with a depth optimized using
                 the 3D points cloud. Our system also allows for an easy
                 user feedback in the 2D image space for the proposed
                 decomposition and augmentation. Finally, our approach
                 is demonstrated on a large number of fa{\c{c}}ades from
                 a variety of street-side images.",
  acknowledgement = ack-nhfb,
  articleno =    "161",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "ade modeling; building modeling; city modeling;
                 fa{\c{c}} image-based modeling; photography",
}

@Article{Thomaszewski:2008:MM,
  author =       "Bernhard Thomaszewski and Andreas Gumann and Simon
                 Pabst and Wolfgang Stra{\ss}er",
  title =        "Magnets in motion",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "162:1--162:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409115",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce magnetic interaction for rigid body
                 simulation. Our approach is based on an equivalent
                 dipole method and as such it is discrete from the
                 ground up. Our approach is symmetric as we base both
                 field and force computations on dipole interactions.
                 Enriching rigid body simulation with magnetism allows
                 for many new and interesting possibilities in computer
                 animation and special effects. Our method also allows
                 the accurate computation of magnetic fields for
                 arbitrarily shaped objects, which is especially
                 interesting for pedagogy as it allows the user to
                 visually discover properties of magnetism which would
                 otherwise be difficult to grasp. We demonstrate our
                 method on a variety of problems and our results reflect
                 intuitive as well as surprising effects. Our method is
                 fast and can be coupled with any rigid body solver to
                 simulate dozens of magnetic objects at interactive
                 rates.",
  acknowledgement = ack-nhfb,
  articleno =    "162",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "magnetic fields and forces; rigid body dynamics",
}

@Article{Barbic:2008:RTC,
  author =       "Jernej Barbi{\v{c}} and Jovan Popovi{\'c}",
  title =        "Real-time control of physically based simulations
                 using gentle forces",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "163:1--163:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409116",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Recent advances have brought real-time physically
                 based simulation within reach, but simulations are
                 still difficult to control in real time. We present
                 interactive simulations of passive systems such as
                 deformable solids or fluids that are not only fast, but
                 also directable: they follow given input trajectories
                 while simultaneously reacting to user input and other
                 unexpected disturbances. We achieve such directability
                 using a real-time controller that runs in tandem with a
                 real-time physically based simulation. To avoid stiff
                 and over-controlled systems where the natural dynamics
                 are overpowered, the injection of control forces has to
                 be minimized. This search for gentle forces can be made
                 tractable in real-time by linearizing the system
                 dynamics around the input trajectory, and then using a
                 time-varying linear quadratic regulator to build the
                 controller. We show examples of controlled complex
                 deformable solids and fluids, demonstrating that our
                 approach generates a requested fixed outcome for
                 reasonable user inputs, while simultaneously providing
                 runtime motion variety.",
  acknowledgement = ack-nhfb,
  articleno =    "163",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "control; deformations; fluids; model reduction;
                 real-time simulation",
}

@Article{Kaufman:2008:SPF,
  author =       "Danny M. Kaufman and Shinjiro Sueda and Doug L. James
                 and Dinesh K. Pai",
  title =        "Staggered projections for frictional contact in
                 multibody systems",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "164:1--164:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409117",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new discrete velocity-level formulation
                 of frictional contact dynamics that reduces to a pair
                 of coupled projections and introduce a simple
                 fixed-point property of this coupled system. This
                 allows us to construct a novel algorithm for accurate
                 frictional contact resolution based on a simple
                 staggered sequence of projections. The algorithm
                 accelerates performance using warm starts to leverage
                 the potentially high temporal coherence between contact
                 states and provides users with direct control over
                 frictional accuracy. Applying this algorithm to rigid
                 and deformable systems, we obtain robust and accurate
                 simulations of frictional contact behavior not
                 previously possible, at rates suitable for interactive
                 haptic simulations, as well as large-scale animations.
                 By construction, the proposed algorithm guarantees
                 exact, velocity-level contact constraint enforcement
                 and obtains long-term stable and robust integration.
                 Examples are given to illustrate the performance,
                 plausibility and accuracy of the obtained solutions.",
  acknowledgement = ack-nhfb,
  articleno =    "164",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "contact; deformation; friction; multibody dynamics",
}

@Article{An:2008:OCE,
  author =       "Steven S. An and Theodore Kim and Doug L. James",
  title =        "Optimizing cubature for efficient integration of
                 subspace deformations",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "165:1--165:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1409060.1409118",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose an efficient scheme for evaluating
                 nonlinear subspace forces (and Jacobians) associated
                 with subspace deformations. The core problem we address
                 is efficient integration of the subspace force density
                 over the 3D spatial domain. Similar to Gaussian
                 quadrature schemes that efficiently integrate functions
                 that lie in particular polynomial subspaces, we propose
                 cubature schemes (multi-dimensional quadrature)
                 optimized for efficient integration of force densities
                 associated with particular subspace deformations,
                 particular materials, and particular geometric domains.
                 We support generic subspace deformation kinematics, and
                 nonlinear hyperelastic materials. For an {\em r\/}
                 -dimensional deformation subspace with {\em O\/} ({\em
                 r\/}) cubature points, our method is able to evaluate
                 sub-space forces at {\em O\/} ({\em r\/}$^2$) cost. We
                 also describe composite cubature rules for runtime
                 error estimation. Results are provided for various
                 subspace deformation models, several hyperelastic
                 materials (St. Venant-Kirchhoff, Mooney-Rivlin,
                 Arruda-Boyce), and multi-modal (graphics, haptics,
                 sound) applications. We show dramatically better
                 efficiency than traditional Monte Carlo integration.",
  acknowledgement = ack-nhfb,
  articleno =    "165",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "dimensional model reduction; dynamic deformations;
                 nonlinear solid mechanics; quadrature; real-time
                 simulation; reduced-order modeling; subspace dynamics;
                 subspace integration",
}

@Article{Narain:2008:FAT,
  author =       "Rahul Narain and Jason Sewall and Mark Carlson and
                 Ming C. Lin",
  title =        "Fast animation of turbulence using energy transport
                 and procedural synthesis",
  journal =      j-TOG,
  volume =       "27",
  number =       "5",
  pages =        "166:1--166:??",
  month =        dec,
  year =         "2008",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1457515.1409119",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Dec 8 14:35:04 MST 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel technique for the animation of
                 turbulent fluids by coupling a procedural turbulence
                 model with a numerical fluid solver to introduce
                 subgrid-scale flow detail. From the large-scale flow
                 simulated by the solver, we model the production and
                 behavior of turbulent energy using a physically
                 motivated energy model. This energy distribution is
                 used to synthesize an incompressible turbulent velocity
                 field, whose features show plausible temporal behavior
                 through a novel Lagrangian approach for advected noise.
                 The synthesized turbulent flow has a dynamical effect
                 on the large-scale flow, and produces visually
                 plausible detailed features on both gaseous and
                 free-surface liquid flows. Our method is an order of
                 magnitude faster than full numerical simulation of
                 equivalent resolution, and requires no manual
                 direction.",
  acknowledgement = ack-nhfb,
  articleno =    "166",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ikemoto:2009:GME,
  author =       "Leslie Ikemoto and Okan Arikan and David Forsyth",
  title =        "Generalizing motion edits with {Gaussian} processes",
  journal =      j-TOG,
  volume =       "28",
  number =       "1",
  pages =        "1:1--1:12",
  month =        jan,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1477926.1477927",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 13 18:22:49 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "One way that artists create compelling character
                 animations is by manipulating details of a character's
                 motion. This process is expensive and repetitive. We
                 show that we can make such motion editing more
                 efficient by generalizing the edits an animator makes
                 on short sequences of motion to other sequences. Our
                 method predicts frames for the motion using Gaussian
                 process models of kinematics and dynamics. These
                 estimates are combined with probabilistic inference.
                 Our method can be used to propagate edits from examples
                 to an entire sequence for an existing character, and it
                 can also be used to map a motion from a control
                 character to a very different target character. The
                 technique shows good generalization. For example, we
                 show that an estimator, learned from a few seconds of
                 edited example animation using our methods, generalizes
                 well enough to edit minutes of character animation in a
                 high-quality fashion. Learning is interactive: An
                 animator who wants to improve the output can provide
                 small, correcting examples and the system will produce
                 improved estimates of motion. We make this interactive
                 learning process efficient and natural with a fast,
                 full-body IK system with novel features. Finally, we
                 present data from interviews with professional
                 character animators that indicate that generalizing and
                 propagating animator edits can save artists significant
                 time and work.",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Artist-guided content creation; controllable motion
                 editing",
}

@Article{Degener:2009:VAA,
  author =       "Patrick Degener and Reinhard Klein",
  title =        "A variational approach for automatic generation of
                 panoramic maps",
  journal =      j-TOG,
  volume =       "28",
  number =       "1",
  pages =        "2:1--2:14",
  month =        jan,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1477926.1477928",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 13 18:22:49 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Panoramic maps combine the advantages of both ordinary
                 geographic maps and terrestrial images. While
                 inheriting the familiar perspective of terrestrial
                 images, they provide a good overview and avoid
                 occlusion of important geographical features. The
                 designer achieves this by skillful choice and
                 integration of several views in a single image. As
                 important features on the surface must be carefully
                 rearranged to guarantee their visibility, the manual
                 design of panoramic maps requires many hours of tedious
                 and painstaking work.\par

                 In this article we take a variational approach to the
                 design of panoramic maps. Starting from conventional
                 elevation data and aerial images, our method fully
                 automatically computes panoramic maps from arbitrary
                 viewpoints. It rearranges geographic structures to
                 maximize the visibility of a specified set of features
                 while minimizing the deformation of the landscape's
                 shape.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cartographic generalization; maximizing visibility;
                 nonphotorealistic rendering; Panoramic map",
}

@Article{Peers:2009:CLT,
  author =       "Pieter Peers and Dhruv K. Mahajan and Bruce Lamond and
                 Abhijeet Ghosh and Wojciech Matusik and Ravi
                 Ramamoorthi and Paul Debevec",
  title =        "Compressive light transport sensing",
  journal =      j-TOG,
  volume =       "28",
  number =       "1",
  pages =        "3:1--3:18",
  month =        jan,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1477926.1477929",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 13 18:22:49 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this article we propose a new framework for
                 capturing light transport data of a real scene, based
                 on the recently developed theory of compressive
                 sensing. Compressive sensing offers a solid
                 mathematical framework to infer a sparse signal from a
                 limited number of nonadaptive measurements. Besides
                 introducing compressive sensing for fast acquisition of
                 light transport to computer graphics, we develop
                 several innovations that address specific challenges
                 for image-based relighting, and which may have broader
                 implications. We develop a novel hierarchical decoding
                 algorithm that improves reconstruction quality by
                 exploiting interpixel coherency relations.
                 Additionally, we design new nonadaptive illumination
                 patterns that minimize measurement noise and further
                 improve reconstruction quality. We illustrate our
                 framework by capturing detailed high-resolution
                 reflectance fields for image-based relighting.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "compressive sensing; Image-based relighting",
}

@Article{Sugerman:2009:GPM,
  author =       "Jeremy Sugerman and Kayvon Fatahalian and Solomon
                 Boulos and Kurt Akeley and Pat Hanrahan",
  title =        "{GRAMPS}: {A} programming model for graphics
                 pipelines",
  journal =      j-TOG,
  volume =       "28",
  number =       "1",
  pages =        "4:1--4:11",
  month =        jan,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1477926.1477930",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 13 18:22:49 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce GRAMPS, a programming model that
                 generalizes concepts from modern real-time graphics
                 pipelines by exposing a model of execution containing
                 both fixed-function and application-programmable
                 processing stages that exchange data via queues. GRAMPS
                 allows the number, type, and connectivity of these
                 processing stages to be defined by software, permitting
                 arbitrary processing pipelines or even processing
                 graphs. Applications achieve high performance using
                 GRAMPS by expressing advanced rendering algorithms as
                 custom pipelines, then using the pipeline as a
                 rendering engine. We describe the design of GRAMPS,
                 then evaluate it by implementing three pipelines, that
                 is, Direct3D, a ray tracer, and a hybridization of the
                 two, and running them on emulations of two different
                 GRAMPS implementations: a traditional GPU-like
                 architecture and a CPU-like multicore architecture. In
                 our tests, our GRAMPS schedulers run our pipelines with
                 500 to 1500KB of queue usage at their peaks.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "GPUs; Graphics pipelines; many-core architectures;
                 parallel programming; stream computing",
}

@Article{Bergner:2009:TCI,
  author =       "Steven Bergner and Mark S. Drew and Torsten
                 M{\"o}ller",
  title =        "A tool to create illuminant and reflectance spectra
                 for light-driven graphics and visualization",
  journal =      j-TOG,
  volume =       "28",
  number =       "1",
  pages =        "5:1--5:11",
  month =        jan,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1477926.1477931",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 13 18:22:49 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Full spectra allow the generation of a physically
                 correct rendering of a scene under different lighting
                 conditions. In this article we devise a tool to augment
                 a palette of given lights and material reflectances
                 with constructed spectra, yielding specified colors or
                 spectral properties such as metamerism or objective
                 color constancy. We utilize this to emphasize or hide
                 parts of a scene by matching or differentiating colors
                 under different illuminations. These color criteria are
                 expressed as a quadratic programming problem, which may
                 be solved with positivity constraints. Further, we
                 characterize full spectra of lights, surfaces, and
                 transmissive materials in an efficient linear subspace
                 model by forming eigenvectors of sets of spectra and
                 transform them to an intermediate space in which
                 spectral interactions reduce to simple component-wise
                 multiplications during rendering. The proposed method
                 enhances the user's freedom in designing
                 photo-realistic scenes and helps in creating expressive
                 visualizations. A key application of our technique is
                 to use specific spectral lighting to scale the visual
                 complexity of a scene by controlling visibility of
                 texture details in surface graphics or material details
                 in volume rendering.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "linear spectral color models; Spectral light and
                 reflectance design",
}

@Article{Choi:2009:FSM,
  author =       "Jaeil Choi and Andrzej Szymczak",
  title =        "Fitting solid meshes to animated surfaces using linear
                 elasticity",
  journal =      j-TOG,
  volume =       "28",
  number =       "1",
  pages =        "6:1--6:10",
  month =        jan,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1477926.1477932",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 13 18:22:49 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Computing correspondence between time frames of a
                 time-dependent 3D surface is essential for the
                 understanding of its motion and deformation. In
                 particular, it can be a useful tool in compression,
                 editing, texturing, or analysis of the physical or
                 structural properties of deforming objects. However,
                 correspondence information is not trivial to obtain for
                 experimentally acquired 3D animations, such as
                 time-dependent visual hulls (typically represented as
                 either a binary occupancy grid or as a sequence of
                 meshes of varying connectivity).\par

                 In this article we present a new nonrigid fitting
                 method that can compute such correspondence information
                 for objects that do not undergo large volume or
                 topological changes, such as living creatures.
                 Experimental results show that it is robust enough to
                 handle visual hull data, allowing to convert it into a
                 constant connectivity mesh with vertices moving in
                 time. Our procedure first creates a rest-state mesh
                 from one of the input frames. This rest-state mesh is
                 then fitted to the consecutive frames. We do this by
                 iteratively displacing its vertices so that a
                 combination of surface distance and elastic potential
                 energy is minimized. A novel rotation compensation
                 method enables us to obtain high-quality results with
                 linear elasticity, even in presence of significant
                 bending.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "deformation; elasticity; finite element methods;
                 fitting; Time-dependent surfaces; tracking",
}

@Article{Fattal:2009:PMI,
  author =       "Raanan Fattal",
  title =        "Participating media illumination using light
                 propagation maps",
  journal =      j-TOG,
  volume =       "28",
  number =       "1",
  pages =        "7:1--7:11",
  month =        jan,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1477926.1477933",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 13 18:22:49 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Light traveling through semi-transparent media such as
                 smoke and marble is absorbed and scattered. To achieve
                 proper realistic visualizations of such media,
                 illumination algorithms must account for these events.
                 In this article, we present a new method for solving
                 the {\em Radiative Transport Equation}, which models
                 such evolution of light. The new method falls into the
                 category of the {\em Discrete Ordinates Method\/} and
                 inherits its generality and computational lightness.
                 This method is known to suffer from two main
                 shortcomings, namely {\em false scattering\/} and the
                 {\em ray effect}, which we avoid in our new method. By
                 propagating the light using low-dimensional maps of
                 rays we detach their transport from the Eulerian grid
                 and use fine angular discretizations. Thus, the
                 scattering effect at each scattering generation is
                 eliminated and the ray effect is significantly reduced
                 at no additional memory requirements. Results
                 demonstrate the new method's efficiency, ability to
                 produce high-quality approximations, and its usefulness
                 for a wide range of computer graphics applications.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "discrete ordinates method; Global illumination; Monte
                 Carlo; participating media; radiosity",
}

@Article{Kikuuwe:2009:EBC,
  author =       "Ryo Kikuuwe and Hiroaki Tabuchi and Motoji Yamamoto",
  title =        "An edge-based computationally efficient formulation of
                 {Saint Venant--Kirchhoff} tetrahedral finite elements",
  journal =      j-TOG,
  volume =       "28",
  number =       "1",
  pages =        "8:1--8:13",
  month =        jan,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1477926.1477934",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 13 18:22:49 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This article describes a computationally efficient
                 formulation and an algorithm for tetrahedral
                 finite-element simulation of elastic objects subject to
                 Saint Venant-Kirchhoff (StVK) material law. The number
                 of floating point operations required by the algorithm
                 is in the range of 15\% to 27\% for computing the
                 vertex forces from a given set of vertex positions, and
                 27\% to 38\% for the tangent stiffness matrix, in
                 comparison to a well-optimized algorithm directly
                 derived from the conventional Total Lagrangian
                 formulation. In the new algorithm, the data is
                 associated with edges and tetrahedron-sharing
                 edge-pairs (TSEPs), as opposed to tetrahedra, to avoid
                 redundant computation. Another characteristic of the
                 presented formulation is that it reduces to that of a
                 spring-network model by simply ignoring all the TSEPs.
                 The technique is demonstrated through an interactive
                 application involving haptic interaction, being
                 combined with a linearized implicit integration
                 technique employing a preconditioned conjugate gradient
                 method.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "deformation; finite element; Green-Lagrange strain;
                 haptics; interactive; Saint Venant-Kirchhoff material;
                 Simulation",
}

@Article{Damera-Venkata:2009:DS,
  author =       "Niranjan Damera-Venkata and Nelson L. Chang",
  title =        "Display supersampling",
  journal =      j-TOG,
  volume =       "28",
  number =       "1",
  pages =        "9:1--9:19",
  month =        jan,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1477926.1477935",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 13 18:22:49 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Supersampling is widely used by graphics hardware to
                 render anti-aliased images. In conventional
                 supersampling, multiple scene samples are
                 computationally combined to produce a single screen
                 pixel. We consider a novel imaging paradigm that we
                 call {\em display supersampling}, where multiple
                 display samples are physically combined via the
                 superimposition of multiple image subframes.
                 Conventional anti-aliasing and texture mapping
                 techniques are shown inadequate for the task of
                 rendering high-quality images on supersampled displays.
                 Instead of requiring anti-aliasing filters,
                 supersampled displays actually require alias generation
                 filters to cancel the aliasing introduced by nonuniform
                 sampling. We present fundamental theory and efficient
                 algorithms for the real-time rendering of
                 high-resolution anti-aliased images on supersampled
                 displays. We show that significant image quality gains
                 are achievable by taking advantage of display
                 supersampling. We prove that alias-free resolution
                 beyond the Nyquist limits of a single subframe may be
                 achieved by designing a bank of alias-canceling
                 rendering filters. In addition, we derive a practical
                 noniterative filter bank approach to real-time
                 rendering and discuss implementations on commodity
                 graphics hardware.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "anti-aliasing; Image display; multiprojector displays;
                 nonuniform sampling; super-resolution; superimposed
                 projection; supersampling",
}

@Article{Jain:2009:OBI,
  author =       "Sumit Jain and Yuting Ye and C. Karen Liu",
  title =        "Optimization-based interactive motion synthesis",
  journal =      j-TOG,
  volume =       "28",
  number =       "1",
  pages =        "10:1--10:12",
  month =        jan,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1477926.1477936",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 13 18:22:49 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a physics-based approach to synthesizing
                 motion of a virtual character in a dynamically varying
                 environment. Our approach views the motion of a
                 responsive virtual character as a sequence of solutions
                 to the constrained optimization problem formulated at
                 every time step. This framework allows the programmer
                 to specify active control strategies using intuitive
                 kinematic goals, significantly reducing the engineering
                 effort entailed in active body control. Our
                 optimization framework can incorporate changes in the
                 character's surroundings through a synthetic visual
                 sensory system and create significantly different
                 motions in response to varying environmental stimuli.
                 Our results show that our approach is general enough to
                 encompass a wide variety of highly interactive
                 motions.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Character animation; nonlinear optimization;
                 physics-based animation",
}

@Article{Kalogerakis:2009:DDC,
  author =       "Evangelos Kalogerakis and Derek Nowrouzezahrai and
                 Patricio Simari and James Mccrae and Aaron Hertzmann
                 and Karan Singh",
  title =        "Data-driven curvature for real-time line drawing of
                 dynamic scenes",
  journal =      j-TOG,
  volume =       "28",
  number =       "1",
  pages =        "11:1--11:13",
  month =        jan,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1477926.1477937",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Feb 13 18:22:49 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This article presents a method for real-time line
                 drawing of deforming objects. Object-space line drawing
                 algorithms for many types of curves, including
                 suggestive contours, highlights, ridges, and valleys,
                 rely on surface curvature and curvature derivatives.
                 Unfortunately, these curvatures and their derivatives
                 cannot be computed in real-time for animated, deforming
                 objects. In a preprocessing step, our method learns the
                 mapping from a low-dimensional set of animation
                 parameters (e.g., joint angles) to surface curvatures
                 for a deforming 3D mesh. The learned model can then
                 accurately and efficiently predict curvatures and their
                 derivatives, enabling real-time object-space rendering
                 of suggestive contours and other such curves. This
                 represents an order-of-magnitude speedup over the
                 fastest existing algorithm capable of estimating
                 curvatures and their derivatives accurately enough for
                 many different types of line drawings. The learned
                 model can generalize to novel animation sequences and
                 is also very compact, typically requiring a few
                 megabytes of storage at runtime. We demonstrate our
                 method for various types of animated objects, including
                 skeleton-based characters, cloth simulation, and
                 blend-shape facial animation, using a variety of
                 nonphotorealistic rendering styles.\par

                 An important component of our system is the use of
                 dimensionality reduction for differential mesh data. We
                 show that Independent Component Analysis (ICA) yields
                 localized basis functions, and gives superior
                 generalization performance to that of Principal
                 Component Analysis (PCA).",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "data-driven curvature; Independent Component Analysis
                 (ICA); neural network regression; Real-time curvature;
                 real-time line drawing; real-time nonphotorealistic
                 rendering for deforming objects",
}

@Article{Weber:2009:CFC,
  author =       "Andrew J. Weber and Galen Gornowicz",
  title =        "Collision-free construction of animated feathers using
                 implicit constraint surfaces",
  journal =      j-TOG,
  volume =       "28",
  number =       "2",
  pages =        "12:1--12:7",
  month =        apr,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1516522.1516523",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed May 13 17:38:56 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a scheme for constructing complex feather
                 geometry suitable for feature animation. The key points
                 of our approach include the use of a potential field
                 derived from guide geometry and an implicit constraint
                 surface to create nonpenetrating feather geometry. Our
                 method is frame independent and produces visually
                 smooth animation that is free from popping and other
                 visual artifacts. We provide details of the
                 implementation and examples of the technique applied to
                 an animated character with several thousand feathers.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; Feathers; implicit surfaces; offset
                 surfaces",
}

@Article{Li:2009:PAS,
  author =       "Qingde Li and Jie Tian",
  title =        "{$2$D} piecewise algebraic splines for implicit
                 modeling",
  journal =      j-TOG,
  volume =       "28",
  number =       "2",
  pages =        "13:1--13:19",
  month =        apr,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1516522.1516524",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed May 13 17:38:56 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "2D splines are a powerful tool for shape modeling,
                 either parametrically or implicitly. However, compared
                 with regular grid-based tensor-product splines, most of
                 the high-dimensional spline techniques based on
                 nonregular 2D polygons, such as box spline and simplex
                 spline, are generally very expensive to evaluate.
                 Though they have many desirable mathematical properties
                 and have been proved theoretically to be powerful in
                 graphics modeling, they are not a convenient graphics
                 modeling technique in terms of practical
                 implementation. In shape modeling practice, we still
                 lack a simple and practical procedure in creating a set
                 of bivariate spline basis functions from an arbitrarily
                 specified 2D polygonal mesh. Solving this problem is of
                 particular importance in using 2D algebraic splines for
                 implicit modeling, as in this situation underlying
                 implicit equations need to be solved quickly and
                 accurately. In this article, a new type of bivariate
                 spline function is introduced. This newly proposed type
                 of bivariate spline function can be created from any
                 given set of 2D polygons that partitions the 2D plane
                 with any required degree of smoothness. In addition,
                 the spline basis functions created with the proposed
                 procedure are piecewise polynomials and can be
                 described explicitly in analytical form. As a result,
                 they can be evaluated efficiently and accurately.
                 Furthermore, they have all the good properties of
                 conventional 2D tensor-product-based B-spline basis
                 functions, such as non-negativity, partition of unit,
                 and convex-hull property. Apart from their obvious use
                 in designing freeform parametric geometric shapes, the
                 proposed 2D splines have been shown a powerful tool for
                 implicit shape modeling.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Algebraic splines; CSG; function-based shape modeling;
                 implicit curve; implicit modeling; implicit surface;
                 isosurface; level set",
}

@Article{Sun:2009:ADT,
  author =       "Bo Sun and Ravi Ramamoorthi",
  title =        "Affine double- and triple-product wavelet integrals
                 for rendering",
  journal =      j-TOG,
  volume =       "28",
  number =       "2",
  pages =        "14:1--14:17",
  month =        apr,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1516522.1516525",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed May 13 17:38:56 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Many problems in computer graphics involve
                 integrations of products of functions. Double- and
                 triple-product integrals are commonly used in
                 applications such as all-frequency relighting or
                 importance sampling, but are limited to distant
                 illumination. In contrast, near-field lighting from
                 planar area lights involves an affine transform of the
                 source radiance at different points in space. Our main
                 contribution is a novel affine double- and
                 triple-product integral theory; this generalization
                 enables one of the product functions to be scaled and
                 translated. We study the computational complexity in a
                 number of bases, with particular attention to the
                 common Haar wavelets. We show that while simple
                 analytic formulae are not easily available, there is
                 considerable sparsity that can be exploited
                 computationally. We demonstrate a practical application
                 to compute near-field lighting from planar area
                 sources, that can be easily combined with most
                 relighting algorithms. We also demonstrate initial
                 results for wavelet importance sampling with near-field
                 area lights, and image processing directly in the
                 wavelet domain.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "double and triple products; image processing;
                 importance sampling; near-field illumination;
                 relighting; Rendering; wavelets",
}

@Article{Wand:2009:ERN,
  author =       "Michael Wand and Bart Adams and Maksim Ovsjanikov and
                 Alexander Berner and Martin Bokeloh and Philipp Jenke
                 and Leonidas Guibas and Hans-Peter Seidel and Andreas
                 Schilling",
  title =        "Efficient reconstruction of nonrigid shape and motion
                 from real-time {$3$D} scanner data",
  journal =      j-TOG,
  volume =       "28",
  number =       "2",
  pages =        "15:1--15:15",
  month =        apr,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1516522.1516526",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed May 13 17:38:56 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new technique for reconstructing a single
                 shape and its nonrigid motion from 3D scanning data.
                 Our algorithm takes a set of time-varying unstructured
                 sample points that capture partial views of a deforming
                 object as input and reconstructs a single shape and a
                 deformation field that fit the data. This
                 representation yields dense correspondences for the
                 whole sequence, as well as a completed 3D shape in
                 every frame. In addition, the algorithm automatically
                 removes spatial and temporal noise artifacts and
                 outliers from the raw input data. Unlike previous
                 methods, the algorithm does not require any shape
                 template but computes a fitting shape automatically
                 from the input data. Our reconstruction framework is
                 based upon a novel topology-aware adaptive subspace
                 deformation technique that allows handling long
                 sequences with complex geometry efficiently. The
                 algorithm accesses data in multiple sequential passes,
                 so that long sequences can be streamed from hard disk,
                 not being limited by main memory. We apply the
                 technique to several benchmark datasets, significantly
                 increasing the complexity of the data that can be
                 handled efficiently in comparison to previous work.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation reconstruction; Deformation modeling;
                 digital geometry processing; surface reconstruction",
}

@Article{Kobilarov:2009:LGI,
  author =       "Marin Kobilarov and Keenan Crane and Mathieu Desbrun",
  title =        "{Lie} group integrators for animation and control of
                 vehicles",
  journal =      j-TOG,
  volume =       "28",
  number =       "2",
  pages =        "16:1--16:14",
  month =        apr,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1516522.1516527",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed May 13 17:38:56 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This article is concerned with the animation and
                 control of vehicles with complex dynamics such as
                 helicopters, boats, and cars. Motivated by recent
                 developments in discrete geometric mechanics, we
                 develop a general framework for integrating the
                 dynamics of holonomic and nonholonomic vehicles by
                 preserving their state-space geometry and motion
                 invariants. We demonstrate that the resulting
                 integration schemes are superior to standard methods in
                 numerical robustness and efficiency, and can be applied
                 to many types of vehicles. In addition, we show how to
                 use this framework in an optimal control setting to
                 automatically compute accurate and realistic motions
                 for arbitrary user-specified constraints.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "holonomic and nonholonomic constraints; Lie group
                 integrators; Physically-based animation; vehicle
                 simulation",
}

@Article{Gomes:2009:BBA,
  author =       "Abel J. P. Gomes and Jos{\'e} F. M. Morgado and Edgar
                 S. Pereira",
  title =        "A {BSP}-based algorithm for dimensionally
                 nonhomogeneous planar implicit curves with topological
                 guarantees",
  journal =      j-TOG,
  volume =       "28",
  number =       "2",
  pages =        "17:1--17:24",
  month =        apr,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1516522.1516528",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed May 13 17:38:56 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Mathematical systems (e.g., Mathematica, Maple,
                 Matlab, and DPGraph) easily plot planar algebraic
                 curves implicitly defined by polynomial functions.
                 However, these systems, and most algorithms found in
                 the literature, cannot draw many implicit curves
                 correctly; in particular, those with singularities
                 (self-intersections, cusps, and isolated points). They
                 do not detect sign-invariant components either, because
                 they use numerical methods based on the Bolzano
                 corollary, that is, they assume that the
                 curve-describing function $f$ flips sign somewhere in a
                 line segment $A--B$ that crosses the curve, or $f(A)
                 \cdot f(B)$.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "binary space partitioning; geometric computing;
                 Implicit curves; numerical algorithms",
}

@Article{Soler:2009:FDF,
  author =       "Cyril Soler and Kartic Subr and Fr{\'e}do Durand and
                 Nicolas Holzschuch and Fran{\c{c}}ois Sillion",
  title =        "{Fourier} depth of field",
  journal =      j-TOG,
  volume =       "28",
  number =       "2",
  pages =        "18:1--18:12",
  month =        apr,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1516522.1516529",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed May 13 17:38:56 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Optical systems used in photography and cinema produce
                 depth-of-field effects, that is, variations of focus
                 with depth. These effects are simulated in image
                 synthesis by integrating incoming radiance at each
                 pixel over the lens aperture. Unfortunately, aperture
                 integration is extremely costly for defocused areas
                 where the incoming radiance has high variance, since
                 many samples are then required for a noise-free Monte
                 Carlo integration. On the other hand, using many
                 aperture samples is wasteful in focused areas where the
                 integrand varies little. Similarly, image sampling in
                 defocused areas should be adapted to the very smooth
                 appearance variations due to blurring. This article
                 introduces an analysis of focusing and depth-of-field
                 in the frequency domain, allowing a practical
                 characterization of a light field's frequency content
                 both for image and aperture sampling. Based on this
                 analysis we propose an adaptive depth-of-field
                 rendering algorithm which optimizes sampling in two
                 important ways. First, image sampling is based on
                 conservative bandwidth prediction and a splatting
                 reconstruction technique ensures correct image
                 reconstruction. Second, at each pixel the variance in
                 the radiance over the aperture is estimated and used to
                 govern sampling. This technique is easily integrated in
                 any sampling-based renderer, and vastly improves
                 performance.",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Depth of field; Fourier analysis of light transport;
                 sampling",
}

@Article{Hasselgren:2009:APT,
  author =       "Jon Hasselgren and Jacob Munkberg and Tomas
                 Akenine-M{\"o}ller",
  title =        "Automatic pre-tessellation culling",
  journal =      j-TOG,
  volume =       "28",
  number =       "2",
  pages =        "19:1--19:10",
  month =        apr,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1516522.1516530",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed May 13 17:38:56 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Graphics processing units supporting tessellation of
                 curved surfaces with displacement mapping exist today.
                 Still, to our knowledge, culling only occurs {\em
                 after\/} tessellation, that is, after the base
                 primitives have been tessellated into triangles. We
                 introduce an algorithm for {\em automatically\/}
                 computing tight positional and normal bounds on the fly
                 for a base primitive. These bounds are derived from an
                 arbitrary vertex shader program, which may include a
                 curved surface evaluation and different types of
                 displacements, for example. The obtained bounds are
                 used for backface, view frustum, and occlusion culling
                 {\em before\/} tessellation. For highly tessellated
                 scenes, we show that up to 80\% of the vertex shader
                 instructions can be avoided, which implies an
                 ``instruction speedup'' of 5\times . Our technique can
                 also be used for offline software rendering.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "culling; hardware; Rasterization; tessellation",
}

@Article{Alexa:2009:IPS,
  author =       "Marc Alexa and Anders Adamson",
  title =        "Interpolatory point set surfaces --- convexity and
                 {Hermite} data",
  journal =      j-TOG,
  volume =       "28",
  number =       "2",
  pages =        "20:1--20:20",
  month =        apr,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1516522.1516531",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed May 13 17:38:56 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Point set surfaces define a (typically) manifold
                 surface from a set of scattered points. The definition
                 involves weighted centroids and a gradient field. The
                 data points are interpolated if singular weight
                 functions are used to define the centroids. While this
                 way of deriving an interpolatory scheme appears
                 natural, we show that it has two deficiencies:
                 Convexity of the input is not preserved and the
                 extension to Hermite data is numerically unstable. We
                 present a generalization of the standard scheme that we
                 call {\em Hermite point set surface}. It allows
                 interpolating, given normal constraints in a stable
                 way. It also yields an intuitive parameter for shape
                 control and preserves convexity in most situations. The
                 analysis of derivatives also leads to a more natural
                 way to define normals, in case they are not supplied
                 with the point data. We conclude by comparing to
                 similar surface definitions.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Hermite data; interpolation; Point-based modeling",
}

@Article{Adams:2009:GKT,
  author =       "Andrew Adams and Natasha Gelfand and Jennifer Dolson
                 and Marc Levoy",
  title =        "{Gaussian} {KD}-trees for fast high-dimensional
                 filtering",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "21:1--21:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531327",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose a method for accelerating a broad class of
                 non-linear filters that includes the bilateral,
                 non-local means, and other related filters. These
                 filters can all be expressed in a similar way: First,
                 assign each value to be filtered a position in some
                 vector space. Then, replace every value with a weighted
                 linear combination of all values, with weights
                 determined by a Gaussian function of distance between
                 the positions. If the values are pixel colors and the
                 positions are ({\em x, y\/}) coordinates, this
                 describes a Gaussian blur. If the positions are instead
                 ({\em x, y, r, g, b\/}) coordinates in a
                 five-dimensional space-color volume, this describes a
                 bilateral filter. If we instead set the positions to
                 local patches of color around the associated pixel,
                 this describes non-local means. We describe a
                 Monte-Carlo kd-tree sampling algorithm that efficiently
                 computes any filter that can be expressed in this way,
                 along with a GPU implementation of this technique. We
                 use this algorithm to implement an accelerated
                 bilateral filter that respects full 3D color distance;
                 accelerated non-local means on single images, volumes,
                 and unaligned bursts of images for denoising; and a
                 fast adaptation of non-local means to geometry. If we
                 have $n$ values to filter, and each is assigned a
                 position in a $d$ -dimensional space, then our space
                 complexity is {\em O(dn\/}) and our time complexity is
                 {\em O(dn\/} log $n$), whereas existing methods are
                 typically either exponential in $d$ or quadratic in
                 $n$.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bilateral filter; denoising; geometry filtering;
                 non-local means",
}

@Article{Fattal:2009:EAW,
  author =       "Raanan Fattal",
  title =        "Edge-avoiding wavelets and their applications",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "22:1--22:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531328",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose a new family of second-generation wavelets
                 constructed using a robust data-prediction lifting
                 scheme. The support of these new wavelets is
                 constructed based on the edge content of the image and
                 avoids having pixels from both sides of an edge.
                 Multi-resolution analysis, based on these new {\em
                 edge-avoiding wavelets}, shows a better decorrelation
                 of the data compared to common linear
                 translation-invariant multi-resolution analyses. The
                 reduced inter-scale correlation allows us to avoid halo
                 artifacts in band-independent multi-scale processing
                 without taking any special precautions. We thus achieve
                 nonlinear data-dependent multi-scale edge-preserving
                 image filtering and processing at computation times
                 which are {\em linear\/} in the number of image pixels.
                 The new wavelets encode, in their shape, the smoothness
                 information of the image at every scale. We use this to
                 derive a new edge-aware interpolation scheme that
                 achieves results, previously computed by solving an
                 inhomogeneous Laplace equation, through an {\em
                 explicit\/} computation. We thus avoid the difficulties
                 in solving large and poorly-conditioned systems of
                 equations.\par

                 We demonstrate the effectiveness of the new wavelet
                 basis for various computational photography
                 applications such as multi-scale dynamic-range
                 compression, edge-preserving smoothing and detail
                 enhancement, and image colorization.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "constraint propagation; data-dependent interpolation;
                 edge-preserving filtering; lifting scheme; wavelets",
}

@Article{Rubinstein:2009:MOM,
  author =       "Michael Rubinstein and Ariel Shamir and Shai Avidan",
  title =        "Multi-operator media retargeting",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "23:1--23:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531329",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Content aware resizing gained popularity lately and
                 users can now choose from a battery of methods to
                 retarget their media. However, no single retargeting
                 operator performs well on all images and all target
                 sizes. In a user study we conducted, we found that
                 users prefer to combine seam carving with cropping and
                 scaling to produce results they are satisfied with.
                 This inspires us to propose an algorithm that combines
                 different operators in an optimal manner. We define a
                 {\em resizing space\/} as a conceptual
                 multi-dimensional space combining several resizing
                 operators, and show how a path in this space defines a
                 sequence of operations to retarget media. We define a
                 new image similarity measure, which we term
                 Bi-Directional Warping (BDW), and use it with a dynamic
                 programming algorithm to find an optimal path in the
                 resizing space. In addition, we show a simple and
                 intuitive user interface allowing users to explore the
                 resizing space of various image sizes interactively.
                 Using key-frames and interpolation we also extend our
                 technique to retarget video, providing the flexibility
                 to use the best combination of operators at different
                 times in the sequence.",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bidirectional warping; media retargeting;
                 multi-operator; resizing space",
}

@Article{Barnes:2009:PRC,
  author =       "Connelly Barnes and Eli Shechtman and Adam Finkelstein
                 and Dan B. Goldman",
  title =        "{PatchMatch}: a randomized correspondence algorithm
                 for structural image editing",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "24:1--24:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531330",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents interactive image editing tools
                 using a new randomized algorithm for quickly finding
                 approximate nearest-neighbor matches between image
                 patches. Previous research in graphics and vision has
                 leveraged such nearest-neighbor searches to provide a
                 variety of high-level digital image editing tools.
                 However, the cost of computing a field of such matches
                 for an entire image has eluded previous efforts to
                 provide interactive performance. Our algorithm offers
                 substantial performance improvements over the previous
                 state of the art (20-100x), enabling its use in
                 interactive editing tools. The key insights driving the
                 algorithm are that some good patch matches can be found
                 via random sampling, and that natural coherence in the
                 imagery allows us to propagate such matches quickly to
                 surrounding areas. We offer theoretical analysis of the
                 convergence properties of the algorithm, as well as
                 empirical and practical evidence for its high quality
                 and performance. This one simple algorithm forms the
                 basis for a variety of tools -- image retargeting,
                 completion and reshuffling -- that can be used together
                 in the context of a high-level image editing
                 application. Finally, we propose additional intuitive
                 constraints on the synthesis process that offer the
                 user a level of control unavailable in previous
                 methods.",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "approximate nearest neighbor; completion; image
                 editing; patch-based synthesis; reshuffling;
                 retargeting",
}

@Article{Vergne:2009:LWE,
  author =       "Romain Vergne and Romain Pacanowski and Pascal Barla
                 and Xavier Granier and Christophe Schlick",
  title =        "Light warping for enhanced surface depiction",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "25:1--25:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531331",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Recent research on the human visual system shows that
                 our perception of object shape relies in part on
                 compression and stretching of the reflected lighting
                 environment onto its surface. We use this property to
                 enhance the shape depiction of 3D objects by locally
                 warping the environment lighting around main surface
                 features. Contrary to previous work, which require
                 specific illumination, material characteristics and/or
                 stylization choices, our approach enhances surface
                 shape without impairing the desired
                 appearance.\par

                 Thanks to our novel local shape descriptor, salient
                 surface features are explicitly extracted in a
                 view-dependent fashion at various scales without the
                 need of any pre-process. We demonstrate our system on a
                 variety of rendering settings, using object materials
                 ranging from diffuse to glossy, to mirror or
                 refractive, with direct or global illumination, and
                 providing styles that range from photorealistic to
                 non-photorealistic. The warping itself is very fast to
                 compute on modern graphics hardware, enabling real-time
                 performance in direct illumination scenarios.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kerr:2009:TEL,
  author =       "William B. Kerr and Fabio Pellacini",
  title =        "Toward evaluating lighting design interface paradigms
                 for novice users",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "26:1--26:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531332",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Lighting design is a complex but fundamental task in
                 computer cinematography, involving the adjustment of
                 light parameters to define final scene appearance. Many
                 user interfaces have been proposed to simplify lighting
                 design. They can be generally categorized in three
                 paradigms: direct light parameter manipulation,
                 indirect light feature manipulation (e.g., shadow
                 dragging), and goal-based optimization of lighting
                 through painting. To this date, no formal evaluation of
                 the relative effectiveness of these paradigms has been
                 performed.\par

                 In this paper, we present a first step toward
                 evaluating the benefits of these three paradigms in the
                 form of a user study with a focus on novice users. 20
                 subjects participated in the experiment by performing
                 various trials on simple scenes with up to 8 point
                 lights, designed to test two lighting tasks: precise
                 adjustment of lighting and the artistic exploration of
                 lighting configurations. We collected objective and
                 subjective data and found that subjects can light well
                 with direct and indirect interfaces, preferring the
                 latter. Paint-based goal specification was found to be
                 significantly worse than the other paradigms,
                 especially since users tend to sketch rather than
                 accurately paint goal images, an input that painting
                 algorithms were not designed for. We also found that
                 given enough time, novices can perform relatively
                 complex lighting tasks, unhindered by geometry or
                 lighting complexity. Finally, we believe that our study
                 will impact the design of future lighting interfaces
                 and it will serve as the basis for designing additional
                 experiments to reach a comprehensive evaluation of
                 lighting interfaces.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kim:2009:MHC,
  author =       "Min H. Kim and Tim Weyrich and Jan Kautz",
  title =        "Modeling human color perception under extended
                 luminance levels",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "27:1--27:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531333",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Display technology is advancing quickly with peak
                 luminance increasing significantly, enabling
                 high-dynamic-range displays. However, perceptual color
                 appearance under extended luminance levels has not been
                 studied, mainly due to the unavailability of
                 psychophysical data. Therefore, we conduct a
                 psychophysical study in order to acquire appearance
                 data for many different luminance levels (up to 16,860
                 cd/m$^2$) covering most of the dynamic range of the
                 human visual system. These experimental data allow us
                 to quantify human color perception under extended
                 luminance levels, yielding a generalized color
                 appearance model. Our proposed appearance model is
                 efficient, accurate and invertible. It can be used to
                 adapt the tone and color of images to different dynamic
                 ranges for cross-media reproduction while maintaining
                 appearance that is close to human perception.",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "color appearance; color reproduction; psychophysics",
}

@Article{Cole:2009:HWD,
  author =       "Forrester Cole and Kevin Sanik and Doug DeCarlo and
                 Adam Finkelstein and Thomas Funkhouser and Szymon
                 Rusinkiewicz and Manish Singh",
  title =        "How well do line drawings depict shape?",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "28:1--28:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531334",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper investigates the ability of sparse line
                 drawings to depict 3D shape. We perform a study in
                 which people are shown an image of one of twelve 3D
                 objects depicted with one of six styles and asked to
                 orient a gauge to coincide with the surface normal at
                 many positions on the object's surface. The normal
                 estimates are compared with each other and with ground
                 truth data provided by a registered 3D surface model to
                 analyze accuracy and precision. The paper describes the
                 design decisions made in collecting a large data set
                 (275,000 gauge measurements) and provides analysis to
                 answer questions about how well people interpret shapes
                 from drawings. Our findings suggest that people
                 interpret certain shapes almost as well from a line
                 drawing as from a shaded image, that current computer
                 graphics line drawing techniques can effectively depict
                 shape and even match the effectiveness of artist's
                 drawings, and that errors in depiction are often
                 localized and can be traced to particular properties of
                 the lines used. The data collected for this study will
                 become a publicly available resource for further
                 studies of this type.",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "line drawings; non-photorealism; shape perception",
}

@Article{Wang:2009:KNM,
  author =       "Jiaping Wang and Yue Dong and Xin Tong and Zhouchen
                 Lin and Baining Guo",
  title =        "Kernel {Nystr{\"o}m} method for light transport",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "29:1--29:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531335",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose a kernel Nystr{\{"}o}m method for
                 reconstructing the light transport matrix from a
                 relatively small number of acquired images. Our work is
                 based on the generalized Nystr{\{"}o}m method for low
                 rank matrices. We introduce the light transport kernel
                 and incorporate it into the Nystr{\{"}o}m method to
                 exploit the nonlinear coherence of the light transport
                 matrix. We also develop an adaptive scheme for
                 efficiently capturing the sparsely sampled images from
                 the scene. Our experiments indicate that the kernel
                 Nystr{\{"}o}m method can achieve good reconstruction of
                 the light transport matrix with a few hundred images
                 and produce high quality relighting results. The kernel
                 Nystr{\{"}o}m method is effective for modeling scenes
                 with complex lighting effects and occlusions which have
                 been challenging for existing techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Donner:2009:EBM,
  author =       "Craig Donner and Jason Lawrence and Ravi Ramamoorthi
                 and Toshiya Hachisuka and Henrik Wann Jensen and Shree
                 Nayar",
  title =        "An empirical {BSSRDF} model",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "30:1--30:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531336",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new model of the homogeneous BSSRDF based
                 on large-scale simulations. Our model captures the
                 appearance of materials that are not accurately
                 represented using existing single scattering models or
                 multiple isotropic scattering models (e.g. the
                 diffusion approximation). We use an analytic function
                 to model the 2D hemispherical distribution of exitant
                 light at a point on the surface, and a table of
                 parameter values of this function computed at uniformly
                 sampled locations over the remaining dimensions of the
                 BSSRDF domain. This analytic function is expressed in
                 elliptic coordinates and has six parameters which vary
                 smoothly with surface position, incident angle, and the
                 underlying optical properties of the material (albedo,
                 mean free path length, phase function and the relative
                 index of refraction). Our model agrees well with
                 measured data, and is compact, requiring only 250MB to
                 represent the full spatial- and angular-distribution of
                 light across a wide spectrum of materials. In practice,
                 rendering a single material requires only about 100KB
                 to represent the BSSRDF.",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Song:2009:SRE,
  author =       "Ying Song and Xin Tong and Fabio Pellacini and Pieter
                 Peers",
  title =        "{SubEdit}: a representation for editing measured
                 heterogeneous subsurface scattering",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "31:1--31:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531337",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper we present {\em SubEdit}, a
                 representation for editing the BSSRDF of heterogeneous
                 subsurface scattering acquired from real-world samples.
                 Directly editing measured raw data is difficult due to
                 the non-local impact of heterogeneous subsurface
                 scattering on the appearance. Our {\em SubEdit\/}
                 representation decouples these non-local effects into
                 the product of two local scattering profiles defined at
                 respectively the incident and outgoing surface
                 locations. This allows users to directly manipulate the
                 appearance of single surface locations and to robustly
                 make selections. To further facilitate editing, we
                 reparameterize the scattering profiles into the local
                 appearance concepts of albedo, scattering range, and
                 profile shape. Our method preserves the visual quality
                 of the measured material after editing by maintaining
                 the consistency of subsurface transport for all edits.
                 {\em SubEdit\/} fits measured data well while remaining
                 efficient enough to support interactive rendering and
                 manipulation. We illustrate the suitability of {\em
                 SubEdit\/} as a representation for editing by applying
                 various complex modifications on a wide variety of
                 measured heterogeneous subsurface scattering
                 materials.",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Weyrich:2009:FMC,
  author =       "Tim Weyrich and Pieter Peers and Wojciech Matusik and
                 Szymon Rusinkiewicz",
  title =        "Fabricating microgeometry for custom surface
                 reflectance",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "32:1--32:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531338",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose a system for manufacturing physical
                 surfaces that, in aggregate, exhibit a desired surface
                 appearance. Our system begins with a user specification
                 of a BRDF, or simply a highlight shape, and infers the
                 required distribution of surface slopes. We sample this
                 distribution, optimize for a maximally-continuous and
                 valley-minimizing height field, and finally mill the
                 surface using a computer-controlled machine tool. We
                 demonstrate a variety of surfaces, ranging from
                 reproductions of measured BRDFs to materials with
                 unconventional highlights.",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Gal:2009:IAE,
  author =       "Ran Gal and Olga Sorkine and Niloy J. Mitra and Daniel
                 Cohen-Or",
  title =        "{iWIRES}: an analyze-and-edit approach to shape
                 manipulation",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "33:1--33:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531339",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Man-made objects are largely dominated by a few
                 typical features that carry special characteristics and
                 engineered meanings. State-of-the-art deformation tools
                 fall short at preserving such characteristic features
                 and global structure. We introduce iWIRES, a novel
                 approach based on the argument that man-made models can
                 be distilled using a few special 1D {\em wires\/} and
                 their mutual relations. We hypothesize that maintaining
                 the properties of such a small number of wires allows
                 preserving the defining characteristics of the entire
                 object. We introduce an {\em analyze-and-edit\/}
                 approach, where prior to editing, we perform a
                 light-weight analysis of the input shape to extract a
                 descriptive set of wires. Analyzing the individual and
                 mutual properties of the wires, and augmenting them
                 with geometric attributes makes them intelligent and
                 ready to be manipulated. Editing the object by
                 modifying the intelligent wires leads to a powerful
                 editing framework that retains the original design
                 intent and object characteristics. We show numerous
                 results of manipulation of man-made shapes using our
                 editing technique.",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "constraint propagation; man-made objects; mesh
                 editing; space deformation; structured deformation",
}

@Article{Ben-Chen:2009:VHM,
  author =       "Mirela Ben-Chen and Ofir Weber and Craig Gotsman",
  title =        "Variational harmonic maps for space deformation",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "34:1--34:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531340",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "A space deformation is a mapping from a source region
                 to a target region within Euclidean space, which best
                 satisfies some user-specified constraints. It can be
                 used to deform shapes embedded in the ambient space and
                 represented in various forms -- polygon meshes, point
                 clouds or volumetric data. For a space deformation
                 method to be useful, it should possess some natural
                 properties: e.g. detail preservation, smoothness and
                 intuitive control. A harmonic map from a domain \omega
                 {\subset} {\em R\/}$^{$d$}$ to {\em R\/}$^{{\em d\/}}$
                 is a mapping whose $d$ components are harmonic
                 functions. Harmonic mappings are smooth and regular,
                 and if their components are coupled in some special
                 way, the mapping can be detail-preserving, making it a
                 natural choice for space deformation applications. The
                 challenge is to find a harmonic mapping of the domain,
                 which will satisfy constraints specified by the user,
                 yet also be detail-preserving, and intuitive to
                 control. We generate harmonic mappings as a linear
                 combination of a set of harmonic basis functions, which
                 have a closed-form expression when the source region
                 boundary is piecewise linear. This is done by defining
                 an energy functional of the mapping, and minimizing it
                 within the linear span of these basis functions. The
                 resulting mapping is harmonic, and a natural
                 `As-Rigid-As-Possible' deformation of the source
                 region. Unlike other space deformation methods, our
                 approach does not require an explicit discretization of
                 the domain. It is shown to be much more efficient, yet
                 generate comparable deformations to state-of-the-art
                 methods. We describe an optimization algorithm to
                 minimize the deformation energy, which is robust,
                 provably convergent, and easy to implement.",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "harmonic maps; shape editing; space deformation",
}

@Article{Xu:2009:JAM,
  author =       "Weiwei Xu and Jun Wang and KangKang Yin and Kun Zhou
                 and Michiel van de Panne and Falai Chen and Baining
                 Guo",
  title =        "Joint-aware manipulation of deformable models",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "35:1--35:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531341",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Complex mesh models of man-made objects often consist
                 of multiple components connected by various types of
                 joints. We propose a joint-aware deformation framework
                 that supports the direct manipulation of an arbitrary
                 mix of rigid and deformable components. First we apply
                 slippable motion analysis to automatically detect
                 multiple types of joint constraints that are implicit
                 in model geometry. For single-component geometry or
                 models with disconnected components, we support
                 user-defined virtual joints. Then we integrate
                 manipulation handle constraints, multiple components,
                 joint constraints, joint limits, and deformation
                 energies into a single volumetric-cell-based space
                 deformation problem. An iterative, parallelized
                 Gauss--Newton solver is used to solve the resulting
                 nonlinear optimization. Interactive deformable
                 manipulation is demonstrated on a variety of geometric
                 models while automatically respecting their
                 multi-component nature and the natural behavior of
                 their joints.",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "inverse kinematics; joint constraint; slippable
                 motions; space deformation",
}

@Article{Baran:2009:SDT,
  author =       "Ilya Baran and Daniel Vlasic and Eitan Grinspun and
                 Jovan Popovi{\'c}",
  title =        "Semantic deformation transfer",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "36:1--36:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531342",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Transferring existing mesh deformation from one
                 character to another is a simple way to accelerate the
                 laborious process of mesh animation. In many cases, it
                 is useful to preserve the semantic characteristics of
                 the motion instead of its literal deformation. For
                 example, when applying the walking motion of a human to
                 a flamingo, the knees should bend in the opposite
                 direction. Semantic deformation transfer accomplishes
                 this task with a shape space that enables interpolation
                 and projection with standard linear algebra. Given
                 several example mesh pairs, semantic deformation
                 transfer infers a correspondence between the shape
                 spaces of the two characters. This enables automatic
                 transfer of new poses and animations.",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; deformation; rigging",
}

@Article{Zheng:2009:HF,
  author =       "Changxi Zheng and Doug L. James",
  title =        "Harmonic fluids",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "37:1--37:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531343",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Fluid sounds, such as splashing and pouring, are
                 ubiquitous and familiar but we lack physically based
                 algorithms to synthesize them in computer animation or
                 interactive virtual environments. We propose a
                 practical method for automatic procedural synthesis of
                 synchronized harmonic bubble-based sounds from 3D fluid
                 animations. To avoid audio-rate time-stepping of
                 compressible fluids, we acoustically augment existing
                 incompressible fluid solvers with particle-based models
                 for bubble creation, vibration, advection, and
                 radiation. Sound radiation from harmonic fluid
                 vibrations is modeled using a time-varying linear
                 superposition of bubble oscillators. We weight each
                 oscillator by its bubble-to-ear acoustic transfer
                 function, which is modeled as a discrete Green's
                 function of the Helmholtz equation. To solve
                 potentially millions of 3D Helmholtz problems, we
                 propose a fast dual-domain multipole boundary-integral
                 solver, with cost linear in the complexity of the fluid
                 domain's boundary. Enhancements are proposed for robust
                 evaluation, noise elimination, acceleration, and
                 parallelization. Examples are provided for water drops,
                 pouring, babbling, and splashing phenomena, often with
                 thousands of acoustic bubbles, and hundreds of
                 thousands of transfer function solves.",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "acoustic bubbles; acoustic transfer; sound synthesis",
}

@Article{Mullen:2009:EPI,
  author =       "Patrick Mullen and Keenan Crane and Dmitry Pavlov and
                 Yiying Tong and Mathieu Desbrun",
  title =        "Energy-preserving integrators for fluid animation",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "38:1--38:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531344",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Numerical viscosity has long been a problem in fluid
                 animation. Existing methods suffer from intrinsic
                 artificial dissipation and often apply complicated
                 computational mechanisms to combat such effects.
                 Consequently, dissipative behavior cannot be controlled
                 or modeled explicitly in a manner independent of time
                 step size, complicating the use of coarse previews and
                 adaptive-time stepping methods. This paper proposes
                 simple, unconditionally stable, fully Eulerian
                 integration schemes with no numerical viscosity that
                 are capable of maintaining the liveliness of fluid
                 motion without recourse to corrective devices. Pressure
                 and fluxes are solved efficiently and simultaneously in
                 a time-reversible manner on simplicial grids, and the
                 energy is preserved exactly over long time scales in
                 the case of inviscid fluids. These integrators can be
                 viewed as an extension of the classical
                 energy-preserving Harlow-Welch / Crank--Nicolson scheme
                 to simplicial grids.",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "energy preservation; Eulerian fluid animation; time
                 integration",
}

@Article{Wicke:2009:MBF,
  author =       "Martin Wicke and Matt Stanton and Adrien Treuille",
  title =        "Modular bases for fluid dynamics",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "39:1--39:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531345",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new approach to fluid simulation that
                 balances the speed of model reduction with the
                 flexibility of grid-based methods. We construct a set
                 of composable reduced models, or {\em tiles}, which
                 capture spatially localized fluid behavior. We then
                 precompute coupling terms so that these models can be
                 rearranged at runtime. To enforce consistency between
                 tiles, we introduce {\em constraint reduction}. This
                 technique modifies a reduced model so that a given set
                 of linear constraints can be fulfilled. Because
                 dynamics and constraints can be solved entirely in the
                 reduced space, our method is extremely fast and scales
                 to large domains.",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "constraint reduction; domain decomposition; fluid
                 simulation; reduced models",
}

@Article{Solenthaler:2009:PCI,
  author =       "B. Solenthaler and R. Pajarola",
  title =        "Predictive-corrective incompressible {SPH}",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "40:1--40:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531346",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel, incompressible fluid simulation
                 method based on the Lagrangian {\em Smoothed Particle
                 Hydrodynamics\/} (SPH) model. In our method,
                 incompressibility is enforced by using a
                 prediction-correction scheme to determine the particle
                 pressures. For this, the information about density
                 fluctuations is actively propagated through the fluid
                 and pressure values are updated until the targeted
                 density is satisfied. With this approach, we avoid the
                 computational expenses of solving a pressure Poisson
                 equation, while still being able to use large time
                 steps in the simulation. The achieved results show that
                 our {\em predictive-corrective incompressible\/} SPH
                 (PCISPH) method clearly outperforms the commonly used
                 {\em weakly compressible\/} SPH (WCSPH) model by more
                 than an order of magnitude while the computations are
                 in good agreement with the WCSPH results.",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "fluid simulation; incompressibility; SPH",
}

@Article{Horvath:2009:DHR,
  author =       "Christopher Horvath and Willi Geiger",
  title =        "Directable, high-resolution simulation of fire on the
                 {GPU}",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "41:1--41:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531347",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The simulation of believable, photorealistic fire is
                 difficult because fire is highly detailed, fast-moving,
                 and turbulent. Traditional gridbased simulation models
                 require large grids and long simulation times to
                 capture even the coarsest levels of detail. In this
                 paper, we propose a novel combination of coarse
                 particle grid simulation with very fine, view-oriented
                 refinement simulations performed on a GPU. We also
                 propose a simple, GPU-based volume rendering scheme.
                 The resulting images of fire produced by the proposed
                 techniques are extremely detailed and can be integrated
                 seamlessly into film-resolution images.\par

                 Our refinement technique takes advantage of perceptive
                 limitations and likely viewing behavior to split the
                 refinement stage into separable, parallel tasks.
                 Multiple independent GPUs are employed to rapidly
                 refine final simulations for rendering, allowing for
                 rapid artist turnaround time and very high
                 resolutions.\par

                 Directability is achieved by allowing virtually any
                 user-defined particle behavior as an input to the
                 initial coarse simulation. The physical criteria
                 enforced by the coarse stage are minimal and could be
                 easily implemented using any of the wide variety of
                 commercially available fluid simulation tools. The GPU
                 techniques utilized by our refinement stage are simple
                 and widely available on even consumer-grade GPUs,
                 lowering the overall implementation cost of the
                 proposed system.",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "fire; GPU; particles; simulation",
}

@Article{Mahajan:2009:MGP,
  author =       "Dhruv Mahajan and Fu-Chung Huang and Wojciech Matusik
                 and Ravi Ramamoorthi and Peter Belhumeur",
  title =        "Moving gradients: a path-based method for plausible
                 image interpolation",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "42:1--42:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531348",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We describe a method for plausible interpolation of
                 images, with a wide range of applications like temporal
                 up-sampling for smooth playback of lower frame rate
                 video, smooth view interpolation, and animation of
                 still images. The method is based on the intuitive
                 idea, that a given pixel in the interpolated frames
                 traces out a {\em path\/} in the source images.
                 Therefore, we simply move and copy pixel gradients from
                 the input images along this path. A key innovation is
                 to allow arbitrary (asymmetric) {\em transition
                 points}, where the path moves from one image to the
                 other. This flexible transition preserves the frequency
                 content of the originals without ghosting or blurring,
                 and maintains temporal coherence. Perhaps most
                 importantly, our framework makes occlusion handling
                 particularly simple. The transition points allow for
                 matches away from the occluded regions, at any suitable
                 point along the path. Indeed, occlusions do not need to
                 be handled explicitly at all in our initial graph-cut
                 optimization. Moreover, a simple comparison of computed
                 path lengths {\em after\/} the optimization, allows us
                 to robustly identify occluded regions, and compute the
                 most plausible interpolation in those areas. Finally,
                 we show that significant improvements are obtained by
                 moving gradients and using Poisson reconstruction.",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "3D Poisson reconstruction; interpolation; occlusion
                 handling; path framework; transition point",
}

@Article{Carroll:2009:OCP,
  author =       "Robert Carroll and Maneesh Agrawal and Aseem
                 Agarwala",
  title =        "Optimizing content-preserving projections for
                 wide-angle images",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "43:1--43:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531349",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Any projection of a 3D scene into a wide-angle image
                 unavoidably results in distortion. Current projection
                 methods either bend straight lines in the scene, or
                 locally distort the shapes of scene objects. We present
                 a method that minimizes this distortion by adapting the
                 projection to content in the scene, such as salient
                 scene regions and lines, in order to preserve their
                 shape. Our optimization technique computes a
                 spatially-varying projection that respects
                 user-specified constraints while minimizing a set of
                 energy terms that measure wide-angle image distortion.
                 We demonstrate the effectiveness of our approach by
                 showing results on a variety of wide-angle photographs,
                 as well as comparisons to standard projections.",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Liu:2009:CPW,
  author =       "Feng Liu and Michael Gleicher and Hailin Jin and Aseem
                 Agarwala",
  title =        "Content-preserving warps for {$3$D} video
                 stabilization",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "44:1--44:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531350",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We describe a technique that transforms a video from a
                 hand-held video camera so that it appears as if it were
                 taken with a directed camera motion. Our method adjusts
                 the video to appear as if it were taken from nearby
                 viewpoints, allowing 3D camera movements to be
                 simulated. By aiming only for perceptual plausibility,
                 rather than accurate reconstruction, we are able to
                 develop algorithms that can effectively recreate
                 dynamic scenes from a single source video. Our
                 technique first recovers the original 3D camera motion
                 and a sparse set of 3D, static scene points using an
                 off-the-shelf structure-from-motion system. Then, a
                 desired camera path is computed either automatically
                 (e.g., by fitting a linear or quadratic path) or
                 interactively. Finally, our technique performs a
                 least-squares optimization that computes a
                 spatially-varying warp from each input video frame into
                 an output frame. The warp is computed to both follow
                 the sparse displacements suggested by the recovered 3D
                 structure, {\em and\/} avoid deforming the content in
                 the video frame. Our experiments on stabilizing
                 challenging videos of dynamic scenes demonstrate the
                 effectiveness of our technique.",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tzur:2009:FPT,
  author =       "Yochay Tzur and Ayellet Tal",
  title =        "{FlexiStickers}: photogrammetric texture mapping using
                 casual images",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "45:1--45:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531351",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Texturing 3D models using casual images has gained
                 importance in the last decade, with the advent of huge
                 databases of images. We present a novel approach for
                 performing this task, which manages to account for the
                 3D geometry of the photographed object. Our method
                 overcomes the limitation of both the
                 constrained-parameterization approach, which does not
                 account for the photography effects, and the
                 photogrammetric approach, which cannot handle arbitrary
                 images. The key idea of our algorithm is to formulate
                 the mapping estimation as a Moving-Least-Squares
                 problem for recovering local camera parameters at each
                 vertex. The algorithm is realized in a {\em
                 FlexiStickers\/} application, which enables fast
                 interactive texture mapping using a small number of
                 constraints.",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Cashman:2009:NEP,
  author =       "Thomas J. Cashman and Ursula H. Augsd{\"o}rfer and
                 Neil A. Dodgson and Malcolm A. Sabin",
  title =        "{NURBS} with extraordinary points: high-degree,
                 non-uniform, rational subdivision schemes",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "46:1--46:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531352",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a subdivision framework that adds
                 extraordinary vertices to NURBS of arbitrarily high
                 degree. The surfaces can represent any odd degree NURBS
                 patch exactly. Our rules handle non-uniform knot
                 vectors, and are not restricted to midpoint knot
                 insertion. In the absence of multiple knots at
                 extraordinary points, the limit surfaces have bounded
                 curvature.",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Schollmeyer:2009:DTN,
  author =       "Andre Schollmeyer and Bernd Fr{\"o}hlich",
  title =        "Direct trimming of {NURBS} surfaces on the {GPU}",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "47:1--47:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531353",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents a highly efficient direct trimming
                 technique for NURBS surfaces, which is applicable to
                 tessellation-based rendering as well as ray tracing
                 systems. The central idea is to split the trim curves
                 into monotonic segments with respect to the two
                 parameter dimensions of the surface patches. We use an
                 optimized bisection method to classify a point with
                 respect to each monotonic trim curve segment without
                 performing an actual intersection test. Our
                 hierarchical acceleration structure allows the use of a
                 large number of such curve segments and performs the
                 bisection method only for points contained in the
                 bounding boxes of the curve segments.\par

                 We have integrated our novel point classification
                 scheme into a GPU-based NURBS ray casting system and
                 implemented the entire trimmed NURBS rendering
                 algorithm in a single OpenGL GLSL shader. The shader
                 can handle surfaces and trim curves of arbitrary
                 degrees, which allows the use of original CAD data
                 without incorporating any approximations. Performance
                 data confirms that our trimming approach can deal with
                 hundreds of thousands of trim curves at interactive
                 rates. Our point classification scheme can be applied
                 to other application domains dealing with complex
                 curved regions including flood fills, font rendering
                 and vector graphics mapped on arbitrary surfaces.",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "parametric surfaces; point classification;
                 programmable graphics hardware; ray casting; root
                 finding; trimmed NURBS",
}

@Article{Myles:2009:BCP,
  author =       "Ashish Myles and J{\"o}rg Peters",
  title =        "Bi-3 {$C^2$} polar subdivision",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "48:1--48:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531354",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Popular subdivision algorithms like Catmull--Clark and
                 Loop are $C^2$ almost everywhere, but suffer from shape
                 artifacts and reduced smoothness exactly near the
                 so-called `extraordinary vertices' that motivate their
                 use. Subdivision theory explains that inherently, for
                 standard stationary subdivision algorithms,
                 curvature-continuity and the ability to model all
                 quadratic shapes requires a degree of at least bi-6.
                 The existence of a simple-to-implement $C^2$
                 subdivision algorithm generating surfaces of good shape
                 and piecewise degree bi-3 in the polar setting is
                 therefore a welcome surprise. This paper presents such
                 an algorithm, the underlying insights, and a detailed
                 analysis. In bi-3 $C^2$ polar subdivision the weights
                 depend, as in standard schemes, only on the valence,
                 but the valence at one central polar vertex increases
                 to match Catmull--Clark-refinement.",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "bi-3; bicubic; C 2; curvature continuous;
                 non-stationary; polar; subdivision; surface",
}

@Article{vanWijk:2009:STC,
  author =       "Jarke J. van Wijk",
  title =        "Symmetric tiling of closed surfaces: visualization of
                 regular maps",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "49:1--49:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531355",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "A regular map is a tiling of a closed surface into
                 faces, bounded by edges that join pairs of vertices,
                 such that these elements exhibit a maximal symmetry.
                 For genus 0 and 1 (spheres and tori) it is well known
                 how to generate and present regular maps, the Platonic
                 solids are a familiar example. We present a method for
                 the generation of space models of regular maps for
                 genus 2 and higher. The method is based on a
                 generalization of the method for tori. Shapes with the
                 proper genus are derived from regular maps by
                 tubification: edges are replaced by tubes.
                 Tessellations are produced using group theory and
                 hyperbolic geometry. The main results are a generic
                 procedure to produce such tilings, and a collection of
                 intriguing shapes and images. Furthermore, we show how
                 to produce shapes of genus 2 and higher with a highly
                 regular structure.",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "mathematical visualization; meshes; regular maps;
                 surface topology; tessellation; tiling",
}

@Article{Kaufmann:2009:ETD,
  author =       "Peter Kaufmann and Sebastian Martin and Mario Botsch
                 and Eitan Grinspun and Markus Gross",
  title =        "Enrichment textures for detailed cutting of shells",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "50:1--50:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531356",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a method for simulating highly detailed
                 cutting and fracturing of thin shells using
                 low-resolution simulation meshes. Instead of refining
                 or remeshing the underlying simulation domain to
                 resolve complex cut paths, we adapt the extended finite
                 element method (XFEM) and enrich our approximation by
                 customdesigned basis functions, while keeping the
                 simulation mesh unchanged. The enrichment functions are
                 stored in {\em enrichment textures}, which allows for
                 fracture and cutting discontinuities at a resolution
                 much finer than the underlying mesh, similar to image
                 textures for increased visual resolution. Furthermore,
                 we propose {\em harmonic enrichment functions\/} to
                 handle multiple, intersecting, arbitrarily shaped,
                 progressive cuts per element in a simple and unified
                 framework. Our underlying shell simulation is based on
                 discontinuous Galerkin (DG) FEM, which relaxes the
                 restrictive requirement of {\em C\/}$^1$ continuous
                 basis functions and thus allows for simpler, {\em
                 C\/}$^0$ continuous XFEM enrichment functions.",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kharevych:2009:NCI,
  author =       "Lily Kharevych and Patrick Mullen and Houman Owhadi
                 and Mathieu Desbrun",
  title =        "Numerical coarsening of inhomogeneous elastic
                 materials",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "51:1--51:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531357",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose an approach for efficiently simulating
                 elastic objects made of non-homogeneous, non-isotropic
                 materials. Based on recent developments in
                 homogenization theory, a methodology is introduced to
                 approximate a deformable object made of arbitrary fine
                 structures of various linear elastic materials with a
                 dynamically-similar coarse model. This numerical
                 coarsening of the material properties allows for
                 simulation of fine, heterogeneous structures on very
                 coarse grids while capturing the proper dynamics of the
                 original dynamical system, thus saving orders of
                 magnitude in computational time. Examples including
                 inhomogeneous and/or anisotropic materials can be
                 realistically simulated in realtime with a
                 numerically-coarsened model made of a few mesh
                 elements.",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "homogenization; model coarsening; model reduction",
}

@Article{Nesme:2009:PTE,
  author =       "Matthieu Nesme and Paul G. Kry and Lenka
                 Je{\v{r}}{\'a}bkov{\'a} and Fran{\c{c}}ois Faure",
  title =        "Preserving topology and elasticity for embedded
                 deformable models",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "52:1--52:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531358",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper we introduce a new approach for the
                 embedding of linear elastic deformable models. Our
                 technique results in significant improvements in the
                 efficient physically based simulation of highly
                 detailed objects. First, our embedding takes into
                 account topological details, that is, disconnected
                 parts that fall into the same coarse element are
                 simulated independently. Second, we account for the
                 varying material properties by computing stiffness and
                 interpolation functions for coarse elements which
                 accurately approximate the behaviour of the embedded
                 material. Finally, we also take into account empty
                 space in the coarse embeddings, which provides a better
                 simulation of the boundary. The result is a
                 straightforward approach to simulating complex
                 deformable models with the ease and speed associated
                 with a coarse regular embedding, and with a quality of
                 detail that would only be possible at much finer
                 resolution.",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; embedded deformation; finite element
                 method; heterogeneous materials; simulation",
}

@Article{Barbic:2009:DOA,
  author =       "Jernej Barbi{\v{c}} and Marco da Silva and Jovan
                 Popovi{\'c}",
  title =        "Deformable object animation using reduced optimal
                 control",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "53:1--53:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531359",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Keyframe animation is a common technique to generate
                 animations of deformable characters and other soft
                 bodies. With spline interpolation, however, it can be
                 difficult to achieve secondary motion effects such as
                 plausible dynamics when there are thousands of degrees
                 of freedom to animate. Physical methods can provide
                 more realism with less user effort, but it is
                 challenging to apply them to quickly create {\em
                 specific\/} animations that closely follow prescribed
                 animator goals. We present a fast space-time
                 optimization method to author physically based
                 deformable object simulations that conform to
                 animator-specified keyframes. We demonstrate our method
                 with FEM deformable objects and mass-spring
                 systems.\par

                 Our method minimizes an objective function that
                 penalizes the sum of keyframe deviations plus the
                 deviation of the trajectory from physics. With existing
                 methods, such minimizations operate in high dimensions,
                 are slow, memory consuming, and prone to local minima.
                 We demonstrate that significant computational speedups
                 and robustness improvements can be achieved if the
                 optimization problem is properly solved in a
                 low-dimensional space. Selecting a low-dimensional
                 space so that the intent of the animator is
                 accommodated, and that at the same time space-time
                 optimization is convergent and fast, is difficult. We
                 present a method that generates a quality
                 low-dimensional space using the given keyframes. It is
                 then possible to find quality solutions to difficult
                 space-time optimization problems robustly and in a
                 manner of minutes.",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "control; deformations; keyframes; model reduction;
                 space-time",
}

@Article{Lagae:2009:PNU,
  author =       "Ares Lagae and Sylvain Lefebvre and George Drettakis
                 and Philip Dutr{\'e}",
  title =        "Procedural noise using sparse {Gabor} convolution",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "54:1--54:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531360",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Noise is an essential tool for texturing and modeling.
                 Designing interesting textures with noise calls for
                 accurate spectral control, since noise is best
                 described in terms of spectral content. Texturing
                 requires that noise can be easily mapped to a surface,
                 while high-quality rendering requires anisotropic
                 filtering. A noise function that is procedural and fast
                 to evaluate offers several additional advantages.
                 Unfortunately, no existing noise combines all of these
                 properties.\par

                 In this paper we introduce a noise based on sparse
                 convolution and the Gabor kernel that enables all of
                 these properties. Our noise offers accurate spectral
                 control with intuitive parameters such as orientation,
                 principal frequency and bandwidth. Our noise supports
                 two-dimensional and solid noise, but we also introduce
                 setup-free surface noise. This is a method for mapping
                 noise onto a surface, complementary to solid noise,
                 that maintains the appearance of the noise pattern
                 along the object and does not require a texture
                 parameterization. Our approach requires only a few
                 bytes of storage, does not use discretely sampled data,
                 and is nonperiodic. It supports anisotropy and
                 anisotropic filtering. We demonstrate our noise using
                 an interactive tool for noise design.",
  acknowledgement = ack-nhfb,
  articleno =    "54",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "noise; procedural texture; rendering; shading",
}

@Article{McDonnell:2009:ECC,
  author =       "Rachel McDonnell and Mich{\'e}al Larkin and
                 Benjam{\'\i}n Hern{\'a}ndez and Isaac Rudomin and Carol
                 O'Sullivan",
  title =        "Eye-catching crowds: saliency based selective
                 variation",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "55:1--55:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531361",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Populated virtual environments need to be simulated
                 with as much variety as possible. By identifying the
                 most salient parts of the scene and characters,
                 available resources can be concentrated where they are
                 needed most. In this paper, we investigate which body
                 parts of virtual characters are most looked at in
                 scenes containing duplicate characters or {\em clones}.
                 Using an eye-tracking device, we recorded fixations on
                 body parts while participants were asked to indicate
                 whether clones were present or not. We found that the
                 head and upper torso attract the majority of first
                 fixations in a scene and are attended to most. This is
                 true regardless of the orientation, presence or absence
                 of motion, sex, age, size, and clothing style of the
                 character. We developed a selective variation method to
                 exploit this knowledge and perceptually validated our
                 method. We found that selective colour variation is as
                 effective at generating the illusion of variety as full
                 colour variation. We then evaluated the effectiveness
                 of four variation methods that varied only salient
                 parts of the characters. We found that head
                 accessories, top texture and face texture variation are
                 all equally effective at creating variety, whereas
                 facial geometry alterations are less so. Performance
                 implications and guidelines are presented.",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "crowd rendering; eye-tracking; virtual humans",
}

@Article{Wang:2009:EBH,
  author =       "Lvdi Wang and Yizhou Yu and Kun Zhou and Baining Guo",
  title =        "Example-based hair geometry synthesis",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "56:1--56:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531362",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an example-based approach to hair modeling
                 because creating hairstyles either manually or through
                 image-based acquisition is a costly and time-consuming
                 process. We introduce a hierarchical hair synthesis
                 framework that views a hairstyle both as a 3D vector
                 field and a 2D arrangement of hair strands on the
                 scalp. Since hair forms wisps, a hierarchical hair
                 clustering algorithm has been developed for detecting
                 wisps in example hairstyles. The coarsest level of the
                 output hairstyle is synthesized using traditional 2D
                 texture synthesis techniques. Synthesizing finer levels
                 of the hierarchy is based on cluster oriented detail
                 transfer. Finally, we compute a discrete tangent vector
                 field from the synthesized hair at every level of the
                 hierarchy to remove undesired inconsistencies among
                 hair trajectories. Improved hair trajectories can be
                 extracted from the vector field. Based on our automatic
                 hair synthesis method, we have also developed simple
                 user-controlled synthesis and editing techniques
                 including feature-preserving combing as well as detail
                 transfer between different hairstyles.",
  acknowledgement = ack-nhfb,
  articleno =    "56",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "detail transfer; hair clustering; hair modeling;
                 texture synthesis; vector fields",
}

@Article{Mohammed:2009:VLG,
  author =       "Umar Mohammed and Simon J. D. Prince and Jan Kautz",
  title =        "Visio-lization: generating novel facial images",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "57:1--57:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531363",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Our goal is to generate novel realistic images of
                 faces using a model trained from real examples. This
                 model consists of two components: First we consider
                 face images as samples from a texture with spatially
                 varying statistics and describe this texture with a
                 local non-parametric model. Second, we learn a
                 parametric global model of all of the pixel values. To
                 generate realistic faces, we combine the strengths of
                 both approaches and condition the local non-parametric
                 model on the global parametric model. We demonstrate
                 that with appropriate choice of local and global models
                 it is possible to reliably generate new realistic face
                 images that do not correspond to any individual in the
                 training data. We extend the model to cope with
                 considerable intra-class variation (pose and
                 illumination). Finally, we apply our model to editing
                 real facial images: we demonstrate image in-painting,
                 interactive techniques for improving synthesized images
                 and modifying facial expressions.",
  acknowledgement = ack-nhfb,
  articleno =    "57",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "face; non-parametric sampling; texture synthesis",
}

@Article{Palubicki:2009:SOT,
  author =       "Wojciech Palubicki and Kipp Horel and Steven Longay
                 and Adam Runions and Brendan Lane and Radom{\'\i}r
                 M{\v{e}}ch and Przemyslaw Prusinkiewicz",
  title =        "Self-organizing tree models for image synthesis",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "58:1--58:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531364",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a method for generating realistic models of
                 temperate-climate trees and shrubs. This method is
                 based on the biological hypothesis that the form of a
                 developing tree emerges from a self-organizing process
                 dominated by the competition of buds and branches for
                 light or space, and regulated by internal signaling
                 mechanisms. Simulations of this process robustly
                 generate a wide range of realistic trees and bushes.
                 The generated forms can be controlled with a variety of
                 interactive techniques, including procedural brushes,
                 sketching, and editing operations such as pruning and
                 bending of branches. We illustrate the usefulness and
                 versatility of the proposed method with diverse tree
                 models, forest scenes, animations of tree development,
                 and examples of combined interactive-procedural tree
                 modeling.",
  acknowledgement = ack-nhfb,
  articleno =    "58",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "apical control; bud fate; emergence; generative tree
                 model; interactive-procedural modeling; tree
                 development",
}

@Article{Liu:2009:DMG,
  author =       "C. Karen Liu",
  title =        "Dextrous manipulation from a grasping pose",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "59:1--59:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531365",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper introduces an optimization-based approach
                 to synthesizing hand manipulations from a starting
                 grasping pose. We describe an automatic method that
                 takes as input an initial grasping pose and partial
                 object trajectory, and produces as output physically
                 plausible hand animation that effects the desired
                 manipulation. In response to different dynamic
                 situations during manipulation, our algorithm can
                 generate a range of possible hand manipulations
                 including changes in joint configurations, changes in
                 contact points, and changes in the grasping force.
                 Formulating hand manipulation as an optimization
                 problem is key to our algorithm's ability to generate a
                 large repertoire of hand motions from limited user
                 input. We introduce an objective function that
                 accentuates the detailed hand motion and contacts
                 adjustment. Furthermore, we describe an optimization
                 method that solves for hand motion and contacts
                 efficiently while taking into account long-term
                 planning of contact forces. Our algorithm does not
                 require any tuning of parameters, nor does it require
                 any prescribed hand motion sequences.",
  acknowledgement = ack-nhfb,
  articleno =    "59",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "character animation; physics-based animation",
}

@Article{Wampler:2009:OGF,
  author =       "Kevin Wampler and Zoran Popovi{\'c}",
  title =        "Optimal gait and form for animal locomotion",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "60:1--60:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531366",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a fully automatic method for generating
                 gaits and morphologies for legged animal locomotion.
                 Given a specific animal's shape we can determine an
                 efficient gait with which it can move. Similarly, we
                 can also adapt the animal's morphology to be optimal
                 for a specific locomotion task. We show that
                 determining such gaits is possible without the need to
                 specify a good initial motion, and without manually
                 restricting the allowed gaits of each animal. Our
                 approach is based on a hybrid optimization method which
                 combines an efficient derivative-aware spacetime
                 constraints optimization with a derivative-free
                 approach able to find non-local solutions in
                 high-dimensional discontinuous spaces. We demonstrate
                 the effectiveness of this approach by synthesizing
                 dynamic locomotions of bipeds, a quadruped, and an
                 imaginary five-legged creature.",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; character dynamics; gait; spacetime
                 optimization",
}

@Article{Ishigaki:2009:PBC,
  author =       "Satoru Ishigaki and Timothy White and Victor B. Zordan
                 and C. Karen Liu",
  title =        "Performance-based control interface for character
                 animation",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "61:1--61:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531367",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Most game interfaces today are largely symbolic,
                 translating simplified input such as keystrokes into
                 the choreography of full-body character movement. In
                 this paper, we describe a system that directly uses
                 human motion performance to provide a radically
                 different, and much more expressive interface for
                 controlling virtual characters. Our system takes a data
                 feed from a motion capture system as input, and in
                 real-time translates the performance into corresponding
                 actions in a virtual world. The difficulty with such an
                 approach arises from the need to manage the discrepancy
                 between the real and virtual world, leading to two
                 important subproblems (1) recognizing the user's
                 intention, and (2) simulating the appropriate action
                 based on the intention and virtual context. We solve
                 this issue by first enabling the virtual world's
                 designer to specify possible activities in terms of
                 prominent features of the world along with associated
                 motion clips depicting interactions. We then integrate
                 the prerecorded motions with online performance and
                 dynamic simulation to synthesize seamless interaction
                 of the virtual character in a simulated virtual world.
                 The result is a flexible interface through which a user
                 can make freeform control choices while the resulting
                 character motion maintains both physical realism and
                 the user's personal style.",
  acknowledgement = ack-nhfb,
  articleno =    "61",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "character animation; motion capture",
}

@Article{McAdams:2009:DPC,
  author =       "Aleka McAdams and Andrew Selle and Kelly Ward and
                 Eftychios Sifakis and Joseph Teran",
  title =        "Detail preserving continuum simulation of straight
                 hair",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "62:1--62:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531368",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Hair simulation remains one of the most challenging
                 aspects of creating virtual characters. Most research
                 focuses on handling the massive geometric complexity of
                 hundreds of thousands of interacting hairs. This is
                 accomplished either by using brute force simulation or
                 by reducing degrees of freedom with guide hairs. This
                 paper presents a hybrid Eulerian/Lagrangian approach to
                 handling both self and body collisions with hair
                 efficiently while still maintaining detail. Bulk
                 interactions and hair volume preservation is handled
                 efficiently and effectively with a FLIP based fluid
                 solver while intricate hair-hair interaction is handled
                 with Lagrangian self-collisions. Thus the method has
                 the efficiency of continuum/guide based hair models
                 with the high detail of Lagrangian self-collision
                 approaches.",
  acknowledgement = ack-nhfb,
  articleno =    "62",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "continuum models; hair simulation",
}

@Article{Wang:2009:RTH,
  author =       "Robert Y. Wang and Jovan Popovi{\'c}",
  title =        "Real-time hand-tracking with a color glove",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "63:1--63:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531369",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Articulated hand-tracking systems have been widely
                 used in virtual reality but are rarely deployed in
                 consumer applications due to their price and
                 complexity. In this paper, we propose an easy-to-use
                 and inexpensive system that facilitates 3-D articulated
                 user-input using the hands. Our approach uses a single
                 camera to track a hand wearing an ordinary cloth glove
                 that is imprinted with a custom pattern. The pattern is
                 designed to simplify the pose estimation problem,
                 allowing us to employ a nearest-neighbor approach to
                 track hands at interactive rates. We describe several
                 proof-of-concept applications enabled by our system
                 that we hope will provide a foundation for new
                 interactions in modeling, animation control and
                 augmented reality.",
  acknowledgement = ack-nhfb,
  articleno =    "63",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "augmented reality; hand tracking; motion capture; user
                 interface",
}

@Article{Jones:2009:AEC,
  author =       "Andrew Jones and Magnus Lang and Graham Fyffe and
                 Xueming Yu and Jay Busch and Ian McDowall and Mark
                 Bolas and Paul Debevec",
  title =        "Achieving eye contact in a one-to-many {$3$D} video
                 teleconferencing system",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "64:1--64:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531370",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a set of algorithms and an associated
                 display system capable of producing correctly rendered
                 eye contact between a three-dimensionally transmitted
                 remote participant and a group of observers in a 3D
                 teleconferencing system. The participant's face is
                 scanned in 3D at 30Hz and transmitted in real time to
                 an autostereoscopic horizontal-parallax 3D display,
                 displaying him or her over more than a 180^\circ field
                 of view observable to multiple observers. To render the
                 geometry with correct perspective, we create a fast
                 vertex shader based on a 6D lookup table for projecting
                 3D scene vertices to a range of subject angles,
                 heights, and distances. We generalize the projection
                 mathematics to arbitrarily shaped display surfaces,
                 which allows us to employ a curved concave display
                 surface to focus the high speed imagery to individual
                 observers. To achieve two-way eye contact, we capture
                 2D video from a cross-polarized camera reflected to the
                 position of the virtual participant's eyes, and display
                 this 2D video feed on a large screen in front of the
                 real participant, replicating the viewpoint of their
                 virtual self. To achieve correct vertical perspective,
                 we further leverage this image to track the position of
                 each audience member's eyes, allowing the 3D display to
                 render correct vertical perspective for each of the
                 viewers around the device. The result is a one-to-many
                 3D teleconferencing system able to reproduce the
                 effects of gaze, attention, and eye contact generally
                 missing in traditional teleconferencing systems.",
  acknowledgement = ack-nhfb,
  articleno =    "64",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Rosenberg:2009:UIM,
  author =       "Ilya Rosenberg and Ken Perlin",
  title =        "The {UnMousePad}: an interpolating multi-touch
                 force-sensing input pad",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "65:1--65:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531371",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Recently, there has been great interest in multi-touch
                 interfaces. Such devices have taken the form of
                 camera-based systems such as Microsoft Surface [de los
                 Reyes et al. 2007] and Perceptive Pixel's FTIR Display
                 [Han 2005] as well as hand-held devices using
                 capacitive sensors such as the Apple iPhone [Jobs et
                 al. 2008]. However, optical systems are inherently
                 bulky while most capacitive systems are only practical
                 in small form factors and are limited in their
                 application since they respond only to human touch and
                 are insensitive to variations in pressure [Westerman
                 1999].\par

                 We have created the UnMousePad, a flexible and
                 inexpensive multitouch input device based on a newly
                 developed pressure-sensing principle called
                 Interpolating Force Sensitive Resistance. IFSR sensors
                 can acquire high-quality anti-aliased pressure images
                 at high frame rates. They can be paper-thin, flexible,
                 and transparent and can easily be scaled to fit on a
                 portable device or to cover an entire table, floor or
                 wall. The UnMousePad can sense three orders of
                 magnitude of pressure variation, and can be used to
                 distinguish multiple fingertip touches while
                 simultaneously tracking pens and styli with a
                 positional accuracy of 87 dpi, and can sense the
                 pressure distributions of objects placed on its
                 surface.\par

                 In addition to supporting multi-touch interaction, IFSR
                 is a general pressure imaging technology that can be
                 incorporated into shoes, tennis racquets, hospital
                 beds, factory assembly lines and many other
                 applications. The ability to measure high-quality
                 pressure images at low cost has the potential to
                 dramatically improve the way that people interact with
                 machines and the way that machines interact with the
                 world.",
  acknowledgement = ack-nhfb,
  articleno =    "65",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "FSR; IFSR; input devices; mobile and personal devices;
                 multi-touch devices; sensors",
}

@Article{Grabler:2009:GPM,
  author =       "Floraine Grabler and Maneesh Agrawala and Wilmot Li
                 and Mira Dontcheva and Takeo Igarashi",
  title =        "Generating photo manipulation tutorials by
                 demonstration",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "66:1--66:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531372",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a demonstration-based system for
                 automatically generating succinct step-by-step visual
                 tutorials of photo manipulations. An author first
                 demonstrates the manipulation using an instrumented
                 version of GIMP that records all changes in interface
                 and application state. From the example recording, our
                 system automatically generates tutorials that
                 illustrate the manipulation using images, text, and
                 annotations. It leverages automated image labeling
                 (recognition of facial features and outdoor scene
                 structures in our implementation) to generate more
                 precise text descriptions of many of the steps in the
                 tutorials. A user study comparing our automatically
                 generated tutorials to hand-designed tutorials and
                 screen-capture video recordings finds that users are
                 20--44\% faster and make 60--95\% fewer errors using
                 our tutorials. While our system focuses on tutorial
                 generation, we also present some initial work on
                 generating content-dependent macros that use image
                 recognition to automatically transfer selection
                 operations from the example image used in the
                 demonstration to new target images. While our macros
                 are limited to transferring selection operations we
                 demonstrate automatic transfer of several common
                 retouching techniques including eye recoloring,
                 whitening teeth and sunset enhancement.",
  acknowledgement = ack-nhfb,
  articleno =    "66",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "macros; photo-editing; programming-by-demonstration;
                 tutorials",
}

@Article{Farbman:2009:CII,
  author =       "Zeev Farbman and Gil Hoffer and Yaron Lipman and
                 Daniel Cohen-Or and Dani Lischinski",
  title =        "Coordinates for instant image cloning",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "67:1--67:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531373",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Seamless cloning of a source image patch into a target
                 image is an important and useful image editing
                 operation, which has received considerable research
                 attention in recent years. This operation is typically
                 carried out by solving a Poisson equation with
                 Dirichlet boundary conditions, which smoothly
                 interpolates the discrepancies between the boundary of
                 the source patch and the target across the entire
                 cloned area. In this paper we introduce an alternative,
                 {\em coordinate-based\/} approach, where rather than
                 solving a large linear system to perform the
                 aforementioned interpolation, the value of the
                 interpolant at each interior pixel is given by a
                 weighted combination of values along the boundary. More
                 specifically, our approach is based on Mean-Value
                 Coordinates (MVC). The use of coordinates is
                 advantageous in terms of speed, ease of implementation,
                 small memory footprint, and parallelizability, enabling
                 real-time cloning of large regions, and interactive
                 cloning of video streams. We demonstrate a number of
                 applications and extensions of the coordinate-based
                 framework.",
  acknowledgement = ack-nhfb,
  articleno =    "67",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "gradient domain; image editing; matting; mean-value
                 coordinates; Poisson equation; seamless cloning;
                 stitching",
}

@Article{Tao:2009:SAB,
  author =       "Litian Tao and Lu Yuan and Jian Sun",
  title =        "{SkyFinder}: attribute-based sky image search",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "68:1--68:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531374",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we present SkyFinder, an interactive
                 search system of over a half million sky images
                 downloaded from the Internet. Using a set of
                 automatically extracted, semantic {\em sky
                 attributes\/} (category, layout, richness, horizon,
                 etc.), the user can find a desired sky image, such as
                 `a landscape with rich clouds at sunset' or `a whole
                 blue sky with white clouds'. The system is fully
                 automatic and scalable. It computes all sky attributes
                 offline, then provides an interactive online search
                 engine. Moreover, we build a sky graph based on the sky
                 attributes, so that the user can smoothly explore and
                 find a path within the space of skies. We also show how
                 our system can be used for controllable sky
                 replacement.",
  acknowledgement = ack-nhfb,
  articleno =    "68",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Liu:2009:PS,
  author =       "Jiangyu Liu and Jian Sun and Heung-Yeung Shum",
  title =        "Paint selection",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "69:1--69:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531375",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we present Paint Selection, a
                 progressive painting-based tool for local selection in
                 images. Paint Selection facilitates users to
                 progressively make a selection by roughly painting the
                 object of interest using a brush. More importantly,
                 Paint Selection is efficient enough that instant
                 feedback can be provided to users as they drag the
                 mouse. We demonstrate that high quality selections can
                 be quickly and effectively `painted' on a variety of
                 multi-megapixel images.",
  acknowledgement = ack-nhfb,
  articleno =    "69",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "image segmentation; user interface",
}

@Article{Bai:2009:VSR,
  author =       "Xue Bai and Jue Wang and David Simons and Guillermo
                 Sapiro",
  title =        "{Video SnapCut}: robust video object cutout using
                 localized classifiers",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "70:1--70:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531376",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Although tremendous success has been achieved for
                 interactive object cutout in still images, accurately
                 extracting dynamic objects in video remains a very
                 challenging problem. Previous video cutout systems
                 present two major limitations: (1) reliance on global
                 statistics, thus lacking the ability to deal with
                 complex and diverse scenes; and (2) treating
                 segmentation as a global optimization, thus lacking a
                 practical workflow that can guarantee the convergence
                 of the systems to the desired results.\par

                 We present {\em Video SnapCut}, a robust video object
                 cutout system that significantly advances the
                 state-of-the-art. In our system segmentation is
                 achieved by the collaboration of a set of local
                 classifiers, each adaptively integrating multiple local
                 image features. We show how this segmentation paradigm
                 naturally supports local user editing and propagates
                 them across time. The object cutout system is completed
                 with a novel coherent video matting technique. A
                 comprehensive evaluation and comparison is presented,
                 demonstrating the effectiveness of the proposed system
                 at achieving high quality results, as well as the
                 robustness of the system against various types of
                 inputs.",
  acknowledgement = ack-nhfb,
  articleno =    "70",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Tagliasacchi:2009:CSE,
  author =       "Andrea Tagliasacchi and Hao Zhang and Daniel
                 Cohen-Or",
  title =        "Curve skeleton extraction from incomplete point
                 cloud",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "71:1--71:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531377",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an algorithm for curve skeleton extraction
                 from imperfect point clouds where large portions of the
                 data may be missing. Our construction is primarily
                 based on a novel notion of generalized {\em rotational
                 symmetry axis\/} (ROSA) of an oriented point set.
                 Specifically, given a subset {\em S\/} of oriented
                 points, we introduce a variational definition for an
                 oriented point that is most rotationally symmetric with
                 respect to {\em S}. Our formulation effectively
                 utilizes normal information to compensate for the
                 missing data and leads to robust curve skeleton
                 computation over regions of a shape that are generally
                 cylindrical. We present an iterative algorithm via
                 planar cuts to compute the ROSA of a point cloud. This
                 is complemented by special handling of non-cylindrical
                 joint regions to obtain a centered, topologically
                 clean, and complete 1D skeleton. We demonstrate that
                 quality curve skeletons can be extracted from a variety
                 of shapes captured by incomplete point clouds. Finally,
                 we show how our algorithm assists in shape completion
                 under these challenges by developing a skeleton-driven
                 point cloud completion scheme.",
  acknowledgement = ack-nhfb,
  articleno =    "71",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "curve skeleton; incomplete data; rotational symmetry",
}

@Article{Lipman:2009:MVS,
  author =       "Yaron Lipman and Thomas Funkhouser",
  title =        "{M{\"o}bius} voting for surface correspondence",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "72:1--72:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531378",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The goal of our work is to develop an efficient,
                 automatic algorithm for discovering point
                 correspondences between surfaces that are approximately
                 and/or partially isometric.\par

                 Our approach is based on three observations. First,
                 isometries are a subset of the M{\{"}o}bius group,
                 which has low-dimensionality -- six degrees of freedom
                 for topological spheres, and three for topological
                 discs. Second, computing the M{\{"}o}bius
                 transformation that interpolates any three points can
                 be computed in closed-form after a mid-edge flattening
                 to the complex plane. Third, deviations from isometry
                 can be modeled by a transportation-type distance
                 between corresponding points in that
                 plane.\par

                 Motivated by these observations, we have developed a
                 M{\{"}o}bius Voting algorithm that iteratively: (1)
                 samples a triplet of three random points from each of
                 two point sets, (2) uses the M{\{"}o}bius
                 transformations defined by those triplets to map both
                 point sets into a canonical coordinate frame on the
                 complex plane, and (3) produces `votes' for predicted
                 correspondences between the mutually closest points
                 with magnitude representing their estimated deviation
                 from isometry. The result of this process is a fuzzy
                 correspondence matrix, which is converted to a
                 permutation matrix with simple matrix operations and
                 output as a discrete set of point correspondences with
                 confidence values.\par

                 The main advantage of this algorithm is that it can
                 find intrinsic point correspondences in cases of
                 extreme deformation. During experiments with a variety
                 of data sets, we find that it is able to find dozens of
                 point correspondences between different object types in
                 different poses fully automatically.",
  acknowledgement = ack-nhfb,
  articleno =    "72",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Chen:2009:BMS,
  author =       "Xiaobai Chen and Aleksey Golovinskiy and Thomas
                 Funkhouser",
  title =        "A benchmark for {$3$D} mesh segmentation",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "73:1--73:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531379",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper describes a benchmark for evaluation of 3D
                 mesh segmentation algorithms. The benchmark comprises a
                 data set with 4,300 manually generated segmentations
                 for 380 surface meshes of 19 different object
                 categories, and it includes software for analyzing 11
                 geometric properties of segmentations and producing 4
                 quantitative metrics for comparison of segmentations.
                 The paper investigates the design decisions made in
                 building the benchmark, analyzes properties of
                 human-generated and computer-generated segmentations,
                 and provides quantitative comparisons of 7 recently
                 published mesh segmentation algorithms. Our results
                 suggest that people are remarkably consistent in the
                 way that they segment most 3D surface meshes, that no
                 one automatic segmentation algorithm is better than the
                 others for all types of objects, and that algorithms
                 based on non-local shape features seem to produce
                 segmentations that most closely resemble ones made by
                 humans.",
  acknowledgement = ack-nhfb,
  articleno =    "73",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "3D mesh analysis; 3D mesh segmentation",
}

@Article{Tang:2009:IHD,
  author =       "Min Tang and Minkyoung Lee and Young J. Kim",
  title =        "Interactive {Hausdorff} distance computation for
                 general polygonal models",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "74:1--74:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531380",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a simple algorithm to compute the Hausdorff
                 distance between complicated, polygonal models at
                 interactive rates. The algorithm requires no
                 assumptions about the underlying topology and geometry.
                 To avoid the high computational and implementation
                 complexity of exact Hausdorff distance calculation, we
                 approximate the Hausdorff distance within a
                 user-specified error bound. The main ingredient of our
                 approximation algorithm is a novel polygon subdivision
                 scheme, called {\em Voronoi subdivision}, combined with
                 culling between the models based on bounding volume
                 hierarchy (BVH). This {\em cross-culling\/} method
                 relies on tight yet simple computation of bounds on the
                 Hausdorff distance, and it discards unnecessary polygon
                 pairs from each of the input models alternatively based
                 on the distance bounds. This algorithm can approximate
                 the Hausdorff distance between polygonal models
                 consisting of tens of thousands triangles with a small
                 error bound in real-time, and outperforms the existing
                 algorithm by more than an order of magnitude. We apply
                 our Hausdorff distance algorithm to the measurement of
                 shape similarity, and the computation of penetration
                 depth for physically-based animation. In particular,
                 the penetration depth computation using Hausdorff
                 distance runs at highly interactive rates for
                 complicated dynamics scene.",
  acknowledgement = ack-nhfb,
  articleno =    "74",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "dynamics simulation; Hausdorff distance; penetration
                 depth; shape similarity",
}

@Article{Tournois:2009:IDR,
  author =       "Jane Tournois and Camille Wormser and Pierre Alliez
                 and Mathieu Desbrun",
  title =        "Interleaving {Delaunay} refinement and optimization
                 for practical isotropic tetrahedron mesh generation",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "75:1--75:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531381",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a practical approach to isotropic
                 tetrahedral meshing of 3D domains bounded by piecewise
                 smooth surfaces. Building upon recent theoretical and
                 practical advances, our algorithm interleaves Delaunay
                 refinement and mesh optimization to generate quality
                 meshes that satisfy a set of user-defined criteria.
                 This interleaving is shown to be more conservative in
                 number of Steiner point insertions than refinement
                 alone, and to produce higher quality meshes than
                 optimization alone. A careful treatment of boundaries
                 and their features is presented, offering a versatile
                 framework for designing smoothly graded tetrahedral
                 meshes.",
  acknowledgement = ack-nhfb,
  articleno =    "75",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Delaunay refinement; graded meshing; isotropic
                 meshing; mesh generation; mesh optimization",
}

@Article{Wojtan:2009:DMS,
  author =       "Chris Wojtan and Nils Th{\"u}rey and Markus Gross and
                 Greg Turk",
  title =        "Deforming meshes that split and merge",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "76:1--76:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531382",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a method for accurately tracking the moving
                 surface of deformable materials in a manner that
                 gracefully handles topological changes. We employ a
                 Lagrangian surface tracking method, and we use a
                 triangle mesh for our surface representation so that
                 fine features can be retained. We make topological
                 changes to the mesh by first identifying merging or
                 splitting events at a particular grid resolution, and
                 then locally creating new pieces of the mesh in the
                 affected cells using a standard isosurface creation
                 method. We stitch the new, topologically simplified
                 portion of the mesh to the rest of the mesh at the cell
                 boundaries. Our method detects and treats topological
                 events with an emphasis on the preservation of detailed
                 features, while simultaneously simplifying those
                 portions of the material that are not visible. Our
                 surface tracker is not tied to a particular method for
                 simulating deformable materials. In particular, we show
                 results from two significantly different simulators: a
                 Lagrangian FEM simulator with tetrahedral elements, and
                 an Eulerian grid-based fluid simulator. Although our
                 surface tracking method is generic, it is particularly
                 well-suited for simulations that exhibit fine surface
                 details and numerous topological events. Highlights of
                 our results include merging of viscoplastic materials
                 with complex geometry, a taffy-pulling animation with
                 many fold and merge events, and stretching and slicing
                 of stiff plastic material.",
  acknowledgement = ack-nhfb,
  articleno =    "76",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "deformable meshes; fluid simulation; physically based
                 animation; topological control",
}

@Article{Bommes:2009:MIQ,
  author =       "David Bommes and Henrik Zimmer and Leif Kobbelt",
  title =        "Mixed-integer quadrangulation",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "77:1--77:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531383",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel method for quadrangulating a given
                 triangle mesh. After constructing an as smooth as
                 possible symmetric cross field satisfying a sparse set
                 of directional constraints (to capture the geometric
                 structure of the surface), the mesh is cut open in
                 order to enable a low distortion unfolding. Then a
                 seamless globally smooth parametrization is computed
                 whose iso-parameter lines follow the cross field
                 directions. In contrast to previous methods, sparsely
                 distributed directional constraints are sufficient to
                 automatically determine the appropriate number, type
                 and position of singularities in the quadrangulation.
                 Both steps of the algorithm (cross field and
                 parametrization) can be formulated as a mixed-integer
                 problem which we solve very efficiently by an adaptive
                 greedy solver. We show several complex examples where
                 high quality quad meshes are generated in a fully
                 automatic manner.",
  acknowledgement = ack-nhfb,
  articleno =    "77",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "direction field; mixed-integer; parametrization;
                 quadrangulation; remeshing; singularities",
}

@Article{Akleman:2009:CPW,
  author =       "Ergun Akleman and Jianer Chen and Qing Xing and
                 Jonathan L. Gross",
  title =        "Cyclic plain-weaving on polygonal mesh surfaces with
                 graph rotation systems",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "78:1--78:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531384",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we show how to create plain-weaving
                 over an arbitrary surface. To create a plain-weaving on
                 a surface, we need to create cycles that cross other
                 cycles (or themselves) by alternatingly going over and
                 under. We use the fact that it is possible to create
                 such cycles, starting from any given manifold-mesh
                 surface by simply twisting every edge of the manifold
                 mesh. We have developed a new method that converts
                 plain-weaving cycles to 3D thread structures. Using
                 this method, it is possible to cover a surface without
                 large gaps between threads by controlling the sizes of
                 the gaps. We have developed a system that converts any
                 manifold mesh to a plain-woven object, by interactively
                 controlling the shapes of the threads with a set of
                 parameters. We have demonstrated that by using this
                 system, we can create a wide variety of plain-weaving
                 patterns, some of which may not have been seen
                 before.",
  acknowledgement = ack-nhfb,
  articleno =    "78",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "links and knots; shape modeling; weaving",
}

@Article{Kim:2009:SMC,
  author =       "Manmyung Kim and Kyunglyul Hyun and Jongmin Kim and
                 Jehee Lee",
  title =        "Synchronized multi-character motion editing",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "79:1--79:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531385",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The ability to interactively edit human motion data is
                 essential for character animation. We present a novel
                 motion editing technique that allows the user to
                 manipulate synchronized multiple character motions
                 interactively. Our Laplacian motion editing method
                 formulates the interaction among multiple characters as
                 a collection of linear constraints and enforces the
                 constraints, while the user directly manipulates the
                 motion of characters in both spatial and temporal
                 domains. Various types of manipulation handles are
                 provided to specify absolute/relative spatial location,
                 direction, time, duration, and synchronization of
                 multiple characters. The capability of non-sequential
                 discrete editing is incorporated into our motion
                 editing interfaces, so continuous and discrete editing
                 is performed simultaneously and seamlessly. We
                 demonstrate that the synchronized multiple character
                 motions are synthesized and manipulated at interactive
                 rates using spatiotemporal constraints.",
  acknowledgement = ack-nhfb,
  articleno =    "79",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "character animation; human motion; interactive motion
                 editing; motion capture; multi-character interaction",
}

@Article{Macchietto:2009:MCB,
  author =       "Adriano Macchietto and Victor Zordan and Christian R.
                 Shelton",
  title =        "Momentum control for balance",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "80:1--80:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531386",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We demonstrate a real-time simulation system capable
                 of automatically balancing a standing character, while
                 at the same time tracking a reference motion and
                 responding to external perturbations. The system is
                 general to non-human morphologies and results in
                 natural balancing motions employing the entire body
                 (for example, wind-milling). Our novel balance routine
                 seeks to control the linear and angular momenta of the
                 character. We demonstrate how momentum is related to
                 the center of mass and center of pressure of the
                 character and derive control rules to change these
                 centers for balance. The desired momentum changes are
                 reconciled with the objective of tracking the reference
                 motion through an optimization routine which produces
                 target joint accelerations. A hybrid inverse/forward
                 dynamics algorithm determines joint torques based on
                 these joint accelerations and the ground reaction
                 forces. Finally, the joint torques are applied to the
                 free-standing character simulation. We demonstrate
                 results for following both motion capture and keyframe
                 data as well as both human and non-human morphologies
                 in presence of a variety of conditions and
                 disturbances.",
  acknowledgement = ack-nhfb,
  articleno =    "80",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "character animation; physics-based animation",
}

@Article{Muico:2009:CAN,
  author =       "Uldarico Muico and Yongjoon Lee and Jovan Popovi{\'c}
                 and Zoran Popovi{\'c}",
  title =        "Contact-aware nonlinear control of dynamic
                 characters",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "81:1--81:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531387",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Dynamically simulated characters are difficult to
                 control because they are underactuated---they have no
                 direct control over their global position and
                 orientation. In order to succeed, control policies must
                 look ahead to determine stabilizing actions, but such
                 planning is complicated by frequent ground contacts
                 that produce a discontinuous search space. This paper
                 introduces a locomotion system that generates
                 high-quality animation of agile movements using
                 nonlinear controllers that plan through such contact
                 changes. We demonstrate the general applicability of
                 this approach by emulating walking and running motions
                 in rigid-body simulations. Then we consolidate these
                 controllers under a higher-level planner that
                 interactively controls the character's direction.",
  acknowledgement = ack-nhfb,
  articleno =    "81",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "character control; character simulation; physics-based
                 character animation",
}

@Article{daSilva:2009:LBC,
  author =       "Marco da Silva and Fr{\'e}do Durand and Jovan
                 Popovi{\'c}",
  title =        "Linear {Bellman} combination for control of character
                 animation",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "82:1--82:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531388",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Controllers are necessary for physically-based
                 synthesis of character animation. However, creating
                 controllers requires either manual tuning or expensive
                 computer optimization. We introduce linear Bellman
                 combination as a method for reusing existing
                 controllers. Given a set of controllers for related
                 tasks, this combination creates a controller that
                 performs a new task. It naturally weights the
                 contribution of each component controller by its
                 relevance to the current state and goal of the system.
                 We demonstrate that linear Bellman combination
                 outperforms naive combination often succeeding where
                 naive combination fails. Furthermore, this combination
                 is provably optimal for a new task if the component
                 controllers are also optimal for related tasks. We
                 demonstrate the applicability of linear Bellman
                 combination to interactive character control of
                 stepping motions and acrobatic maneuvers.",
  acknowledgement = ack-nhfb,
  articleno =    "82",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "optimal control; physically based animation",
}

@Article{Eisemann:2009:VAC,
  author =       "Elmar Eisemann and Sylvain Paris and Fr{\'e}do
                 Durand",
  title =        "A visibility algorithm for converting {$3$D} meshes
                 into editable {$2$D} vector graphics",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "83:1--83:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531389",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Artists often need to import and embellish 3D models
                 coming from CAD-CAM into 2D vector graphics software to
                 produce, e.g., brochures or manuals. Current automatic
                 solutions tend to result, at best, in a 2D triangle
                 soup and artists often have to trace over 3D
                 renderings. We describe a method to convert 3D models
                 into 2D layered vector illustrations that respect
                 visibility and facilitate further editing. Our core
                 contribution is a visibility method that can partition
                 a mesh into large components that can be layered
                 according to visibility. Because self-occluding objects
                 and objects forming occlusion cycles cannot be
                 represented by layers without being cut, we introduce a
                 new cut algorithm that uses a graph representation of
                 the mesh and curvature-aware geodesic distances.",
  acknowledgement = ack-nhfb,
  articleno =    "83",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "geometry processing; NPR; vector graphics;
                 visibility",
}

@Article{McCann:2009:LL,
  author =       "James McCann and Nancy Pollard",
  title =        "Local layering",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "84:1--84:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531390",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In a conventional 2d painting or compositing program,
                 graphical objects are stacked in a user-specified
                 global order, as if each were printed on an image-sized
                 sheet of transparent film. In this paper we show how to
                 relax this restriction so that users can make stacking
                 decisions on a per-overlap basis, as if the layers were
                 pictures cut from a magazine. This allows for complex
                 and visually exciting overlapping patterns, without
                 painstaking layer-splitting, depth-value painting,
                 region coloring, or mask-drawing. Instead, users are
                 presented with a layers dialog which acts locally.
                 Behind the scenes, we divide the image into overlap
                 regions and track the ordering of layers in each
                 region. We formalize this structure as a graph of
                 stacking lists, define the set of orderings where
                 layers do not interpenetrate as consistent, and prove
                 that our local stacking operators are both correct and
                 sufficient to reach any consistent stacking. We also
                 provide a method for updating the local stacking when
                 objects change shape or position due to user editing -
                 this scheme prevents layer updates from producing
                 undesired intersections. Our method extends trivially
                 to both animation compositing and local visibility
                 adjustment in depth-peeled 3d scenes; the latter of
                 which allows for the creation of impossible figures
                 which can be viewed and manipulated in real-time.",
  acknowledgement = ack-nhfb,
  articleno =    "84",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; compositing; image editing; layers;
                 stacking; visibility",
}

@Article{Lai:2009:ATP,
  author =       "Yu-Kun Lai and Shi-Min Hu and Ralph R. Martin",
  title =        "Automatic and topology-preserving gradient mesh
                 generation for image vectorization",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "85:1--85:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531391",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "{\em Gradient mesh\/} vector graphics representation,
                 used in commercial software, is a regular grid with
                 specified position and color, and their gradients, at
                 each grid point. Gradient meshes can compactly
                 represent smoothly changing data, and are typically
                 used for single objects. This paper advances the state
                 of the art for gradient meshes in several significant
                 ways. Firstly, we introduce a {\em
                 topology-preserving\/} gradient mesh representation
                 which allows an arbitrary number of {\em holes}. This
                 is important, as objects in images often have holes,
                 either due to occlusion, or their 3D structure.
                 Secondly, our algorithm uses the concept of image
                 manifolds, adapting surface parameterization and
                 fitting techniques to generate the gradient mesh in a
                 {\em fully automatic\/} manner. Existing gradient-mesh
                 algorithms require manual interaction to guide grid
                 construction, and to cut objects with holes into
                 disk-like regions. Our new algorithm is empirically at
                 least 10 times {\em faster\/} than previous approaches.
                 Furthermore, image segmentation can be used with our
                 new algorithm to provide automatic gradient mesh
                 generation for a {\em whole image}. Finally, fitting
                 errors can be simply controlled to balance quality with
                 storage.",
  acknowledgement = ack-nhfb,
  articleno =    "85",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "gradient mesh; image manifold; image vectorization;
                 parameterization",
}

@Article{Balzer:2009:CCP,
  author =       "Michael Balzer and Thomas Schl{\"o}mer and Oliver
                 Deussen",
  title =        "Capacity-constrained point distributions: a variant of
                 {Lloyd}'s method",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "86:1--86:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531392",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new general-purpose method for optimizing
                 existing point sets. The resulting distributions
                 possess high-quality blue noise characteristics and
                 adapt precisely to given density functions. Our method
                 is similar to the commonly used Lloyd's method while
                 avoiding its drawbacks. We achieve our results by
                 utilizing the concept of capacity, which for each point
                 is determined by the area of its Voronoi region
                 weighted with an underlying density function. We demand
                 that each point has the same capacity. In combination
                 with a dedicated optimization algorithm, this capacity
                 constraint enforces that each point obtains equal
                 importance in the distribution. Our method can be used
                 as a drop-in replacement for Lloyd's method, and
                 combines enhancement of blue noise characteristics and
                 density function adaptation in one operation.",
  acknowledgement = ack-nhfb,
  articleno =    "86",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "blue noise; capacity constraint; importance sampling;
                 Lloyd's method; Poisson disk point sets; Voronoi
                 tessellations",
}

@Article{Harmon:2009:ACM,
  author =       "David Harmon and Etienne Vouga and Breannan Smith and
                 Rasmus Tamstorf and Eitan Grinspun",
  title =        "Asynchronous contact mechanics",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "87:1--87:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531393",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We develop a method for reliable simulation of
                 elastica in complex contact scenarios. Our focus is on
                 firmly establishing three parameter-independent
                 guarantees: that simulations of well-posed problems (a)
                 have no interpenetrations, (b) obey causality,
                 momentum- and energy-conservation laws, and (c)
                 complete in finite time. We achieve these guarantees
                 through a novel synthesis of asynchronous variational
                 integrators, kinetic data structures, and a
                 discretization of the contact barrier potential by an
                 infinite sum of nested quadratic potentials. In a
                 series of two- and three-dimensional examples, we
                 illustrate that this method more easily handles
                 challenging problems involving complex contact
                 geometries, sharp features, and sliding during
                 extremely tight contact.",
  acknowledgement = ack-nhfb,
  articleno =    "87",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "collision; contact; simulation; symplectic;
                 variational",
}

@Article{Chentanez:2009:ISS,
  author =       "Nuttapong Chentanez and Ron Alterovitz and Daniel
                 Ritchie and Lita Cho and Kris K. Hauser and Ken
                 Goldberg and Jonathan R. Shewchuk and James F.
                 O'Brien",
  title =        "Interactive simulation of surgical needle insertion
                 and steering",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "88:1--88:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531394",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present algorithms for simulating and visualizing
                 the insertion and steering of needles through
                 deformable tissues for surgical training and planning.
                 Needle insertion is an essential component of many
                 clinical procedures such as biopsies, injections,
                 neurosurgery, and brachytherapy cancer treatment. The
                 success of these procedures depends on accurate
                 guidance of the needle tip to a clinical target while
                 avoiding vital tissues. Needle insertion deforms body
                 tissues, making accurate placement difficult. Our
                 interactive needle insertion simulator models the
                 coupling between a steerable needle and deformable
                 tissue. We introduce (1) a novel algorithm for local
                 remeshing that quickly enforces the conformity of a
                 tetrahedral mesh to a curvilinear needle path, enabling
                 accurate computation of contact forces, (2) an
                 efficient method for coupling a 3D finite element
                 simulation with a 1D inextensible rod with stick-slip
                 friction, and (3) optimizations that reduce the
                 computation time for physically based simulations. We
                 can realistically and interactively simulate needle
                 insertion into a prostate mesh of 13,375 tetrahedra and
                 2,763 vertices at a 25 Hz frame rate on an 8-core 3.0
                 GHz Intel Xeon PC. The simulation models prostate
                 brachytherapy with needles of varying stiffness,
                 steering needles around obstacles, and supports motion
                 planning for robotic needle insertion. We evaluate the
                 accuracy of the simulation by comparing against
                 real-world experiments in which flexible, steerable
                 needles were inserted into gel tissue phantoms.",
  acknowledgement = ack-nhfb,
  articleno =    "88",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "coupled simulation; needle insertion; real-time finite
                 element methods; surgical simulation",
}

@Article{Bickel:2009:CMN,
  author =       "Bernd Bickel and Moritz B{\"a}cher and Miguel A.
                 Otaduy and Wojciech Matusik and Hanspeter Pfister and
                 Markus Gross",
  title =        "Capture and modeling of non-linear heterogeneous soft
                 tissue",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "89:1--89:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531395",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper introduces a data-driven representation and
                 modeling technique for simulating non-linear
                 heterogeneous soft tissue. It simplifies the
                 construction of convincing deformable models by
                 avoiding complex selection and tuning of physical
                 material parameters, yet retaining the richness of
                 non-linear heterogeneous behavior. We acquire a set of
                 example deformations of a real object, and represent
                 each of them as a spatially varying stress-strain
                 relationship in a finite-element model. We then model
                 the material by non-linear interpolation of these
                 stress-strain relationships in strain-space. Our method
                 relies on a simple-to-build capture system and an
                 efficient run-time simulation algorithm based on
                 incremental loading, making it suitable for interactive
                 computer graphics applications. We present the results
                 of our approach for several non-linear materials and
                 biological soft tissue, with accurate agreement of our
                 model to the measured data.",
  acknowledgement = ack-nhfb,
  articleno =    "89",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "data-driven graphics; deformations; model acquisition;
                 physically based animation and modeling",
}

@Article{Wang:2009:PGL,
  author =       "Huamin Wang and Miao Liao and Qing Zhang and Ruigang
                 Yang and Greg Turk",
  title =        "Physically guided liquid surface modeling from
                 videos",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "90:1--90:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531396",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an image-based reconstruction framework to
                 model real water scenes captured by stereoscopic video.
                 In contrast to many image-based modeling techniques
                 that rely on user interaction to obtain high-quality 3D
                 models, we instead apply automatically calculated
                 physically-based constraints to refine the initial
                 model. The combination of image-based reconstruction
                 with physically-based simulation allows us to model
                 complex and dynamic objects such as fluid. Using a
                 depth map sequence as initial conditions, we use a
                 physically based approach that automatically fills in
                 missing regions, removes outliers, and refines the
                 geometric shape so that the final 3D model is
                 consistent to both the input video data and the laws of
                 physics. Physically-guided modeling also makes
                 interpolation or extrapolation in the space-time domain
                 possible, and even allows the fusion of depth maps that
                 were taken at different times or viewpoints. We
                 demonstrated the effectiveness of our framework with a
                 number of real scenes, all captured using only a single
                 pair of cameras.",
  acknowledgement = ack-nhfb,
  articleno =    "90",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "image-based reconstruction; physically-based fluid
                 simulation; space-time model completion",
}

@Article{Wang:2009:EGB,
  author =       "Rui Wang and Rui Wang and Kun Zhou and Minghao Pan and
                 Hujun Bao",
  title =        "An efficient {GPU}-based approach for interactive
                 global illumination",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "91:1--91:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531397",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents a GPU-based method for interactive
                 global illumination that integrates complex effects
                 such as multi-bounce indirect lighting, glossy
                 reflections, caustics, and arbitrary specular paths.
                 Our method builds upon scattered data sampling and
                 interpolation on the GPU. We start with raytraced
                 shading points and partition them into coherent shading
                 clusters using adaptive seeding followed by k-means. At
                 each cluster center we apply final gather to evaluate
                 its incident irradiance using GPU-based photon mapping.
                 We approximate the entire photon tree as a compact
                 illumination cut, thus reducing the final gather cost
                 for each ray. The sampled irradiance values are then
                 interpolated at all shading points to produce
                 rendering. Our method exploits the spatial coherence of
                 illumination to reduce sampling cost. We sample
                 sparsely and the distribution of sample points conforms
                 with the underlying illumination changes. Therefore our
                 method is both fast and preserves high rendering
                 quality. Although the same property has been exploited
                 by previous caching and adaptive sampling methods,
                 these methods typically require sequential computation
                 of sample points, making them ill-suited for the GPU.
                 In contrast, we select sample points adaptively in a
                 single pass, enabling parallel computation. As a
                 result, our algorithm runs entirely on the GPU,
                 achieving interactive rates for scenes with complex
                 illumination effects.",
  acknowledgement = ack-nhfb,
  articleno =    "91",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "final gather; global illumination; GPU; illumination
                 cut; k-means; photon mapping",
}

@Article{Walter:2009:SSR,
  author =       "Bruce Walter and Shuang Zhao and Nicolas Holzschuch
                 and Kavita Bala",
  title =        "Single scattering in refractive media with triangle
                 mesh boundaries",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "92:1--92:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531398",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Light scattering in refractive media is an important
                 optical phenomenon for computer graphics. While recent
                 research has focused on multiple scattering, there has
                 been less work on accurate solutions for single or
                 low-order scattering. Refraction through a complex
                 boundary allows a single external source to be visible
                 in multiple directions internally with different
                 strengths; these are hard to find with existing
                 techniques. This paper presents techniques to quickly
                 find paths that connect points inside and outside a
                 medium while obeying the laws of refraction. We
                 introduce: a half-vector based formulation to support
                 the most common geometric representation, triangles
                 with interpolated normals; hierarchical pruning to
                 scale to triangular meshes; and, both a solver with
                 strong accuracy guarantees, and a faster method that is
                 empirically accurate. A GPU version achieves
                 interactive frame rates in several examples.",
  acknowledgement = ack-nhfb,
  articleno =    "92",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "refraction; single scatter; subsurface",
}

@Article{Egan:2009:FAS,
  author =       "Kevin Egan and Yu-Ting Tseng and Nicolas Holzschuch
                 and Fr{\'e}do Durand and Ravi Ramamoorthi",
  title =        "Frequency analysis and sheared reconstruction for
                 rendering motion blur",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "93:1--93:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531399",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Motion blur is crucial for high-quality rendering, but
                 is also very expensive. Our first contribution is a
                 frequency analysis of motion-blurred scenes, including
                 moving objects, specular reflections, and shadows. We
                 show that motion induces a shear in the frequency
                 domain, and that the spectrum of moving scenes can be
                 approximated by a wedge. This allows us to compute
                 adaptive space-time sampling rates, to accelerate
                 rendering. For uniform velocities and standard
                 axis-aligned reconstruction, we show that the product
                 of spatial and temporal bandlimits or sampling rates is
                 constant, independent of velocity. Our second
                 contribution is a novel sheared reconstruction filter
                 that is aligned to the first-order direction of motion
                 and enables even lower sampling rates. We present a
                 rendering algorithm that computes a sheared
                 reconstruction filter per pixel, without any
                 intermediate Fourier representation. This often permits
                 synthesis of motion-blurred images with far fewer
                 rendering samples than standard techniques require.",
  acknowledgement = ack-nhfb,
  articleno =    "93",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "anti-aliasing; filter; frequency analysis; light
                 transport; motion blur; reconstruction; sampling;
                 space-time",
}

@Article{Bittner:2009:AGV,
  author =       "Ji{\v{r}}{\'\i} Bittner and Oliver Mattausch and Peter
                 Wonka and Vlastimil Havran and Michael Wimmer",
  title =        "Adaptive global visibility sampling",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "94:1--94:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531400",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper we propose a global visibility algorithm
                 which computes from-region visibility for all view
                 cells simultaneously in a progressive manner. We cast
                 rays to sample visibility interactions and use the
                 information carried by a ray for all view cells it
                 intersects. The main contribution of the paper is a set
                 of adaptive sampling strategies based on ray mutations
                 that exploit the spatial coherence of visibility. Our
                 method achieves more than an order of magnitude speedup
                 compared to per-view cell sampling. This provides a
                 practical solution to visibility preprocessing and also
                 enables a new type of interactive visibility analysis
                 application, where it is possible to quickly inspect
                 and modify a coarse global visibility solution that is
                 constantly refined.",
  acknowledgement = ack-nhfb,
  articleno =    "94",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "from-region visibility; visibility preprocessing",
}

@Article{Agrawal:2009:IMB,
  author =       "Amit Agrawal and Yi Xu and Ramesh Raskar",
  title =        "Invertible motion blur in video",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "95:1--95:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531401",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We show that motion blur in successive video frames is
                 invertible even if the point-spread function (PSF) due
                 to motion smear in a single photo is non-invertible.
                 Blurred photos exhibit nulls (zeros) in the frequency
                 transform of the PSF, leading to an ill-posed
                 deconvolution. Hardware solutions to avoid this require
                 specialized devices such as the coded exposure camera
                 or accelerating sensor motion. We employ ordinary video
                 cameras and introduce the notion of null-filling along
                 with joint-invertibility of multiple blur-functions.
                 The key idea is to record the same object with varying
                 PSFs, so that the nulls in the frequency component of
                 one frame can be filled by other frames. The combined
                 frequency transform becomes null-free, making
                 deblurring well-posed. We achieve jointly-invertible
                 blur simply by changing the exposure time of successive
                 frames. We address the problem of automatic deblurring
                 of objects moving with constant velocity by solving the
                 four critical components: preservation of all spatial
                 frequencies, segmentation of moving parts, motion
                 estimation of moving parts, and non-degradation of the
                 static parts of the scene. We demonstrate several
                 challenging cases of object motion blur including
                 textured backgrounds and partial occluders.",
  acknowledgement = ack-nhfb,
  articleno =    "95",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational photography; invertibility; motion
                 deblurring; PSF; PSF estimation",
}

@Article{Krishnan:2009:DFP,
  author =       "Dilip Krishnan and Rob Fergus",
  title =        "Dark flash photography",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "96:1--96:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531402",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Camera flashes produce intrusive bursts of light that
                 disturb or dazzle. We present a prototype camera and
                 flash that uses infra-red and ultra-violet light mostly
                 outside the visible range to capture pictures in
                 low-light conditions. This `dark' flash is at least two
                 orders of magnitude dimmer than conventional flashes
                 for a comparable exposure. Building on ideas from
                 flash/no-flash photography, we capture a pair of
                 images, one using the dark flash, other using the dim
                 ambient illumination alone. We then exploit the
                 correlations between images recorded at different
                 wavelengths to denoise the ambient image and restore
                 fine details to give a high quality result, even in
                 very weak illumination. The processing techniques can
                 also be used to denoise images captured with
                 conventional cameras.",
  acknowledgement = ack-nhfb,
  articleno =    "96",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational photography; dark flash; multi-spectral
                 imaging; spectral image correlations",
}

@Article{Levin:2009:FAC,
  author =       "Anat Levin and Samuel W. Hasinoff and Paul Green and
                 Fr{\'e}do Durand and William T. Freeman",
  title =        "{$4$D} frequency analysis of computational cameras for
                 depth of field extension",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "97:1--97:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1576246.1531403",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Depth of field (DOF), the range of scene depths that
                 appear sharp in a photograph, poses a fundamental
                 tradeoff in photography---wide apertures are important
                 to reduce imaging noise, but they also increase defocus
                 blur. Recent advances in computational imaging modify
                 the acquisition process to extend the DOF through
                 deconvolution. Because deconvolution quality is a tight
                 function of the frequency power spectrum of the defocus
                 kernel, designs with high spectra are desirable. In
                 this paper we study how to design effective
                 extended-DOF systems, and show an upper bound on the
                 maximal power spectrum that can be achieved. We analyze
                 defocus kernels in the 4D light field space and show
                 that in the frequency domain, only a low-dimensional 3D
                 manifold contributes to focus. Thus, to maximize the
                 defocus spectrum, imaging systems should concentrate
                 their limited energy on this manifold. We review
                 several computational imaging systems and show either
                 that they spend energy outside the focal manifold or do
                 not achieve a high spectrum over the DOF. Guided by
                 this analysis we introduce the lattice-focal lens,
                 which concentrates energy at the low-dimensional focal
                 manifold and achieves a higher power spectrum than
                 previous designs. We have built a prototype
                 lattice-focal lens and present extended depth of field
                 results.",
  acknowledgement = ack-nhfb,
  articleno =    "97",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational camera; depth of field; Fourier
                 analysis; light field",
}

@Article{Mohan:2009:BIV,
  author =       "Ankit Mohan and Grace Woo and Shinsaku Hiura and Quinn
                 Smithwick and Ramesh Raskar",
  title =        "{Bokode}: imperceptible visual tags for camera based
                 interaction from a distance",
  journal =      j-TOG,
  volume =       "28",
  number =       "3",
  pages =        "98:1--98:??",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1531326.1531404",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Tue Aug 11 18:14:27 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We show a new camera based interaction solution where
                 an ordinary camera can detect small optical tags from a
                 relatively large distance. Current optical tags, such
                 as barcodes, must be read within a short range and the
                 codes occupy valuable physical space on products. We
                 present a new low-cost optical design so that the tags
                 can be shrunk to {\em 3mm\/} visible diameter, and
                 unmodified ordinary cameras several meters away can be
                 set up to decode the identity plus the relative
                 distance and angle. The design exploits the bokeh
                 effect of ordinary cameras lenses, which maps rays
                 exiting from an out of focus scene point into a disk
                 like blur on the camera sensor. This bokeh-code or {\em
                 Bokode\/} is a barcode design with a simple lenslet
                 over the pattern. We show that a code with 15 {\em
                 $\mu$m\/} features can be read using an off-the-shelf
                 camera from distances of up to 2 meters. We use
                 intelligent binary coding to estimate the relative
                 distance and angle to the camera, and show potential
                 for applications in augmented reality and motion
                 capture. We analyze the constraints and performance of
                 the optical system, and discuss several plausible
                 application scenarios.",
  acknowledgement = ack-nhfb,
  articleno =    "98",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "2D fiducials; augmented reality; computational probes;
                 defocus blur; human-computer interaction; motion
                 capture",
}

@Article{Lee:2009:CBM,
  author =       "Sung-Hee Lee and Eftychios Sifakis and Demetri
                 Terzopoulos",
  title =        "Comprehensive biomechanical modeling and simulation of
                 the upper body",
  journal =      j-TOG,
  volume =       "28",
  number =       "4",
  pages =        "99:1--99:17",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1559755.1559756",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Sep 4 15:14:09 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce a comprehensive biomechanical model of
                 the human upper body. Our model confronts the combined
                 challenge of modeling and controlling more or less all
                 of the relevant articular bones and muscles, as well as
                 simulating the physics-based deformations of the soft
                 tissues. Its dynamic skeleton comprises 68 bones with
                 147 jointed degrees of freedom, including those of each
                 vertebra and most of the ribs. To be properly actuated
                 and controlled, the skeletal submodel requires
                 comparable attention to detail with respect to muscle
                 modeling. We incorporate 814 muscles, each of which is
                 modeled as a piecewise uniaxial Hill-type force
                 actuator. To biomechanically simulate realistic flesh
                 deformations, we also develop a coupled finite element
                 model with the appropriate constitutive behavior, in
                 which are embedded the detailed 3D anatomical
                 geometries of the hard and soft tissues. Finally, we
                 develop an associated physics-based animation
                 controller that computes the muscle activation signals
                 necessary to drive the elaborate musculoskeletal system
                 in accordance with a sequence of target poses specified
                 by an animator.",
  acknowledgement = ack-nhfb,
  articleno =    "99",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "biomechanics; finite elements; Human modeling and
                 animation; muscle-based animation; rigid/deformable
                 dynamics and control; soft tissue simulation",
}

@Article{Bailey:2009:SGD,
  author =       "Reynold Bailey and Ann McNamara and Nisha Sudarsanam
                 and Cindy Grimm",
  title =        "Subtle gaze direction",
  journal =      j-TOG,
  volume =       "28",
  number =       "4",
  pages =        "100:1--100:14",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1559755.1559757",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Sep 4 15:14:09 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This article presents a novel technique that combines
                 eye-tracking with subtle image-space modulation to
                 direct a viewer's gaze about a digital image. We call
                 this paradigm {\em subtle gaze direction}. Subtle gaze
                 direction exploits the fact that our peripheral vision
                 has very poor acuity compared to our foveal vision. By
                 presenting brief, subtle modulations to the peripheral
                 regions of the field of view, the technique presented
                 here draws the viewer's foveal vision to the modulated
                 region. Additionally, by monitoring saccadic velocity
                 and exploiting the visual phenomenon of saccadic
                 masking, modulation is automatically terminated before
                 the viewer's foveal vision enters the modulated region.
                 Hence, the viewer is never actually allowed to
                 scrutinize the stimuli that attracted her gaze. This
                 new subtle gaze directing technique has potential
                 application in many areas including large scale display
                 systems, perceptually adaptive rendering, and complex
                 visual search tasks.",
  acknowledgement = ack-nhfb,
  articleno =    "100",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "eye-tracking; image-based; Luminance; modulation;
                 visual acuity; warm-cool",
}

@Article{Liu:2009:CVT,
  author =       "Yang Liu and Wenping Wang and Bruno L{\'e}vy and Feng
                 Sun and Dong-Ming Yan and Lin Lu and Chenglei Yang",
  title =        "On centroidal {Voronoi} tessellation --- energy
                 smoothness and fast computation",
  journal =      j-TOG,
  volume =       "28",
  number =       "4",
  pages =        "101:1--101:17",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1559755.1559758",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Sep 4 15:14:09 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Centroidal Voronoi tessellation (CVT) is a particular
                 type of Voronoi tessellation that has many applications
                 in computational sciences and engineering, including
                 computer graphics. The prevailing method for computing
                 CVT is Lloyd's method, which has linear convergence and
                 is inefficient in practice. We develop new efficient
                 methods for CVT computation and demonstrate the fast
                 convergence of these methods. Specifically, we show
                 that the CVT energy function has 2nd order smoothness
                 for convex domains with smooth density, as well as in
                 most situations encountered in optimization. Due to the
                 2nd order smoothness, it is possible to minimize the
                 CVT energy functions using Newton-like optimization
                 methods and expect fast convergence. We propose a
                 quasi-Newton method to compute CVT and demonstrate its
                 faster convergence than Lloyd's method with various
                 numerical examples. It is also significantly faster and
                 more robust than the Lloyd-Newton method, a previous
                 attempt to accelerate CVT. We also demonstrate surface
                 remeshing as a possible application.",
  acknowledgement = ack-nhfb,
  articleno =    "101",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Centroidal Voronoi tessellation; constrained CVT;
                 Lloyd's method; numerical optimization; quasi-Newton
                 methods; remeshing",
}

@Article{Bratkova:2009:ARM,
  author =       "Margarita Bratkova and Peter Shirley and William B.
                 Thompson",
  title =        "Artistic rendering of mountainous terrain",
  journal =      j-TOG,
  volume =       "28",
  number =       "4",
  pages =        "102:1--102:18",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1559755.1559759",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Sep 4 15:14:09 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Panorama maps are aerial view paintings that depict
                 complex, three-dimensional landscapes in a pleasing and
                 understandable way. Painters and cartographers have
                 developed techniques to create such artistic landscapes
                 for centuries, but the process remains difficult and
                 time-consuming. In this work, we derive principles and
                 heuristics for panorama map creation of mountainous
                 terrain from a perceptual and artistic analysis of two
                 panorama maps of Yellowstone National Park. We then
                 present methods to automatically produce landscape
                 renderings in the visual style of the panorama map. Our
                 algorithms rely on United States Geological Survey
                 (USGS) terrain and classification data. Our surface
                 textures are generated using perceptual metrics and
                 artistic considerations, and use the structural
                 information present in the terrain to guide the
                 automatic placement of image space strokes for natural
                 surfaces such as forests, cliffs, snow, and water.",
  acknowledgement = ack-nhfb,
  articleno =    "102",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Non-photorealistic rendering; terrain; texture
                 synthesis",
}

@Article{Wills:2009:TPS,
  author =       "Josh Wills and Sameer Agarwal and David Kriegman and
                 Serge Belongie",
  title =        "Toward a perceptual space for gloss",
  journal =      j-TOG,
  volume =       "28",
  number =       "4",
  pages =        "103:1--103:15",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1559755.1559760",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Sep 4 15:14:09 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We design and implement a comprehensive study of the
                 perception of gloss. This is the largest study of its
                 kind to date, and the first to use real material
                 measurements. In addition, we develop a novel
                 multi-dimensional scaling (MDS) algorithm for analyzing
                 pairwise comparisons. The data from the psychophysics
                 study and the MDS algorithm is used to construct a low
                 dimensional perceptual embedding of these bidirectional
                 reflectance distribution functions (BRDFs). The
                 embedding is validated by correlating it with nine
                 gloss dimensions, fitted parameters of seven analytical
                 BRDF models, and a perceptual parameterization of
                 Ward's model. We also introduce a novel perceptual
                 interpolation scheme that uses the embedding to provide
                 the user with an intuitive interface for navigating the
                 space of gloss and constructing new materials.",
  acknowledgement = ack-nhfb,
  articleno =    "103",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "human perception; reflectance models; Rendering",
}

@Article{Xin:2009:ICH,
  author =       "Shi-Qing Xin and Guo-Jin Wang",
  title =        "Improving {Chen} and {Han}'s algorithm on the discrete
                 geodesic problem",
  journal =      j-TOG,
  volume =       "28",
  number =       "4",
  pages =        "104:1--104:8",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1559755.1559761",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Sep 4 15:14:09 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The computation of geodesic distances or paths between
                 two points on triangulated meshes is a common operation
                 in many computer graphics applications. In this
                 article, we present an exact algorithm for the
                 single-source all-vertices shortest path
                 problem.\par

                 Mitchell et al. [1987] proposed an $O(n^2 \log n)$
                 method (MMP), based on Dijkstra's algorithm, where $n$
                 is the complexity of the polyhedral surface. Then, Chen
                 and Han [1990] (CH) improved the running time to
                 $O(n^2)$. Interestingly Surazhsky et al. [2005]
                 provided experimental evidence demonstrating that the
                 MMP algorithm runs many times faster, in practice, than
                 the CH algorithm.\par

                 The CH algorithm encodes the structure of the set of
                 shortest paths using a set of windows on the edges of
                 the polyhedron. Our experiments showed that in many
                 examples over 99\% of the windows created by the CH
                 algorithm are of no use to define a shortest path. So
                 this article proposes to improve the CH algorithm by
                 two separate techniques. One is to filter out useless
                 windows using the current estimates of the distances to
                 the vertices, the other is to maintain a priority queue
                 like that achieved in Dijkstra's algorithm. Our
                 experimental results suggest that the improved CH
                 algorithm, in spite of an $O(n^2 \log n)$ asymptotic
                 time complexity, greatly outperforms the original CH
                 algorithm in both time and space. Furthermore, it
                 generally runs faster than the MMP algorithm and uses
                 considerably less space.",
  acknowledgement = ack-nhfb,
  articleno =    "104",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational geometry; Design and analysis of
                 algorithms; shortest path problems",
}

@Article{Volino:2009:SAN,
  author =       "Pascal Volino and Nadia Magnenat-Thalmann and
                 Fran{\c{c}}ois Faure",
  title =        "A simple approach to nonlinear tensile stiffness for
                 accurate cloth simulation",
  journal =      j-TOG,
  volume =       "28",
  number =       "4",
  pages =        "105:1--105:16",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1559755.1559762",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Sep 4 15:14:09 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Recent mechanical models for cloth simulation have
                 evolved toward accurate representation of elastic
                 stiffness based on continuum mechanics, converging to
                 formulations that are largely analogous to fast finite
                 element methods. In the context of tensile
                 deformations, these formulations usually involve the
                 linearization of tensors, so as to express linear
                 elasticity in a simple way. However, this approach
                 needs significant adaptations and approximations for
                 dealing with the nonlinearities resulting from large
                 cloth deformations. Toward our objective of accurately
                 simulating the nonlinear properties of cloth, we show
                 that this linearization can indeed be avoided and
                 replaced by adapted strain-stress laws that precisely
                 describe the nonlinear behavior of the material. This
                 leads to highly streamlined computations that are
                 particularly efficient for simulating the nonlinear
                 anisotropic tensile elasticity of highly deformable
                 surfaces. We demonstrate the efficiency of this method
                 with examples related to accurate garment simulation
                 from experimental tensile curves measured on actual
                 materials.",
  acknowledgement = ack-nhfb,
  articleno =    "105",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cloth simulation; finite elements; mechanical
                 simulation; Particle systems",
}

@Article{Pamplona:2009:PMP,
  author =       "Vitor F. Pamplona and Manuel M. Oliveira and Gladimir
                 V. G. Baranoski",
  title =        "Photorealistic models for pupil light reflex and
                 iridal pattern deformation",
  journal =      j-TOG,
  volume =       "28",
  number =       "4",
  pages =        "106:1--106:12",
  month =        aug,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1559755.1559763",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Sep 4 15:14:09 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce a physiologically-based model for pupil
                 light reflex (PLR) and an image-based model for iridal
                 pattern deformation. Our PLR model expresses the pupil
                 diameter as a function of the lighting of the
                 environment, and is described by a delay-differential
                 equation, naturally adapting the pupil diameter even to
                 abrupt changes in light conditions. Since the
                 parameters of our PLR model were derived from measured
                 data, it correctly simulates the actual behavior of the
                 human pupil. Another contribution of our work is a
                 model for realistic deformation of the iris pattern as
                 a function of pupil dilation and constriction. Our
                 models produce high-fidelity appearance effects and can
                 be used to produce real-time predictive animations of
                 the pupil and iris under variable lighting conditions.
                 We assess the predictability and quality of our
                 simulations through comparisons of modeled results
                 against measured data derived from experiments also
                 described in this work. Combined, our models can bring
                 facial animation to new photorealistic standards.",
  acknowledgement = ack-nhfb,
  articleno =    "106",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Face animation; image-based modelling; iris animation;
                 photorealism; physiologically-based modelling",
}

@Article{Rosenberger:2009:LSS,
  author =       "Amir Rosenberger and Daniel Cohen-Or and Dani
                 Lischinski",
  title =        "Layered shape synthesis: automatic generation of
                 control maps for non-stationary textures",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "107:1--107:5",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618453",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Many inhomogeneous real-world textures are
                 non-stationary and exhibit various large scale patterns
                 that are easily perceived by a human observer. Such
                 textures violate the assumptions underlying most
                 state-of-the-art example-based synthesis methods.
                 Consequently, they cannot be properly reproduced by
                 these methods, unless a suitable control map is
                 provided to guide the synthesis process. Such control
                 maps are typically either user specified or generated
                 by a simulation. In this paper, we present an
                 alternative: a method for automatic example-based
                 generation of control maps, geared at synthesis of
                 natural, highly inhomogeneous textures, such as those
                 resulting from natural aging or weathering processes.
                 Our method is based on the observation that an
                 appropriate control map for many of these textures may
                 be modeled as a superposition of several layers, where
                 the visible parts of each layer are occupied by a more
                 homogeneous texture. Thus, given a decomposition of a
                 texture exemplar into a small number of such layers, we
                 employ a novel example-based shape synthesis algorithm
                 to automatically generate a new set of layers. Our
                 shape synthesis algorithm is designed to preserve both
                 local and global characteristics of the exemplar's
                 layer map. This process results in a new control map,
                 which then may be used to guide the subsequent texture
                 synthesis process.",
  acknowledgement = ack-nhfb,
  articleno =    "107",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "control maps; example-based texture synthesis;
                 non-stationary textures; shape synthesis",
}

@Article{Xu:2009:FAS,
  author =       "Kai Xu and Daniel Cohen-Or and Tao Ju and Ligang Liu
                 and Hao Zhang and Shizhe Zhou and Yueshan Xiong",
  title =        "Feature-aligned shape texturing",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "108:1--108:7",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618454",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The essence of a 3D shape can often be well captured
                 by its salient feature curves. In this paper, we
                 explore the use of salient curves in synthesizing
                 intuitive, shape-revealing textures on surfaces. Our
                 texture synthesis is guided by two principles: matching
                 the direction of the texture patterns to those of the
                 salient curves, and aligning the prominent feature
                 lines in the texture to the salient curves exactly. We
                 have observed that textures synthesized by these
                 principles not only fit naturally to the surface
                 geometry, but also visually reveal, even reinforce, the
                 shape's essential characteristics. We call these {\em
                 feature-aligned shape texturing}. Our technique is
                 fully automatic, and introduces two novel technical
                 components in vector-field-guided texture synthesis: an
                 algorithm that orients the salient curves on a surface
                 for constrained vector field generation, and a
                 feature-to-feature texture optimization.",
  acknowledgement = ack-nhfb,
  articleno =    "108",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "feature alignment; salient features; texture
                 synthesis",
}

@Article{Gonzalez:2009:CMM,
  author =       "Francisco Gonz{\'a}lez and Gustavo Patow",
  title =        "Continuity mapping for multi-chart textures",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "109:1--109:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618455",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "It is well known that multi-chart parameterizations
                 introduce seams over meshes, causing serious problems
                 for applications like texture filtering, relief mapping
                 and simulations in the texture domain. Here we present
                 two techniques, collectively known as {\em Continuity
                 Mapping}, that together make any multi-chart
                 parameterization seamless: {\em Traveler's Map\/} is
                 used for solving the spatial discontinuities of
                 multi-chart parameterizations in texture space thanks
                 to a bidirectional mapping between areas outside the
                 charts and the corresponding areas inside; and {\em
                 Sewing the Seams\/} addresses the sampling mismatch at
                 chart boundaries using a set of stitching triangles
                 that are not true geometry, but merely evaluated on a
                 perfragment basis to perform consistent linear
                 interpolation between non-adjacent texel values. {\em
                 Continuity Mapping\/} does {\em not\/} require any
                 modification of the artist-provided textures or models,
                 it is fully automatic, and achieves continuity with
                 small memory and computational costs.",
  acknowledgement = ack-nhfb,
  articleno =    "109",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ma:2009:MFT,
  author =       "Chongyang Ma and Li-Yi Wei and Baining Guo and Kun
                 Zhou",
  title =        "Motion field texture synthesis",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "110:1--110:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618456",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "A variety of animation effects such as herds and
                 fluids contain detailed motion fields characterized by
                 repetitive structures. Such detailed motion fields are
                 often visually important, but tedious to specify
                 manually or expensive to simulate computationally. Due
                 to the repetitive nature, some of these motion fields
                 (e.g. turbulence in fluids) could be synthesized by
                 procedural texturing, but procedural texturing is known
                 for its limited generality.\par

                 We apply example-based texture synthesis for motion
                 fields. Our technique is general and can take on a
                 variety of user inputs, including captured data, manual
                 art, and physical/procedural simulation. This
                 data-driven approach enables artistic effects that are
                 difficult to achieve via previous methods, such as
                 heart shaped swirls in fluid animation. Due to the use
                 of texture synthesis, our method is able to populate a
                 large output field from a small input exemplar,
                 imposing minimum user workload. Our algorithm also
                 allows the synthesis of output motion fields not only
                 with the same dimension as the input (e.g. 2D to 2D)
                 but also of higher dimension, such as 3D volumetric
                 outputs from 2D planar inputs. This cross-dimension
                 capability supports a convenient usage scenario, i.e.
                 the user could simply supply 2D images and our method
                 produces a 3D motion field with similar
                 characteristics. The motion fields produced by our
                 method are generic, and could be combined with a
                 variety of large-scale low-resolution motions that are
                 easy to specify either manually or computationally but
                 lack the repetitive structures to be characterized as
                 textures. We apply our technique to a variety of
                 animation phenomena, including smoke, liquid, and group
                 motion.",
  acknowledgement = ack-nhfb,
  articleno =    "110",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "fluids; group motion; motion field; texture
                 synthesis",
}

@Article{Vanegas:2009:IDU,
  author =       "Carlos A. Vanegas and Daniel G. Aliaga and
                 Bed{\v{r}}ich Bene{\v{s}} and Paul A. Waddell",
  title =        "Interactive design of urban spaces using geometrical
                 and behavioral modeling",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "111:1--111:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618457",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "The main contribution of our work is in closing the
                 loop between behavioral and geometrical modeling of
                 cities. Editing of urban design variables is performed
                 intuitively and visually using a graphical user
                 interface. Any design variable can be constrained or
                 changed. The design process uses an iterative dynamical
                 system for reaching equilibrium: a state where the
                 demands of behavioral modeling match those of
                 geometrical modeling. 3D models are generated in a few
                 seconds and conform to plausible urban behavior and
                 urban geometry. Our framework includes an interactive
                 agent-based behavioral modeling system as well as
                 adaptive geometry generation algorithms. We demonstrate
                 interactive and incremental design and editing for
                 synthetic urban spaces spanning over 200 square
                 kilometers.",
  acknowledgement = ack-nhfb,
  articleno =    "111",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "3D models; editing; interactive; urban spaces",
}

@Article{Whiting:2009:PMS,
  author =       "Emily Whiting and John Ochsendorf and Fr{\'e}do
                 Durand",
  title =        "Procedural modeling of structurally-sound masonry
                 buildings",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "112:1--112:9",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618458",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We introduce structural feasibility into procedural
                 modeling of buildings. This allows for more realistic
                 structural models that can be interacted with in
                 physical simulations. While existing structural
                 analysis tools focus heavily on providing an analysis
                 of the stress state, our proposed method automatically
                 tunes a set of designated free parameters to obtain
                 forms that are structurally sound.",
  acknowledgement = ack-nhfb,
  articleno =    "112",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "architecture; optimization; physics; procedural
                 modeling; statics; structural stability",
}

@Article{Jiang:2009:SAM,
  author =       "Nianjuan Jiang and Ping Tan and Loong-Fah Cheong",
  title =        "Symmetric architecture modeling with a single image",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "113:1--113:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618459",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a method to recover a 3D texture-mapped
                 architecture model from a single image. Both single
                 image based modeling and architecture modeling are
                 challenging problems. We handle these difficulties by
                 employing constraints derived from shape symmetries,
                 which are prevalent in architecture. We first present a
                 novel algorithm to calibrate the camera from a single
                 image by exploiting symmetry. Then a set of 3D points
                 is recovered according to the calibration and the
                 underlying symmetry. With these reconstructed points,
                 the user interactively marks out components of the
                 architecture structure, whose shapes and positions are
                 automatically determined according to the 3D points.
                 Lastly, we texture the 3D model according to the input
                 image, and we enhance the texture quality at those
                 foreshortened and occluded regions according to their
                 symmetric counterparts. The modeling process requires
                 only a few minutes interaction. Multiple examples are
                 provided to demonstrate the presented method.",
  acknowledgement = ack-nhfb,
  articleno =    "113",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "3D reconstruction; architecture modeling; symmetry",
}

@Article{Xiao:2009:IBS,
  author =       "Jianxiong Xiao and Tian Fang and Peng Zhao and Maxime
                 Lhuillier and Long Quan",
  title =        "Image-based street-side city modeling",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "114:1--114:12",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618460",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose an automatic approach to generate
                 street-side 3D photo-realistic models from images
                 captured along the streets at ground level. We first
                 develop a multi-view semantic segmentation method that
                 recognizes and segments each image at pixel level into
                 semantically meaningful areas, each labeled with a
                 specific object class, such as building, sky, ground,
                 vegetation and car. A partition scheme is then
                 introduced to separate buildings into independent
                 blocks using the major line structures of the scene.
                 Finally, for each block, we propose an inverse
                 patch-based orthographic composition and structure
                 analysis method for fa{\c{c}}ade modeling that
                 efficiently regularizes the noisy and missing
                 reconstructed 3D data. Our system has the distinct
                 advantage of producing visually compelling results by
                 imposing strong priors of building regularity. We
                 demonstrate the fully automatic system on a typical
                 city example to validate our methodology.",
  acknowledgement = ack-nhfb,
  articleno =    "114",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "3D reconstruction; ade modeling; building modeling;
                 city modeling; fa{\c{c}} image-based modeling; street
                 view; street-side",
}

@Article{Xia:2009:PBI,
  author =       "Tian Xia and Binbin Liao and Yizhou Yu",
  title =        "Patch-based image vectorization with automatic
                 curvilinear feature alignment",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "115:1--115:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618461",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Raster image vectorization is increasingly important
                 since vector-based graphical contents have been adopted
                 in personal computers and on the Internet. In this
                 paper, we introduce an effective vector-based
                 representation and its associated vectorization
                 algorithm for full-color raster images. There are two
                 important characteristics of our representation. First,
                 the image plane is decomposed into nonoverlapping
                 parametric triangular patches with curved boundaries.
                 Such a simplicial layout supports a flexible topology
                 and facilitates adaptive patch distribution. Second, a
                 subset of the curved patch boundaries are dedicated to
                 faithfully representing curvilinear features. They are
                 automatically aligned with the features. Because of
                 this, patches are expected to have moderate internal
                 variations that can be well approximated using smooth
                 functions. We have developed effective techniques for
                 patch boundary optimization and patch color fitting to
                 accurately and compactly approximate raster images with
                 both smooth variations and curvilinear features. A
                 real-time GPU-accelerated parallel algorithm based on
                 recursive patch subdivision has also been developed for
                 rasterizing a vectorized image. Experiments and
                 comparisons indicate our image vectorization algorithm
                 achieves a more accurate and compact vector-based
                 representation than existing ones do.",
  acknowledgement = ack-nhfb,
  articleno =    "115",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "curvilinear features; mesh simplification; thin-plate
                 splines; vector graphics",
}

@Article{Jeschke:2009:GLS,
  author =       "Stefan Jeschke and David Cline and Peter Wonka",
  title =        "A {GPU Laplacian} solver for diffusion curves and
                 {Poisson} image editing",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "116:1--116:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618462",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new Laplacian solver for {\em minimal\/}
                 surfaces---surfaces having a mean curvature of zero
                 everywhere except at some fixed (Dirichlet) boundary
                 conditions. Our solution has two main contributions:
                 First, we provide a robust rasterization technique to
                 transform continuous boundary values (diffusion curves)
                 to a discrete domain. Second, we define a {\em variable
                 stencil size\/} diffusion solver that solves the
                 minimal surface problem. We prove that the solver
                 converges to the right solution, and demonstrate that
                 it is at least as fast as commonly proposed multigrid
                 solvers, but much simpler to implement. It also works
                 for arbitrary image resolutions, as well as 8 bit data.
                 We show examples of robust diffusion curve rendering
                 where our curve rasterization and diffusion solver
                 eliminate the strobing artifacts present in previous
                 methods. We also show results for real-time seamless
                 cloning and stitching of large image panoramas.",
  acknowledgement = ack-nhfb,
  articleno =    "116",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "diffusion; line and curve rendering; Poisson
                 equation",
}

@Article{Jeschke:2009:RSD,
  author =       "Stefan Jeschke and David Cline and Peter Wonka",
  title =        "Rendering surface details with diffusion curves",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "117:1--117:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618463",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "{\em Diffusion curve images\/} (DCI) provide a
                 powerful tool for efficient 2D image generation,
                 storage and manipulation. A DCI consist of curves with
                 colors defined on either side. By diffusing these
                 colors over the image, the final result includes sharp
                 boundaries along the curves with smoothly shaded
                 regions between them. This paper extends the
                 application of diffusion curves to render high quality
                 surface details on 3D objects. The first extension is a
                 view dependent warping technique that dynamically
                 reallocates texture space so that object parts that
                 appear large on screen get more texture for increased
                 detail. The second extension is a {\em dynamic\/}
                 feature embedding technique that retains crisp,
                 anti-aliased curve details even in extreme closeups.
                 The third extension is the application of dynamic
                 feature embedding to displacement mapping and geometry
                 images. Our results show high quality renderings of
                 diffusion curve textures, displacements, and geometry
                 images, all rendered interactively.",
  acknowledgement = ack-nhfb,
  articleno =    "117",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "diffusion curves; displacement mapping; geometry
                 images; line and curve rendering",
}

@Article{Xu:2009:EAB,
  author =       "Kun Xu and Yong Li and Tao Ju and Shi-Min Hu and
                 Tian-Qiang Liu",
  title =        "Efficient affinity-based edit propagation using {K-D}
                 tree",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "118:1--118:6",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618464",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Image/video editing by strokes has become increasingly
                 popular due to the ease of interaction. Propagating the
                 user inputs to the rest of the image/video, however, is
                 often time and memory consuming especially for large
                 data. We propose here an efficient scheme that allows
                 affinity-based edit propagation to be computed on data
                 containing tens of millions of pixels at interactive
                 rate (in matter of seconds). The key in our scheme is a
                 novel means for approximately solving the optimization
                 problem involved in edit propagation, using adaptive
                 clustering in a high-dimensional, affinity space. Our
                 approximation significantly reduces the cost of
                 existing affinity-based propagation methods while
                 maintaining visual fidelity, and enables interactive
                 stroke-based editing even on high resolution images and
                 long video sequences using commodity computers.",
  acknowledgement = ack-nhfb,
  articleno =    "118",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Chadwick:2009:HSP,
  author =       "Jeffrey N. Chadwick and Steven S. An and Doug L.
                 James",
  title =        "Harmonic shells: a practical nonlinear sound model for
                 near-rigid thin shells",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "119:1--119:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618465",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose a procedural method for synthesizing
                 realistic sounds due to nonlinear thin-shell
                 vibrations. We use linear modal analysis to generate a
                 small-deformation displacement basis, then couple the
                 modes together using nonlinear thin-shell forces. To
                 enable audio-rate time-stepping of mode amplitudes with
                 mesh-independent cost, we propose a reduced-order
                 dynamics model based on a thin-shell cubature scheme.
                 Limitations such as mode locking and pitch glide are
                 addressed. To support fast evaluation of mid-frequency
                 mode-based sound radiation for detailed meshes, we
                 propose {\em far-field acoustic transfer maps\/} (FFAT
                 maps) which can be precomputed using state-of-the-art
                 fast Helmholtz multipole methods. Familiar examples are
                 presented including rumbling trash cans and plastic
                 bottles, crashing cymbals, and noisy sheet metal
                 objects, each with increased richness over linear modal
                 sound models.",
  acknowledgement = ack-nhfb,
  articleno =    "119",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "acoustic transfer; contact sounds; dimensional model
                 reduction; Helmholtz equation; modal analysis; sound
                 synthesis; subspace integration; thin shells",
}

@Article{Kim:2009:SWL,
  author =       "Doyub Kim and Oh-young Song and Hyeong-Seok Ko",
  title =        "Stretching and wiggling liquids",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "120:1--120:7",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618466",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents a novel framework for simulating
                 the stretching and wiggling of liquids. We demonstrate
                 that complex phase-interface dynamics can be
                 effectively simulated by introducing the Eulerian
                 vortex sheet method, which focuses on the vorticity at
                 the interface (rather than the whole domain). We extend
                 this model to provide user control for the production
                 of visual effects. Then, the generated fluid flow
                 creates complex surface details, such as thin and
                 wiggling fluid sheets. To capture such high-frequency
                 features efficiently, this work employs a denser grid
                 for surface tracking in addition to the (coarser)
                 simulation grid. In this context, the paper proposes a
                 filter, called the liquid-biased filter, which is able
                 to downsample the surface in the high-resolution grid
                 into the coarse grid without unrealistic volume loss
                 resulting from aliasing error. The proposed method,
                 which runs on a single PC, realistically reproduces
                 complex fluid scenes.",
  acknowledgement = ack-nhfb,
  articleno =    "120",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Eulerian vortex sheet method; fluid animation; level
                 set method; surface tracking",
}

@Article{Pfaff:2009:STU,
  author =       "Tobias Pfaff and Nils Thuerey and Andrew Selle and
                 Markus Gross",
  title =        "Synthetic turbulence using artificial boundary
                 layers",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "121:1--121:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618467",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Turbulent vortices in fluid flows are crucial for a
                 visually interesting appearance. Although there has
                 been a significant amount of work on turbulence in
                 graphics recently, these algorithms rely on the
                 underlying simulation to resolve the flow around
                 objects. We build upon work from classical fluid
                 mechanics to design an algorithm that allows us to
                 accurately precompute the turbulence being generated
                 around an object immersed in a flow. This is made
                 possible by modeling turbulence formation based on an
                 averaged flow field, and relying on universal laws
                 describing the flow near a wall. We precompute the
                 confined vorticity in the boundary layer around an
                 object, and simulate the boundary layer separation
                 during a fluid simulation. Then, a turbulence model is
                 used to identify areas where this separated layer will
                 transition into actual turbulence. We sample these
                 regions with vortex particles, and simulate the further
                 dynamics of the vortices based on these particles. We
                 will show how our method complements previous work on
                 synthetic turbulence, and yields physically plausible
                 results. In addition, we demonstrate that our method
                 can efficiently compute turbulent flows around a
                 variety of objects including cars, whisks, as well as
                 boulders in a river flow. We can even apply our model
                 to precomputed static flow fields, yielding turbulent
                 dynamics without a costly simulation.",
  acknowledgement = ack-nhfb,
  articleno =    "121",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "fluid simulation; physically based animation;
                 turbulence",
}

@Article{Narain:2009:ADD,
  author =       "Rahul Narain and Abhinav Golas and Sean Curtis and
                 Ming C. Lin",
  title =        "Aggregate dynamics for dense crowd simulation",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "122:1--122:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618468",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Large dense crowds show aggregate behavior with
                 reduced individual freedom of movement. We present a
                 novel, scalable approach for simulating such crowds,
                 using a dual representation both as discrete agents and
                 as a single continuous system. In the continuous
                 setting, we introduce a novel variational constraint
                 called {\em unilateral incompressibility}, to model the
                 large-scale behavior of the crowd, and accelerate
                 inter-agent collision avoidance in dense scenarios.
                 This approach makes it possible to simulate very large,
                 dense crowds composed of up to a hundred thousand
                 agents at near-interactive rates on desktop
                 computers.",
  acknowledgement = ack-nhfb,
  articleno =    "122",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "continuum; crowds; incompressibility; planning",
}

@Article{Kim:2009:SSD,
  author =       "Theodore Kim and Doug L. James",
  title =        "Skipping steps in deformable simulation with online
                 model reduction",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "123:1--123:9",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618469",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Finite element simulations of nonlinear deformable
                 models are computationally costly, routinely taking
                 hours or days to compute the motion of detailed meshes.
                 Dimensional model reduction can make simulations orders
                 of magnitude faster, but is unsuitable for general
                 deformable body simulations because it requires
                 expensive precomputations, and it can suppress motion
                 that lies outside the span of a pre-specified low-rank
                 basis. We present an online model reduction method that
                 does not have these limitations. In lieu of
                 precomputation, we analyze the motion of the full model
                 as the simulation progresses, incrementally building a
                 reduced-order nonlinear model, and detecting when our
                 reduced model is capable of performing the next
                 timestep. For these subspace steps, full-model
                 computation is 'skipped' and replaced with a very fast
                 (on the order of milliseconds) reduced order step. We
                 present algorithms for both dynamic and quasistatic
                 simulations, and a 'throttle' parameter that allows a
                 user to trade off between faster, approximate previews
                 and slower, more conservative results. For detailed
                 meshes undergoing low-rank motion, we have observed
                 speedups of over an order of magnitude with our
                 method.",
  acknowledgement = ack-nhfb,
  articleno =    "123",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "character skinning; dimensional model reduction;
                 nonlinear solid mechanics; reduced-order modeling;
                 subspace deformation; subspace integration",
}

@Article{Chen:2009:SII,
  author =       "Tao Chen and Ming-Ming Cheng and Ping Tan and Ariel
                 Shamir and Shi-Min Hu",
  title =        "{Sketch2Photo}: {Internet} image montage",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "124:1--124:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618470",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a system that composes a realistic picture
                 from a simple freehand sketch annotated with text
                 labels. The composed picture is generated by seamlessly
                 stitching several photographs in agreement with the
                 sketch and text labels; these are found by searching
                 the Internet. Although online image search generates
                 many inappropriate results, our system is able to
                 automatically select suitable photographs to generate a
                 high quality composition, using a filtering scheme to
                 exclude undesirable images. We also provide a novel
                 image blending algorithm to allow seamless image
                 composition. Each blending result is given a numeric
                 score, allowing us to find an optimal combination of
                 discovered images. Experimental results show the method
                 is very successful; we also evaluate our system using
                 the results from two user studies.",
  acknowledgement = ack-nhfb,
  articleno =    "124",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Dong:2009:OIR,
  author =       "Weiming Dong and Ning Zhou and Jean-Claude Paul and
                 Xiaopeng Zhang",
  title =        "Optimized image resizing using seam carving and
                 scaling",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "125:1--125:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618471",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel method for content-aware image
                 resizing based on optimization of a well-defined image
                 distance function, which preserves both the important
                 regions and the global visual effect (the background or
                 other decorative objects) of an image. The method
                 operates by joint use of seam carving and image
                 scaling. The principle behind our method is the use of
                 a bidirectional similarity function of image Euclidean
                 distance (IMED), while cooperating with a dominant
                 color descriptor (DCD) similarity and seam energy
                 variation. The function is suitable for the
                 quantitative evaluation of the resizing result and the
                 determination of the best seam carving number.
                 Different from the previous simplex-mode approaches,
                 our method takes the advantages of both discrete and
                 continuous methods. The technique is useful in image
                 resizing for both reduction/retargeting and enlarging.
                 We also show that this approach can be extended to
                 indirect image resizing.",
  acknowledgement = ack-nhfb,
  articleno =    "125",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "DCD; image distance function; image resizing; IMED",
}

@Article{Krahenbuhl:2009:SRS,
  author =       "Philipp Kr{\"a}henb{\"u}hl and Manuel Lang and
                 Alexander Hornung and Markus Gross",
  title =        "A system for retargeting of streaming video",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "126:1--126:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618472",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel, integrated system for
                 content-aware video retargeting. A simple and
                 interactive framework combines key frame based
                 constraint editing with numerous automatic algorithms
                 for video analysis. This combination gives content
                 producers high level control of the retargeting
                 process. The central component of our framework is a
                 non-uniform, pixel-accurate warp to the target
                 resolution which considers automatic as well as
                 interactively defined features. Automatic features
                 comprise video saliency, edge preservation at the pixel
                 resolution, and scene cut detection to enforce
                 bilateral temporal coherence. Additional high level
                 constraints can be added by the producer to guarantee a
                 consistent scene composition across arbitrary output
                 formats. For high quality video display we adopted a 2D
                 version of EWA splatting eliminating aliasing artifacts
                 known from previous work. Our method seamlessly
                 integrates into postproduction and computes the
                 reformatting in real-time. This allows us to retarget
                 annotated video streams at a high quality to arbitrary
                 aspect ratios while retaining the intended
                 cinematographic scene composition. For evaluation we
                 conducted a user study which revealed a strong viewer
                 preference for our method.",
  acknowledgement = ack-nhfb,
  articleno =    "126",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "art-directability; content-awareness; EWA splatting;
                 user study; video retargeting; warping",
}

@Article{Wang:2009:MAT,
  author =       "Yu-Shuen Wang and Hongbo Fu and Olga Sorkine and
                 Tong-Yee Lee and Hans-Peter Seidel",
  title =        "Motion-aware temporal coherence for video resizing",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "127:1--127:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618473",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Temporal coherence is crucial in content-aware video
                 retargeting. To date, this problem has been addressed
                 by constraining temporally adjacent pixels to be
                 transformed coherently. However, due to the {\em
                 motion-oblivious\/} nature of this simple constraint,
                 the retargeted videos often exhibit flickering or
                 waving artifacts, especially when significant camera or
                 object motions are involved. Since the feature
                 correspondence across frames varies spatially with both
                 camera and object motion, {\em motion-aware\/}
                 treatment of features is required for video resizing.
                 This motivated us to align consecutive frames by
                 estimating interframe camera motion and to constrain
                 relative positions in the aligned frames. To preserve
                 object motion, we detect distinct moving areas of
                 objects across multiple frames and constrain each of
                 them to be resized consistently. We build a complete
                 video resizing framework by incorporating our
                 motion-aware constraints with an adaptation of the
                 scale-and-stretch optimization recently proposed by
                 Wang and colleagues. Our streaming implementation of
                 the framework allows efficient resizing of long video
                 sequences with low memory cost. Experiments demonstrate
                 that our method produces spatiotemporally coherent
                 retargeting results even for challenging examples with
                 complex camera and object motion, which are difficult
                 to handle with previous techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "127",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "optimization; spatial and temporal coherence; video
                 retargeting",
}

@Article{Matusik:2009:PSV,
  author =       "Wojciech Matusik and Boris Ajdin and Jinwei Gu and
                 Jason Lawrence and Hendrik P. A. Lensch and Fabio
                 Pellacini and Szymon Rusinkiewicz",
  title =        "Printing spatially-varying reflectance",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "128:1--128:9",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618474",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Although real-world surfaces can exhibit significant
                 variation in materials --- glossy, diffuse, metallic,
                 etc. --- printers are usually used to reproduce color
                 or gray-scale images. We propose a complete system that
                 uses appropriate inks and foils to print documents with
                 a variety of material properties. Given a set of inks
                 with known Bidirectional Reflectance Distribution
                 Functions (BRDFs), our system automatically finds the
                 optimal linear combinations to approximate the BRDFs of
                 the target documents. Novel gamut-mapping algorithms
                 preserve the relative glossiness between different
                 BRDFs, and halftoning is used to produce patterns to be
                 sent to the printer. We demonstrate the effectiveness
                 of this approach with printed samples of a number of
                 measured spatially-varying BRDFs.",
  acknowledgement = ack-nhfb,
  articleno =    "128",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ritschel:2009:IRE,
  author =       "Tobias Ritschel and Makoto Okabe and Thorsten
                 Thorm{\"a}hlen and Hans-Peter Seidel",
  title =        "Interactive reflection editing",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "129:1--129:7",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618475",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Effective digital content creation tools must be both
                 efficient in the interactions they provide but also
                 allow full user control. There may be occasions, when
                 art direction requires changes that contradict physical
                 laws. In particular, it is known that physical
                 correctness of reflections for the human observer is
                 hard to assess. For many centuries, traditional artists
                 have exploited this fact to depict reflections that lie
                 outside the realm of physical possibility. However, a
                 system that gives explicit control of this effect to
                 digital artists has not yet been described. This paper
                 introduces a system that transforms physically correct
                 reflections into art-directed reflections, as specified
                 by {\em reflection constraints}. The system introduces
                 a taxonomy of reflection editing operations, using an
                 intuitive user interface, that works directly on the
                 reflecting surfaces with real-time visual feedback
                 using a GPU. A user study shows how such a system can
                 allow users to quickly manipulate reflections according
                 to an art direction task.",
  acknowledgement = ack-nhfb,
  articleno =    "129",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "graphics hardware; intuitive editing; lighting design;
                 non-photorealistc rendering; perception;
                 post-production",
}

@Article{Bousseau:2009:UAI,
  author =       "Adrien Bousseau and Sylvain Paris and Fr{\'e}do
                 Durand",
  title =        "User-assisted intrinsic images",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "130:1--130:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618476",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "For many computational photography applications, the
                 lighting and materials in the scene are critical pieces
                 of information. We seek to obtain {\em intrinsic
                 images}, which decompose a photo into the product of an
                 {\em illumination\/} component that represents lighting
                 effects and a {\em reflectance\/} component that is the
                 color of the observed material. This is an
                 under-constrained problem and automatic methods are
                 challenged by complex natural images. We describe a new
                 approach that enables users to guide an optimization
                 with simple indications such as regions of constant
                 reflectance or illumination. Based on a simple
                 assumption on local reflectance distributions, we
                 derive a new propagation energy that enables a closed
                 form solution using linear least-squares. We achieve
                 fast performance by introducing a novel downsampling
                 that preserves local color distributions. We
                 demonstrate intrinsic image decomposition on a variety
                 of images and show applications.",
  acknowledgement = ack-nhfb,
  articleno =    "130",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational photography; intrinsic images;
                 reflectance-illumination separation",
}

@Article{Lalonde:2009:WCA,
  author =       "Jean-Fran{\c{c}}ois Lalonde and Alexei A. Efros and
                 Srinivasa G. Narasimhan",
  title =        "Webcam clip art: appearance and illuminant transfer
                 from time-lapse sequences",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "131:1--131:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618477",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Webcams placed all over the world observe and record
                 the visual appearance of a variety of outdoor scenes
                 over long periods of time. The recorded time-lapse
                 image sequences cover a wide range of illumination and
                 weather conditions -- a vast untapped resource for
                 creating visual realism. In this work, we propose to
                 use a large repository of webcams as a 'clip art'
                 library from which users may transfer scene appearance
                 (objects, scene backdrops, outdoor illumination) into
                 their own time-lapse sequences or even single
                 photographs. The goal is to combine the recent ideas
                 from data-driven appearance transfer techniques with a
                 general and theoretically-grounded physically-based
                 illumination model. To accomplish this, the paper
                 presents three main research contributions: 1) a new,
                 high-quality outdoor webcam database that has been
                 calibrated radiometrically and geometrically; 2) a
                 novel approach for matching illuminations across
                 different scenes based on the estimation of the
                 properties of natural illuminants (sun, sky, weather
                 and clouds), the camera geometry, and
                 illumination-dependent scene features; 3) a new
                 algorithm for generating physically plausible high
                 dynamic range environment maps for each frame in a
                 webcam sequence.",
  acknowledgement = ack-nhfb,
  articleno =    "131",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computer vision; HDR; image databases; image-based
                 lighting; object insertion; time-lapse video",
}

@Article{Ritschel:2009:MRS,
  author =       "T. Ritschel and T. Engelhardt and T. Grosch and H.-P.
                 Seidel and J. Kautz and C. Dachsbacher",
  title =        "Micro-rendering for scalable, parallel final
                 gathering",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "132:1--132:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618478",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Recent approaches to global illumination for dynamic
                 scenes achieve interactive frame rates by using coarse
                 approximations to geometry, lighting, or both, which
                 limits scene complexity and rendering quality.
                 High-quality global illumination renderings of complex
                 scenes are still limited to methods based on ray
                 tracing. While conceptually simple, these techniques
                 are computationally expensive. We present an efficient
                 and scalable method to compute global illumination
                 solutions at interactive rates for complex and dynamic
                 scenes. Our method is based on parallel final gathering
                 running entirely on the GPU. At each final gathering
                 location we perform {\em micro-rendering:\/} we
                 traverse and rasterize a hierarchical point-based scene
                 representation into an importance-warped {\em
                 micro-buffer}, which allows for BRDF importance
                 sampling. The final reflected radiance is computed at
                 each gathering location using the micro-buffers and is
                 then stored in image-space. We can trade quality for
                 speed by reducing the sampling rate of the gathering
                 locations in conjunction with bilateral upsampling. We
                 demonstrate the applicability of our method to
                 interactive global illumination, the simulation of
                 multiple indirect bounces, and to final gathering from
                 photon maps.",
  acknowledgement = ack-nhfb,
  articleno =    "132",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "final gathering; global illumination; GPU; real-time
                 rendering",
}

@Article{Wang:2009:AFR,
  author =       "Jiaping Wang and Peiran Ren and Minmin Gong and John
                 Snyder and Baining Guo",
  title =        "All-frequency rendering of dynamic, spatially-varying
                 reflectance",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "133:1--133:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618479",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We describe a technique for real-time rendering of
                 dynamic, spatially-varying BRDFs in static scenes with
                 all-frequency shadows from environmental and point
                 lights. The 6D SVBRDF is represented with a general
                 microfacet model and spherical lobes fit to its 4D
                 spatially-varying normal distribution function (SVNDF).
                 A sum of spherical Gaussians (SGs) provides an accurate
                 approximation with a small number of lobes. Parametric
                 BRDFs are fit on-the-fly using simple analytic
                 expressions; measured BRDFs are fit as a preprocess
                 using nonlinear optimization. Our BRDF representation
                 is compact, allows detailed textures, is closed under
                 products and rotations, and supports reflectance of
                 arbitrarily high specularity. At run-time, SGs
                 representing the NDF are warped to align the half-angle
                 vector to the lighting direction and multiplied by the
                 microfacet shadowing and Fresnel factors. This yields
                 the relevant 2D view slice on-the-fly at each pixel,
                 still represented in the SG basis. We account for
                 macro-scale shadowing using a new, nonlinear visibility
                 representation based on spherical signed distance
                 functions (SSDFs). SSDFs allow per-pixel interpolation
                 of high-frequency visibility without ghosting and can
                 be multiplied by the BRDF and lighting efficiently on
                 the GPU.",
  acknowledgement = ack-nhfb,
  articleno =    "133",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lee:2009:DFR,
  author =       "Sungkil Lee and Elmar Eisemann and Hans-Peter Seidel",
  title =        "Depth-of-field rendering with multiview synthesis",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "134:1--134:6",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618480",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a GPU-based real-time rendering method that
                 simulates high-quality depth-of-field effects, similar
                 in quality to multiview accumulation methods. Most
                 real-time approaches have difficulties to obtain good
                 approximations of visibility and view-dependent shading
                 due to the use of a single view image. Our method also
                 avoids the multiple rendering of a scene, but can
                 approximate different views by relying on a layered
                 image-based scene representation. We present several
                 performance and quality improvements, such as early
                 culling, approximate cone tracing, and jittered
                 sampling. Our method achieves artifact-free results for
                 complex scenes and reasonable depth-of-field blur in
                 real time.",
  acknowledgement = ack-nhfb,
  articleno =    "134",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Yang:2009:AS,
  author =       "Lei Yang and Diego Nehab and Pedro V. Sander and
                 Pitchaya Sitthi-amorn and Jason Lawrence and Hugues
                 Hoppe",
  title =        "Amortized supersampling",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "135:1--135:12",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618481",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a real-time rendering scheme that reuses
                 shading samples from earlier time frames to achieve
                 practical antialiasing of procedural shaders. Using a
                 reprojection strategy, we maintain several sets of
                 shading estimates at subpixel precision, and
                 incrementally update these such that for most pixels
                 only one new shaded sample is evaluated per frame. The
                 key difficulty is to prevent accumulated blurring
                 during successive reprojections. We present a
                 theoretical analysis of the blur introduced by
                 reprojection methods. Based on this analysis, we
                 introduce a nonuniform spatial filter, an adaptive
                 recursive temporal filter, and a principled scheme for
                 locally estimating the spatial blur. Our scheme is
                 appropriate for antialiasing shading attributes that
                 vary slowly over time. It works in a single rendering
                 pass on commodity graphics hardware, and offers results
                 that surpass 4x4 stratified supersampling in quality,
                 at a fraction of the cost.",
  acknowledgement = ack-nhfb,
  articleno =    "135",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Zatzarinni:2009:RAE,
  author =       "Rony Zatzarinni and Ayellet Tal and Ariel Shamir",
  title =        "Relief analysis and extraction",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "136:1--136:9",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618482",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an approach for extracting reliefs and
                 details from relief surfaces. We consider a relief
                 surface as a surface composed of two components: a base
                 surface and a height function which is defined over
                 this base. However, since the base surface is unknown,
                 the decoupling of these components is a challenge. We
                 show how to estimate a robust height function over the
                 base, without explicitly extracting the base surface.
                 This height function is utilized to separate the relief
                 from the base. Several applications benefiting from
                 this extraction are demonstrated, including relief
                 segmentation, detail exaggeration and dampening,
                 copying of details from one object to another, and
                 curve drawing on meshes.",
  acknowledgement = ack-nhfb,
  articleno =    "136",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Mehra:2009:AMM,
  author =       "Ravish Mehra and Qingnan Zhou and Jeremy Long and Alla
                 Sheffer and Amy Gooch and Niloy J. Mitra",
  title =        "Abstraction of man-made shapes",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "137:1--137:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618483",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Man-made objects are ubiquitous in the real world and
                 in virtual environments. While such objects can be very
                 detailed, capturing every small feature, they are often
                 identified and characterized by a small set of defining
                 curves. Compact, abstracted shape descriptions based on
                 such curves are often visually more appealing than the
                 original models, which can appear to be visually
                 cluttered. We introduce a novel algorithm for
                 abstracting three-dimensional geometric models using
                 characteristic curves or contours as building blocks
                 for the abstraction. Our method robustly handles models
                 with poor connectivity, including the extreme cases of
                 polygon soups, common in models of man-made objects
                 taken from online repositories. In our algorithm, we
                 use a two-step procedure that first approximates the
                 input model using a manifold, closed {\em envelope\/}
                 surface and then extracts from it a hierarchical
                 abstraction curve network along with suitable normal
                 information. The constructed curve networks form a
                 compact, yet powerful, representation for the input
                 shapes, retaining their key shape characteristics while
                 discarding minor details and irregularities.",
  acknowledgement = ack-nhfb,
  articleno =    "137",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "curve network; NPR; perception; shape analysis",
}

@Article{Xu:2009:PIR,
  author =       "Kai Xu and Hao Zhang and Andrea Tagliasacchi and
                 Ligang Liu and Guo Li and Min Meng and Yueshan Xiong",
  title =        "Partial intrinsic reflectional symmetry of {$3$D}
                 shapes",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "138:1--138:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618484",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "While many 3D objects exhibit various forms of global
                 symmetries, prominent intrinsic symmetries which exist
                 only on parts of an object are also well recognized.
                 Such partial symmetries are often seen as more natural
                 than a global one, even when the symmetric parts are
                 under complex pose. We introduce an algorithm to
                 extract {\em partial intrinsic reflectional
                 symmetries\/} (PIRS) of a 3D shape. Given a closed
                 2-manifold mesh, we develop a voting scheme to obtain
                 an intrinsic reflectional symmetry axis (IRSA)
                 transform, which is a scalar field over the mesh that
                 accentuates prominent IRSAs of the shape. We then
                 extract a set of explicit IRSA curves on the shape
                 based on a refined measure of local reflectional
                 symmetry support along a curve. The iterative
                 refinement procedure combines IRSA-induced region
                 growing and region-constrained symmetry support
                 refinement to improve accuracy and address potential
                 issues arising from rotational symmetries in the shape.
                 We show how the extracted IRSA curves can be
                 incorporated into a conventional mesh segmentation
                 scheme so that the implied symmetry cues can be
                 utilized to obtain more meaningful results. We also
                 demonstrate the use of IRSA curves for symmetry-driven
                 part repair.",
  acknowledgement = ack-nhfb,
  articleno =    "138",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Schiftner:2009:PCS,
  author =       "Alexander Schiftner and Mathias H{\"o}binger and
                 Johannes Wallner and Helmut Pottmann",
  title =        "Packing circles and spheres on surfaces",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "139:1--139:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618485",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Inspired by freeform designs in architecture which
                 involve circles and spheres, we introduce a new kind of
                 triangle mesh whose faces' incircles form a packing. As
                 it turns out, such meshes have a rich geometry and
                 allow us to cover surfaces with circle patterns, sphere
                 packings, approximate circle packings, hexagonal meshes
                 which carry a torsion-free support structure, hybrid
                 tri-hex meshes, and others. We show how triangle meshes
                 can be optimized so as to have the incircle packing
                 property. We explain their relation to conformal
                 geometry and implications on solvability of
                 optimization. The examples we give confirm that this
                 kind of meshes is a rich source of geometric structures
                 relevant to architectural geometry.",
  acknowledgement = ack-nhfb,
  articleno =    "139",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "architectural geometry; circle packing; computational
                 conformal geometry; computational differential
                 geometry; freeform surface; sphere packing; supporting
                 structures",
}

@Article{Overbeck:2009:AWR,
  author =       "Ryan S. Overbeck and Craig Donner and Ravi
                 Ramamoorthi",
  title =        "Adaptive wavelet rendering",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "140:1--140:12",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618486",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Effects such as depth of field, area lighting,
                 antialiasing and global illumination require evaluating
                 a complex high-dimensional integral at each pixel of an
                 image. We develop a new adaptive rendering algorithm
                 that greatly reduces the number of samples needed for
                 Monte Carlo integration. Our method renders directly
                 into an image-space wavelet basis. First, we adaptively
                 distribute Monte Carlo samples to reduce the variance
                 of the wavelet basis' scale coefficients, while using
                 the wavelet coefficients to find edges. Working in
                 wavelets, rather than pixels, allows us to sample not
                 only image-space edges but also other features that are
                 smooth in the image plane but have high variance in
                 other integral dimensions. In the second stage, we
                 reconstruct the image from these samples by using a
                 suitable wavelet approximation. We achieve this by
                 subtracting an estimate of the error in each wavelet
                 coefficient from its magnitude, effectively producing
                 the smoothest image consistent with the rendering
                 samples. Our algorithm renders scenes with
                 significantly fewer samples than basic Monte Carlo or
                 adaptive techniques. Moreover, the method introduces
                 minimal overhead, and can be efficiently included in an
                 optimized ray-tracing system.",
  acknowledgement = ack-nhfb,
  articleno =    "140",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hachisuka:2009:SPP,
  author =       "Toshiya Hachisuka and Henrik Wann Jensen",
  title =        "Stochastic progressive photon mapping",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "141:1--141:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618487",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents a simple extension of progressive
                 photon mapping for simulating global illumination with
                 effects such as depth-of-field, motion blur, and glossy
                 reflections. Progressive photon mapping is a robust
                 global illumination algorithm that can handle complex
                 illumination settings including
                 specular-diffuse-specular paths. The algorithm can
                 compute the correct radiance value at a point in the
                 limit. However, progressive photon mapping is not
                 effective at rendering distributed ray tracing effects,
                 such as depth-of-field, that requires multiple pixel
                 samples in order to compute the correct average
                 radiance value over a region. In this paper, we
                 introduce a new formulation of progressive photon
                 mapping, called stochastic progressive photon mapping,
                 which makes it possible to compute the correct average
                 radiance value for a region. The key idea is to use
                 shared photon statistics within the region rather than
                 isolated photon statistics at a point. The algorithm is
                 easy to implement, and our results demonstrate how it
                 efficiently handles scenes with distributed ray tracing
                 effects, while maintaining the robustness of
                 progressive photon mapping in scenes with complex
                 lighting.",
  acknowledgement = ack-nhfb,
  articleno =    "141",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Velazquez-Armendariz:2009:ABP,
  author =       "Edgar Vel{\'a}zquez-Armend{\'a}riz and Shuang Zhao and
                 Milo{\v{s}} Ha{\v{s}}an and Bruce Walter and Kavita
                 Bala",
  title =        "Automatic bounding of programmable shaders for
                 efficient global illumination",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "142:1--142:9",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618488",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper describes a technique to automatically
                 adapt programmable shaders for use in physically-based
                 rendering algorithms. Programmable shading provides
                 great flexibility and power for creating rich local
                 material detail, but only allows the material to be
                 queried in one limited way: point sampling.
                 Physically-based rendering algorithms simulate the
                 complex global flow of light through an environment but
                 rely on higher level information about the material
                 properties, such as importance sampling and bounding,
                 to intelligently solve high dimensional rendering
                 integrals.\par

                 We propose using a compiler to automatically generate
                 interval versions of programmable shaders that can be
                 used to provide the higher level query functions needed
                 by physically-based rendering without the need for user
                 intervention or expertise. We demonstrate the use of
                 programmable shaders in two such algorithms,
                 multidimensional lightcuts and photon mapping, for a
                 wide range of scenes including complex geometry,
                 materials and lighting.",
  acknowledgement = ack-nhfb,
  articleno =    "142",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "global illumination; interval arithmetic;
                 many-lights",
}

@Article{Hasan:2009:VSL,
  author =       "Milo{\v{s}} Ha{\v{s}}an and Jaroslav
                 K{\v{r}}iv{\'a}nek and Bruce Walter and Kavita Bala",
  title =        "Virtual spherical lights for many-light rendering of
                 glossy scenes",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "143:1--143:6",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618489",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this paper, we aim to lift the accuracy limitations
                 of many-light algorithms by introducing a new light
                 type, the {\em virtual spherical light\/} (VSL). The
                 illumination contribution of a VSL is computed over a
                 non-zero solid angle, thus eliminating the illumination
                 spikes that virtual point lights used in traditional
                 many-light methods are notorious for. The VSL enables
                 application of many-light approaches in scenes with
                 glossy materials and complex illumination that could
                 previously be rendered only by much slower algorithms.
                 By combining VSLs with the matrix row-column sampling
                 algorithm, we achieve high-quality images in one to
                 four minutes, even in scenes where path tracing or
                 photon mapping take hours to converge.",
  acknowledgement = ack-nhfb,
  articleno =    "143",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "global illumination; glossy BRDF; many lights",
}

@Article{Gu:2009:RIA,
  author =       "Jinwei Gu and Ravi Ramamoorthi and Peter Belhumeur and
                 Shree Nayar",
  title =        "Removing image artifacts due to dirty camera lenses
                 and thin occluders",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "144:1--144:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618490",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Dirt on camera lenses, and occlusions from thin
                 objects such as fences, are two important types of
                 artifacts in digital imaging systems. These artifacts
                 are not only an annoyance for photographers, but also a
                 hindrance to computer vision and digital forensics. In
                 this paper, we show that both effects can be described
                 by a single image formation model, wherein an
                 intermediate layer (of dust, dirt or thin occluders)
                 both attenuates the incoming light and scatters stray
                 light towards the camera. Because of camera defocus,
                 these artifacts are low-frequency and either additive
                 or multiplicative, which gives us the power to recover
                 the original scene radiance pointwise. We develop a
                 number of physics-based methods to remove these effects
                 from digital photographs and videos. For dirty camera
                 lenses, we propose two methods to estimate the
                 attenuation and the scattering of the lens dirt and
                 remove the artifacts -- either by taking several
                 pictures of a structured calibration pattern
                 beforehand, or by leveraging natural image statistics
                 for post-processing existing images. For artifacts from
                 thin occluders, we propose a simple yet effective
                 iterative method that recovers the original scene from
                 multiple apertures. The method requires two images if
                 the depths of the scene and the occluder layer are
                 known, or three images if the depths are unknown. The
                 effectiveness of our proposed methods are demonstrated
                 by both simulated and real experimental results.",
  acknowledgement = ack-nhfb,
  articleno =    "144",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational photography; image enhancement",
}

@Article{Cho:2009:FMD,
  author =       "Sunghyun Cho and Seungyong Lee",
  title =        "Fast motion deblurring",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "145:1--145:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618491",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents a fast deblurring method that
                 produces a deblurring result from a single image of
                 moderate size in a few seconds. We accelerate both
                 latent image estimation and kernel estimation in an
                 iterative deblurring process by introducing a novel
                 prediction step and working with image derivatives
                 rather than pixel values. In the prediction step, we
                 use simple image processing techniques to predict
                 strong edges from an estimated latent image, which will
                 be solely used for kernel estimation. With this
                 approach, a computationally efficient Gaussian prior
                 becomes sufficient for deconvolution to estimate the
                 latent image, as small deconvolution artifacts can be
                 suppressed in the prediction. For kernel estimation, we
                 formulate the optimization function using image
                 derivatives, and accelerate the numerical process by
                 reducing the number of Fourier transforms needed for a
                 conjugate gradient method. We also show that the
                 formulation results in a smaller condition number of
                 the numerical system than the use of pixel values,
                 which gives faster convergence. Experimental results
                 demonstrate that our method runs an order of magnitude
                 faster than previous work, while the deblurring quality
                 is comparable. GPU implementation facilitates further
                 speed-up, making our method fast enough for practical
                 use.",
  acknowledgement = ack-nhfb,
  articleno =    "145",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "deblurring; image restoration; motion blur",
}

@Article{Chen:2009:NBI,
  author =       "Jia Chen and Chi-Keung Tang and Jue Wang",
  title =        "Noise brush: interactive high quality image-noise
                 separation",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "146:1--146:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618492",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper proposes an {\em interactive\/} approach
                 using {\em joint image-noise filtering\/} for achieving
                 high quality image-noise separation. The core of the
                 system is our novel joint image-noise filter which
                 operates in both image and noise domain, and can
                 effectively separate noise from both high and low
                 frequency image structures. A novel user interface is
                 introduced, which allows the user to interact with both
                 the image and the noise layer, and apply the filter
                 adaptively and locally to achieve optimal results. A
                 comprehensive and quantitative evaluation shows that
                 our interactive system can significantly improve the
                 initial image-noise separation results. Our system can
                 also be deployed in various noise-consistent image
                 editing tasks, where preserving the noise
                 characteristics inherent in the input image is a
                 desired feature.",
  acknowledgement = ack-nhfb,
  articleno =    "146",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Subr:2009:EPM,
  author =       "Kartic Subr and Cyril Soler and Fr{\'e}do Durand",
  title =        "Edge-preserving multiscale image decomposition based
                 on local extrema",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "147:1--147:9",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618493",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We propose a new model for detail that inherently
                 captures {\em oscillations}, a key property that
                 distinguishes textures from individual edges. Inspired
                 by techniques in empirical data analysis and
                 morphological image analysis, we use the local extrema
                 of the input image to extract information about
                 oscillations: We define detail as oscillations between
                 local minima and maxima. Building on the key
                 observation that the spatial scale of oscillations are
                 characterized by the density of local extrema, we
                 develop an algorithm for decomposing images into
                 multiple scales of superposed oscillations.\par

                 Current edge-preserving image decompositions assume
                 image detail to be low contrast variation. Consequently
                 they apply filters that extract features with
                 increasing contrast as successive layers of detail. As
                 a result, they are unable to distinguish between
                 high-contrast, fine-scale features and edges of similar
                 contrast that are to be preserved. We compare our
                 results with existing edge-preserving image
                 decomposition algorithms and demonstrate exciting
                 applications that are made possible by our new notion
                 of detail.",
  acknowledgement = ack-nhfb,
  articleno =    "147",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computational photography; image decomposition",
}

@Article{Gingold:2009:SAM,
  author =       "Yotam Gingold and Takeo Igarashi and Denis Zorin",
  title =        "Structured annotations for {$2$D-to-$3$D} modeling",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "148:1--148:9",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618494",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a system for 3D modeling of free-form
                 surfaces from 2D sketches. Our system frees users to
                 create 2D sketches from arbitrary angles using their
                 preferred tool, which may include pencil and paper. A
                 3D model is created by placing primitives and
                 annotations on the 2D image. Our primitives are based
                 on commonly used sketching conventions and allow users
                 to maintain a single view of the model. This eliminates
                 the frequent view changes inherent to existing 3D
                 modeling tools, both traditional and sketch-based, and
                 enables users to match input to the 2D guide image. Our
                 annotations---same-lengths and angles, alignment,
                 mirror symmetry, and connection curves---allow the user
                 to communicate higher-level semantic information;
                 through them our system builds a consistent model even
                 in cases where the original image is inconsistent. We
                 present the results of a user study comparing our
                 approach to a conventional 'sketch-rotate-sketch'
                 workflow.",
  acknowledgement = ack-nhfb,
  articleno =    "148",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "annotations; image-based modeling; interactive
                 modeling; sketch-based modeling; user interfaces",
}

@Article{Schmidt:2009:ADS,
  author =       "Ryan Schmidt and Azam Khan and Karan Singh and Gord
                 Kurtenbach",
  title =        "Analytic drawing of {$3$D} scaffolds",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "149:1--149:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618495",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We describe a novel approach to inferring 3D curves
                 from perspective drawings in an interactive design
                 tool. Our methods are based on a traditional design
                 drawing style known as {\em analytic drawing}, which
                 supports precise image-space construction of a linear
                 3D scaffold. This scaffold in turn acts as a set of
                 visual constraints for sketching 3D curves. We
                 implement analytic drawing techniques in a
                 pure-inference sketching interface which supports both
                 single-and multi-view incremental construction of
                 complex scaffolds and curve networks. A new
                 representation of 3D drawings is proposed, and useful
                 interactive drawing aids are described. Novel
                 techniques are presented for deriving constraints from
                 single-view sketches drawn relative to the current 3D
                 scaffold, and then inferring 3D line and curve geometry
                 which satisfies these constraints. The resulting
                 analytic drawing tool allows 3D drawings to be
                 constructed using exactly the same strokes as one would
                 make on paper.",
  acknowledgement = ack-nhfb,
  articleno =    "149",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Fisher:2009:DPC,
  author =       "Matthew Fisher and Kayvon Fatahalian and Solomon
                 Boulos and Kurt Akeley and William R. Mark and Pat
                 Hanrahan",
  title =        "{DiagSplit}: parallel, crack-free, adaptive
                 tessellation for micropolygon rendering",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "150:1--150:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618496",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present DiagSplit, a parallel algorithm for
                 adaptively tessellating displaced parametric surfaces
                 into high-quality, crack-free micropolygon meshes.
                 DiagSplit modifies the split-dice tessellation
                 algorithm to allow splits along non-isoparametric
                 directions in the surface's parametric domain, and uses
                 a dicing scheme that supports unique tessellation
                 factors for each subpatch edge. Edge tessellation
                 factors are computed using only information local to
                 subpatch edges. These modifications allow all
                 subpatches generated by DiagSplit to be processed
                 independently without introducing T-junctions or mesh
                 cracks and without incurring the tessellation overhead
                 of binary dicing. We demonstrate that DiagSplit
                 produces output that is better (in terms of image
                 quality and number of micropolygons produced) than
                 existing parallel tessellation schemes, and as good as
                 highly adaptive split-dice implementations that are
                 less amenable to parallelization.",
  acknowledgement = ack-nhfb,
  articleno =    "150",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "micropolygons; real-time rendering; tessellation",
}

@Article{Loop:2009:ASS,
  author =       "Charles Loop and Scott Schaefer and Tianyun Ni and
                 Ignacio Casta{\~n}o",
  title =        "Approximating subdivision surfaces with {Gregory}
                 patches for hardware tessellation",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "151:1--151:9",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618497",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new method for approximating subdivision
                 surfaces with hardware accelerated parametric patches.
                 Our method improves the memory bandwidth requirements
                 for patch control points, translating into superior
                 performance compared to existing methods. Our input is
                 general, allowing for meshes that contain both
                 quadrilateral and triangular faces in the input control
                 mesh, as well as control meshes with boundary. We
                 present two implementations of our scheme designed to
                 run on Direct3D 11 class hardware equipped with a
                 tessellator unit.",
  acknowledgement = ack-nhfb,
  articleno =    "151",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Kainz:2009:RCM,
  author =       "Bernhard Kainz and Markus Grabner and Alexander Bornik
                 and Stefan Hauswiesner and Judith Muehl and Dieter
                 Schmalstieg",
  title =        "Ray casting of multiple volumetric datasets with
                 polyhedral boundaries on manycore {GPUs}",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "152:1--152:9",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618498",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a new GPU-based rendering system for ray
                 casting of multiple volumes. Our approach supports a
                 large number of volumes, complex translucent and
                 concave polyhedral objects as well as CSG intersections
                 of volumes and geometry in any combination. The system
                 (including the rasterization stage) is implemented
                 entirely in CUDA, which allows full control of the
                 memory hierarchy, in particular access to high
                 bandwidth and low latency shared memory. High depth
                 complexity, which is problematic for conventional
                 approaches based on depth peeling, can be handled
                 successfully. As far as we know, our approach is the
                 first framework for multivolume rendering which
                 provides interactive frame rates when concurrently
                 rendering more than 50 arbitrarily overlapping volumes
                 on current graphics hardware.",
  acknowledgement = ack-nhfb,
  articleno =    "152",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Hou:2009:DGS,
  author =       "Qiming Hou and Kun Zhou and Baining Guo",
  title =        "Debugging {GPU} stream programs through automatic
                 dataflow recording and visualization",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "153:1--153:11",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618499",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel framework for debugging GPU stream
                 programs through automatic dataflow recording and
                 visualization. Our debugging system can help
                 programmers locate errors that are common in general
                 purpose stream programs but very difficult to debug
                 with existing tools. A stream program is first compiled
                 into an instrumented program using a compiler. This
                 instrumenting compiler automatically adds to the
                 original program dataflow recording code that saves the
                 information of all GPU memory operations into log
                 files. The resulting stream program is then executed on
                 the GPU. With dataflow recording, our debugger
                 automatically detects common memory errors such as
                 out-of-bound access, uninitialized data access, and
                 race conditions -- these errors are extremely difficult
                 to debug with existing tools. When the instrumented
                 program terminates, either normally or due to an error,
                 a dataflow visualizer is launched and it allows the
                 user to examine the memory operation history of all
                 threads and values in all streams. Thus the user can
                 analyze error sources by tracing through relevant
                 threads and streams using the recorded dataflow.\par

                 A key ingredient of our debugging framework is {\em the
                 GPU interrupt}, a novel mechanism that we introduce to
                 support CPU function calls from inside GPU code. We
                 enable interrupts on the GPU by designing a specialized
                 compilation algorithm that translates these interrupts
                 into GPU kernels and CPU management code. Dataflow
                 recording involving disk I/O operations can thus be
                 implemented as interrupt handlers. The GPU interrupt
                 mechanism also allows the programmer to discover errors
                 in more active ways by developing customized debugging
                 functions that can be directly used in GPU code. As
                 examples we show two such functions: assert for data
                 verification and watch for visualizing intermediate
                 results.",
  acknowledgement = ack-nhfb,
  articleno =    "153",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "debugging; GPGPU; interrupt; stream programming",
}

@Article{Alcantara:2009:RTP,
  author =       "Dan A. Alcantara and Andrei Sharf and Fatemeh
                 Abbasinejad and Shubhabrata Sengupta and Michael
                 Mitzenmacher and John D. Owens and Nina Amenta",
  title =        "Real-time parallel hashing on the {GPU}",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "154:1--154:9",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618500",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We demonstrate an efficient data-parallel algorithm
                 for building large hash tables of millions of elements
                 in real-time. We consider two parallel algorithms for
                 the construction: a classical sparse perfect hashing
                 approach, and cuckoo hashing, which packs elements
                 densely by allowing an element to be stored in one of
                 multiple possible locations. Our construction is a
                 hybrid approach that uses both algorithms. We measure
                 the construction time, access time, and memory usage of
                 our implementations and demonstrate real-time
                 performance on large datasets: for 5 million key-value
                 pairs, we construct a hash table in 35.7 ms using 1.42
                 times as much memory as the input data itself, and we
                 can access all the elements in that hash table in 15.3
                 ms. For comparison, sorting the same data requires 36.6
                 ms, but accessing all the elements via binary search
                 requires 79.5 ms. Furthermore, we show how our hashing
                 methods can be applied to two graphics applications: 3D
                 surface intersection for moving data and geometric
                 hashing for image matching.",
  acknowledgement = ack-nhfb,
  articleno =    "154",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "cuckoo hashing; GPU computing; hash tables; parallel
                 data structures; parallel hash tables",
}

@Article{Zhou:2009:RIR,
  author =       "Kun Zhou and Qiming Hou and Zhong Ren and Minmin Gong
                 and Xin Sun and Baining Guo",
  title =        "{RenderAnts}: interactive {Reyes} rendering on
                 {GPUs}",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "155:1--155:11",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618501",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present RenderAnts, the first system that enables
                 interactive Reyes rendering on GPUs. Taking RenderMan
                 scenes and shaders as input, our system first compiles
                 RenderMan shaders to GPU shaders. Then all stages of
                 the basic Reyes pipeline, including bounding/splitting,
                 dicing, shading, sampling, compositing and filtering,
                 are executed on GPUs using carefully designed
                 data-parallel algorithms. Advanced effects such as
                 shadows, motion blur and depth-of-field can also be
                 rendered. In order to avoid exhausting GPU memory, we
                 introduce a novel dynamic scheduling algorithm to bound
                 the memory consumption during rendering. The algorithm
                 automatically adjusts the amount of data being
                 processed in parallel at each stage so that all data
                 can be maintained in the available GPU memory. This
                 allows our system to maximize the parallelism in all
                 individual stages of the pipeline and achieve superior
                 performance. We also propose a multi-GPU scheduling
                 technique based on work stealing so that the system can
                 support scalable rendering on multiple GPUs. The
                 scheduler is designed to minimize inter-GPU
                 communication and balance workloads among GPUs.\par

                 We demonstrate the potential of RenderAnts using
                 several complex RenderMan scenes and an open source
                 movie entitled Elephants Dream. Compared to Pixar's
                 PRMan, our system can generate images of comparably
                 high quality, but is over one order of magnitude
                 faster. For moderately complex scenes, the system
                 allows the user to change the viewpoint, lights and
                 materials while producing photorealistic results at
                 interactive speed.",
  acknowledgement = ack-nhfb,
  articleno =    "155",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "dynamic scheduling; feature-film rendering; GPGPU;
                 out-of-core texture fetch; RenderMan; shaders",
}

@Article{Mitra:2009:SA,
  author =       "Niloy J. Mitra and Mark Pauly",
  title =        "Shadow art",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "156:1--156:7",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618502",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "'To them, I said, the truth would be literally nothing
                 but the shadows of the images.' - {\em Plato, The
                 Republic\/}\par

                 Shadow art is a unique form of sculptural art where the
                 2D shadows cast by a 3D sculpture are essential for the
                 artistic effect. We introduce computational tools for
                 the creation of shadow art and propose a design process
                 where the user can directly specify the desired shadows
                 by providing a set of binary images and corresponding
                 projection information. Since multiple shadow images
                 often contradict each other, we present a geometric
                 optimization that computes a 3D shadow volume whose
                 shadows best approximate the provided input images. Our
                 analysis shows that this optimization is essential for
                 obtaining physically realizable 3D sculptures. The
                 resulting shadow volume can then be modified with a set
                 of interactive editing tools that automatically respect
                 the often intricate shadow constraints. We demonstrate
                 the potential of our system with a number of complex 3D
                 shadow art sculptures that go beyond what is seen in
                 contemporary art pieces.",
  acknowledgement = ack-nhfb,
  articleno =    "156",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Lo:2009:PP,
  author =       "Kui-Yip Lo and Chi-Wing Fu and Hongwei Li",
  title =        "{$3$D} polyomino puzzle",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "157:1--157:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618503",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents a computer-aided geometric design
                 approach to realize a new genre of 3D puzzle, namely
                 the {\em 3D Polyomino puzzle}. We base our puzzle
                 pieces on the family of 2D shapes known as {\em
                 polyominoes\/} in recreational mathematics, and
                 construct the 3D puzzle model by covering its geometry
                 with polyominolike shapes. We first apply quad-based
                 surface parametrization to the input solid, and tile
                 the parametrized surface with polyominoes. Then, we
                 construct a nonintersecting offset surface inside the
                 input solid and shape the puzzle pieces to fit inside a
                 thick shell volume. Finally, we develop a family of
                 associated techniques for precisely constructing the
                 geometry of individual puzzle pieces, including the
                 ring-based ordering scheme, the motion space analysis
                 technique, and the tab and blank construction method.
                 The final completed puzzle model is guaranteed to be
                 not only buildable, but also interlocking and
                 maintainable.",
  acknowledgement = ack-nhfb,
  articleno =    "157",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "computer-aided design; polyomino; puzzle",
}

@Article{Popescu:2009:GC,
  author =       "Voicu Popescu and Paul Rosen and Nicoletta
                 Adamo-Villani",
  title =        "The graph camera",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "158:1--158:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618504",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "A conventional pinhole camera captures only a small
                 fraction of a 3-D scene due to occlusions. We introduce
                 the graph camera, a non-pinhole with rays that
                 circumvent occluders to create a single layer image
                 that shows simultaneously several regions of interest
                 in a 3-D scene. The graph camera image exhibits good
                 continuity and little redundancy. The graph camera
                 model is literally a graph of tens of planar pinhole
                 cameras. A fast projection operation allows rendering
                 in feed-forward fashion, at interactive rates, which
                 provides support for dynamic scenes. The graph camera
                 is an infrastructure level tool with many applications.
                 We explore the graph camera benefits in the contexts of
                 virtual 3-D scene exploration and summarization, and in
                 the context of real-world 3-D scene visualization. The
                 graph camera allows integrating multiple video feeds
                 seamlessly, which enables monitoring complex real-world
                 spaces with a single image.",
  acknowledgement = ack-nhfb,
  articleno =    "158",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "camera models; image-based rendering; interactive
                 rendering; non-pinholes; panoramas; video integration",
}

@Article{Hirsch:2009:BST,
  author =       "Matthew Hirsch and Douglas Lanman and Henry Holtzman
                 and Ramesh Raskar",
  title =        "{BiDi} screen: a thin, depth-sensing {LCD} for {$3$D}
                 interaction using light fields",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "159:1--159:9",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618505",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We transform an LCD into a display that supports both
                 2D multi-touch and unencumbered 3D gestures. Our
                 BiDirectional (BiDi) screen, capable of both image
                 capture and display, is inspired by emerging LCDs that
                 use embedded optical sensors to detect multiple points
                 of contact. Our key contribution is to exploit the
                 spatial light modulation capability of LCDs to allow
                 lensless imaging without interfering with display
                 functionality. We switch between a display mode showing
                 traditional graphics and a capture mode in which the
                 backlight is disabled and the LCD displays a pinhole
                 array or an equivalent tiled-broadband code. A
                 large-format image sensor is placed slightly behind the
                 liquid crystal layer. Together, the image sensor and
                 LCD form a mask-based light field camera, capturing an
                 array of images equivalent to that produced by a camera
                 array spanning the display surface. The recovered
                 multi-view orthographic imagery is used to passively
                 estimate the depth of scene points. Two motivating
                 applications are described: a hybrid touch plus gesture
                 interaction and a light-gun mode for interacting with
                 external light-emitting widgets. We show a working
                 prototype that simulates the image sensor with a camera
                 and diffuser, allowing interaction up to 50 cm in front
                 of a modified 20.1 inch LCD.",
  acknowledgement = ack-nhfb,
  articleno =    "159",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "3D interaction; 3D reconstruction; depth from focus;
                 image-based relighting; LCD; lensless imaging; light
                 field",
}

@Article{Masia:2009:ERT,
  author =       "Belen Masia and Sandra Agustin and Roland W. Fleming
                 and Olga Sorkine and Diego Gutierrez",
  title =        "Evaluation of reverse tone mapping through varying
                 exposure conditions",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "160:1--160:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618506",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Most existing image content has low dynamic range
                 (LDR), which necessitates effective methods to display
                 such legacy content on high dynamic range (HDR)
                 devices. Reverse tone mapping operators (rTMOs) aim to
                 take LDR content as input and adjust the contrast
                 intelligently to yield output that recreates the HDR
                 experience. In this paper we show that current rTMO
                 approaches fall short when the input image is not
                 exposed properly. More specifically, we report a series
                 of perceptual experiments using a Brightside HDR
                 display and show that, while existing rTMOs perform
                 well for under-exposed input data, the perceived
                 quality degrades substantially with over-exposure, to
                 the extent that in some cases subjects prefer the LDR
                 originals to images that have been treated with rTMOs.
                 We show that, in these cases, a simple rTMO based on
                 gamma expansion avoids the errors introduced by other
                 methods, and propose a method to automatically set a
                 suitable gamma value for each image, based on the image
                 key and empirical data. We validate the results both by
                 means of perceptual experiments and using a recent
                 image quality metric, and show that this approach
                 enhances visible details without causing artifacts in
                 incorrectly-exposed regions. Additionally, we perform
                 another set of experiments which suggest that spatial
                 artifacts introduced by rTMOs are more disturbing than
                 inaccuracies in the expanded intensities. Together,
                 these findings suggest that when the quality of the
                 input data is unknown, reverse tone mapping should be
                 handled with simple, non-aggressive methods to achieve
                 the desired effect.",
  acknowledgement = ack-nhfb,
  articleno =    "160",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "high dynamic range imaging; human visual system; image
                 processing; perception; psychophysics; tone
                 management",
}

@Article{Kim:2009:RCG,
  author =       "Yongjin Kim and Cheolhun Jang and Julien Demouth and
                 Seungyong Lee",
  title =        "Robust color-to-gray via nonlinear global mapping",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "161:1--161:4",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618507",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper presents a fast color-to-gray conversion
                 algorithm which robustly reproduces the visual
                 appearance of a color image in grayscale. The
                 conversion preserves feature discriminability and
                 reasonable color ordering, while respecting the
                 original lightness of colors, by simple optimization of
                 a nonlinear global mapping. Experimental results show
                 that our method produces convincing results for a
                 variety of color images. We further extend the method
                 to temporally coherent color-to-gray video
                 conversion.",
  acknowledgement = ack-nhfb,
  articleno =    "161",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "color-to-grayscale; video decolorization",
}

@Article{Chang:2009:SAE,
  author =       "Jianghao Chang and Beno{\^\i}t Alain and Victor
                 Ostromoukhov",
  title =        "Structure-aware error diffusion",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "162:1--162:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618508",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an original error-diffusion method which
                 produces visually pleasant halftone images while
                 preserving fine details and visually identifiable
                 structures present in the original images. Our method
                 is conceptually simple and computationally efficient.
                 The source image is analyzed, and its local frequency
                 content is detected. The main component of the
                 frequency content (main frequency, orientation and
                 contrast) serve as lookup table indices to a
                 pre-calculated database of modifications to a standard
                 error diffusion. The modifications comprise threshold
                 modulation and variation of error-diffusion
                 coefficients. The whole system is calibrated in such a
                 way that the produced halftone images are visually
                 close to the original images (patches of constant
                 intensity, patches containing sinusoidal waves of
                 different frequencies/orientations/contrasts, as well
                 as natural images of different origins). Our system
                 produces images of visual quality comparable to that
                 presented in [Pang et al. 2008], but much faster. When
                 processing typical images of linear size of several
                 hundreds of pixels, our error-diffusion system is two
                 to three orders of magnitude faster than [Pang et al.
                 2008]. Thanks to its speed combined with high visual
                 quality, our error-diffusion algorithm can be used in
                 many practical applications which may require digital
                 halftoning: printing, visualization, geometry
                 processing, various sampling techniques, etc.",
  acknowledgement = ack-nhfb,
  articleno =    "162",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Mitra:2009:EI,
  author =       "Niloy J. Mitra and Hung-Kuo Chu and Tong-Yee Lee and
                 Lior Wolf and Hezy Yeshurun and Daniel Cohen-Or",
  title =        "Emerging images",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "163:1--163:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618509",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Emergence refers to the unique human ability to
                 aggregate information from seemingly meaningless
                 pieces, and to perceive a whole that is meaningful.
                 This special skill of humans can constitute an
                 effective scheme to tell humans and machines apart.
                 This paper presents a synthesis technique to generate
                 images of 3D objects that are detectable by humans, but
                 difficult for an automatic algorithm to recognize. The
                 technique allows generating an infinite number of
                 images with emerging figures. Our algorithm is designed
                 so that locally the synthesized images divulge little
                 useful information or cues to assist any segmentation
                 or recognition procedure. Therefore, as we demonstrate,
                 computer vision algorithms are incapable of effectively
                 processing such images. However, when a human observer
                 is presented with an emergence image, synthesized using
                 an object she is familiar with, the figure emerges when
                 observed as a whole. We can control the difficulty
                 level of perceiving the emergence effect through a
                 limited set of parameters. A procedure that synthesizes
                 emergence images can be an effective tool for exploring
                 and understanding the factors affecting computer vision
                 techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "163",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Jakob:2009:CHA,
  author =       "Wenzel Jakob and Jonathan T. Moon and Steve
                 Marschner",
  title =        "Capturing hair assemblies fiber by fiber",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "164:1--164:9",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618510",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Hair models for computer graphics consist of many
                 curves representing individual hair fibers. In current
                 practice these curves are generated by ad hoc random
                 processes, and in close-up views their arrangement
                 appears plainly different from real hair. To begin
                 improving this situation, this paper presents a new
                 method for measuring the detailed arrangement of fibers
                 in a hair assembly. Many macrophotographs with shallow
                 depth of field are taken of a sample of hair, sweeping
                 the plane of focus through the hair's volume. The
                 shallow depth of field helps isolate the fibers and
                 reduces occlusion. Several sweeps are performed with
                 the hair at different orientations, resulting in
                 multiple observations of most of the clearly visible
                 fibers. The images are filtered to detect the fibers,
                 and the resulting feature data from all images is used
                 jointly in a hair growing process to construct smooth
                 curves along the observed fibers. Finally, additional
                 hairs are generated to fill in the unseen volume inside
                 the hair. The method is demonstrated on both straight
                 and wavy hair, with results suitable for realistic
                 close-up renderings. These models provide the first
                 views we know of into the 3D arrangement of hair fibers
                 in real hair assemblies.",
  acknowledgement = ack-nhfb,
  articleno =    "164",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "3D scanning; hair",
}

@Article{Zinke:2009:PAP,
  author =       "Arno Zinke and Martin Rump and Tom{\'a}s Lay and
                 Andreas Weber and Anton Andriyenko and Reinhard Klein",
  title =        "A practical approach for photometric acquisition of
                 hair color",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "165:1--165:9",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618511",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "In this work a practical approach to photometric
                 acquisition of hair color is presented. Based on a
                 single input photograph of a simple setup we are able
                 to extract physically plausible optical properties of
                 hair and to render virtual hair closely matching the
                 original. Our approach does not require any costly
                 special hardware but a standard consumer camera only.",
  acknowledgement = ack-nhfb,
  articleno =    "165",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "BCSDF; hair modeling; hair rendering",
}

@Article{Yuksel:2009:HM,
  author =       "Cem Yuksel and Scott Schaefer and John Keyser",
  title =        "Hair meshes",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "166:1--166:7",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618512",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Despite the visual importance of hair and the
                 attention paid to hair modeling in the graphics
                 research, modeling realistic hair still remains a very
                 challenging task that can be performed by very few
                 artists. In this paper we present {\em hair meshes}, a
                 new method for modeling hair that aims to bring hair
                 modeling as close as possible to modeling polygonal
                 surfaces. This new approach provides artists with
                 direct control of the overall shape of the hair, giving
                 them the ability to model the exact hair shape they
                 desire. We use the hair mesh structure for modeling the
                 hair volume with topological constraints that allow us
                 to automatically and uniquely trace the path of
                 individual hair strands through this volume. We also
                 define a set of topological operations for creating
                 hair meshes that maintain these constraints.
                 Furthermore, we provide a method for hiding the
                 volumetric structure of the hair mesh from the end
                 user, thus allowing artists to concentrate on
                 manipulating the outer surface of the hair as a
                 polygonal surface. We explain and show examples of how
                 hair meshes can be used to generate individual hair
                 strands for a wide variety of realistic hair styles.",
  acknowledgement = ack-nhfb,
  articleno =    "166",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "hair mesh; hair modeling; volume modeling",
}

@Article{Talton:2009:EMC,
  author =       "Jerry O. Talton and Daniel Gibson and Lingfeng Yang
                 and Pat Hanrahan and Vladlen Koltun",
  title =        "Exploratory modeling with collaborative design
                 spaces",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "167:1--167:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618513",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Enabling ordinary people to create high-quality 3D
                 models is a long-standing problem in computer graphics.
                 In this work, we draw from the literature on design and
                 human cognition to better understand the design
                 processes of novice and casual modelers, whose goals
                 and motivations are often distinct from those of
                 professional artists. The result is a method for
                 creating {\em exploratory\/} modeling tools, which are
                 appropriate for casual users who may lack
                 rigidly-specified goals or operational knowledge of
                 modeling techniques.\par

                 Our method is based on parametric design spaces, which
                 are often high dimensional and contain wide quality
                 variations. Our system estimates the distribution of
                 good models in a space by tracking the modeling
                 activity of a distributed community of users. These
                 estimates drive intuitive modeling tools, creating a
                 self-reinforcing system that becomes easier to use as
                 more people participate.\par

                 We present empirical evidence that the tools developed
                 with our method allow rapid creation of complex,
                 high-quality 3D models by users with no specialized
                 modeling skills or experience. We report analyses of
                 usage patterns garnered throughout the year-long
                 deployment of one such tool, and demonstrate the
                 generality of the method by applying it to several
                 design spaces.",
  acknowledgement = ack-nhfb,
  articleno =    "167",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "collaboration; exploration; modeling",
}

@Article{Wang:2009:OWC,
  author =       "Jack M. Wang and David J. Fleet and Aaron Hertzmann",
  title =        "Optimizing walking controllers",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "168:1--168:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618514",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This paper describes a method for optimizing the
                 parameters of a physics-based controller for full-body,
                 3D walking. A modified version of the SIMBICON
                 controller [Yin et al. 2007] is optimized for
                 characters of varying body shape, walking speed and
                 step length. The objective function includes terms for
                 power minimization, angular momentum minimization, and
                 minimal head motion, among others. Together these terms
                 produce a number of important features of natural
                 walking, including active toe-off, near-passive knee
                 swing, and leg extension during swing. We explain the
                 specific form of our objective criteria, and show the
                 importance of each term to walking style. We
                 demonstrate optimized controllers for walking with
                 different speeds, variation in body shape, and in
                 ground slope.",
  acknowledgement = ack-nhfb,
  articleno =    "168",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "controller synthesis; human motion; optimization;
                 physics-based animation",
}

@Article{Lee:2009:CCC,
  author =       "Yongjoon Lee and Seong Jae Lee and Zoran Popovi{\'c}",
  title =        "Compact character controllers",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "169:1--169:8",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618515",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present methods for creating compact and efficient
                 data-driven character controllers. Our first method
                 identifies the essential motion data examples tailored
                 for a given task. It enables complex yet efficient
                 high-dimensional controllers, as well as automatically
                 generated connecting controllers that merge a set of
                 independent controllers into a much larger aggregate
                 one without modifying existing ones. Our second method
                 iteratively refines basis functions to enable highly
                 complex value functions. We show that our methods
                 dramatically reduce the computation and storage
                 requirement of controllers and enable very complex
                 behaviors.",
  acknowledgement = ack-nhfb,
  articleno =    "169",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "data driven animation; human animation; optimal
                 control",
}

@Article{Coros:2009:RTB,
  author =       "Stelian Coros and Philippe Beaudoin and Michiel van de
                 Panne",
  title =        "Robust task-based control policies for physics-based
                 characters",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "170:1--170:9",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618516",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a method for precomputing robust task-based
                 control policies for physically simulated characters.
                 This allows for characters that can demonstrate skill
                 and purpose in completing a given task, such as walking
                 to a target location, while physically interacting with
                 the environment in significant ways. As input, the
                 method assumes an abstract action vocabulary consisting
                 of balance-aware, step-based controllers. A novel
                 constrained state exploration phase is first used to
                 define a character dynamics model as well as a finite
                 volume of character states over which the control
                 policy will be defined. An optimized control policy is
                 then computed using reinforcement learning. The final
                 policy spans the cross-product of the character state
                 and task state, and is more robust than the controllers
                 it is constructed from. We demonstrate real-time
                 results for six locomotion-based tasks and on three
                 highly-varied bipedal characters. We further provide a
                 game-scenario demonstration.",
  acknowledgement = ack-nhfb,
  articleno =    "170",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "animation; simulation of skilled movement",
}

@Article{Lau:2009:MST,
  author =       "Manfred Lau and Ziv Bar-Joseph and James Kuffner",
  title =        "Modeling spatial and temporal variation in motion
                 data",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "171:1--171:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618517",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a novel method to model and synthesize
                 variation in motion data. Given a few examples of a
                 particular type of motion as input, we learn a
                 generative model that is able to synthesize a family of
                 spatial and temporal variants that are statistically
                 similar to the input examples. The new variants retain
                 the features of the original examples, but are {\em not
                 exact copies\/} of them. We learn a Dynamic Bayesian
                 Network model from the input examples that enables us
                 to capture properties of conditional independence in
                 the data, and model it using a multivariate probability
                 distribution. We present results for a variety of human
                 motion, and 2D handwritten characters. We perform a
                 user study to show that our new variants are less
                 repetitive than typical game and crowd simulation
                 approaches of re-playing a small number of existing
                 motion clips. Our technique can synthesize new variants
                 efficiently and has a small memory requirement.",
  acknowledgement = ack-nhfb,
  articleno =    "171",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "human animation; machine learning; motion capture;
                 variation",
}

@Article{Levine:2009:RTP,
  author =       "Sergey Levine and Christian Theobalt and Vladlen
                 Koltun",
  title =        "Real-time prosody-driven synthesis of body language",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "172:1--172:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618518",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Human communication involves not only speech, but also
                 a wide variety of gestures and body motions.
                 Interactions in virtual environments often lack this
                 multi-modal aspect of communication. We present a
                 method for automatically synthesizing body language
                 animations directly from the participants' speech
                 signals, without the need for additional input. Our
                 system generates appropriate body language animations
                 by selecting segments from motion capture data of real
                 people in conversation. The synthesis can be performed
                 progressively, with no advance knowledge of the
                 utterance, making the system suitable for animating
                 characters from live human speech. The selection is
                 driven by a hidden Markov model and uses prosody-based
                 features extracted from speech. The training phase is
                 fully automatic and does not require hand-labeling of
                 input data, and the synthesis phase is efficient enough
                 to run in real time on live microphone input. User
                 studies confirm that our method is able to produce
                 realistic and compelling body language.",
  acknowledgement = ack-nhfb,
  articleno =    "172",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "control; data-driven animation; gesture synthesis;
                 human animation; nonverbal behavior generation",
}

@Article{Shi:2009:CMS,
  author =       "Xiaohan Shi and Hujun Bao and Kun Zhou",
  title =        "Out-of-core multigrid solver for streaming meshes",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "173:1--173:7",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618519",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present an out-of-core multigrid for solving the
                 Poisson equation defined over gigantic meshes. This
                 enables gradient-domain operations on out-of-core
                 meshes with irregular connectivity. Taking a streaming
                 mesh and boundary constraints as input, our solver
                 builds a multigrid hierarchy and refines the multigrid
                 solution progressively by performing all operations as
                 streaming computations. A set of rules are carefully
                 designed to make neighboring multigrid nodes perform
                 tasks cooperatively and efficiently. With a sublinear
                 memory growth with respect to the number of mesh
                 vertices, our approach handles meshes with 14M vertices
                 using merely 84MB of memory, while an equivalent
                 in-core multigrid implementation fails to fit into 2GB
                 memory space.",
  acknowledgement = ack-nhfb,
  articleno =    "173",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "gradient domain mesh editing; irregular domain;
                 out-of-core multigrid solver; Poisson equation",
}

@Article{Vlasic:2009:DSC,
  author =       "Daniel Vlasic and Pieter Peers and Ilya Baran and Paul
                 Debevec and Jovan Popovi{\'c} and Szymon Rusinkiewicz
                 and Wojciech Matusik",
  title =        "Dynamic shape capture using multi-view photometric
                 stereo",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "174:1--174:11",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1661412.1618520",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We describe a system for high-resolution capture of
                 moving 3D geometry, beginning with dynamic normal maps
                 from multiple views. The normal maps are captured using
                 active shape-from-shading (photometric stereo), with a
                 large lighting dome providing a series of novel
                 spherical lighting configurations. To compensate for
                 low-frequency deformation, we perform multi-view
                 matching and thin-plate spline deformation on the
                 initial surfaces obtained by integrating the normal
                 maps. Next, the corrected meshes are merged into a
                 single mesh using a volumetric method. The final output
                 is a set of meshes, which were impossible to produce
                 with previous methods. The meshes exhibit details on
                 the order of a few millimeters, and represent the
                 performance over human-size working volumes at a
                 temporal resolution of 60Hz.",
  acknowledgement = ack-nhfb,
  articleno =    "174",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Li:2009:RSV,
  author =       "Hao Li and Bart Adams and Leonidas J. Guibas and Mark
                 Pauly",
  title =        "Robust single-view geometry and motion
                 reconstruction",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "175:1--175:10",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618521",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a framework and algorithms for robust
                 geometry and motion reconstruction of complex deforming
                 shapes. Our method makes use of a smooth template that
                 provides a crude approximation of the scanned object
                 and serves as a geometric and topological prior for
                 reconstruction. Large-scale motion of the acquired
                 object is recovered using a novel space-time adaptive,
                 non-rigid registration method. Fine-scale details such
                 as wrinkles and folds are synthesized with an efficient
                 linear mesh deformation algorithm. Subsequent spatial
                 and temporal filtering of detail coefficients allows
                 transfer of persistent geometric detail to regions not
                 observed by the scanner. We show how this two-scale
                 process allows faithful recovery of small-scale shape
                 and motion features leading to a high-quality
                 reconstruction. We illustrate the robustness and
                 generality of our algorithm on a variety of examples
                 composed of different materials and exhibiting a large
                 range of dynamic deformations.",
  acknowledgement = ack-nhfb,
  articleno =    "175",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "3D scanning; animation reconstruction; geometry
                 synthesis; non-rigid registration; partial scans;
                 template tracking",
}

@Article{Huang:2009:CUP,
  author =       "Hui Huang and Dan Li and Hao Zhang and Uri Ascher and
                 Daniel Cohen-Or",
  title =        "Consolidation of unorganized point clouds for surface
                 reconstruction",
  journal =      j-TOG,
  volume =       "28",
  number =       "5",
  pages =        "176:1--176:7",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1618452.1618522",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:01:55 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We consolidate an unorganized point cloud with noise,
                 outliers, non-uniformities, and in particular
                 interference between close-by surface sheets as a
                 preprocess to surface generation, focusing on reliable
                 normal estimation. Our algorithm includes two new
                 developments. First, a {\em weighted locally optimal
                 projection\/} operator produces a set of denoised,
                 outlier-free and evenly distributed particles over the
                 original dense point cloud, so as to improve the
                 reliability of local PCA for initial estimate of
                 normals. Next, an iterative framework for robust normal
                 estimation is introduced, where a priority-driven
                 normal propagation scheme based on a new priority
                 measure and an orientation-aware PCA work
                 complementarily and iteratively to consolidate particle
                 normals. The priority setting is reinforced with front
                 stopping at thin surface features and normal flipping
                 to enable robust handling of the close-by surface sheet
                 problem. We demonstrate how a point cloud that is
                 well-consolidated by our method steers conventional
                 surface generation schemes towards a proper
                 interpretation of the input data.",
  acknowledgement = ack-nhfb,
  articleno =    "176",
  fjournal =     "ACM Transactions on Graphics",
}

@Article{Ray:2009:GAD,
  author =       "Nicolas Ray and Bruno Vallet and Laurent Alonso and
                 Bruno Levy",
  title =        "Geometry-aware direction field processing",
  journal =      j-TOG,
  volume =       "29",
  number =       "1",
  pages =        "1:1--1:11",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1640443.1640444",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:18:12 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "Many algorithms in texture synthesis,
                 nonphotorealistic rendering (hatching), or remeshing
                 require to define the orientation of some features
                 (texture, hatches, or edges) at each point of a
                 surface. In early works, tangent vector (or tensor)
                 fields were used to define the orientation of these
                 features. Extrapolating and smoothing such fields is
                 usually performed by minimizing an energy composed of a
                 smoothness term and of a data fitting term. More
                 recently, dedicated structures ($N$-RoSy and
                 $N$-symmetry direction fields) were introduced in order
                 to unify the manipulation of these fields, and provide
                 control over the field's topology (singularities). On
                 the one hand, controlling the topology makes it
                 possible to have few singularities, even in the
                 presence of high frequencies (fine details) in the
                 surface geometry. On the other hand, the user has to
                 explicitly specify all singularities, which can be a
                 tedious task. It would be better to let them emerge
                 naturally from the direction extrapolation and
                 smoothing.\par

                 This article introduces an intermediate representation
                 that still allows the intuitive design operations such
                 as smoothing and directional constraints, but restates
                 the objective function in a way that avoids the
                 singularities yielded by smaller geometric details. The
                 resulting design tool is intuitive, simple, and allows
                 to create fields with simple topology, even in the
                 presence of high geometric frequencies. The generated
                 field can be used to steer global parameterization
                 methods (e.g., QuadCover).",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "filtering; topology; Vector field design",
}

@Article{Zeng:2009:IPP,
  author =       "Kun Zeng and Mingtian Zhao and Caiming Xiong and
                 Song-Chun Zhu",
  title =        "From image parsing to painterly rendering",
  journal =      j-TOG,
  volume =       "29",
  number =       "1",
  pages =        "2:1--2:11",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1640443.1640445",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:18:12 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "We present a semantics-driven approach for
                 stroke-based painterly rendering, based on recent image
                 parsing techniques [Tu et al. 2005; Tu and Zhu 2006] in
                 computer vision. Image parsing integrates segmentation
                 for regions, sketching for curves, and recognition for
                 object categories. In an interactive manner, we
                 decompose an input image into a hierarchy of its
                 constituent components in a parse tree representation
                 with occlusion relations among the nodes in the tree.
                 To paint the image, we build a brush dictionary
                 containing a large set (760) of brush examples of four
                 shape/appearance categories, which are collected from
                 professional artists, then we select appropriate
                 brushes from the dictionary and place them on the
                 canvas guided by the image semantics included in the
                 parse tree, with each image component and layer painted
                 in various styles. During this process, the scene and
                 object categories also determine the color blending and
                 shading strategies for inhomogeneous synthesis of image
                 details. Compared with previous methods, this approach
                 benefits from richer meaningful image semantic
                 information, which leads to better simulation of
                 painting techniques of artists using the high-quality
                 brush dictionary. We have tested our approach on a
                 large number (hundreds) of images and it produced
                 satisfactory painterly effects.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "Image parsing; nonphotorealistic rendering;
                 orientation field; painterly rendering; primal sketch",
}

@Article{Lau:2009:FPI,
  author =       "Manfred Lau and Jinxiang Chai and Ying-Qing Xu and
                 Heung-Yeung Shum",
  title =        "Face poser: {Interactive} modeling of {$3$D} facial
                 expressions using facial priors",
  journal =      j-TOG,
  volume =       "29",
  number =       "1",
  pages =        "3:1--3:17",
  month =        dec,
  year =         "2009",
  CODEN =        "ATGRDF",
  DOI =          "http://doi.acm.org/10.1145/1640443.1640446",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Mar 15 09:18:12 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tog/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib",
  abstract =     "This article presents an intuitive and easy-to-use
                 system for interactively posing 3D facial expressions.
                 The user can model and edit facial expressions by
                 drawing freeform strokes, by specifying distances
                 between facial points, by incrementally editing curves
                 on the face, or by directly dragging facial points in
                 2D screen space. Designing such an interface for 3D
                 facial modeling and editing is challenging because many
                 unnatural facial expressions might be consistent with
                 the user's input. We formulate the problem in a maximum
                 a posteriori framework by combining the user's input
                 with priors embedded in a large set of facial
                 expression data. Maximizing the posteriori allows us to
                 generate an optimal and natural facial expression that
                 achieves the goal specified by the user. We evaluate
                 the performance of our system by conducting a thorough
                 comparison of our method with alternative facial
                 modeling techniques. To demonstrate the usability of
                 our system, we also perform a user study of our system
                 and compare with state-of-the-art facial expression
                 modeling software (Poser 7).",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Transactions on Graphics",
  keywords =     "3D modeling interfaces; Facial modeling and animation;
                 optimization; sketching interfaces; statistical
                 models",
}

@Article{Patane:2009:TED,
  author =       "Giuseppe Patan{\`e} and Michela Spagnuolo and Bianca
                 Falcidieno",
  title =        "To