Entry Dinerstein:2001:LGM 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{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",
}

Related entries