Entry Slater:2002:CTQ from jgraphtools.bib

Last update: Sun Oct 15 02:29:44 MDT 2017                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@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",
}

Related entries