Entry Assarsson:2000:OVF 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{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",
}

Related entries