%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "2.12", %%% date = "14 October 2017", %%% time = "08:50:15 MDT", %%% filename = "jgraphtools.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 = "59224 8189 35231 363224", %%% email = "beebe at math.utah.edu, beebe at acm.org, %%% beebe at computer.org (Internet)", %%% codetable = "ISO/ASCII", %%% keywords = "bibliography; BibTeX; Journal of Graphics %%% Tools: JGT; Journal of Graphics, GPU, and %%% Game Tools", %%% license = "public domain", %%% supported = "yes", %%% docstring = "This is a COMPLETE bibliography of the %%% quarterly Journal of Graphics Tools: JGT %%% (CODEN JGTOFD, ISSN 1086-7651), which began %%% with volume 1, number 1, in 1996 and ended %%% with volume 13, number 4, in 2008. %%% %%% At volume 14, number 1 (2009), the journal %%% was renamed Journal of Graphics, GPU, and %%% Game Tools (ISSN 2151-2272 (print), 2151-237X %%% (electronic)). That journal is also covered %%% in this bibliography. In 2012, the journal %%% name was changed back to its original. %%% Journal publication ceased in 2013. %%% %%% The journals are published by %%% %%% A K Peters, Ltd. %%% 289 Linden Street, %%% Wellesley, MA 02181 %%% USA %%% Phone: +1 617 235 2210 %%% Fax: +1 617 235 2404 %%% Email: akpeters at tiac.net %%% %%% and have World-Wide Web sites at %%% %%% http://www.tandfonline.com/loi/ujgt20 %%% http://akpeters.metapress.com/content/120927/ %%% http://jgt.akpeters.com/ %%% http://www.acm.org/jgt/ %%% %%% where abstracts to individual articles may %%% be found. Uniform Resource Locator (URL) %%% values in the bibliography entries below %%% point to those abstracts. %%% %%% At version 2.12, the COMPLETE year coverage %%% looked like this: %%% %%% 1996 ( 15) 2002 ( 30) 2008 ( 19) %%% 1997 ( 16) 2003 ( 16) 2009 ( 19) %%% 1998 ( 13) 2004 ( 15) 2010 ( 5) %%% 1999 ( 18) 2005 ( 25) 2011 ( 17) %%% 2000 ( 16) 2006 ( 19) 2012 ( 17) %%% 2001 ( 14) 2007 ( 22) 2013 ( 18) %%% %%% Article: 314 %%% %%% Total entries: 314 %%% %%% Entries in this bibliography are derived %%% primarily from information at the journal's %%% Web site, because the journal is not %%% covered by major article databases, such as %%% Compendex, IEEE INSPEC, OCLC Contents1st, %%% or UnCover, nor is the journal available at %%% the University of Utah Marriott Library. %%% %%% 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 path.sty" # "\ifx \undefined \TM \def \TM {${}^{\sc TM}$} \fi" # "\hyphenation{ Kuz-i-ora } " } %%% ==================================================================== %%% 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/|"} %%% ==================================================================== %%% Journal abbreviations: @String{j-J-GRAPHICS-TOOLS = "Journal of Graphics Tools: JGT"} @String{j-J-GRAPHICS-GPU-GAME-TOOLS = "Journal of Graphics, GPU, and Game Tools"} %%% ==================================================================== %%% Bibliography entries: @Article{Smith:1996:HMI, author = "Alvy Ray Smith and Eric Ray Lyons", title = "{HWB}: {A} more intuitive hue-based color model", journal = j-J-GRAPHICS-TOOLS, volume = "1", number = "1", pages = "3--17", year = "1996", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/SmithLyons96/", abstract = "The two most common color selector models, other than RGB (Red-Green-Blue), are the hue-based HSV (Hue-Saturation-Value) and HSL (Hue-Saturation-Lightness) color models. It is shown that both of these models are flawed. A closely related model, HWB (Hue-Whiteness-Blackness), is introduced that avoids the flaws, is slightly faster to compute, and is very easy to teach to new users: Choose a hue. Lighten it with white. Darken it with black. We explain that lightening is not the opposite of darkening.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Bigos:1996:ABC, author = "Andrew Bigos", title = "Avoiding buffer clears", journal = j-J-GRAPHICS-TOOLS, volume = "1", number = "1", pages = "19--20", year = "1996", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Bigos96/", abstract = "A trick to avoid clearing a depth buffer between frames of an animation.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Goldsmith:1996:MCC, author = "Jeff Goldsmith and Allan S. Jacobson", title = "Marching cubes in cylindrical and spherical coordinates", journal = j-J-GRAPHICS-TOOLS, volume = "1", number = "1", pages = "21--32", year = "1996", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/GoldsmithJacobson96/", abstract = "Isosurface extraction is a common analysis and visualization technique for three-dimensional scalar data. Marching Cubes is the most commonly-used algorithm for finding polygonal representations of isosurfaces in such data. We extend Marching Cubes to produce geometry for data sets that lie in spherical and cylindrical coordinate systems as well as show the steps for derivation of transformations for other coordinate systems. Such data sets are very common in the physical sciences, and display within their natural coordinate system aids visualization considerably.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Hubbard:1996:IAR, author = "Philip M. Hubbard", title = "Improving accuracy in a robust algorithm for {$3$D Voronoi} diagrams", journal = j-J-GRAPHICS-TOOLS, volume = "1", number = "1", pages = "33--45", year = "1996", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Hubbard96/", abstract = "This paper describes extensions to a previous algorithm that robustly builds three-dimensional Voronoi diagrams in the presence of inexact numerical computations. The extensions improve the algorithm's accuracy, making its results more nearly represent the proximity properties of an ideal Voronoi diagram. In empirical tests, these extensions ahve improved accuracy by more than eight orders of magnitude. Complete pseudocode for the algorithm appears in an appendix of this paper.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Cignoni:1996:TCP, author = "P. Cignoni and C. Montani and R. Scopigno", title = "Triangulating convex polygons having ${T}$-vertices", journal = j-J-GRAPHICS-TOOLS, volume = "1", number = "2", pages = "1--4", year = "1996", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/CignoniMontaniScopigno96/", abstract = "A technique to triangulate planar convex polygons having T-vertices is described. Simple strip or fan tessellation of a polygon with T-vertices can result in zero-area triangles and compromise the rendering process. Our technique splits such a polygon into one triangle strip and, at most, one triangle fan. The technique is particularly useful in multiresolution or adaptive representation of polygonal surfaces and the simplification of surfaces.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Velho:1996:SEP, author = "Luiz Velho", title = "Simple and efficient polygonization of implicit surfaces", journal = j-J-GRAPHICS-TOOLS, volume = "1", number = "2", pages = "5--24", year = "1996", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Velho96/", abstract = "This paper describes a simple and efficient polygonization algorithm that gives a practical way to construct adapted piecewise linear representations of implicit surfaces. The method starts with a coarse uniform polygonal approximation of the surface and subdivides each polygon recursively according to local curvature. In that way, the inherent complexity of the problem is tamed by separating structuring from sampling and reducing part of the full three dimensional search to two dimensions.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{vanOverveld:1996:HSH, author = "C. W. A. M. {van Overveld} and Brian Wyvill", title = "Hi-speed, hi-fi hi-lights: a fast algorithm for the specular term in the {Phong} illumination model", journal = j-J-GRAPHICS-TOOLS, volume = "1", number = "2", pages = "25--30", year = "1996", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/vanOverVeldWyvill96/", abstract = "The computational effort to render images with light sources and camera at infinity is less than with light sources at finite distance from the illuminated surface. On the other hand, in the case of an infinitely remote light source and camera, planar polygons don't receive highlights. In this paper, a method is suggested to use the (relatively cheap) infinite-distance model instead of the expensive finite-distance model for the computation of highlights. It works by replacing a light source at finite distance by a light source at infinite distance, and at the same time adjusting the normal vectors in such a way that the resulting illumination pattern stays the same. With these modifications, a simple table look-up comes in the place of an expensive computation to obtain the specular term in the standard illumination model.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Mirtich:1996:FAC, author = "Brian Mirtich", title = "Fast and accurate computation of polyhedral mass properties", journal = j-J-GRAPHICS-TOOLS, volume = "1", number = "2", pages = "31--50", year = "1996", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Mirtich96/; http://www.cs.berkeley.edu/~mirtich/massProps.html", abstract = "The location of a body's center of mass, and its moments and products of inertia about various axes are important physical quantities needed for any type of dynamic simulation or physically based modeling. We present an algorithm for automatically computing these quantities for a general class of rigid bodies: those composed of uniform density polyhedra. The mass integrals may be converted into volume integrals under these assumptions, and the bulk of the paper is devoted to the computation of these volume integrals. Our algorithm is based on a three step reduction of the volume integrals to successively simpler integrals. The algorithm is designed to minimize the numerical errors that can result from poorly conditioned alignment of polyhedral faces. It is also designed for efficiency. All required volume integrals of a polyhedron are computed together during a single walk over the boundary of the polyhedron; exploiting common subexpressions reduces floating point operations. We present numerical results detailing the speed and accuracy of the algorithm, and also give a complete low level pseudocode description.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Haines:1996:FLM, author = "Eric Haines and Steven Worley", title = "Fast, Low Memory ${Z}$-Buffering when Performing Medium-Quality Rendering", journal = j-J-GRAPHICS-TOOLS, volume = "1", number = "3", pages = "1--5", year = "1996", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/HainesWorley96/", abstract = "This article presents algorithms which both improve performance and decrease memory costs when using a Z-buffer for medium-quality rendering. The crux of the method is to perform rendering in two passes; the first quickly renders only Z-depth values, the second does all shading calculations. This method allows the reuse of memory used to store the Z-depths and colors, as only one of these two values is needed at any given moment for any given pixel. It also eliminates all unnecessary shading/shadowing/texturing calls, which typically take the majority of computation time in medium-quality algorithms.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Hutchinson:1996:RVI, author = "Dave Hutchinson and Terry Hewitt", title = "Rapidly Visualizing Isophotes", journal = j-J-GRAPHICS-TOOLS, volume = "1", number = "3", pages = "7--12", year = "1996", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/HutchinsonHewitt96/", abstract = "For computer aided design it is often necessary to identify regions of unwanted curvature in a surface. Isophotes can be used to detect first- and second-order discontinuities in a surface. This paper describes a method to visualize isophotes using existing hardware or software display and false colour capabilities. This method is faster and easier to implement than the traditional approach of explicitly computing isophotes.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{vanOverveld:1996:BBB, author = "C. W. A. M. {van Overveld} and Brian Wyvill", title = "Banishing bad buckling", journal = j-J-GRAPHICS-TOOLS, volume = "1", number = "3", pages = "13--28", year = "1996", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/vanOverVeldWyvill96b/; http://www.win.tue.nl/win/cs/tt/kees/PAPERS_PS/b_buckl.ps.gz", abstract = "An algorithm is presented which can be used to alleviate shape artifacts (buckling) that occur with interpolating spline curves or interpolating spline surfaces. The algorithm consists of applying small displacements to some of the vertices that are interpolated. It is based on a quantitative measure for the amount of buckling, and a relaxation method to reduce this amount.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Gritz:1996:BGI, author = "Larry Gritz and James K. Hahn", title = "{BMRT}: {A} global illumination implementation of the {RenderMan} standard", journal = j-J-GRAPHICS-TOOLS, volume = "1", number = "3", pages = "29--47", year = "1996", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/GritzHahn96/", abstract = "The RenderMan Interface specification proposed by Pixar is a standard for communication between modeling software and rendering software or devices. This standard has proven very powerful and is extremely popular in production work. Although the standard itself claims not to specify a rendering algorithm, people have speculated RenderMan and global illumination are mutually incompatible.\par We have implemented a rendering system which fully adheres to the RenderMan Interface and uses global illumination algorithms. Specifically, this implementation supports progressive refinement radiosity and distribution ray tracing in a two-pass approach. This rendering system is widely distributed, very popular, and has been used in production (three properties usually not found in global illumination renderers). We discuss how we overcame problems in mating global illumination algorithms with the RenderMan standard, and make recommendations for future versions of the standard to better accommodate such algorithms. We also present a summary of important lessons we learned by creating and distributing this tool.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Nelson:1996:TCC, author = "Scott R. Nelson", title = "Twelve characteristics of correct antialiased lines", journal = j-J-GRAPHICS-TOOLS, volume = "1", number = "4", pages = "1--20", year = "1996", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Nelson96/", abstract = "Many papers have been written on line antialiasing algorithms. Most ignore important features that can leave visible artifacts. This paper presents twelve desirable characteristics of antialiased lines and discusses algorithmic tradeoffs that affect each of the characteristics from a behavioral perspective. Accompanying color images show the differences between acceptable and unacceptable behavior for each characteristic. This paper provides the information needed to visibly analyze how well a particular antialiased line algorithm works.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Ranjan:1996:CUS, author = "Vishwa Ranjan and Alain Fournier", title = "Creating union of spheres models from multiple views", journal = j-J-GRAPHICS-TOOLS, volume = "1", number = "4", pages = "21--39", year = "1996", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/RanjanFournier96/", abstract = "In this paper, we present a method to obtain a {\em union of spheres (UoS)\/} model of an object by integrating the information obtained from different views, each view created by point-sampling of the visible surface of the object. The boundary points can be obtained from multiple range-finder images, or by ray-tracing a model of the object (if available in a ray-traceable form) from different views. The algorithm consists of two parts: construction and simplification. The construction method is based on the Delaunay tetrahedralization of points in three dimensions and uses the half-space constraints imposed by the visibility directions of boundary points. The simplification method is based on the concept of {\em sphericity}. Sphericity is a quantity that measures how well a set of spheres is approximated by a single sphere. This allows us to reduce the number of primitives in a controlled way, while keeping the union of spheres model. It can also be used to stabilize the union of spheres model, i.e., to make it independent of the noise in the samples or other small distortions in the data. Several examples illustrate the algorithm.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Sherstyuk:1996:RTS, author = "Andrei Sherstyuk", title = "Ray tracing with selective visibility", journal = j-J-GRAPHICS-TOOLS, volume = "1", number = "4", pages = "41--46", year = "1996", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Sherstyuk96/", abstract = "We propose a simple yet effective extension of the ray-tracing algorithm that allows selective visibility of objects for specific rays. Typically, rays are classified as pixel, shadow, reflected, and transmitted. We suggest adding to material descriptions a visibility mask which controls how these rays interact with the material. This addition can be incorporated seamlessly into any ray tracer and may help to generate visually interesting images.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Barzel:1997:LCC, author = "Ronen Barzel", title = "Lighting Controls for Computer Cinematography", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "1", pages = "1--20", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Barzel97/", abstract = "Lighting is an essential component of visually rich cinematographic images. However, the common computer graphics light source models, such as a cone-shaped spotlight, are not versatile enough for cinematographic-quality lighting. In this paper we describe the controls and features of a light source model for lighting computer graphics films. The model is based on generalized light cones, emphasizing independent control over the shape and texture of lights and shadows. While inspired by techniques of real-world cinematography, it is tailored to the needs and capabilities of computer graphics. The model has been used successfully in production over the past few years, to light many short works and the movie {\em Toy Story}.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Moller:1997:FMS, author = "Tomas M{\"o}ller and Ben Trumbore", title = "Fast, Minimum Storage Ray-Triangle Intersection", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "1", pages = "21--28", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/MollerTrumbore97/", abstract = "We present a clean algorithm for determining whether a ray intersects a triangle. The algorithm translates the origin of the ray and then changes the base to yield a vector $(t u v)^{\tt T}$, where $t$ is the distance to the plane in which the triangle lies and $(u,v)$ represents the coordinates inside the triangle.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Nelson:1997:HQH, author = "Scott R. Nelson", title = "High quality hardware line antialiasing", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "1", pages = "29--46", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Nelson97/", abstract = "The graphics community has understood line antialiasing reasonably well for many years. Many papers have been written on the subject, but none of them have offered a complete solution. This paper explains all of the details of a well behaved hardware algorithm used in the SparcStation ZX that, although imperfect, works very well in practice. The paper discusses tradeoffs at each point and the reasoning that went into the decisions that were made.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Telea:1997:COB, author = "A. C. Telea and C. W. A. M. van Overveld", title = "The Close Objects Buffer: {A} Sharp Shadow Detection Technique for Radiosity Methods", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "2", pages = "1--8", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/TeleaVanOverveld97/", abstract = "Detecting sharp illumination variations such as shadow boundaries is an important problem for radiosity methods. Such illumination variations are captured using a nonuniform mesh that refines the areas exhibiting high illumination gradients. Nonuniform meshing techniques like discontinuity meshing often rely on shadow casting, and as a result their application is computationally expensive. This paper presents a sharp shadow detection technique for radiosity tools based on the progressive refinement method. The presented technique offers good results (especially for capturing sharp shadows cast by small `detail' objects), is very simple to implement, has negligible time and space requirements, and integrates well with other adaptive subdivision strategies in a radiosity tool based on progressive refinement.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Wong:1997:SHH, author = "Tien-Tsin Wong and Wai-Shing Luk and Pheng-Ann Heng", title = "Sampling with {Hammersley} and {Halton} Points", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "2", pages = "9--24", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/WongLukHeng97/", abstract = "The Hammersley and Halton point sets, two well known low discrepancy sequences, have been used for quasi-Monte Carlo integration in previous research. A deterministic formula generates a uniformly distributed and stochastic-looking sampling pattern, at low computational cost. The Halton point set is also useful for incremental sampling. In this paper, we discuss detailed implementation issues and our experience of choosing suitable bases of the point sets, not just on the $2$D plane, but also on a spherical surface. The sampling scheme is also applied to ray tracing, with a significant improvement in error.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Moller:1997:FTT, author = "Tomas M{\"o}ller", title = "A Fast Triangle-Triangle Intersection Test", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "2", pages = "25--30", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Moller97/", abstract = "This paper presents a method, along with some optimizations, for computing whether or not two triangles intersect. The code, which is shown to be fast, can be used, for example, in collision detection algorithms.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Chung:1997:RRS, author = "A. J. Chung and A. J. Field", title = "Rendering Radiosity Solutions by Adaptive Gathering", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "2", pages = "31--44", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/ChungField97/", abstract = "The radiosity method is a finite element global illumination technique that usually involves the discretization of the environment being modeled and estimating the light transported between the resulting elements. The computed result, a collection of patches and their estimated radiances, does not produce a very realistic image and often the reconstruction of the illuminance functions over each visible surface is necessary. The more sophisticated of these reconstruction techniques perform a local gathering step at closely spaced sample points, typically one per pixel. This paper describes an algorithmic framework for implementing this final gathering pass that allows one to adaptively control the spacing of sample points in order to minimize the number of computationally expensive local gather operations while still achieving a rendered image of acceptable quality.\par The basic algorithm is independent of the method by which the global illumination solution is obtained but can easily be tuned for specific models and surfaces. The method is also easily extended to allow the shading of curved surfaces within a radiosity environment.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{vanOverveld:1997:DGM, author = "C. W. A. M. {van Overveld} and M. G. J. R. Stalpers", title = "Deforming Geometric Models Based on a Polygonal Skeleton Mesh", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "3", pages = "1--14", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/StalpersVanOverveld97/", abstract = "A technique is presented for the deformation of a given geometric model (to be called: the skin) by means of a polygonized skeleton model. It is based on recognition of similarities in shape between these models by means of a method called dual-connectivity search. The technique uses these similarities in shape to define a semantic relation between the skeleton and the skin such that a smooth deformation for the skin is generated, that resembles, and is derived from, a deformation of the skeleton.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Cignoni:1997:CAG, author = "P. Cignoni and C. Montani and R. Scopigno", title = "Computer-Assisted Generation of Bas- and High-Reliefs", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "3", pages = "15--28", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/CignoniMontaniScopigno97/", abstract = "This paper proposes a computer-oriented interpretation of the laws ruling the elevation of figures in bas- or high-relief sculptures. It presents some simple algorithms and a prototypical, public-domain software tool for the generation of three-dimensional bas- and high-reliefs starting from three-dimensional surface models.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Bailey:1997:ETD, author = "Michael Bailey and Dru Clark", title = "Encoding Three-Dimensional Surface Information in a Texture Vector", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "3", pages = "29--35", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/BaileyClark97/", abstract = "This paper describes a novel use of texture mapping. Surface information, in this case the surface normal, is used as the texture coordinates. As we rotate the object, the color pattern on its surfaces fluctuates based on its surface normal orientation in world space. The result is a fast human-in-the-loop interactive system for optimizing mechanical part orientation for fabrication.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Xiang:1997:TPC, author = "Zhigang Xiang", title = "A Tri-Plane Cursor", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "3", pages = "37--43", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Xiang97/", abstract = "Interactive three-dimensional editing requires visualization techniques that help the user gauge position and shape. This paper describes the use of a tri-plane cursor to provide correlated cursor/object position and surface-shape feedback. These visual cues are generated dynamically by three cursor planes in the form of contours and shading variations.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Shirley:1997:LDM, author = "Peter Shirley and Kenneth Chiu", title = "A Low Distortion Map Between Disk and Square", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "3", pages = "45--52", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/ShirleyChiu97/", abstract = "This paper presents a map between squares and disks that associates concentric squares with concentric circles. This map preserves adjacency and fractional area, and has proven useful in many sampling applications where correspondences must be maintained between the two shapes. The paper also provides code to compute the map that minimizes branching and is robust for all inputs. Finally, it extends the map to the hemisphere. Though this map has been used in publications before, details of its computation have never previously been published.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{vandenBergen:1997:ECD, author = "Gino van den Bergen", title = "Efficient Collision Detection of Complex Deformable Models using {AABB} Trees", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "4", pages = "1--14", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/vanDenBergen97/", abstract = "We present a scheme for exact collision detection between complex models undergoing rigid motion and deformation. The scheme relies on a hierarchical model representation using axis-aligned bounding boxes (AABBs). Recent work has shown that AABB trees are slower than oriented bounding box (OBB) trees for performing overlap tests. In this paper, we describe a way to speed up overlap tests between AABBs, such that for collision detection of rigid models, the difference in performance between the two representations is greatly reduced. Furthermore, we show how to update an AABB tree quickly as a model is deformed. We thus find AABB trees to be the method of choice for collision detection of complex models undergoing deformation. In fact, because they are not much slower to test, are faster to build, and use less storage than OBB trees, AABB trees might be a reasonable choice for rigid models as well.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Havran:1997:FRB, author = "Vlastimil Havran and Tomas Kopal and Jiri Bittner and Jiri Zara", title = "Fast Robust {BSP} Tree Traversal Algorithm for Ray Tracing", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "4", pages = "15--24", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/HavranKopalBittnerZara97/", abstract = "An orthogonal BSP (binary space partitioning) tree is a commonly used spatial subdivision data structure for ray tracing acceleration. While the construction of a BSP tree takes a relatively short time, the efficiency of a traversal algorithm significantly influences the overall rendering time. We propose a new fast traversal algorithm based on statistical evaluation of all possible cases occurring during traversing a BSP tree. More frequent cases are handled simply, while less frequent ones are more computationally expensive. The proposed traversal algorithm handles all singularities correctly. The algorithm saves from 30\% up to 50\% of traversal time comparing with the commonly-known Sung and Arvo algorithms.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Held:1997:ECE, author = "Martin Held", title = "{ERIT}: {A} Collection of Efficient and Reliable Intersection Tests", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "4", pages = "25--44", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Held97/", abstract = "We describe ERIT, a collection of C routines for efficiently and reliably handling intersection queries between pairs of primitive objects in three dimensions. ERIT supports intersection queries between the following pairs of primitives: triangle/line-segment, triangle/triangle, sphere/line-segment, sphere/triangle, cylinder/line-segment, cylinder/triangle, cylinder/sphere, cone/line-segment, cone/triangle, toroid/line-segment, toroid/triangle, and sphere/sphere. All intersection routines are based on standard ``epsilon-based'' floating-point arithmetic. Practical tests have proved that ERIT's routines are efficient and reliable, and we provide performance statistics for three widely-used hardware platforms.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{vanOverveld:1997:CWS, author = "C. W. A. M. {van Overveld}", title = "Color Waves: {A} Simple Heuristic for Choosing False Colors", journal = j-J-GRAPHICS-TOOLS, volume = "2", number = "4", pages = "45--50", year = "1997", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/vanOverveld97/", abstract = "A simple heuristic is presented for choosing false colors for visualizing scalar functions on two-dimensional domains. The color scheme allows inspection of the function on several length scales simultaneously.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Johannsen:1998:CBC, author = "Andreas Johannsen and Michael B. Carter", title = "Clustered Backface Culling", journal = j-J-GRAPHICS-TOOLS, volume = "3", number = "1", pages = "1--14", year = "1998", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/JohannsenCarter98/", abstract = "This paper presents a simple, practical, and effective backface-culling technique for clusters of polygons, as well as a method for generating efficient clusters from a set of triangle strips. The cluster-backface test is directly derived from the traditional single-polygon test, and has about the same complexity. Memory requirements are 40 bytes per test. Cluster-backface tests may be arranged hierarchically, and frontface tests added for symmetry. Experiments show graphics performance improvements of up to 50 percent in terms of the number of effective polygons rendered per second.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Larson:1998:LEF, author = "Gregory Ward Larson", title = "{LogLuv} Encoding for Full-Gamut, High-Dynamic Range Images", journal = j-J-GRAPHICS-TOOLS, volume = "3", number = "1", pages = "15--31", year = "1998", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Larson98/", abstract = "The human eye can accommodate luminance in a single view over a range of about 10,000:1 and is capable of distinguishing about 10,000 colors at a given brightness. By comparison, typical computer monitors have a luminance range less than 100:1 and cover about half of the visible color gamut. Despite this difference, most digital image formats are geared to the capabilities of conventional displays, rather than the characteristics of human vision. In this paper, we propose a compact encoding suitable for the transfer, manipulation, and storage of high-dynamic range color images. This format is a replacement for conventional RGB images, and encodes color pixels as log luminance values and CIE $(u',v')$ chromaticity coordinates. We have implemented and distributed this encoding as part of teh standard TIFF I/O library available by anonymous ftp. After explaining our encoding, we describe its use within TIFF and present some techniques for handling high-dynamic range pixels, and demonstrate with an example image.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Max:1998:OPV, author = "Nelson Max", title = "A One-Pass Version of Two-Pass Image Resampling", journal = j-J-GRAPHICS-TOOLS, volume = "3", number = "1", pages = "33--41", year = "1998", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Max98/", abstract = "The intermediate storage and memory access for the first-pass output of the Catmull-Smith two-pass image resampling are eliminated by feeding output directly to the second apss as soon as it is computed. The algorithm reads input and intermediate data sequentially, so that it is suitable for efficient hardware or software implementation on modern, cache-based computers.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Thurmer:1998:CVN, author = "Grit Th{\"u}rmer and Charles A. W{\"u}thrich", title = "Computing Vertex Normals from Polygonal Facets", journal = j-J-GRAPHICS-TOOLS, volume = "3", number = "1", pages = "43--46", year = "1998", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/ThurmerWuthrich98/", abstract = "The method most commonly used to estimate the normal vector at a vertex of a polygonal surface averages the normal vectors of the facets incident to the vertex considered. The vertex normal obtained in this way may vary depending on the tessellation of the polygonal surface since the normal of each incident facet contributes equally to the normal in the vertex. To overcome this drawback, we extend the method so that it also incorporates the geometric contribution of each facet, consider the angle under which a facet is incident to the vertex in question.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Smits:1998:EIR, author = "Brian Smits", title = "Efficiency Issues for Ray Tracing", journal = j-J-GRAPHICS-TOOLS, volume = "3", number = "2", pages = "1--14", year = "1998", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Smits98/", abstract = "Ray casting is the bottleneck of many rendering algorithms. Although much work has been done on making ray casting more efficient, most published work is high level. This paper discusses efficiency at a slightly lower level, presenting optimizations for bounding-volume hierarchies that many people use but are rarely described in the literature. A set of guidelines for optimization are presented that avoid some of the common pitfalls. Finally, the effects of the optimizations are shown for a set of models.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Woo:1998:CTS, author = "Andrew Woo", title = "Chordlength Texturing of Spline Surfaces", journal = j-J-GRAPHICS-TOOLS, volume = "3", number = "2", pages = "15--19", year = "1998", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Woo98/", abstract = "This paper presents an inexpensive way to provide (s,t) texture coordinates of a spline surface that mitigates texture compression and stretching artifacts. The approach employs a chordlength approximation based on the original spline-surface parameterization. Its success can be seen in existing Alias|Wavefront renderers since 1991.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{VanGelder:1998:ASE, author = "Allen {Van Gelder}", title = "Approximate Simulation of Elastic Membranes by Triangulated Spring Meshes", journal = j-J-GRAPHICS-TOOLS, volume = "3", number = "2", pages = "21--41", year = "1998", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/VanGelder98/", abstract = "Spring meshes have been used to model elastic material in computer graphics, with skin, textiles, and soft tissue being typical applications. A spring mesh is a system of vertices and edges, possibly with highly irregular geometry, in which each edge is a spring, and springs are connected by ``pin-joints'' (``gimbal-joints'' in three dimensions) at the vertices. This method is computationally attractive, compared to some alternatives. Given a specified set of elastic material properties, however, the question of whether a particular spring mesh accurately simulates those properties has been largely ignored in the literature. Additionally, previous reports on the technique are silent on the subject of assigning stiffness to the various springs. This paper shows that assigning the same stiffness to all springs fails to simulate a uniform elastic membrane, for equilibrium calculations. A formula for spring stuffness that provides a more accurate simulation is then derived. In its simplest form, this formula specifies that stiffness varies as triangle area over edge length squared. Its accuracy is demonstrated on test and practical mesh examples. It is also shown that, in general, an exact simulation is not possible.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Bailey:1998:UCO, author = "Michael Bailey and Dru Clark", title = "Using {ChromaDepth} to Obtain Inexpensive Single-image Stereovision for Scientific Visualization", journal = j-J-GRAPHICS-TOOLS, volume = "3", number = "3", pages = "1--9", year = "1998", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/BaileyClark98/", abstract = "Stereographics is an effective way to enhance insight in three-dimensional scientific visualization. This is especially true for visualizations consisting of complex geometry, such as molecular studies, or where one data set needs to be registered against another, such as in earth science. But, as effective as it is, stereoviewing sees only limited use in scientific visualization because of the difficulty and expense of creating images that everyone can see. This paper demonstrates how a low-end, inexpensive viewing technique can be used as a ``quick trick'' to produce many of the same effects as high-end stereoviewing. Not only is this technique easy to view and easy to publish, it is easy to create. This paper shows how standard OpenGL features can be used to create such images, both statically and interactively.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Feng:1998:ABS, author = "Jieqing Feng and Pheng-Ann Heng and Tien-Tsin Wong", title = "Accurate {B}-spline Free-Form Deformation of Polygonal Objects", journal = j-J-GRAPHICS-TOOLS, volume = "3", number = "3", pages = "11--27", year = "1998", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/FengHengWong98/", abstract = "Free-form deformation is an important geometric shape modification method in computer animation and geometric modeling. We explore it by means of functional composition via shifting operators. Our method takes a polygonal model as input but yields a curved model described by triangular B{\'e}zier patches as output. The proposed method solves the sampling problem of free-form deformation.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Grassia:1998:PPR, author = "F. Sebastian Grassia", title = "Practical Parameterization of Rotations Using the Exponential Map", journal = j-J-GRAPHICS-TOOLS, volume = "3", number = "3", pages = "29--48", year = "1998", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Grassia98/", abstract = "Parameterizing three degree-of-freedom (DOF) rotations is difficult to do well. Many graphics applications demand that we be able to compute and differentiate positions and orientations of articulated figures with respect to their rotational (and other) parameters, as well as integrate differential equations, optimize rotation parameters, and interpolate orientations. Widely used parameterizations such as Euler angles and quaternions are well suited to only a few of these operations. The exponential map maps a vector in $R^3$ describing the axis and magnitude of a three-DOF rotation to the corresponding rotation. Several graphics researchers have applied it with limited success to interpolation of orientations, but it has been virtually ignored with respect to the other operations mentioned above. In this paper we present formulae for computing, differentiating, and integrating three-DOF rotations with the exponential map. We show that our formulation is numerically stable in the face of machine precision issues, and that for most applications all singularities in the map can be avoided through a simple technique of dynamic reparameterization. We demonstrate how to use the exponential map to solve both the ``freely rotating body'' problem and the important ball-and-socket joint required to accurately model shoulder and hip joints in articulated figures. Examining several common graphics applications, we explain the benefits of our formulation of the exponential map over Euler angles and quaternions, including robustness, small state vectors, lack of explicit constraints, good modeling capabilities, simplicity of solving ordinary differential equations, and good interpolation behavior.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Campagna:1998:DES, author = "Swen Campagna and Leif Kobbelt and Hans-Peter Seidel", title = "Directed Edges --- {A} Scalable Representation for Triangle Meshes", journal = j-J-GRAPHICS-TOOLS, volume = "3", number = "4", pages = "1--12", year = "1998", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/CampagnaKobbeltSeidel98/", abstract = "In a broad range of computer graphics applications, the representation of geometric shape is based on triangle meshes. General purpose data structures for polygonal meshes typically provide fast access to geometric objects (e.g., points) and topological entities (e.g., neighborhood relationships) but the memory requirements are rather high due to the many special configurations. In this paper, we present a new data structure which is specifically designed for triangle meshes. The data structure enables the programmer to trade memory for access time by either storing internal references explicitly, or by reconstructing them locally on demand. The trade-off can be hidden from the programmer by an object-oriented API and can automatically adapt to the available hardware resources or the complexity of the mesh (scalability).", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Fu:1998:TBV, author = "Chi-Wing Fu and Tien-Tsin Wong and Pheng-Ann Heng", title = "Triangle-Based View Interpolation without Depth-Buffering", journal = j-J-GRAPHICS-TOOLS, volume = "3", number = "4", pages = "13--31", year = "1998", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/FuWongHeng98/", abstract = "In this paper, we propose a triangle-based view interpolation algorithm that can correctly resolve the visibility problem without depth-buffering. The algorithm is especially useful when depth information is not available, such as in the case of real-world photographs. By subdividing the reference image into variable-sized triangles, view interpolation can be done efficiently using existing graphics hardware. We derive the drawing order between each pair of neighboring triangles from the epipolar geometry. Using this drawing order, a graph can be built and topological sorting is applied on the graph to obtain the complete drawing order of all triangles in linear time.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Chen:1998:FVT, author = "Hongsheng Chen and Shiaofen Fang", title = "Fast Voxelization of Three-Dimensional Synthetic Objects", journal = j-J-GRAPHICS-TOOLS, volume = "3", number = "4", pages = "33--45", year = "1998", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/ChenFang98/", abstract = "This paper presents a new approach to the voxelization of three-dimensional synthetic objects. It makes use of existing graphics hardware on standard graphics workstations, such as the polygon-based geometry engine and frame buffer operations, and is able to generate the voxel-based volume representations of general curves, surfaces, or solid objects efficiently. On a workstation with hardware-supported texture mapping, the voxelization result may also be written directly to the three-dimensional texture memory as a three-dimensional texture object, and interactively rendered by the three-dimensional texture-mapping hardware. This approach provides a practical solution to the interactive manipulations of geometric objects within a volume graphics framework.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Wang:1999:NMP, author = "Wencheng Wang and Yanyun Chen and Enhua Wu", title = "A New Method for Polygon Edging on Shaded Surfaces", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "1", pages = "1--10", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/WangChenWu99/", abstract = "Wireframe and shaded surfaces are often rendered together to reap the advantages of both methods. However, existing methods for such a combination can lead to edge stitching and/or draw edges of polygons that are behind other polygons; the Z-buffer comparison widely used in existing methods is not very suitable for the task. In this paper, a new method without a Z-buffer comparison is proposed. Using this proposed method, the correspondence between edges and polygons is examined and the occluding relation between polygons is used to decide if a pixel of an edge is to be drawn. Thus, the problems caused by Z-buffer comparisons are eliminated, and high-quality wireframe-overlayed shaded surfaces can be rendered.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Wan:1999:OIV, author = "Ming Wan and Arie Kaufman and Steve Bryson", title = "Optimized Interpolation for Volume Ray Casting", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "1", pages = "11--24", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/WanKaufmanBryson99/", abstract = "An acceleration technique using bilinear and simplified trilinear interpolation which reduces the amount of interpolation computation during the ray sampling procedure of the volume ray casting algorithm is described. It has several characteristics: It is applicable to both perspective projection and parallel projection; it uses almost no extra space and processing power; there is no noticeable sacrifice of image quality; and more importantly, it can be easily applied to existing ray casting optimizations to further improve their efficiency. In addition, an adaptive depth-sampling optimization has been developed based on our technique, which serves as an effective approach to meet the frame rate demand of time-critical visualization environment. Experimental results show that a rendering rate of more than ten frames per second has been achieved on a 16-processor SGI Power Challenge.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Karabassi:1999:ITC, author = "Evaggelia-Aggeliki Karabassi and Georgios Papaioannou and Theoharis Theoharis", title = "Intersection Test for Collision Detection in Particle Systems", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "1", pages = "25--37", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/KarabassiEtAl99/", abstract = "We present a method for detecting collisions between a system of spherical particles and an environment composed of triangles. The proposed algorithm takes into account each particle's volume and is based on an intersection test between a triangle and a cylinder with spherical caps (the trajectory of a particle). The algorithm also efficiently calculates a close estimate of the point of intersection, which is necessary for collision detection.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Wang:1999:MSR, author = "Changyaw Wang and Kelvin Sung", title = "Multi-Stage {$N$}-rooks Sampling Method", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "1", pages = "39--47", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/WangSung99/", abstract = "In many graphics tasks, such as pixel antialiasing, a set of spatially ``uniform'' samples must be generated on a unit square. Some algorithms attempt to create sets of samples whose $x$ and $y$ coordinates are each themselves uniform, while making sure that the samples are also uniform in two dimensions. However, this is hard to do if the number of samples is not a perfect square. In this paper, we introduce a new sampling strategy which generates any number of uniform two-dimensional samples while maintaining uniformity in $x$ and $y$ as well.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Max:1999:WCV, author = "Nelson Max", title = "Weights for Computing Vertex Normals from Facet Normals", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "2", pages = "1--6", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Max99/", abstract = "I propose a new equation to estimate the normal at a vertex of a polygonal approximation to a smooth surface, as a weighted sum of the normals to the facets surrounding the vertex. The equation accounts for the difference in size of these facets by assigning larger weights for smaller facets. When tested on random cubic polynomial surfaces, the equation is superior to other popular weighting methods.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{vandenBergen:1999:FRG, author = "Gino van den Bergen", title = "A Fast and Robust {GJK} Implementation for Collision Detection of Convex Objects", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "2", pages = "7--25", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/vanDenBergen99/", abstract = "This paper presents an implementation of the Gilbert-Johnson-Keerthi algorithm for computing the distance between convex objects, that has improved performance, robustness, and versatility over earlier implementations. The algorithm presented here is especially suitable for use in collision detection of objects modeled using various types of geometric primitives, such as boxes, cones, and spheres, and their images under affine transformation.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Zhang:1999:DIB, author = "Hansong Zhang", title = "A Derivation of Image-Based Rendering for Conventional Three-Dimensional Graphics", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "2", pages = "27--36", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Zhang99/", abstract = "Image-based rendering generates images from one or more known images without explicit geometric representation of objects. This paper presents a derivation of the pixel transformations for three-dimensional image warping, a popular form of image-based rendering. The derivation is based entirely on traditional three-dimensional graphics terminology, using only 4~x~4 matrices. The transformations are optimized based on the fact that transformations of adjacent pixels share much common computation. Derivatives and frame-to-frame coherence are also discussed.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Schmalstieg:1999:FPA, author = "Dieter Schmalstieg and Robert F. Tobler", title = "Fast Projected Area Computation for Three-Dimensional Bounding Boxes", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "2", pages = "37--43", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/SchmalstiegTobler99/", abstract = "The area covered by a three-dimensional bounding box after projection onto the screen is relevant for view-dependent algorithms in real-time and photorealistic rendering. We describe a fast method to compute the accurate two-dimensional area of a three-dimensional oriented bounding box, and show how it can be computed equally fast or faster than its approximation with a two-dimensional bounding box enclosing the projected three-dimensional bounding box.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Christensen:1999:FPM, author = "Per H. Christensen", title = "Faster Photon Map Global Illumination", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "3", pages = "1--10", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Christensen99/", abstract = "The photon map method is an extension of ray tracing that makes it able to efficiently compute caustics and soft indirect illumination on surfaces and in participating media. This paper describes a method to further speed up the computation of soft indirect illumination (diffuse-diffuse light transport such as color bleeding) on surfaces. The speed-up is based on the observation that the many look-ups in the global photon map during final gathering can be simplified by precomputing local irradiance values at the photon positions. Our tests indicate that the calculation of soft indirect illumination during rendering, which is the most time-consuming part, can be sped up by a factor of 5--7 in typical scenes at the expense of (1) a precomputation that takes about 2\%--5\% of the time saved during rendering and (2) a 28\% increase of memory use.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Teller:1999:DLT, author = "Seth Teller and Michael Hohmeyer", title = "Determining the Lines Through Four Lines", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "3", pages = "11--22", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/TellerHohmeyer99/", abstract = "This paper describes how to compute the line or lines which intersect four given lines in three dimensions. This intersection computation arises in computer graphics (for visibility computations), computational geometry (for line traversals), and computer vision (for object recognition).\par Given four distinct lines in three dimensions, there exist zero, one, two, or various infinities of lines intersecting the given lines. We use Pl{\"u}cker coordinatization of lines to cast this problem as a null-space computation in five dimensions, and show how the singular value decomposition (SVD) yields a simple, stable characterization of the incident lines, and an efficient algorithm to determine them.\par Finally, we enumerate the types of input degeneracies that may arise, show how to detect each type in practice, and describe for each case the solution set of lines that arises.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Keating:1999:ESA, author = "Brett Keating", title = "Efficient Shadow Antialiasing Using an {$A$}-Buffer", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "3", pages = "23--33", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Keating99/", abstract = "The Z-buffer shadow algorithm is a popular method for producing hard shadows. However, antialiasing of the shadow edges is necessary. This paper provides a new technique for antialiasing of shadow edges that is based on the A-buffer hidden-surface algorithm, which uses bitmasks to describe the area of a pixel occupied by an object. Compared to percentage-closer filtering, which is the standard method for antialiasing shadow edges, the new technique is much faster and has no noisiness present in the blurred regions.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{McCormick:1999:DAB, author = "Patrick S. McCormick and Charles Hansen and Edward Angel", title = "The Deferred Accumulation Buffer", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "3", pages = "35--46", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/McCormickHansenAngel99/", abstract = "A well-known disadvantage of using the Z-buffer algorithm for medium-quality rendering is the overhead associated with shading, shadowing, and texturing pixels that do not contribute to the final image. This problem may be avoided by deferring shading calculations until the end of the rendering pipeline. In this paper, we review two approaches to deferred shading, discuss how to handle transparency, and then extend these ideas to implement a deferred accumulation buffer.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Moller:1999:EBM, author = "Tomas M{\"o}ller and John F. Hughes", title = "Efficiently Building a Matrix to Rotate One Vector to Another", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "4", pages = "1--4", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/MollerHughes99/", abstract = "We describe an efficient (no square roots or trigonometric functions) method to construct the $3\times3$ matrix that rotates a unit vector {\bf f} into another unit vector {\bf t}, rotating about the axis {\bf f} $\times$ {\bf t}. We give experimental results showing this method is faster than previously known methods. An implementation in C is provided.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Karabassi:1999:FDB, author = "Evaggelia-Aggeliki Karabassi and Georgios Papaioannou and Theoharis Theoharis", title = "A Fast Depth-Buffer-Based Voxelization Algorithm", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "4", pages = "5--10", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/KarabassiEtAl99b/", abstract = "This paper presents a fast and easy to implement voxelization algorithm, which is based on the z-buffer. Unlike most existing methods, our approach is suitable both for polygonal and analytical objects. The efficiency of the method is independent of the object complexity and can be accelerated by taking advantage of widely available, low-cost hardware.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Smits:1999:RSC, author = "Brian Smits", title = "An {RGB}-to-Spectrum Conversion for Reflectances", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "4", pages = "11--22", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Smits99/", abstract = "This paper presents a solution to the problem of using RGB data created by most modeling systems in a spectrally-based renderer. It differs from previous methods in that it attempts to create physically plausible spectra for reflectances. The method searches the metamer space for a spectrum that best fits a set of criteria. The results are used in an algorithm that is simple and efficient enough to be used within the rendering process for both importing models and for texture mapping.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Boyles:1999:SBV, author = "Michael Boyles and Shiaofen Fang", title = "Slicing-Based Volumetric Collision Detection", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "4", pages = "23--32", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/BoylesFang99/", abstract = "In this paper, we present a new approach for collision detection of volumetric objects. Good speeds and accuracy can be achieved using existing graphics hardware. The algorithm in simple to implement and, unlike other collision detection mechanisms, requires very little extra memory and preprocessing time. Using a combination of the two-dimensional scanline process and three-dimensional texture mapping technique, a number of polygonal slides can be computed for all volume objects in a scene. For each slice, the objects are checked for collisions using the framebuffer and logical color coding operations. Experiments are provided and analyzed.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Hughes:1999:BOB, author = "John F. Hughes and Tomas M{\"o}ller", title = "Building an Orthonormal Basis from a Unit Vector", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "4", pages = "33--35", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/HughesMoller99/", abstract = "We show how to easily create a right-handed orthonormal basis, given a unit vector, in 2-,~3-, and 4-space.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Li:1999:IPD, author = "Frederick W. B. Li and Rynson W. H. Lau", title = "Incremental Polygonization of Deforming {NURBS} Surfaces", journal = j-J-GRAPHICS-TOOLS, volume = "4", number = "4", pages = "37--50", year = "1999", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/LiLau99/", abstract = "Nonuniform rational B-splines (NURBS) are a powerful tool to model deformable objects. Their shapes can be easily modified by moving the control points. A common method used to render these objects is polygonization. However, the polygonization process is computationally very expensive. If the object deforms, we need to execute this process in every frame to reflect the geometric change of the object. This limitation makes real-time rendering of deforming objects very difficult. In this paper, we present an incremental method for polygonizing deforming objects modeled by NURBS surfaces. Some incremental techniques are introduced here to further improve the performance of the method. They include an efficient mechanism for determining the deformation region when the surface deforms, an incremental crack prevention technique, and an updating method for multiple control point movement.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Feng:2000:AAB, author = "Jieqing Feng and Qunsheng Peng", title = "Accelerating Accurate {B}-spline Free-Form Deformation of Polygonal Objects", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "1", pages = "1--8", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/FengPeng00/", abstract = "A previous paper described an algorithm for accurate B-spline free-form deformation of polygonal objects to produce triangular B{\'e}zier patches. However that algorithm computed the control points of the resulting patches using a generalized de Casteljau algorithm, which is expensive to compute. In this short note, we describe an algorithm that instead uses polynomial interpolation; both theoretical analysis and implementation results show that this new algorithm runs faster than the original.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Assarsson:2000:OVF, author = "Ulf Assarsson and Tomas M{\"o}ller", title = "Optimized View Frustum Culling Algorithms for Bounding Boxes", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "1", pages = "9--22", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/AssarssonMoller00/", abstract = "This paper presents optimizations for faster view frustum culling (VFC) for axis-aligned bounding box (AABB) and oriented bounding box (OBB) hierarchies. We exploit frame-to-frame coherency by caching and by comparing against previous distances and rotation angles. By using an octant test, we potentially halve the number of plane tests needed, and we also evaluate masking, which is a well-known technique. The optimizations can be used for arbitrary bounding volumes, but we present only results for ABBs and OBBs. In particular, we provide solutions which are 2-11 times faster than other VFC algorithms for AABBs and OBBs, depending on the circumstances.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Haines:2000:SCT, author = "Eric Haines", title = "A Shaft Culling Tool", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "1", pages = "23--26", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Haines00/", abstract = "Shaft culling is a means to accelerate the testing of visibility between two objects. This paper briefly describes an algorithm for shaft culling and various implementation options. The code and test harness for the algorithm is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Martin:2000:PRT, author = "William Martin and Elaine Cohen and Russell Fish and Peter Shirley", title = "Practical Ray Tracing of Trimmed {NURBS} Surfaces", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "1", pages = "27--52", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Oct 12 17:08:13 2000", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/MartinCohenFishShirley00/", abstract = "A system is presented for ray tracing trimmed NURBS surfaces. While approaches to components are drawn largely from existing literature, their combination within a single framework is novel. This paper also differs from prior work in that the details of an efficient implementation are fleshed out. Throughout, emphasis is placed on practical methods suitable to implementation in general ray-tracing programs.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Wong:2000:AIS, author = "Kevin Chun-Ho Wong and Pheng-Ann Heng and Tien-Tsin Wong", title = "Accelerating ``Intelligent Scissors'' Using Slimmed Graphs", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "2", pages = "1--13", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Jan 13 13:11:20 2001", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/WongHengWong00/", abstract = "In this paper, we describe an acceleration technique for the semi-automatic image segmentation algorithm, ``intelligent scissors''. Using intelligent scissors, the user can accurately and interactively extract an object from a digitized image. However, the original algorithm suffers from slow performance when large images are treated. In practice, pixels within the non-edge regions are seldom involved in the determination of boundaries (segmentation curves). If these pixels are removed before boundary determination, the performance of intelligent scissors can be improved. We generate a slimmed graph to achieve this goal with significant improvement in response time.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Jin:2000:TDD, author = "Xiaogang Jin and Y. F. Li", title = "Three-Dimensional Deformation Using Directional Polar Coordinates", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "2", pages = "15--24", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Jan 13 13:11:20 2001", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/JinLi00/", abstract = "Spatial deformation is an important tool in both computer animation and shape design. In this paper, we present a new three-dimensional deformation method using directional polar coordinates. The user specifies a source control object and a destination control object, which act as embedding spaces. The source and the destination control objects determine a three-dimensional volume morphing which maps the space enclosed in the source control object to that of the destination control object. By embedding the object to be deformed into the source control object, the three-dimensional volume morphing determines the deformed object automatically without the cumbersome moving of control points. Experiments show that this deformation model is efficient and intuitive, and it can achieve some deformation effects which are difficult with traditional methods.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Ashikhmin:2000:APB, author = "Michael Ashikhmin and Peter Shirley", title = "An Anisotropic {Phong BRDF} Model", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "2", pages = "25--32", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Jan 13 13:11:20 2001", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/AshikhminShirley00/", abstract = "We present a BRDF model that combines several advantages of the various empirical models currently in use. In particular, it has intuitive parameters, is anisotropic, conserves energy, is reciprocal, has an appropriate non-Lambertian diffuse term, and is well-suited for use in Monte Carlo renderers.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Alonso:2000:UGH, author = "Laurent Alonso and Nicolas Holzschuch", title = "Using Graphics Hardware to Speed Up Your Visibility Queries", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "2", pages = "33--47", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Jan 13 13:11:20 2001", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/AlonsoHolzschuch00/", abstract = "We present a visibility method that takes advantage of the graphics hardware to give fast answers to visibility queries. Our visibility method is designed to solve two types of visibility queries: point-based visibility queries, where several visibility queries share the same origin, and plane-based visibility queries, where several visibility queries have their origins on the same plane. Both occur frequently in global illumination algorithms. Combining the speed given by graphics hardware with a software heuristic to avoid reliability problems, our visibility method is significantly faster than ray-casting, and still gives the same results", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Chung:2000:SRT, author = "A. J. Chung and A. J. Field", title = "A Simple Recursive Tessellator for Adaptive Surface Triangulation", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "3", pages = "1--9", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Fri Jul 20 12:38:17 2001", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/AlonsoHolzschuch00/", abstract = "Sometimes there is a need to create a triangular mesh approximation of a parametric surface. If the parametrization is nonuniform (compressed in some areas, stretchy in others), a uniform grid in parameter space becomes distorted and provides a bad approximation. We describe how to create an adaptive triangulation of such a surface, provided the user of the algorithm provides a routine {\tt split_edge()} which indicates whether a particular edge is close enough to the surface or requires splitting, and optionally a routine {\tt flat_enough()} which tells whether a triangle whose edges appear adequate is indeed flat enough, or requires further subdivision. Our contribution is a simple algorithm for guaranteeing that the topology of the resulting mesh is well formed in the sense that there are no cracks between triangles (i.e., T-junction), and for ensuring that subdivision halts at a given point. There is also rudimentary support for trimmed surfaces. Source code for the algorithm is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Wolberg:2000:ODR, author = "George Wolberg and H. M. Sueyllam and M. A. Ismail and K. M. Ahmed", title = "One-Dimensional Resampling with Inverse and Forward Mapping Functions", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "3", pages = "11--33", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Fri Jul 20 12:38:17 2001", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/AlonsoHolzschuch00/", abstract = "Separable resampling algorithms significantly reduce the complexity of image warping. Fant presented a separable algorithm that is well suited for hardware implementation. That method, however, is inherently serial and applies only when the inverse mapping is given. Wolberg presented another algorithm that is less suited for hardware implementation and applies only when the forward mapping is given. This paper demonstrates the equivalence of the two algorithms in the sense that they produce identical output scanlines. We derive a variation of Fant's algorithm that applies when the forward mapping is given and a variation of Wolberg's algorithm that applies when the inverse mapping is given. Integrated hardware implementations that perform one-dimensional resampling under either forward or inverse mappings are presented for both algorithms based on their software descriptions. The Fant algorithm has the advantage of being simple when implemented in hardware, while the Wolberg algorithm has the advantage of being parallelizable and facilitates a faster software implementation. The Wolberg algorithm also has the advantage of decoupling the roundoff errors made among intervals since it does not accrue errors through the incremental calculations required by the Fant algorithm.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Velho:2000:USR, author = "Luiz Velho", title = "Using Semi-Regular $4$-$8$ Meshes for Subdivision Surfaces", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "3", pages = "35--47", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Fri Jul 20 12:38:17 2001", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/AlonsoHolzschuch00/", abstract = "Semi-regular $4$-$8$ meshes are refinable {\em triangulated quadrangulations}. They provide a powerful hierarchical structure for multiresolution applications. In this paper, we show how to decompose the Doo--Sabin and Catmull--Clark subdivision schemes using $4$-$8$ refinement. The described technique makes it possible to use these classical subdivision surfaces with semi-regular $4$-$8$ meshes.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Castro:2000:EAT, author = "Francesc Castro and L{\'a}szl{\'o} Neumann and Mateu Sbert", title = "Extended Ambient Term", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "4", pages = "1--7", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Fri Jul 20 12:38:17 2001", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/AlonsoHolzschuch00/", abstract = "The ambient term in a renderer is a constant color added to all points yielding a crude global approximation to indirect lighting. Because the ambient term ignores geometric occlusion conditions, it is computationally inexpensive. We present an extended ambient term that provides better results than the constant term, but is still inexpensive, because it also does not compute occlusion conditions. It is based on the idea of finding a six-sided axis-aligned environment which is similar in color and area to the real scene, and deriving an approximation to indirect lighting by computing interreflections in the simplified scene.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Rocchini:2000:GRP, author = "C. Rocchini and P. Cignoni", title = "Generating Random Points in a Tetrahedron", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "4", pages = "9--12", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Fri Jul 20 12:38:17 2001", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/AlonsoHolzschuch00/", abstract = "This paper proposes a simple and efficient technique to generate uniformly random points in a tetrahedron. The technique generates random points in a cube and folds the cube into the barycentric space of the tetrahedron in a way that preserves uniformity.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Livingston:2000:CCT, author = "Mark A. Livingston and Arthur Gregory and W. Bruce Culbertson", title = "Camera Control in Three Dimensions with a Two-Dimensional Input Device", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "4", pages = "13--24", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Fri Jul 20 12:38:17 2001", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/AlonsoHolzschuch00/", abstract = "We implement a variety of operations to control a virtual camera using a two-dimensional modal input device, such as a standard three-button mouse. All operations are designed to be easy to use for the end user, but we also designed for ease of implementation for the programmer.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Torres:2000:FAD, author = "J. C. Torres and F. A. Conde", title = "A Fast Algorithm to Decide the Inclusion of a Point in the Convex Hull of a Two-Dimensional Point Set", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "4", pages = "25--32", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Fri Jul 20 12:38:17 2001", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/AlonsoHolzschuch00/", abstract = "This paper presents a new fast algorithm to compute the two-dimensional inclusion test of a point in the convex hull of a set of points, without computing the convex hull. The algorithm is based on the classification of the points in octants of the plane. The classification step for each point requires only simple test operations, and makes the algorithm run in at worst, O(n). For point sets larger than 11 points, the proposed algorithm is faster than other known approaches. The paper includes a practical evaluation of the algorithm, comparing it with several previously known approaches.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Elinas:2000:RTR, author = "Pantelis Elinas and Wolfgang Stuerzlinger", title = "Real-time rendering of {$3$D} clouds", journal = j-J-GRAPHICS-TOOLS, volume = "5", number = "4", pages = "33--45", year = "2000", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Feb 06 11:23:34 2002", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/ElinasStuerzlinger00.html", abstract = "The visual realism of a computer graphics simulation of outdoor scenery is greatly enhanced by a realistic display of clouds. In this paper, we present an algorithm based on Gardner's work that can render perspectively-correct 3D clouds in real time on current graphics hardware. The use of 3D ellipsoids as primitives permits even close-ups without the viewer noticing the approximation. We describe an implementation using OpenGL.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Dinerstein:2001:LGM, author = "Jonathan Dinerstein and Larre Egbert and Nick Flann", title = "Linear grouping---a method for optimizing {$3$D} vertex transformation and clipping", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "1", pages = "1--6", year = "2001", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Feb 06 11:23:34 2002", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/DinersteinEgbertFlann01.html", abstract = "This paper introduces {\em linear grouping}, a slightly lossy optimization technique for affine transformation of rigid vertex data. This technique is beneficial when vertex transformation is of notable cost, such as in software rendering systems and applications and where visual correctness is sufficient, for example games, simulators, and other real-time applications. In practice, linear grouping (nearly visually lossless) eliminates approximately~55\% of the vertices in an average polygonal mesh, reducing transform overhead by about~50\% and clipping overhead by about~32\%.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Kallmann:2001:SVC, author = "Marcelo Kallmann and Daniel Thalmann", title = "Star-vertices: {A} compact representation for planar meshes with adjacency information", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "1", pages = "7--18", year = "2001", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Feb 06 11:23:34 2002", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/KallmannThalmann01.html", abstract = "In this paper we propose a new structure, {\em star-vertex}, to represent general planar meshes. The basic concept is simple, allowing constant adjacency query time, and scalability (ability to trade size for speed), and under specific situations requiring less storage space than others. For simplicity, we use a generic traverse element, which resembles the behavior of oriented edges. We present implementation examples of the proposed structure and comparisons with other mesh representation schemes.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Haines:2001:SPS, author = "Eric Haines", title = "Soft planar shadows using plateaus", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "1", pages = "19--27", year = "2001", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Feb 06 11:23:34 2002", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Haines01.html", abstract = "This paper presents an algorithm for rapidly creating and rendering soft shadows on a plane. It has the advantages of rapid generation on current hardware, as well as high quality and a realistic feel on a perceptual level. The algorithm renders the soft shadow to a texture. It begins with a hard drop shadow, then uses the object's silhouette edges to generate penumbrae in a single pass. Though the shadows generated are physically inaccurate, this technique yields penumbrae that are smooth and perceptually convincing.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Akenine-Moller:2001:FTB, author = "Tomas Akenine-M{\"o}ller", title = "Fast {$3$D} triangle-box overlap testing", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "1", pages = "29--33", year = "2001", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Feb 06 11:23:34 2002", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/AkenineMoller01.html", abstract = "A fast routine for testing whether a triangle and a box are overlapping in three dimensions is presented. The test is derived using the separating axis theorem, whereafter the test is simplified and the code is optimized for speed. We show that this approach is 2.3 vs. 3.8 (PC vs. Sun) times faster than previous routines. It can be used for faster collision detection and faster voxelization in interactive ray tracers. The code is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Nasri:2001:SAG, author = "Ahmed Nasri and Gerald Farin", title = "A subdivision algorithm for generating rational curves", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "1", pages = "35--47", year = "2001", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Feb 06 11:23:34 2002", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/", abstract = "The well-known Chaikin algorithm generates uniform quadratic B-spline curves by repeating the process of cutting off the corners of a polygon. One disadvantage of this algorithm is the incapability of generating circles. This paper proposes a modification of this algorithm to produce piecewise rational curves; in particular a circle is produced from a given square. For a general control polygon, every two subsequent polygon legs of equal length will correspond to a circular arc. Such an arc will be parameterized by arc length and will remain circular under affine transformations. Both properties are not shared by the standard rational quadratic form.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{vanderLinden:2001:MEL, author = "Jarno van der Linden and Richard Lobb", title = "{MPEG}-Encoded light fields", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "2", pages = "1--15", year = "2001", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Feb 06 11:23:34 2002", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/vanDerLindenLobb01.html", abstract = "Light fields (or Lumigraphs) are an image-based rendering method. As light fields require a large number of images, memory and disk space requirements are a significant barrier to the practical use of light fields. In this paper, we explain how to greatly reduce the space demands of light fields by encoding them in an MPEG format. The encoding is comprised of an MPEG bitstream and two tables of precomputed information to aid real-time decoding. By restricting the parameters used for MPEG encoding, and by employing a caching system, new views of the compressed light field can be rendered at fast interactive frame rates on consumer hardware. Compression ratios of around 50:1 are demonstrated. Combined, the speed and compression make the use of light fields practical on consumer hardware.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Molla:2001:SA, author = "Ram{\'o}n Moll{\'a} and Roberto Viv{\'o}", title = "The Stair algorithm", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "2", pages = "17--25", year = "2001", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Feb 06 11:23:34 2002", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/MollaVivo01.html", abstract = "This algorithm draws straight lines on discrete devices as if they were staircases. It determines the fractional average length of each step, and it fills the pixels along every scanline intersected by the line to be drawn. This algorithm supports fractional line ends, and it uses internal 32-bit, fixed-point arithmetic; 16 bits for the integer and 16 bits for the decimal part.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Wilhelms:2001:FER, author = "Jane Wilhelms and Allen {Van Gelder}", title = "Fast and easy reach-cone joint limits", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "2", pages = "27--41", year = "2001", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Feb 06 11:23:34 2002", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/WilhelmsVanGelder01.html", abstract = "We describe a simple and fast method of creating and using joint sinus reach cones to limit the range of motion on universal and ball-and-socket joints. Reach cones can be created interactively or based on results from biomechanics. A reach cone is specified as a spherical polygon on the surface of a reach sphere that defines all positions the longitudinal segment axis beyond the joint can take. Reach polygons can be concave or convex, and cover more than one hemisphere. Longitudinal axis rotation limits can also be defined for locations in the reach cone. Calculations to determine whether a segment is within the reach cone are based on the relation of the segment longitudinal axis to the planes defining the reach cone and are done in the local coordinate space of the segment. The calculations have no discernible effect on the speed of interactive display or animation.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Stam:2001:SFS, author = "Jos Stam", title = "A simple fluid solver based on the {FFT}", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "2", pages = "43--52", year = "2001", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Feb 06 11:23:34 2002", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Stam01.html", abstract = "This paper presents a very simple implementation of a fluid solver. The implementation is consistent with the equations of fluid flow and produces velocity fields that contain incompressible rotational structures and dynamically react to user-supplied forces. Specialized for a fluid which wraps around in space, it allows us to take advantage of the Fourier transform, which greatly simplifies many aspects of the solver. Indeed, given a Fast Fourier Transform, our solver can be implemented in roughly one page of readable C code. The solver is a good starting point for anyone interested in coding a basic fluid solver. The fluid solver presented is useful also as a basic motion primitive that can be used for many different applications in computer graphics.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Mech:2001:HAR, author = "Radom{\'\i}r Mech", title = "Hardware-accelerated real-time rendering of gaseous phenomena", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "3", pages = "1--16", year = "2001", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Apr 11 07:08:39 2002", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Mech01/", abstract = "In this paper, the problem of rendering a gas in real time is approached by placing specific constraints on the distribution of densities and colors inside the gas. A multi-pass algorithm for real-time rendering of a gas defined by a three-dimensional boundary is presented. The density and the color of the gas inside the boundary may be constant, or the color of a dense gas can be defined by a texture. This algorithm is combined with an existing algorithm for rendering layered fog so that the density and color inside the three-dimensional boundary can vary along a single axis. Despite the constraints, the algorithms can be used to render a variety of volumetric phenomena in real time. The OpenGL implementation of the algorithm presented in this paper is used in SGI's Performer, Version 2.4, released in November 2000.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Jin:2001:CSL, author = "Xiaogang Jin and Chiew-Lan Tai and Jieqing Feng and Qunsheng Peng", title = "Convolution surfaces for line skeletons with polynomial weight distributions", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "3", pages = "17--28", year = "2001", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Apr 11 07:08:39 2002", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/JinEtAl01/", abstract = "Convolution surfaces generalize point-based implicit surfaces to incorporate higher-dimensional skeletal elements; line segments can be considered the most fundamental skeletal elements since they can approximate curve skeletons. Existing analytical models for line-segment skeletons assume uniform weight distributions, and thus they can produce only constant-radius convolution surfaces. This paper presents an analytical solution for convolving line-segment skeletons with a variable kernel modulated by a polynomial function, allowing generalized cylindrical convolution surfaces to be modeled conveniently. Its computational requirement is competitive with that of uniform weight distribution. The source code of the field computation is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Max:2001:CSC, author = "Nelson Max", title = "Consistent subdivision of convex polyhedra into tetrahedra", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "3", pages = "29--36", year = "2001", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Apr 11 07:08:39 2002", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Max01/", abstract = "This paper presents a simple method of subdividing a grid of convex polyhedral cells into tetrahedra such that the subdivision of two adjacent cells divide their common face into the same set of triangles. The method is then generalized to grids of convex polytopes in $n$ dimensions.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Wiseman:2001:CEC, author = "Yair Wiseman and Erick Fredj", title = "Contour extraction of compressed {JPEG} images", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "3", pages = "37--43", year = "2001", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Apr 11 07:08:39 2002", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/WisemanFredj01/", abstract = "We present a new algorithm that uses the JPEG compression format and provides a significant improvement in contour extraction for medical imaging, such as X-ray photos. The algorithm searches for an object's contour in the compressed file. The complexity is reduced to $O(n)$ in the case of a high resolution picture, which is better than the state-of-the-art for contour extraction.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Andersen:2001:TDP, author = "Clark R. Andersen and William L. {Buford, Jr.}", title = "The three-dimensional parametric ellipse", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "3", pages = "45--48", year = "2001", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Apr 11 07:08:39 2002", bibsource = "http://www.acm.org/jgt/issues.html; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/AndersenBuford01/", abstract = "The common approach to generating an arbitrarily oriented ellipse or circle in three dimensions is to generate it first in two dimensions, then transform the result into the desired position and orientation. We present a technique to model the ellipse directly as a three-dimensional parametric function, a constrained variation of a Lissajous curve, avoiding the need for subsequent transformations.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Nielsen:2002:FTB, author = "Kasper H{\o}y Nielsen and Niels J{\o}rgen Christensen", title = "Fast Texture-Based Form Factor Calculations for Radiosity Using Graphics Hardware", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "4", pages = "1--12", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/NielsenChristensen01/", abstract = "This paper describes a method that speeds up hemicube rendering by using texture maps to discretize a scene instead of geometric meshing. The method avoids subdivision of input surfaces and takes advantage of hardware texture mapping in order to accelerate form factor calculations. By using the method, we are able to compute finite-element progressive radiosity significantly faster than when using traditional meshing.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Nakamaru:2002:EBF, author = "Koji Nakamaru and Yoshio Ohno", title = "Enhanced Breadth-First Ray Tracing", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "4", pages = "13--28", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/NakamaruOhno01/", abstract = "Breadth-first ray tracing that utilizes uniform spatial subdivision can render a large number of objects without breakdown. The original algorithm however has two major drawbacks: redundant data processing and limited grid resolution. We present several refinements for these drawbacks and realize fast and robust external ray tracing. We achieved speedups of roughly up to 4x for SPD scenes with up to 50 million objects, and up to 14x for pathological cases with 1 billion objects, all rendered on a PC with 256MB memory.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Vincent:2002:FAP, author = "Stephen Vincent and David Forsey", title = "Fast and Accurate Parametric Curve Length Computation", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "4", pages = "29--40", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/VincentForsey01/", abstract = "This paper describes a simple technique for evaluating the length of a parametric curve. The technique approximates sections of the curve to the arc of a circle using only sample points on the curve; no computation of derivatives or other properties is required. This method is almost as quick to implement and compute as chord-length summation, but it is much more accurate. It also provides recursion criteria for adaptive sampling. An extension of the algorithm to estimate the area of a parametric surface is discussed briefly.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Baranoski:2002:ECB, author = "Gladimir V. G. Baranoski and Jon Rokne", title = "An Efficient and Controllable Blob Function", journal = j-J-GRAPHICS-TOOLS, volume = "6", number = "4", pages = "41--54", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/BaranoskiRokne01/", abstract = "A tunable blob function is proposed which is computationally simple since it is a rational function of low degree. The blob function is dependent on a parameter $d$ which can be used to control the blob function making it suitable for computer graphics applications such as implicit surface generational. The main properties of the blob function are described and graphed. When the parameter $d$ is large, the blob function can be used to generate a three-dimensional spike by rotating it around the $z$-axis.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Thomspon:2002:SPP, author = "William B. Thomspon and Peter Shirley and James A. Ferwerda", title = "A Spatial Post-Processing Algorithm for Images of Night Scenes", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "1", pages = "1--12", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/ThompsonShirleyFerwerda02/", abstract = "The standard technique for making images viewed at daytime lighting levels look like images of night scenes is to use a low overall contrast, low overall brightness, desaturation, and to give the image a ``blue shift.'' This paper introduces two other important effects associated with viewing real night scenes: visible noise, and the loss of acuity with little corresponding perceived blur.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Meyer:2002:GBC, author = "Mark Meyer and Haeyoung Lee and Alan Barr and Mathieu Desbrun", title = "Generalized Barycentric Coordinates on Irregular Polygons", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "1", pages = "13--22", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/MeyerEtAl02/", abstract = "In this paper we present an easy computation of a generalized form of barycentric coordinates for irregular, convex $n$-sided polygons. Triangular barycentric coordinates have had many classical applications in computer graphics, from texture mapping to ray tracing. Our new equations preserve many of the familiar properties of the triangular barycentric coordinates with an equally simple calculation, contrary to the previous formulations. We illustrate the properties and behavior of these new generalized barycentric coordinates through several example applications.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Vranek:2002:FAC, author = "David Vranek", title = "Fast and Accurate Circle-Circle and Circle-Line {$3$D} Distance Computation", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "1", pages = "23--32", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Vranek02/", abstract = "This paper presents a novel high-precision algorithm for the calculation of the minimal distance between two circles in three dimensions. Contrary to the common approach that mainly utilizes a solution of an eighth-degree polynomial equation, the proposed algorithm is based on directly using the distance function and its derivatives. As the theory is not too complicated, the algorithm is very easy to implement. The paper also suggests a small modification of the circle-circle distance algorithm for the circle-line distance calculation. Results of computational simulation compared with Eberly's Wild Magic library are given and summarized in detail at the end of the paper. They show that the proposed algorithm always correctly finds the global minimum with much higher accuracy at the same speed in the circle-circle distance calculation case, whereas circle-line calculation is approximately four times faster. The source code is available online at the web site given at the end of the paper.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Slater:2002:CTQ, author = "Mel Slater", title = "Constant Time Queries on Uniformly Distributed Points on a Hemisphere", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "1", pages = "33--44", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Slater02/", abstract = "A set of uniformly distributed points on a hemisphere is generated using a popular method based on triangle subdivision. In applications, each data point (for example, representing a direction from a point on a surface) is typically associated with additional information (for example, a radiance value). Given an arbitrary query point on the hemisphere we require the nearest data point from the given distribution. An algorithm is presented that finds the data point in constant time, independently of the number of original points in the distribution. A portion of the hemisphere is rendered such that each point in the distribution has an associated set of quadrilaterals rendered with a unique color index for that point. The frame-buffer for the rendered hemisphere portion can be stored in off-screen memory. Any query point can be projected into this off-screen frame buffer, projected to a 'pixel' location, and the color index stored at this pixel location found. This color index is a lookup into an array of the original data points. This algorithm is presented in detail, and an illustrative implementation in OpenGL is described.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Reinhard:2002:PEP, author = "Erik Reinhard", title = "Parameter Estimation for Photographic Tone Reproduction", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "1", pages = "45--52", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Reinhard02/", abstract = "Tone reproduction algorithms attempt to compress a large range of pixel values into a smaller range that is suitable for display on devices with limited dynamic range. A recently proposed tone reproduction operator achieved this goal by emulating photographic practice. Like in photography, the manual tuning of a small set of intuitive parameters was required. In this paper we extend this photographic tone reproduction algorithm with an automatic method for estimating these parameters. The estimation process is also based on photographic practice. The resulting operator produces good images and does not require manual parameter tuning. Sample source code is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Schmidt:2002:SND, author = "Charles M. Schmidt and Brian Budge", title = "Simple Nested Dielectrics in Ray Traced Images", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "2", pages = "1--8", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/SchmidtBudge02/", abstract = "This paper presents a simple method for modeling and rendering refractive objects that are nested within each other. The technique allows the use of simpler scene geometry and can even improve rendering time in some images. The algorithm can be easily added into an existing ray tracer and makes no assumptions about the drawing primitives that have been implemented.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Sunday:2002:FPA, author = "Daniel Sunday", title = "Fast Polygon Area and {Newell} Normal Computation", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "2", pages = "9--13 (??)", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Sunday02/", abstract = "The textbook formula for the area of an $n$-vertex two-dimensional polygon uses $2n+1$ multiplications and $2n-1$ additions. We give an improved formula that uses $n+1$ multiplications and $2n-1$ additions. A similar formula is derived for a three-dimensional planar polygon where, given the unit normal, the textbook equation cost of $6n+4$ multiplications and $4n+1$ additions is reduced to $n+2$ multiplications and $2n-1$ additions. Our formula also speed up Newell's method to compute a robust approximate normal for a nearly planar three-dimensional polygon, using $3n$ fewer additions than the textbook formula. Further, when using this method, one can get the polygon's planar area as equal to the length of Newell's normal for a small additional fixed cost.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", xxremark = "Web site has 4-page gap between this article and the next.", } @Article{Ganovelli:2002:FTT, author = "Fabio Ganovelli and Frederico Ponchio and Claudio Rocchini", title = "Fast Tetrahedron-Tetrahedron Overlap Algorithm", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "2", pages = "17--26", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/GanovelliPonchioRocchini02/", abstract = "We present an algorithm to test two tetrahedra for overlap. The algorithm is based on a dimension reduction technique that allows the application of the Separating Axis Theorem, thus avoiding part of the computation needed to perform the Separating Axis Test. Source code is available on the website listed at the end of this paper.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Cazals:2002:NID, author = "Fr{\'e}d{\'e}ric Cazals", title = "Non-Intrusive Debugging and Incremental Visualization with the Geometric Stethoscope", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "2", pages = "27--40", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Cazals02/", abstract = "Developing and debugging geometric applications is known to be a difficult task: The calculations and data structures can be involved, there are degenerate cases and numerical issues, etc. THis paper presents a software setup aiming at easing the development, the debugging, ad the maintenance of geometric applications. \par More precisely, {\em incremental visualization\/} is defined as the possibility for the programmer to visualize interactively any significant update of the geometric data structures at any time. {\em Non-intrusive debugging\/} is defined as the possibility of visualizing any geometric entity in three dimensions from a standard debugger at any time without modifying the source code. We present a setup to perform incremental visualization and non-intrusive debugging. This setup is based on multithreading and requires a three-dimensional viewer, such as Open Inventor, Vtk, or Geomview, and a standard debugger (dbx or gdb). \par An Open Inventor based C++ implementation of this setup accompanies this paper. Using it simply requires writing the functions converting the user's data structures into Open Inventor's data structures. The setup could easily be extended to accommodate other medias such as sound, video, etc.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Martin:2002:TCI, author = "William Martin and Peter Shirley and Steven Parker and William Thompson and Erik Reinhard", title = "Temporally coherent interactive ray tracing", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "2", pages = "41--48", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/MartinEtAl02/", abstract = "Ray tracing exhibits visible temporal aliasing artifacts in interactive viewing of complex datasets. We present a technique to reduce scintillation in point sampled imagery by targeting new rays to intersection points from previous frames. Remaining artifacts are abated by blending between successive frames. The algorithm achieves a reduction in scintillation comparable to that of supersampling, but at a significantly lower cost. Sample animations are available on the website listed at the end of this paper.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Frisken:2002:SET, author = "Sarah F. Frisken and Ronald N. Perry", title = "Simple and Efficient Traversal Methods for Quadtrees and Octrees", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "3", pages = "1--11", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/FriskenPerry02/", abstract = "Quadtrees and octrees are used extensively throughout computer graphics and in many other diverse fields such as computer vision, robotics, and pattern recognition. Managing information stored in quadtrees and octrees requires basic tree traversal operations such as point location, region location, and neighbor searches. This paper presents simple and efficient methods for performing these operations that are inherently nonrecursive and reduce the number of comparisons with poor predictive behavior. The methods are table-free, thereby reducing memory accesses, and generalize easily to higher dimensions. Source code is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Kallay:2002:CTB, author = "Michael Kallay", title = "Computing Tight Bounds for a {B{\'e}zier} Curve", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "3", pages = "13--17", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Kallay02/", abstract = "This note shows hot to computer tight bounds (within arithmetic error) on cubic B{\'e}zier curves. A C++ implementation is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Steed:2002:PSC, author = "Anthony Steed", title = "Pseudo-Shadowed Cursors for {$3$D} Interaction", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "3", pages = "19--25", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Steed02/", abstract = "We present a simple technique that can be used to highlight the intersection of the planes of a 3D cursor with the objects within a scene. Such highlighting is useful in object manipulation tasks, where the user needs to understand cursor orientation and position relative to scene objects.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Haumont:2002:CPS, author = "Denis Haumont and Nadine Warz{\'e}e", title = "Complete Polygonal Scene Voxelization", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "3", pages = "27--41", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/HaumontWarzee02/", abstract = "We present a fast and robust tool for automatically converting complete polygonal scenes into volumetric representations. A wide range of scenes are handled by storing the status (inside/outside) of the volumetric space areas in the cells of an octree. The algorithm first looks for a point in the scene for which the status can be unequivocally determined. When such a point is found, it propagates its status to the surrounding visible cells. This iterative two-step procedure is repeated for different parts of the scene until the status of all the cells has been determined. The algorithm's advantage is the coherence with the rendered geometry; it can handle complex geometry and exhibits robust solutions for a broad range of scenes containing numerous artifacts, such as cracks, holes, overlapping geometries, interpenetrating meshes, double walls, and fuzzy borders.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Vincent:2002:FDG, author = "Stephen Vincent", title = "Fast Detection of the Geometric Form of Two-Dimensional Cubic {B{\'e}zier} Curves", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "3", pages = "43--51", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Vincent02/", abstract = "This paper presents and algorithm that determines, from the control points of a cubic two-dimensional B{\'e}zier curve, the geometric form of the curve (arch, single inflection, two inflections, cusp, loop, or the degenerate forms straight line or point). The algorithm is based on a case analysis of the signs for the determinants of the control-point triples. Source code is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Ashikhmin:2002:SBR, author = "Michael Ashikhmin and Abhijeet Ghosh", title = "Simple blurry reflections with environment maps", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "4", pages = "3--8", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:44:14 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/AshikhminGhosh02/", abstract = "We present a technique which uses existing OpenGL capabilities to approximate the effect of blurry specular reflections and indirect diffuse illumination. It makes use of environment maps, mipmapping with level of detail control, and possibly texture borders. The method is extremely simple to implement, in some cases requiring just a single additional OpenGL statement.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Brabec:2002:PSM, author = "Stefan Brabec and Thomas Annen and Hans-Peter Seidel", title = "Practical shadow mapping", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "4", pages = "9--18", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:44:14 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/BrabecAnnenSeidel02/", abstract = "We present several techniques that can drastically improve shadow quality, when using the shadow mapping algorithm. Visual artifacts like jagged shadow boundaries or z-fighting are mainly due to insufficient shadow map resolution during the shadow test and/or limited numerical precision. We show how to compute a tight light source viewing frustum, dependent on the current camera setup, such that nearly the full shadow map resolution is available. Furthermore, we recommend linear distribution of depth values instead of perspective depth values.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Forsyth:2002:SSB, author = "Tom Forsyth", title = "Self-Shadowing Bumpmap using {$3$D} Texture Hardware", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "4", pages = "19--26", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Forsyth02/", abstract = "Self-shadowing bump maps add realism and depth to scenes and provide important visual cues. Previous techniques have shown self-shadowing at interactive rates, but at a substantial cost over standard normal mapped bump mapping. This paper uses volume textures on consumer graphics hardware, using few enough resources that they can be easily added to existing normal map bump mapping renderers. The ways the technique can be scaled according to available memory constraints are also explored.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Kautz:2002:RTH, author = "Jan Kautz and Hans-Peter Seidel", title = "Real-Time Halftoning", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "4", pages = "27--31", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/KautzSeidel02/", abstract = "We present a real-time hardware accelerated method for rendering objects using halftoning. It is solely based on texture mapping and creates the impression of a printed image, although the lighting and objects can be changed and manipulated on the fly.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Kim:2002:HAR, author = "Dongo Kim and James K. Hahn", title = "Hardware-Assisted Rendering of Cylindrical Panoramas", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "4", pages = "33--42", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/KimHahn02/", abstract = "Cylindrical panorama is being used in many applications. Cylindrical panoramic viewers render the panorama from the center of the cylinder by projecting the cylindrical map onto a planar screen. This process involves nonlinear image warping, so many panoramic viewers are implemented in software. Hardware acceleration may be used if the panorama is resampled onto the polygonal models. \par This paper presents an algorithm to render cylindrical panorama with hardware acceleration while using the input panorama as is. The rendering equation of cylindrical panorama is decomposed into linear approximation and nonlinear residuals. Nonlinear parts are encoded as bump maps to perturb the texture coordinates on a per-pixel basis. This process can be performed by environment-mapped bump mapping (EMBM) hardware.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Kim:2002:CPQ, author = "Young J. Kim and Kenneth Hoff and Ming C. Lin and Dinesh Manocha", title = "Closest Point Query among the Union of Convex Polytopes using Rasterization Hardware", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "4", pages = "43--51", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/KimEtAl02/", abstract = "We present a novel approach using rasterization hardware to perform the following query: Given a collection of convex polytopes in 3D, find the closest point from some given point inside the polytopes to the surface of the union of the polytopes. The algorithm takes advantage of multipass rendering, clipping, and depth tests. We also demonstrate its application to penetration depth computation.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Parilov:2002:PPD, author = "Sergey Parilov and Wolfgang Stuerzlinger", title = "Per-Pixel Divisions", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "4", pages = "53--59", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/ParilovStuerzlinger02/", abstract = "We describe a method to perform per-pixel divisions using graphics hardware, with a simple iterative algorithm. In the worst case, the number of rendering passes is 17 for approximate divisions, and 18 for accurate divisions. The algorithm can be used for 3D vector normalization, evaluating complex lighting models, and image reconstruction.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Steigleder:2002:FAB, author = "Mauro Steigleder", title = "Factorization of the Ashikhmin {BRDF} for Real-Time Rendering", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "4", pages = "61--68", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Steigleder02/", abstract = "Ashikhmin and Shirley have proposed an anisotropic BRDF model that is physically plausible and has intuitive parameters. We present an analytical factorization of the Ashikhmin BRDF that is suitable for real-time implementation on all graphics accelerators, and addresses some important issues necessary to correctly implement the factorization. We also discuss highlight antialiasing.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Wang:2002:FNM, author = "Yigang Wang and Bernd Fr{\"o}hlich and Martin G{\"o}bel", title = "Fast Normal Map Generation for Simplified Meshes", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "4", pages = "69--82", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/WangFrohlichGobel02/", abstract = "Approximating detailed models with coarse, normal mapped meshes is a very efficient method for real-time rendering of complex objects with fine surface detail. In this paper, we present a new and fast normal map construction algorithm. We scan-convert each triangle of the simplified model, which results in a regularly spaced point set on the surface of each triangle. The original model and all these point samples of the simplified model are rendered from uniformly distributed camera positions. The actual normal map was created by computing the corresponding normals for the point sets. For each point, the normal of the closest point from the high resolution mesh over the set of all camera positions is chosen. Our approach works for general triangle meshes and exploits fully common graphics rendering hardware. Normal map construction times are generally in the range of only a few seconds even for large models. We render our normal-mapped meshes in real-time with a slightly modified version of the standard bump-mapping algorithm. In order to evaluate the approximation error, we investigate the distance and normal errors for normal-mapped meshes. Our investigation of the approximation errors shows that using more than 12 viewpoints does not result in a further improvement in the normal maps for our test cases.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Weiskopf:2002:RTD, author = "Daniel Weiskopf and Thomas Ertl", title = "Real-Time Depth-Cueing beyond Fogging", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "4", pages = "83--90", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/WeiskopfErtl02/", abstract = "We propose a generic and flexible depth-cueing scheme which subsumes a large class of color-based depth-cueing approaches. In particular, it includes standard fog-based depth-cueing and widely neglected saturation depth-cueing. Our depth-cueing scheme is based on linear transformations in the 3D tristimulus space of colors and on weighted sums of colors. Since all of the required operations are supported by contemporary consumer graphics hardware, the depth-cueing scheme can be implemented with minimal reduction of performance. Therefore, any real-time rendering application can be enriched by sophisticated depth-cueing.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Yang:2002:FIS, author = "Ruigang Yang and Greg Welch", title = "Fast Image Segmentation and Smoothing Using Commodity Graphics Hardware", journal = j-J-GRAPHICS-TOOLS, volume = "7", number = "4", pages = "91--100", year = "2002", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/YangWelch02/", abstract = "We present a novel use of commodity graphics hardware to perform real-time image segmentation and image morphology operations. Our preliminary results show a performance increase of over 30\% using an nVidia GeForce4 when compared to an implementation using Intel MMX optimized code on a 2.2GHz Intel P4 CPU.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Low:2003:CVF, author = "Kok-Lim Low and Adrian Ilie", title = "Computing a View Frustum to Maximize an Object's Image Area", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "1", pages = "3--15", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/LowIlie03/", abstract = "This paper presents a method to compute a view frustum for a 3D object viewed from a given viewpoint, such that the object is completely enclosed in the frustum and the object's image area is also near-maximal in the given 2D rectangular viewing region. This optimization can be used to improve the resolution of shadow maps and texture maps for projective texture mapping. Instead of doing the optimization in 3D space to find a good view frustum, our method uses a 2D approach. The basic idea of our approach is as follows. First, from the given viewpoint, a conveniently-computed view frustum is used to project the 3D vertices of the object to their corresponding 2D image points. A tight 2D bounding quadrilateral is then computed to enclose these 2D image points. Next, considering the projective warp between the bounding quadrilateral and the rectangular viewing region, our method applies a technique of camera calibration to compute a new view frustum that generates an image that covers the viewing region as much as possible.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Shen:2003:FTT, author = "Hao Shen and Pheng Ann Heng and Zesheng Tang", title = "A Fast Triangle-Triangle Overlap Test Using Signed Distances", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "1", pages = "16--24 (??)", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/ShenHengTang03/", abstract = "A fast test for triangle-triangle intersection by computing signed vertex-plane distances (sufficient if one triangle is wholly to one side of the other) and sign line-line distances of selected edges (otherwise) is presented. This algorithm is faster than previously published algorithms and the code is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", xxpages = "3--15", xxremark = "Web site gives same page numbers for two successive articles.", } @Article{Guigue:2003:FRT, author = "Philippe Guigue and Olivier Devillers", title = "Fast and Robust Triangle-Triangle Overlap Test using Orientation Predicates", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "1", pages = "25--32 (??)", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/GuigueDevillers03/", abstract = "This paper presents an algorithm for determining whether two triangles in three dimensions intersect. The general scheme is identical to the one proposed by M{\"o}ller. The main difference is that our algorithm relies exclusively on the sign of $4 \times 4$ determinants and does not need any intermediate explicit constructions which are source of numerical errors. Besides the fact that the resulting code is more reliable than existing methods, it is also more efficient. The source code is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", xxpages = "25--42", xxremark = "Web site gives overlapping page numbers.", } @Article{Dawson:2003:CW, author = "Robert J. MacG. Dawson", title = "Crooked Wallpaper", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "1", pages = "33--46", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Dec 16 13:47:48 2003", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Dawson03/", abstract = "It may be of interest to represent a periodic bitmap pattern, with period vectors that are not horizontal and vertical, using rectangular bitmaps. Holladay's algorithm provides an efficient way to do this when the tiled motif is small, using a single rectangle. We show that this may not be efficient when the repeated motif is larger, and give a generalization, using two rectangles, that requires fewer partial blits.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Lewiner:2003:EIM, author = "Thomas Lewiner and H{\'e}lio Lopes and Ant{\^o}nio Wilson Vieira and Geovan Tavares", title = "Efficient Implementation of Marching Cubes' Cases with Topological Guarantees", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "2", pages = "1--15", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/LewinerEtAl03/", abstract = "Marching Cubes methods first offered visual access to experimental and theoretical data. The implementation of this method usually relies on a small look-up table; many enhancements and optimizations of Marching Cubes still use it. However, this look-up table can lead to cracks and inconsistent topology. This paper introduces a full implementation of Chernyaev's technique to ensure a topologically correct result, i.e., a manifold mesh, for any input data. It completes the original paper for the ambiguity resolution and for the feasibility of the implementation. Moreover, the cube interpolation provided here can be used in a wider range of methods. The source code is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Ward:2003:FRI, author = "Greg Ward", title = "Fast, Robust Image Registration for Compositing High Dynamic Range Photographcs from Hand-Held Exposures", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "2", pages = "17--30", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Ward03/", abstract = "In this paper, we present a fast, robust, and completely automatic method for translational alignment of hand-held photographs. The technique employs percentile threshold bitmaps to accelerate image operations and avoid problems with the varying exposure levels used in high dynamic range (HDR) photography. An image pyramid is constructed from grayscale versions of each exposure, and these are converted to bitmaps and aligned horizontally and vertically using inexpensive shift and difference operations over each image. The cost of the algorithm is linear with respect to the number of pixels and effectively independent of the maximum translation. A three million pixel exposure can be aligned in a fraction of a second on a contemporary microprocessor using this technique.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Kallay:2003:ITP, author = "Michael Kallay and Jason Lawrence", title = "Improving the Two-Pass Resampling Algorithm", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "2", pages = "31--40", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/KallayLawrence03/", abstract = "The Catmull-Smith two-pass resampling algorithm simplifies the nontrivial reconstruction of a transformed two-dimensional image by decomposing the transformation into two one-dimensional passes. We present a theoretically motivated modification to this algorithm that provides improved image quality. For the case of projective transformations, this improvement results in a final algorithm that is more robust and accurate than the original while even affecting correctness in some cases.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Jianhui:2003:RBS, author = "Ye Jianhui", title = "Region-Based Simplification of Laser Scanned Meshes", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "2", pages = "41--50", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Jianhui03/", abstract = "To simplify the mesh acquired from a three-dimensional laser scanner, it is more important to keep the boundary and quality of the region of interest than of other regions. The algorithm must not be sensitive to noise introduced in practical applications. In this paper, we present a novel vertex merging mesh simplification algorithm based on region segmentation. The algorithm can be divided into two stages: segmentation and simplification. After the segmentation of the 3D color mesh into different regions, vertices are classed into a region-boundary vertex, which can only be merged into a region-boundary vertex in order to guarantee the completeness of the regions' boundary, and region-inner vertex. The iterative vertex merging is applied with a region-weighted error metric, which implements controllable simplifications. We demonstrate our method with several examples of a 3D color human head mesh.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Xue:2003:ESU, author = "Daqing Xue and Roger Crawfis", title = "Efficient Splatting Using Modern Graphics Hardware", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "3", pages = "1--21", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/XueCrawfis03/", abstract = "Interactive volume rendering for data set sizes larger than one million samples requires either dedicated hardware, such as three-dimensional texture mapping, or a sparse representation and rendering algorithm. Consumer graphics cards have seen a rapid explosion of performance and capabilities over the past few years. This paper presents a splatting algorithm for direct volume rendering that utilizes the new capabilities of vertex programs and the OpenGL imaging extensions. This paper presents three techniques: immediate mode rendering, vertex shader rendering, and point convolution rendering, to implement splatting on a PC equipped with an NVIDIA GeForce4 display card. Per-splat and per-voxel render-time analysis is conducted for these techniques. The results show that vertex-shader rendering offers an order of magnitude speed-up over immediate mode rendering and that interactive volume rendering is becoming feasible on these consumer-level graphics cards for complex volumes with millions of voxels.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Arvo:2003:OSM, author = "Jukka Arvo and Timo Aila", title = "Optimized Shadow Mapping Using the Stencil Buffer", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "3", pages = "23--32", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/ArvoAila03/", abstract = "Shadow maps and shadow volumes are common techniques for computing real-time shadows. We optimize the performance of a hardware-accelerated shadow mapping algorithm by rasterizing the light frustum into the stencil buffer, in a manner similar to the shadow volume algorithm. The pixel shader code that performs shadow tests and illumination computations is applied only to the pixels that are inside the light frustum. We also use deferred shading to further limit the operations to visible pixels. Our technique can be easily plugged into existing applications, and is especially useful for dynamic scenes that contain several local light sources. In our test scenarios, the overall frame rate was up 2.2 times higher than for our comparison methods.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Adabala:2003:PTT, author = "Neeharika Adabala and Nadia Magnenat-Thalmann", title = "A Procedural Thread Texture Model", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "3", pages = "33--40", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/AdabalaMagnenatThalmann03/", abstract = "We present a technique for procedurally creating the texture of the twists of thread. The procedure is designed to support variations in appearance due to tightness of twist, thickness of the bundles twisted together, and the roughness of the fibers. The procedural texture of the twist is further shaded to give it the appearance of a typical facet of thread that is visible on woven clothes. We demonstrate the utility of the texture by using it to synthesize texture of woven textiles.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Steigleder:2003:GSS, author = "Mauro Steigleder and Michael McCool", title = "Generalized Stratified Sampling Using the {Hilbert} Curve", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "3", pages = "41--47", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/SteiglederMcCool03/", abstract = "Stratified sampling is a widely used strategy to improve convergence in Monte Carlo techniques. The efficiency of a stratification technique mainly depends on the coherence of the strata. This paper presents an approach to generate an arbitrary number of coherent strata, independently of the dimensionality of the domain, using the Hilbert space-filling curve. Using this approach, it is possible to draw an arbitrary number of stratified samples from higher dimensional spaces using only one-dimensional stratification. This technique can also be used to generalize nonuniform stratified sampling. Source code is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Mech:2003:RTI, author = "Radom{\'\i}r Mech", title = "Real-Time Image-Based Rendering Using Surface Proxies and Texture Packing", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "4", pages = "1--19", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Mech03/", abstract = "In this paper, we present a technique for image-based rendering of complex objects in real-time applications. Views of the object are projected onto the object's proxy, an approximation of the object's surface. This paper describes a system that consists of a novel technique for creating a proxy using the marching cubes algorithm, an algorithm for computing view textures based on a novel technique for texture packing, and a very fast rendering algorithm that only requires blending a few textures chosen from a small number of views. This system is used in SGI's OpenGL Performer 3.1 and is available online for download.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Akenine-Moller:2003:DVS, author = "Tomas Akenine-M{\"o}ller and Ulf Assarsson", title = "On The Degree of Vertices in a Shadow Volume Silhouette", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "4", pages = "21--24", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/AkenineMollerAssarsson03/", abstract = "In shadow volume rendering, the {\em shadow volume silhouette\/} edges are used to create primitives that model the shadow volume. A common misconception is that the vertices on such silhouettes can only be connected to two silhouette edges, i.e., have degree two. Furthermore, some believe that such a vertex can have any degree. In this short note, we present a geometric proof that shows that the degree of a silhouette vertex must be even, and not necessarily two.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Dur:2003:PLP, author = "Arne D{\"u}r and Sylvia Leimgruber", title = "A Practical List-Priority Algorithm for 3{D} Polygons", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "4", pages = "25--36", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/DuerLeimgruber03/", abstract = "To determine a correct order for rendering three-dimensional polygons, the commonly used Binary Space-Partitioning (BSP) tree algorithm recursively splits polygons whenever points of the polygons lie on both sides of the spanning plane which, for large schemes, significantly increases the number of polygons. To keep the number of new polygons small, we present an alternative algorithm that splits only penetrating polygons and applies a topological sort to the resulting polygons with respect to the covering relation. Although the existence of a correct order cannot be guaranteed in general, the new algorithm PITS (polygon intersection topological sorting) has proved to be successful for many polygonal approximations of famous surfaces from geometry where it has been used to produce quality PostScript output from OpenGL.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Platis:2003:FRT, author = "Nikos Platis and Theoharis Theoharis", title = "Fast Ray-Tetrahedron Intersection Using {Pl{\"u}cker} Coordinates", journal = j-J-GRAPHICS-TOOLS, volume = "8", number = "4", pages = "37--48", year = "2003", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/PlatisTheoharis03/", abstract = "We present an algorithm for ray-tetrahedron intersection. The algorithm uses Plücker coordinates to represent the ray and the edges of the tetrahedron and employs a robust and efficient test to determine the intersection. The algorithm is highly optimized and provides a significant performance increase over related algorithms. Source code is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{McGuire:2004:OSS, author = "Morgan McGuire", title = "Observations on Silhouette Sizes", journal = j-J-GRAPHICS-TOOLS, volume = "9", number = "1", pages = "1--12", year = "2004", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/McGuire04/", abstract = "Silhouettes have many applications in computer graphics such as non-photorealistic edge rendering, fur rendering, shadow volume creation, and anti-aliasing. The number of edges, $s$, in the silhouette of a model observed from a point is therefore useful in analyzing such algorithms. \par This paper examines, from a theoretical viewpoint, a menagerie of objects with interesting silhouettes (including those with minimal and maximal silhouettes). It shows that the relationship between and $s$ and the number of triangles in a model, $f$, is bounded above by $s = O(f)$ and below by $s = \Omega(1)$, and that the expected value of $s$ over all observation points at infinity is proportional to the sum of the dihedral angles. \par In practice, the models used with silhouette-based rendering algorithms are triangle meshes that are manually constructed or result from scans of human-made objects. They consist of only surface geometry with few cracks; there is no internal detail like the engine under a car's hood. Geometric and aesthetic constraints on these models appear to create an inherent relationship between $f$ and $s$. Measurements of the actual silhouettes of real-world 3D models with polygon counts varied across six orders of magnitude show them to follow the relationship $s \sim f^{0.8}$. Furthermore, the expected value of $s$ at infinity is a good approximation of the expected silhouette size for a viewer at a finite location.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Wang:2004:SST, author = "Chung-Ming Wang and Nen-Chin Hwang", title = "A Stratified Sampling Technique for an Ellipse", journal = j-J-GRAPHICS-TOOLS, volume = "9", number = "1", pages = "13--22", year = "2004", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/WangHwang04/", abstract = "We present an efficient stratified sampling technique for an ellipse. Our technique provides extensions of previous work for sampling a disk with low distortion; it works for both polar and concentric maps between a square and an ellipse. The mapping preserves adjacency and fractional area, and does not require any numerical computation. As in the previous work, the concentric map demonstrates better performance. Our technique has proven useful in realistic image synthesis using Monte Carlo direct lighting and Monte Carlo path tracing. In conclusion, the proposed technique is stratified, efficient, and feasible for the computer graphics community. Source code is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Telea:2004:IIT, author = "Alexandru Telea", title = "An Image Inpainting Technique Based on the Fast Marching Method", journal = j-J-GRAPHICS-TOOLS, volume = "9", number = "1", pages = "23--34", year = "2004", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Telea04/", abstract = "Digital inpainting provides a means for reconstruction of small damaged portions of an image. Although the inpainting basics are straightforward, most inpainting techniques published in the literature are complex to understand and implement. We present here a new algorithm for digital inpainting based on the fast marching method for level set applications. Our algorithm is very simple to implement, fast, and produces nearly identical results to more complex, and usually slower, known methods. Source code is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Mahovsky:2004:FRA, author = "Jeffrey Mahovsky and Brian Wyvill", title = "Fast Ray-Axis Aligned Bounding Box Overlap Tests with {Pl{\"u}cker} Coordinates", journal = j-J-GRAPHICS-TOOLS, volume = "9", number = "1", pages = "35--46", year = "2004", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/MahovskyWyvill04/", abstract = "Fast ray-axis aligned bounding box overlap tests can be performed by utilizing Pl{\"u}cker coordinates. This method tests the ray against the edges comprising the silhouette of the box instead of testing against individual faces. Projection of the edges onto a two-dimensional plane to generate the silhouette is not necessary, which simplifies the technique. The method is division-free and successive calculations are independent and consist simply of dot product operations, which permits vectorization. The method does not compute an intersection distance along the ray to the box, but this can be added as an additional step. Storage of Pl{\"u}cker coordinates is unnecessary, permitting integration into existing systems. Test results show the technique's performance is up to 93\% faster than traditional methods if an intersection distance is not needed.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Schmidl:2004:CFU, author = "Harald Schmidl and Nolan Walker and Ming Lin", title = "{CAB}: Fast Update of {OBB} Trees for Collision Detection Between Articulated Bodies", journal = j-J-GRAPHICS-TOOLS, volume = "9", number = "2", pages = "1--9", year = "2004", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/SchmidlWalkerLin04/", abstract = "We present a new, fast approach for updating oriented bounding box hierarchies for articulated humanoid models, using a bottom-up approach. The algorithm approximates existing techniques by assuming a major body axis. Existence of a major axis allows merging of bounding boxes in a hierarchy approximately but with sufficient accuracy. For scenarios with close proximity, a speed-up by a factor of 2 on average is achieved compared to existing techniques.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Barbier:2004:FDC, author = "Aur{\'e}lien Barbier and Eric Galin", title = "Fast Distance Computation Between a Point and Cylinders, Cones, Line-Swept Spheres and Cone-Spheres", journal = j-J-GRAPHICS-TOOLS, volume = "9", number = "2", pages = "11--19", year = "2004", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/BarbierGalin04/", abstract = "This paper presents algorithms for computing the minimal distance between a point and a cylinder, a cone, a line-swept sphere, and a cone-sphere. Some optimizations are provided when queries are performed along a line which may be useful for voxelization applications. Source code is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Velho:2004:DAM, author = "Luiz Velho", title = "A Dynamic Adaptive Mesh Library based on Stellar Operators", journal = j-J-GRAPHICS-TOOLS, volume = "9", number = "2", pages = "21--47", year = "2004", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Velho04/", abstract = "In this paper, we present a dynamic adaptive mesh library which maintains a conforming triangulation of time-varying surfaces. The user supplies an initial mesh, a surface sampling procedure, and a set of adaptation criteria. The mesh is automatically modified in order to conform to user-defined characteristics, while the surface changes over time. The mesh representation is based on a half-edge data structure without any extra storage requirements. The mesh has an underlying semiregular multiresolution structure. Furthermore, the specification of desired mesh characteristics can be based on very general adaptation rules. This scheme facilitates the development of graphics applications that manipulate triangulated surfaces. The library source code is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Krishnaswamy:2004:IRC, author = "Aravind Krishnaswamy and Gladimir V. G. Baranoski and Jon G. Rokne", title = "Improving the Reliability\slash Cost Ratio of Goniophotometric Comparisons", journal = j-J-GRAPHICS-TOOLS, volume = "9", number = "3", pages = "1--20", year = "2004", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/BaranoskiEtAl04/", abstract = "Many scattering models have been presented in the graphics literature. Few of them, however, have been evaluated through comparisons with real measured data. As the demand for plausible and predictable scattering models increases, more attention is given to performing such comparisons. In this paper we examine the implementation of virtual goniphotometers used to obtain BRDF (bidirectional reflectance distribution function) and BTDF (bidirectional transmittance distribution function) records from algorithmic scattering models. These records can be compared to data from actual experiments in order to validate the models. Our discussion focuses on practical issues, namely the subdivision of the devices' collector sphere and the ray density required to obtain reliable BRDF and BTDF estimates. The subdivision techniques examined in this paper have been used before in publications, but the details of their computation are not readily available in the literature. Although the mathematical bound presented to determine appropriate ray densities for virtual goniphotometers is a direct generalization of a bound used for virtual spectrophotometers, it has not been published before. Our discussion of these issues is supported by practical experiments whose results are also provided in this paper.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Wang:2004:RFC, author = "Niniane Wang", title = "Realistic and Fast Cloud Rendering", journal = j-J-GRAPHICS-TOOLS, volume = "9", number = "3", pages = "21--40", year = "2004", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/Wang04/", abstract = "Clouds are an important aspect of rendering outdoor scenes. This paper describes a cloud system that extends texture splatting on particles to model a dozen cloud types (e.g., stratus, cumulus congestus, cumulonimbus), an improvement over earlier systems that modeled only one type of cumulus. We also achieve fast real-time rendering, even for scenes of dense overcast coverage, which was a limitation for previous systems. \par We present a new shading model that uses artist-driven controls rather than a programmatic approach to approximate lighting. This is suitable when fine-grained control over the look-and-feel is necessary, and artistic resources are available. We also introduce a way to simulate cloud formation and dissipation using texture splatted particles.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Ramsey:2004:RBP, author = "Shaun D. Ramsey and Kristin Potter and Charles Hansen", title = "Ray Bilinear Patch Intersections", journal = j-J-GRAPHICS-TOOLS, volume = "9", number = "3", pages = "41--47", year = "2004", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Sat Dec 04 10:50:51 2004", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.acm.org/jgt/papers/RamseyPotterHansen04/", abstract = "Ray tracing and other techniques employ algorithms which require the intersection between a 3D parametric ray and an object to be computed. The object to intersect is typically a sphere, triangle, or polygon but many surface types are possible. In this work we consider intersections between rays and the simplest parametric surface, the bilinear patch. Unlike other surfaces, solving the ray-bilinear patch intersection with simple algebraic manipulations fails. We present a complete, efficient, robust, and graceful formulation to solve ray-bilinear patch intersections quickly. Source code is available online.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Stewart:2004:ADS, author = "Ian F. Stewart and Andr{\'e} R. Foisy", title = "Arbitrary-Degree Subdivision with Creases and Attributes", journal = j-J-GRAPHICS-TOOLS, volume = "9", number = "4", pages = "3--17", year = "2004", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:22:38 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/StewartFoisy04/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Brentin:2004:MAS, author = "Greg Brentin and Greg Heflin", title = "{Maya\TM} Assets: {A} Shot Content Management System", journal = j-J-GRAPHICS-TOOLS, volume = "9", number = "4", pages = "19--31", year = "2004", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:22:38 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/BrentinHeflin04/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Yee:2004:PMP, author = "Hector Yee", title = "A Perceptual Metric for Production Testing", journal = j-J-GRAPHICS-TOOLS, volume = "9", number = "4", pages = "33--40", year = "2004", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:22:38 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/Yee04/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Piponi:2004:ADC, author = "Dan Piponi", title = "Automatic Differentiation, {C++} Templates, and Photogrammetry", journal = j-J-GRAPHICS-TOOLS, volume = "9", number = "4", pages = "41--55", year = "2004", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:22:38 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/Piponi04/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Andersen:2004:CTP, author = "Ben Andersen and Kevin Noone", title = "Controlled Texture Pushing and Crossing Seams in {UV} Space Using {Maya} and {Photorealistic Renderman}", journal = j-J-GRAPHICS-TOOLS, volume = "9", number = "4", pages = "57--67", year = "2004", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:22:38 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/AndersenNoone04/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Repenning:2005:IID, author = "Alexander Repenning", title = "Inflatable Icons: Diffusion-based Interactive Extrusion of {$2$D} Images into {$3$D} Models", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "1", pages = "1--15", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/Repenning05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Lin:2005:PTD, author = "Zhouchen Lin and Hai-Tao Chen and Heung-Yeung Shum and Jian Wang", title = "Prefiltering Two-Dimensional Polygons without Clipping", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "1", pages = "17--26", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/LinEtAl05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Lin:2005:OPF, author = "Zhouchen Lin and Hai-Tao Chen and Heung-Yeung Shum and Jian Wang", title = "Optimal Polynomial Filters", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "1", pages = "27--38", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/LinEtAl05b/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Stark:2005:GSS, author = "Michael Stark and Peter Shirley and Michael Ashikhmin", title = "Generation of Stratified Samples for {B}-Spline Pixel Filtering", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "1", pages = "39--48", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/StarkEtAl05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Williams:2005:ERR, author = "Amy Williams and Steve Barrus and R. Keith Morley and Peter Shirley", title = "An Efficient and Robust Ray-Box Intersection Algorithm", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "1", pages = "49--54", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/WilliamsEtAl05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Bethune:2005:ASG, author = "Christopher Bethune and A. James Stewart", title = "Adaptive Slice Geometry for Hardware-Assisted Volume Rendering", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "1", pages = "55--70", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/BethuneStewart05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Baerentzen:2005:HAP, author = "J. Andreas B{\ae}rentzen", title = "Hardware-Accelerated Point Generation and Rendering of Point-Based Impostors", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "2", pages = "1--12", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/Baerentzen05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Lofsted:2005:EFR, author = "Marta L{\"o}fsted and Tomas Akenine-M{\"o}ller", title = "An Evaluation Framework for Ray--Triangle Intersection Algorithms", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "2", pages = "13--26", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/LofstedtAkenineMoller05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Malsch:2005:STD, author = "Elisabeth Anna Malsch and John Jeffy Lin and Gautam Dasgupta", title = "Smooth Two-Dimensional Interpolations: {A} Recipe for All Polygons", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "2", pages = "27--39", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/MalschEtAl05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Reuter:2005:IAD, author = "Patrick Reuter and Johannes Behr and Marc Alexa", title = "An Improved Adjacency Data Structure for Fast Triangle Stripping", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "2", pages = "41--50", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/ReuterEtAl05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Barrett:2005:EPE, author = "Sean Barrett", title = "Efficient Polygon Edge Enumeration", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "2", pages = "51--53", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/Barrett05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Nijasure:2005:RTG, author = "Mangesh Nijasure and Sumanta N. Pattanaik and Vineet Goel", title = "Real-Time Global Illumination on {GPU}s", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "2", pages = "55--71", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/NijasureEtAl05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Akenine-Moller:2005:CTR, author = "Tomas Akenine-M{\"o}ller and Timo Aila", title = "Conservative and Tiled Rasterization Using a Modified Triangle Set-Up", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "3", pages = "1--8", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/AkenineMollerAila05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Heidrich:2005:CBC, author = "Wolfgang Heidrich", title = "Computing the Barycentric Coordinates of a Projected Point", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "3", pages = "9--12", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/Heidrich05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Chirkov:2005:FLS, author = "Nick Chirkov", title = "Fast {$3$D} Line Segment--Triangle Intersection Test", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "3", pages = "13--18", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/Chirkov05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Rokita:2005:DBS, author = "Przemyslaw Rokita", title = "Depth-Based Selective Antialiasing", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "3", pages = "19--26", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/Rokita05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Segura:2005:EPC, author = "R. Segura and F. R. Feito and J. Ruiz de Miras and J. C. Torres and C. Og{\'a}yar", title = "An Efficient Point Classification Algorithm for Triangle Meshes", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "3", pages = "27--35", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/SeguraEtAl05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Buss:2005:SDL, author = "Samuel R. Buss and Jin-Su Kim", title = "Selectively Damped Least Squares for Inverse Kinematics", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "3", pages = "37--49", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/BussKim05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Singh:2005:IIC, author = "Karan Singh and Cindy Grimm", title = "Implementing the {IBar} Camera Widget", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "3", pages = "51--64", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/SinghGrimm05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Toksvig:2005:MNM, author = "Michael Toksvig", title = "Mipmapping Normal Maps", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "3", pages = "65--71", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/Toksvig05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Wrotek:2005:RTC, author = "Pawel Wrotek and Alexander Rice and Morgan McGuire", title = "Real-Time Collision Deformations using Graphics Hardware", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "4", pages = "1--22", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/WrotekEtAl05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Lagae:2005:ERQ, author = "Ares Lagae and Philip Dutr{\'e}", title = "An Efficient Ray-Quadrilateral Intersection Test", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "4", pages = "23--32", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/LagaeDutre05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Dingliana:2005:VBA, author = "John Dingliana and Carol O'Sullivan", title = "A Voxel-Based Approach to Approximate Collision Handling", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "4", pages = "33--48", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/DinglianaOSullivan05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Patel:2005:SDF, author = "Mayur Patel and Noah Taylor", title = "Simple Divergence-Free Fields for Artistic Simulation", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "4", pages = "49--60", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/PatelTaylor05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Lum:2005:CHR, author = "Eric B. Lum and Kwan-Liu Ma and Nelson Max", title = "Calculating Hierarchical Radiosity Form Factors using Programmable Graphics Hardware", journal = j-J-GRAPHICS-TOOLS, volume = "10", number = "4", pages = "61--71", year = "2005", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/LumEtAl05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Lacewell:2006:SBC, author = "J. Dylan Lacewell and Dave Edwards and Peter Shirley and William B. Thompson", title = "Stochastic Billboard Clouds for Interactive Foliage Rendering", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "1", pages = "1--12", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/LacewellEtAl06/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Ben-Artzi:2006:ESS, author = "Aner Ben-Artzi and Ravi Ramamoorthi and Maneesh Agrawala", title = "Efficient Shadows from Sampled Environment Maps", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "1", pages = "13--36", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/BenArtziEtAl06/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Ma:2006:HPM, author = "YingLiang Ma and W. T. Hewitt and Martin Turner", title = "A High-Performance Method for Calculating the Minimum Distance Between Two {$2$D} and {$3$D} {NURBS} Curves", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "1", pages = "37--50", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/MaHewittTurner06/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Dur:2006:INW, author = "Arne D{\"u}r", title = "An Improved Normalization for the {Ward} Reflectance Model", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "1", pages = "51--59", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/Dur06/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Tumblin:2006:EDI, author = "Jack Tumblin", title = "Exact {$2$-D} Integration inside Quadrilateral Boundaries", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "1", pages = "61--71", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/Tumblin06/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Benthin:2006:TIR, author = "Carsten Benthin and Ingo Wald and Philipp Slusallek", title = "Techniques for Interactive Ray Tracing of {B{\'e}zier} Surfaces", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "2", pages = "1--16", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/BenthinEtAl06/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Mousa:2006:DSH, author = "M. Mousa and R. Chaine and S. Akkouche", title = "Direct Spherical Harmonic Transform of a Triangulated Mesh", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "2", pages = "17--26", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/MousaEtAl06/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Jones:2006:EGP, author = "Thouis R. Jones", title = "Efficient Generation of {Poisson}-Disk Sampling Patterns", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "2", pages = "27--36", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/Jones05/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Redon:2006:FML, author = "Stephane Redon and Ming C. Lin", title = "A Fast Method for Local Penetration Depth Computation", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "2", pages = "37--50", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/RedonLin06/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Kallay:2006:CMI, author = "Michael Kallay", title = "Computing the Moment of Inertia of a Solid Defined by a Triangle Mesh", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "2", pages = "51--57", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/Kallay06/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{deBoer:2006:SPT, author = "Willem H. de Boer", title = "Smooth Penumbra Transitions with Shadow Maps", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "2", pages = "59--71", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Wed Aug 23 07:32:12 2006", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://jgt.akpeters.com/papers/deBoer06/", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Kontkanen:2006:SPV, author = "Janne Kontkanen and Samuli Laine", title = "Sampling Precomputed Volumetric Lighting", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "3", pages = "1--16", month = "????", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=11&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=11&issue=3&spage=1", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Li:2006:BGA, author = "Zhong Li and Lizhuang Ma", title = "A Bidirectional Generating Algorithm for Rational Parametric Curves", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "3", pages = "17--26", month = "????", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=11&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=11&issue=3&spage=17", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Zuniga:2006:RQW, author = "Miguel R. Zuniga and Jeffrey K. Uhlmann", title = "Ray Queries with Wide Object Isolation and the {DE}-Tree", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "3", pages = "27--45", month = "????", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=11&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=11&issue=3&spage=27", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Sanderson:2006:ARD, author = "Allen R. Sanderson and Robert M. Kirby and Chris R. Johnson and Lingfa Yang", title = "Advanced Reaction-Diffusion Models for Texture Synthesis", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "3", pages = "47--71", month = "????", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=11&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=11&issue=3&spage=47", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Bernardon:2006:GBT, author = "F{\'a}bio F. Bernardon and Christian A. Pagot and Jo{\~a}o L. D. Comba and Cl{\'a}udio T. Silva", title = "{GPU}-Based Tiled Ray Casting Using Depth Peeling", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "4", pages = "1--16", month = "????", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=11&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=11&issue=4&spage=1", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Liu:2006:HRI, author = "Peiran Liu and Nicolas D. Georganas and Gerhard Roth", title = "Handling Rapid Interference Detection of Progressive Meshes Using Active Bounding Trees", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "4", pages = "17--37", month = "????", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=11&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=11&issue=4&spage=17", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Fischer:2006:FAH, author = "Ian Fischer and Craig Gotsman", title = "Fast Approximation of High-Order {Voronoi} Diagrams and Distance Transforms on the {GPU}", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "4", pages = "39--60", month = "????", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=11&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=11&issue=4&spage=39", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Cline:2006:LBV, author = "David Cline and Kevin Steele and Parris Egbert", title = "Lightweight Bounding Volumes for Ray Tracing", journal = j-J-GRAPHICS-TOOLS, volume = "11", number = "4", pages = "61--71", month = "????", year = "2006", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=11&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=11&issue=4&spage=61", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Larsson:2007:FSB, author = "Thomas Larsson and Tomas Akenine-M{\"o}ller and Eric Lengyel", title = "On Faster Sphere-Box Overlap Testing", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "1", pages = "3--8", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=1&spage=3", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Stephenson:2007:IMB, author = "Ian Stephenson", title = "Improving Motion Blur: Shutter Efficiency and Temporal Sampling", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "1", pages = "9--15", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=1&spage=9", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Friedel:2007:USP, author = "Ilja Friedel and Peter Schr{\"o}der and Mathieu Desbrun", title = "Unconstrained Spherical Parameterization", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "1", pages = "17--26", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=1&spage=17", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Marinov:2007:GBM, author = "Martin Marinov and Mario Botsch and Leif Kobbelt", title = "{GPU}-Based Multiresolution Deformation using Approximate Normal Field Reconstruction", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "1", pages = "27--46", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=1&spage=27", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Arvo:2007:AFS, author = "Jukka Arvo", title = "Alias-Free Shadow Maps using Graphics Hardware", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "1", pages = "47--59", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=1&spage=47", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Passalis:2007:GVA, author = "Georgios Passalis and Theoharis Theoharis and George Toderici and Ioannis A. Kakadiaris", title = "General Voxelization Algorithm with Scalable {GPU} Implementation", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "1", pages = "61--71", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=1&spage=61", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Arvo:2007:SSC, author = "James Arvo and Kevin Novins", title = "Stratified Sampling of Convex Quadrilaterals", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "2", pages = "1--12", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=2&spage=1", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Bradley:2007:ATU, author = "Derek Bradley and Gerhard Roth", title = "Adaptive Thresholding using the Integral Image", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "2", pages = "13--21", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=2&spage=13", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Lengyel:2007:UDF, author = "Eric Lengyel", title = "Unified Distance Formulas for Halfspace Fog", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "2", pages = "23--32", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=2&spage=23", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Max:2007:HPC, author = "Nelson Max", title = "Hexahedron Projection for Curvilinear Grids", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "2", pages = "33--45", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=2&spage=33", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Karasuda:2007:DRT, author = "Eric Karasuda and Sara McMains", title = "Displaying Readable Text in a Head-Tracked, Stereoscopic Virtual Environment", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "2", pages = "47--57", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=2&spage=47", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Malmer:2007:FPA, author = "Mattias Malmer and Fredrik Malmer and Ulf Assarsson and Nicolas Holzschuch", title = "Fast Precomputed Ambient Occlusion for Proximity Shadows", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "2", pages = "59--71", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=2&spage=59", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Li:2007:IIA, author = "Xin Li", title = "{iSlerp}: An Incremental Approach to {Slerp}", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "3", pages = "1--6", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=3&spage=1", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Lacewell:2007:EEC, author = "Dylan Lacewell and Brent Burley", title = "Exact Evaluation of {Catmull--Clark} Subdivision Surfaces Near {B}-Spline Boundaries", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "3", pages = "7--15", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=3&spage=7", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Risser:2007:FRM, author = "Eric Risser and Musawir Shah and Sumanta Pattanaik", title = "Faster Relief Mapping using the Secant Method", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "3", pages = "17--24", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=3&spage=17", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{McDonnell:2007:PFP, author = "Kevin T. McDonnell and Hong Qin", title = "{PB-FFD}: {A} Point-Based Technique for Free-Form Deformation", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "3", pages = "25--41", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=3&spage=25", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Mikkelsen:2007:SPP, author = "Morten S. Mikkelsen", title = "Separating-Plane Perspective Shadow Mapping", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "3", pages = "43--54", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=3&spage=43", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Sussner:2007:BAS, author = "Gerd Su{\ss}ner and Marc Stamminger and G{\"u}nther Greiner", title = "Bidirectional Adaptive $\sqrt{3}$-Subdivision", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "4", pages = "1--24", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=4&spage=1", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Grimm:2007:CCM, author = "Cindy M. Grimm and Bill Niebruegge", title = "Continuous Cube Mapping", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "4", pages = "25--34", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=4&spage=25", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Eisemann:2007:FRA, author = "Martin Eisemann and Marcus Magnor and Thorsten Grosch and Stefan M{\"u}ller", title = "Fast Ray\slash Axis-Aligned Bounding Box Overlap Tests using Ray Slopes", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "4", pages = "35--46", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=4&spage=35", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Parus:2007:FCV, author = "Jindrich Parus and Ivana Kolingerov{\'a} and Anders Hast", title = "Fast Computation of Vertex Normals for Linearly Deforming Meshes", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "4", pages = "47--58", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=4&spage=47", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Hasselgren:2007:TSV, author = "Jon Hasselgren and Tomas Akenine-M{\"o}ller", title = "Textured Shadow Volumes", journal = j-J-GRAPHICS-TOOLS, volume = "12", number = "4", pages = "59--72", month = "????", year = "2007", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=12&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=12&issue=4&spage=59", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Wyman:2008:RNI, author = "Chris Wyman and Carsten Dachsbacher", title = "Reducing Noise in Image-Space Caustics with Variable-Sized Splatting", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "1", pages = "1--17", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=1&spage=1", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Bavoil:2008:RSS, author = "Louis Bavoil and Steven P. Callahan and Cl{\'a}udio T. Silva", title = "Robust Soft Shadow Mapping with Backprojection and Depth Peeling", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "1", pages = "19--30", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=1&spage=19", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Larsson:2008:EEO, author = "Thomas Larsson", title = "An Efficient Ellipsoid-{OBB} Intersection Test", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "1", pages = "31--43", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=1&spage=31", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{DeCoro:2008:SSF, author = "Christopher DeCoro and Szymon Rusinkiewicz", title = "Subtractive Shadows: {A} Flexible Framework for Shadow Level of Detail", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "1", pages = "45--56", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=1&spage=45", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Hutchinson:2008:PCT, author = "Elena Jakubiak Hutchinson and Sarah Frisken and Ronald Perry", title = "Proximity Cluster Trees", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "1", pages = "57--69", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=1&spage=57", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Hausner:2008:VDH, author = "Alejo Hausner", title = "Versatile Decorative Halftoning", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "2", pages = "1--12", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=2&spage=1", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Faust:2008:ECG, author = "Martin Faust", title = "Enhanced Color-to-Gray Conversion", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "2", pages = "13--19", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=2&spage=13", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Vidal:2008:SES, author = "Vincent Vidal and Xing Mei and Philippe Decaudin", title = "Simple Empty-Space Removal for Interactive Volume Rendering", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "2", pages = "21--36", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=2&spage=21", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Frisken:2008:ECF, author = "Sarah F. Frisken", title = "Efficient Curve Fitting", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "2", pages = "37--54", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=2&spage=37", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Wang:2008:LCM, author = "Wencheng Wang and Chunjuan Sun and Jing Li and Enhua Wu", title = "Line Clipping by Managing Polygon Edges in Convex Polylines", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "2", pages = "55--71", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=2&spage=55", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Kim:2008:SVA, author = "Byungmoon Kim and Kihwan Kim and Greg Turk", title = "A Shadow-Volume Algorithm for Opaque and Transparent Nonmanifold Casters", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "3", pages = "1--14", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=3&spage=1", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Silva:2008:NNB, author = "Frutuoso G. M. Silva and Abel J. P. Gomes", title = "A Nonoriented, Nonmanifold Boundary Representation for Geometric Applications", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "3", pages = "15--33", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=3&spage=15", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Brodu:2008:QSI, author = "Nicolas Brodu", title = "Query Sphere Indexing for Neighborhood Requests", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "3", pages = "35--51", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=3&spage=35", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Clarberg:2008:FEA, author = "Petrik Clarberg", title = "Fast Equal-Area Mapping of the (Hemi)Sphere using {SIMD}", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "3", pages = "53--68", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=3&spage=53", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{McGuire:2008:EHQ, author = "Morgan McGuire", title = "Efficient, High-Quality {Bayer} Demosaic Filtering on {GPUs}", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "4", pages = "1--16", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=4&spage=1", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Rousseau:2008:GR, author = "Pierre Rousseau and Vincent Jolivet and Djamchid Ghazanfarpour", title = "{GPU} Rainfall", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "4", pages = "17--33", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=4&spage=17", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Ebner:2008:GCC, author = "Marc Ebner", title = "{GPU} Color Constancy", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "4", pages = "35--51", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=4&spage=35", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Bai:2008:CCM, author = "Linge Bai and David Breen", title = "Calculating Center of Mass in an Unbounded {$2$D} Environment", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "4", pages = "53--60", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=4&spage=53", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Ruijters:2008:EGB, author = "Daniel Ruijters and Bart M. ter Haar Romeny and Paul Suetens", title = "Efficient {GPU}-Based Texture Interpolation using Uniform {B}-Splines", journal = j-J-GRAPHICS-TOOLS, volume = "13", number = "4", pages = "61--69", month = "????", year = "2008", CODEN = "JGTOFD", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=13&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=13&issue=4&spage=61", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } %%% ==================================================================== %%% Journal renamed, but volumes increase without a break. @Article{Callahan:2009:AUV, author = "Steven P. Callahan and Cl{\'a}udio T. Silva", title = "Accelerating Unstructured Volume Rendering with Joint Bilateral Upsampling", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "1", pages = "1--15", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=1&spage=1", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Igarashi:2009:IRP, author = "Takeo Igarashi and Yuki Igarashi", title = "Implementing As-Rigid-As-Possible Shape Manipulation and Surface Flattening", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "1", pages = "17--30", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=1&spage=17", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Bayraktar:2009:GBN, author = "Serkan Bayraktar and U{\u{g}}ur G{\"u}d{\"u}kbay and B{\"u}lent {\"O}zg{\"u}{\c{c}}", title = "{GPU}-Based Neighbor-Search Algorithm for Particle Simulations", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "1", pages = "31--42", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=1&spage=31", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Mantiuk:2009:VHD, author = "Rafal Mantiuk and Wolfgang Heidrich", title = "Visualizing High Dynamic Range Images in a {Web} Browser", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "1", pages = "43--53", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=1&spage=43", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Stark:2009:ECP, author = "Michael M. Stark", title = "Efficient Construction of Perpendicular Vectors without Branching", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "1", pages = "55--62", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=1&spage=55", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Piponi:2009:TTP, author = "Dan Piponi", title = "Two Tricks for the Price of One: Linear Filters and Their Transposes", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "1", pages = "63--72", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=1; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=1&spage=63", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Stark:2009:FSC, author = "Michael M. Stark", title = "Fast and Stable Conformal Mapping Between a Disc and a Square", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "2", pages = "1--23", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=2&spage=1", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Dammertz:2009:PSL, author = "Holger Dammertz and Johannes Hanika", title = "Plane Sampling for Light Paths from the Environment Map", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "2", pages = "25--31", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=2&spage=25", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Sadeghi:2009:CPT, author = "Iman Sadeghi and Bin Chen and Henrik Wann Jensen", title = "Coherent Path Tracing", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "2", pages = "33--43", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=2&spage=33", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Pouchol:2009:HHS, author = "Mickael Pouchol and Alexandre Ahmad and Benoit Crespin and Olivier Terraz", title = "A Hierarchical Hashing Scheme for Nearest Neighbor Search and Broad-Phase Collision Detection", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "2", pages = "45--59", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=2&spage=45", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Augsdorfer:2009:RPR, author = "Ursula H. Augsd{\"o}rfer and Neil A. Dodgson and Malcolm A. Sabin", title = "Removing Polar Rendering Artifacts in Subdivision Surfaces", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "2", pages = "61--76", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=2; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=2&spage=61", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Cords:2009:ISS, author = "Hilko Cords and Oliver G. Staadt", title = "Interactive Screen-Space Surface Rendering of Dynamic Particle Clouds", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "3", pages = "1--19", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=3&spage=1", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Forest:2009:RTH, author = "Vincent Forest and Loic Barthe and Mathias Paulin", title = "Real-Time Hierarchical Binary-Scene Voxelization", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "3", pages = "21--34", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=3&spage=21", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Schoning:2009:BIM, author = "Johannes Sch{\"o}ning and Jonathan Hook and Nima Motamedi and Patrick Olivier and Florian Echtler and Peter Brandl and Laurence Muller and Florian Daiber and Otmar Hilliges and Markus Loechtefeld and Tim Roth and Dominik Schmidt and Ulrich von Zadow", title = "Building Interactive Multi-Touch Surfaces", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "3", pages = "35--55", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=3&spage=35", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Starck:2009:FVV, author = "J. Starck and J. Kilner and A. Hilton", title = "A Free-Viewpoint Video Renderer", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "3", pages = "57--72", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=3; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=3&spage=57", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{vanWelbergen:2009:RTA, author = "Herwin van Welbergen and Job Zwiers and Zs{\'o}fia M. Ruttkay", title = "Real-Time Animation Using a Mix of Physical Simulation and Kinematics", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "4", pages = "1--21", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=4&spage=1", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{McGuire:2009:ILS, author = "Morgan McGuire", title = "An Inexpensive Light Stage Dome", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "4", pages = "23--29", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=4&spage=23", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Heinly:2009:IRT, author = "Jared Heinly and Shawn Recker and Kevin Bensema and Jesse Porch and Christiaan Gribble", title = "Integer Ray Tracing", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "4", pages = "31--56", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=4&spage=31", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Strugar:2009:CDD, author = "Filip Strugar", title = "Continuous Distance-Dependent Level of Detail for Rendering Heightmaps", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "14", number = "4", pages = "57--74", month = "????", year = "2009", CODEN = "????", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 7 09:40:29 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=2151-237X&volume=14&issue=4; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=2151-237X&volume=14&issue=4&spage=57", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Boulanger:2010:HFS, author = "Kevin Boulanger and Kadi Bouatouch and Sumanta Pattanaik", title = "High-Frequency Shadows for Real-Time Rendering of Trees", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "1", pages = "1--12", year = "2010", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2010.10390648", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 6 22:25:15 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "11 Feb 2011", } @Article{Brunton:2010:SHT, author = "Alan Brunton and Jochen Lang and Eric Dubois", title = "Spherical Harmonic Transforms and Convolutions on the {GPU}", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "1", pages = "13--27", year = "2010", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2010.10390649", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 6 22:25:15 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "11 Feb 2011", } @Article{Ascencio-Lopez:2010:AIS, author = "Ignacio Ascencio-Lopez and Oscar Meruvia-Pastor and Hugo Hidalgo-Silva", title = "Adaptive Incremental Stippling using the {Poisson}-Disk Distribution", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "1", pages = "29--47", year = "2010", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2010.10390650", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 6 22:25:15 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "11 Feb 2011", } @Article{Mikkelsen:2010:BMU, author = "Morten S. Mikkelsen", title = "Bump Mapping Unparametrized Surfaces on the {GPU}", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "1", pages = "49--61", year = "2010", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2010.10390651", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 6 22:25:15 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "11 Feb 2011", } @Article{Sherman:2010:TPT, author = "Glen Aldridge Sherman", title = "A Triangle Product for Texture Stretch", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "1", pages = "63--72", year = "2010", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2010.10390652", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 6 22:25:15 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "11 Feb 2011", } @Article{Ahmed:2011:PPQ, author = "Abdalla G. M. Ahmed", title = "Pixel Patterns from Quantization Artifacts of Forward Affine Mapping", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "2", pages = "73--94", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.563670", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 6 22:25:15 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "11 May 2011", } @Article{Glassner:2011:RCE, author = "Andrew Glassner", title = "Reconciling Circular and Elliptical Arcs", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "2", pages = "95--98", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.563679", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 6 22:25:15 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "11 May 2011", } @Article{Lengyel:2011:TCD, author = "Eric Lengyel", title = "Transition Cells for Dynamic Multiresolution Marching Cubes", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "2", pages = "99--122", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.563682", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 6 22:25:15 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "11 May 2011", } @Article{Munkberg:2011:BCM, author = "Jacob Munkberg and Tomas Akenine-M{\"o}ller", title = "Backface Culling for Motion Blur and Depth of Field", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "2", pages = "123--139", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.563695", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Tue Sep 6 22:25:15 MDT 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "11 May 2011", } @Article{Ernst:2011:RTS, author = "Manfred Ernst and Sven Woop", title = "Ray Tracing with Shared-Plane Bounding Volume Hierarchies", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "3", pages = "141--151", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.563675", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Wed Dec 14 10:31:39 MST 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "21 Oct 2011", } @Article{Schlomer:2011:ASA, author = "Thomas Schl{\"o}mer and Oliver Deussen", title = "Accurate Spectral Analysis of Two-Dimensional Point Sets", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "3", pages = "152--160", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.609773", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Wed Dec 14 10:31:39 MST 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "21 Oct 2011", } @Article{Eberly:2011:FAA, author = "David Eberly", title = "A Fast and Accurate Algorithm for Computing {SLERP}", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "3", pages = "161--176", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.610255", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Wed Dec 14 10:31:39 MST 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "21 Oct 2011", } @Article{Jones:2011:LTP, author = "Thouis R. Jones and David R. Karger", title = "Linear-Time {Poisson}-Disk Patterns", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "3", pages = "177--182", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.617173", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Wed Dec 14 10:31:39 MST 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "21 Oct 2011", } @Article{Pegoraro:2011:ECV, author = "Vincent Pegoraro and Philipp Slusallek", title = "On the Evaluation of the Complex-Valued Exponential Integral", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "3", pages = "183--198", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.617177", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Wed Dec 14 10:31:39 MST 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/elefunt.bib; http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", abstract = "Although its applications span a broad scope of scientific fields ranging from applied physics to computer graphics, the exponential integral is a nonelementary special function available in specialized software packages but not in standard libraries, consequently requiring custom implementations on most platforms. In this paper, we provide a concise and comprehensive description of how to evaluate the complex-valued exponential integral. We first introduce some theoretical background on the main characteristics of the function, and outline available third-party proprietary implementations. We then provide an analysis of the various known representations of the function and present an effective algorithm allowing the computation of results within a desired accuracy, together with the corresponding pseudocode in order to facilitate portability onto various systems. An application to the calculation of the closed-form solution to single light scattering in homogeneous participating media illustrates the practical benefits of the provided implementation with the hope that, in the long term, the latter will contribute to standardizing the availability of the complex-valued exponential integral on graphics platforms.", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "21 Oct 2011", } @Article{Shirley:2011:SAM, author = "Peter Shirley and Austin Robison and R. Keith Morley", title = "A Simple Algorithm for Managing Color in Global Tone Reproduction", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "3", pages = "199--205", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.610677", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Wed Dec 14 10:31:39 MST 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "21 Oct 2011", } @Article{McGuire:2011:E, author = "Morgan McGuire", title = "Editorial", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "4", pages = "207--209", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.632611", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Wed Dec 14 10:34:32 MST 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "8 Nov 2011", } @Article{Cowan:2011:GBM, author = "Brent Cowan and Bill Kapralos", title = "A {GPU}-Based Method to Approximate Acoustical Reflectivity", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "4", pages = "210--215", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.619888", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Wed Dec 14 10:34:32 MST 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "8 Nov 2011", } @Article{McGuire:2011:ETQ, author = "Morgan McGuire", title = "Efficient Triangle and Quadrilateral Clipping Within Shaders", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "4", pages = "216--224", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.619891", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Wed Dec 14 10:34:32 MST 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "8 Nov 2011", } @Article{Thomsen:2011:ARU, author = "Andreas Thomsen and Kasper H{\o}y Nielsen", title = "Approximate Radiosity Using Stochastic Depth Buffering", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "4", pages = "225--234", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.621759", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Wed Dec 14 10:34:32 MST 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "8 Nov 2011", } @Article{Olsson:2011:TS, author = "Ola Olsson and Ulf Assarsson", title = "Tiled Shading", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "4", pages = "235--251", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.621761", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Wed Dec 14 10:34:32 MST 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "8 Nov 2011", } @Article{Sloan:2011:WS, author = "Peter-Pike Sloan and Derek Nowrouzezahrai and Hong Yuan", title = "Wrap Shading", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "4", pages = "252--259", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.628841", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Wed Dec 14 10:34:32 MST 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "8 Nov 2011", } @Article{Anonymous:2011:EBE, author = "Anonymous", title = "Editorial Board {EOV}", journal = j-J-GRAPHICS-GPU-GAME-TOOLS, volume = "15", number = "4", pages = "ebi--??", year = "2011", CODEN = "????", DOI = "https://doi.org/10.1080/2151237X.2011.628840", ISSN = "2151-2272 (print), 2151-237X (electronic)", ISSN-L = "2151-2272", bibdate = "Wed Dec 14 10:34:32 MST 2011", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "8 Nov 2011", } %%% ==================================================================== %%% Journal renamed to its original name at volume 16 2012: @Article{Yuan:2012:IR, author = "Hong Yuan and Derek Nowrouzezahrai and Peter-Pike Sloan", title = "Irradiance Rigs", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "1", pages = "1--11", year = "2012", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2151237X.2012.631448", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Fri Apr 6 18:03:25 MDT 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "6 Mar 2012", } @Article{Ray:2012:AAL, author = "Bimal Kumar Ray", title = "An Alternative Algorithm for Line Clipping", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "1", pages = "12--24", year = "2012", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2151237X.2012.641824", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Fri Apr 6 18:03:25 MDT 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "6 Mar 2012", } @Article{Vo:2012:SEM, author = "Huy T. Vo and Claudio T. Silva and Luiz F. Scheidegger and Valerio Pascucci", title = "Simple and Efficient Mesh Layout with Space-Filling Curves", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "1", pages = "25--39", year = "2012", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2151237X.2012.641828", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Fri Apr 6 18:03:25 MDT 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "6 Mar 2012", } @Article{Upchurch:2012:TPP, author = "Paul Upchurch and Mathieu Desbrun", title = "Tightening the Precision of Perspective Rendering", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "1", pages = "40--56", year = "2012", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2151237X.2012.649987", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Fri Apr 6 18:03:25 MDT 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "6 Mar 2012", } @Article{LeBlanc:2012:MBF, author = "Graham LeBlanc and Andrew Shouldice and Dirk V. Arnold and Stephen Brooks", title = "Multi-Band {Fourier} Synthesis of Ocean Waves", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "2", pages = "57--70", year = "2012", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2012.680854", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Nov 8 18:11:44 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "04 Jun 2012", } @Article{Iwanicki:2012:NML, author = "Michal Iwanicki and Peter-Pike Sloan", title = "Normal Mapping with Low-Frequency Precomputed Visibility", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "2", pages = "71--84", year = "2012", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2012.676341", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Nov 8 18:11:44 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "04 Jun 2012", } @Article{McEwan:2012:ECN, author = "Ian McEwan and David Sheets and Mark Richardson and Stefan Gustavson", title = "Efficient Computational Noise in {GLSL}", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "2", pages = "85--94", year = "2012", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2151237X.2012.649621", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Nov 8 18:11:44 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "04 Jun 2012", } @Article{Schretter:2012:GRS, author = "Colas Schretter and Leif Kobbelt and Paul-Olivier Dehaye", title = "Golden Ratio Sequences for Low-Discrepancy Sampling", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "2", pages = "95--104", year = "2012", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2012.679555", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Nov 8 18:11:44 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "04 Jun 2012", } @Article{Pfeifle:2012:RCC, author = "Ron Pfeifle", title = "Rendering Cubic Curves on a {GPU} with {Floater}'s Implicitization", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "2", pages = "105--122", year = "2012", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2151237X.2012.653284", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Nov 8 18:11:44 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "04 Jun 2012", } @Article{Nunes:2012:RTD, author = "Gustavo Nunes and Alexandre Valdetaro and Alberto Raposo and Bruno Feij{\'o} and Rodrigo de Toledo", title = "Rendering Tubes from Discrete Curves Using Hardware Tessellation", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "3", pages = "123--143", year = "2012", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2012.659610", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Nov 8 18:11:45 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "02 Aug 2012", } @Article{Tarini:2012:CTP, author = "Marco Tarini", title = "Cylindrical and Toroidal Parameterizations Without Vertex Seams", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "3", pages = "144--150", year = "2012", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2151237X.2012.654054", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Nov 8 18:11:45 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "02 Aug 2012", } @Article{Frisvad:2012:BOB, author = "Jeppe Revall Frisvad", title = "Building an Orthonormal Basis from a {$3$D} Unit Vector Without Normalization", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "3", pages = "151--159", year = "2012", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2012.689606", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Nov 8 18:11:45 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "02 Aug 2012", } @Article{Anjyo:2012:PAD, author = "Ken Anjyo and Hideki Todo and J. P. Lewis", title = "A Practical Approach to Direct Manipulation Blendshapes", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "3", pages = "160--176", year = "2012", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2012.689747", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Thu Nov 8 18:11:45 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", onlinedate = "02 Aug 2012", } @Article{Kenwright:2012:IKC, author = "Ben Kenwright", title = "Inverse Kinematics --- Cyclic Coordinate Descent {(CCD)}", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "4", pages = "177--217", year = "2012", DOI = "https://doi.org/10.1080/2165347X.2013.823362", bibdate = "Thu Mar 6 06:15:16 MST 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Champagnat:2012:ECB, author = "Fr{\'e}d{\'e}ric Champagnat and Yves {Le Sant}", title = "Efficient Cubic {B}-spline Image Interpolation on a {GPU}", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "4", pages = "218--232", year = "2012", DOI = "https://doi.org/10.1080/2165347X.2013.824736", bibdate = "Thu Mar 6 06:15:16 MST 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", note = "See erratum \cite{Anonymous:2013:EEC}.", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Seo:2012:LST, author = "Jaewoo Seo and Ken Anjyo", title = "Line Selection Tool for {$3$D} Artists", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "4", pages = "233--244", year = "2012", DOI = "https://doi.org/10.1080/2165347X.2013.823780", bibdate = "Thu Mar 6 06:15:16 MST 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Anonymous:2012:EBE, author = "Anonymous", title = "Editorial Board {EOV}", journal = j-J-GRAPHICS-TOOLS, volume = "16", number = "4", pages = "ebi--ebi", year = "2012", DOI = "https://doi.org/10.1080/2165347X.2013.859494", bibdate = "Thu Mar 6 06:15:16 MST 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Jacobson:2013:BMG, author = "Alec Jacobson", title = "Bijective Mappings with Generalized Barycentric Coordinates: A Counterexample", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "1--2", pages = "1--4", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2013.842511", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 9 17:24:56 MDT 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Manoharan:2013:ICD, author = "Prabukumar Manoharan and Bimal Kumar Ray", title = "An Improved Circle Drawing Algorithm on a Hexagonal Grid", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "1--2", pages = "5--15", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2013.865004", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 9 17:24:56 MDT 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Frogley:2013:FRD, author = "D. Frogley and M. D. Jones", title = "Fast Relabeling of Deformable {Delaunay} Tetrahedral Meshes Using a Compact Uniform Grid", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "1--2", pages = "17--29", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2013.870057", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 9 17:24:56 MDT 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Mousas:2013:MEE, author = "Christos Mousas and Paul Newbury and Christos-Nikolaos Anagnostopoulos", title = "The Minimum Energy Expenditure Shortest Path Method", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "1--2", pages = "31--44", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2013.872586", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 9 17:24:56 MDT 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Pobegailo:2013:CSC, author = "Alexander P. Pobegailo", title = "Construction of Small Circular Arcs on a Sphere of Unit Quaternions", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "1--2", pages = "45--51", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2013.878262", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 9 17:24:56 MDT 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Anonymous:2013:EEC, author = "Anonymous", title = "Erratum: {``Efficient Cubic B-spline Image Interpolation on a GPU'', by Fr{\'e}d{\'e}ric Champagnat and Yves Le Sant, J. Graph. Tools 14(4) 218--232 (2012)}", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "1--2", pages = "53--53", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2013.887941", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 9 17:24:56 MDT 2014", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", note = "See \cite{Champagnat:2012:ECB}.", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Obaid:2013:MES, author = "Mohammad Obaid and Erik Sintorn and Daniel Sj{\"o}lie and Morten Fjeld", title = "Message from the {Editors}: {SIGRAD 2014} Special Issue of the {{\em Journal of Graphics Tools\/}}", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "3", pages = "55--58", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2015.1043848", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 15 07:27:53 MDT 2015", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.tandfonline.com/doi/abs/10.1080/2165347X.2015.1043848", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Fratarcangeli:2013:GBI, author = "Marco Fratarcangeli and Fabio Pellacini", title = "A {GPU}-Based Implementation of Position Based Dynamics for Interactive Deformable Bodies", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "3", pages = "59--66", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2015.1030525", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 15 07:27:53 MDT 2015", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.tandfonline.com/doi/abs/10.1080/2165347X.2015.1030525", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Kallberg:2013:FAM, author = "Linus K{\"a}llberg and Thomas Larsson", title = "Faster Approximation of Minimum Enclosing Balls by Distance Filtering and {GPU} Parallelization", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "3", pages = "67--84", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2015.1037471", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 15 07:27:53 MDT 2015", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.tandfonline.com/doi/abs/10.1080/2165347X.2015.1037471", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Marreiros:2013:SMM, author = "Filipe M. M. Marreiros and {\"O}rjan Smedby", title = "Single-Monitor-Mirror Stereoscopic Display", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "3", pages = "85--97", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2015.1028690", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 15 07:27:53 MDT 2015", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.tandfonline.com/doi/abs/10.1080/2165347X.2015.1028690", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Dupre:2013:PPS, author = "R. Dupre and V. Argyriou and D. Greenhill", title = "Prediction of Physics Simulation using Dimensionality Reduction and Regression", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "3", pages = "99--110", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2015.1034813", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 15 07:27:53 MDT 2015", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.tandfonline.com/doi/abs/10.1080/2165347X.2015.1034813", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Banterle:2013:E, author = "Francesco Banterle", title = "Editorial", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "4", pages = "111--111", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2015.1046323", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 15 07:27:54 MDT 2015", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.tandfonline.com/doi/abs/10.1080/2165347X.2015.1046323", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Asuni:2013:TLD, author = "Nicola Asuni and Andrea Giachetti", title = "{TESTIMAGES}: A Large Data Archive For Display and Algorithm Testing", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "4", pages = "113--125", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2015.1024298", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 15 07:27:54 MDT 2015", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.tandfonline.com/doi/abs/10.1080/2165347X.2015.1024298", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Keinert:2013:IRC, author = "Benjamin Keinert and Henry Sch{\"a}fer and Johann Kornd{\"o}rfer and Urs Ganse and Marc Stamminger", title = "Improved Ray Casting of Procedural Distance Bounds", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "4", pages = "127--138", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2015.1033069", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 15 07:27:54 MDT 2015", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.tandfonline.com/doi/abs/10.1080/2165347X.2015.1033069", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Ivo:2013:ASB, author = "Rafael Ivo and Fabio Ganovelli and Creto Vidal and Joaquim Bento Cavalcante-Neto and Roberto Scopigno", title = "Adapting Splat-based Models to Curved Sharp Features", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "4", pages = "139--150", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2015.1034331", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 15 07:27:54 MDT 2015", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.tandfonline.com/doi/abs/10.1080/2165347X.2015.1034331", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Schmidt:2013:TIB, author = "Michael R. Schmidt", title = "Toward Improved Batchability of {$3$D} Objects Using a Consolidated Shader", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "4", pages = "151--158", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2014.909340", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 15 07:27:54 MDT 2015", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.tandfonline.com/doi/abs/10.1080/2165347X.2014.909340", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Schulz:2013:CAT, author = "Adriana Schulz and Wojciech Matusik and Luiz Velho", title = "{ChoreoGraphics}: An Authoring Tool for Dance Shows", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "4", pages = "159--176", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2014.909341", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 15 07:27:54 MDT 2015", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.tandfonline.com/doi/abs/10.1080/2165347X.2014.909341", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", } @Article{Anonymous:2013:EEB, author = "Anonymous", title = "{EOV} Editorial Board", journal = j-J-GRAPHICS-TOOLS, volume = "17", number = "4", pages = "ebi--ebi", year = "2013", CODEN = "JGTOFD", DOI = "https://doi.org/10.1080/2165347X.2013.1064679", ISSN = "1086-7651", ISSN-L = "1086-7651", bibdate = "Tue Sep 15 07:27:54 MDT 2015", bibsource = "http://www.math.utah.edu/pub/tex/bib/jgraphtools.bib", URL = "http://www.tandfonline.com/doi/abs/10.1080/2165347X.2013.1064679", acknowledgement = ack-nhfb, fjournal = "Journal of Graphics Tools: JGT", journal-URL = "http://www.tandfonline.com/loi/ujgt20", }