Entry Mirtich:1996:FAC 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{Mirtich:1996:FAC,
  author =       "Brian Mirtich",
  title =        "Fast and accurate computation of polyhedral mass
                 properties",
  journal =      j-J-GRAPHICS-TOOLS,
  volume =       "1",
  number =       "2",
  pages =        "31--50",
  year =         "1996",
  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/Mirtich96/;
                 http://www.cs.berkeley.edu/~mirtich/massProps.html",
  abstract =     "The location of a body's center of mass, and its
                 moments and products of inertia about various axes are
                 important physical quantities needed for any type of
                 dynamic simulation or physically based modeling. We
                 present an algorithm for automatically computing these
                 quantities for a general class of rigid bodies: those
                 composed of uniform density polyhedra. The mass
                 integrals may be converted into volume integrals under
                 these assumptions, and the bulk of the paper is devoted
                 to the computation of these volume integrals. Our
                 algorithm is based on a three step reduction of the
                 volume integrals to successively simpler integrals. The
                 algorithm is designed to minimize the numerical errors
                 that can result from poorly conditioned alignment of
                 polyhedral faces. It is also designed for efficiency.
                 All required volume integrals of a polyhedron are
                 computed together during a single walk over the
                 boundary of the polyhedron; exploiting common
                 subexpressions reduces floating point operations. We
                 present numerical results detailing the speed and
                 accuracy of the algorithm, and also give a complete low
                 level pseudocode description.",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.tandfonline.com/loi/ujgt20",
}

Related entries