Entry Frisken:2002:SET 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{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",
}

Related entries