Entry Kim:2002:CPQ 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{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",
}

Related entries