Entry Sunday:2002:FPA 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{Sunday:2002:FPA,
  author =       "Daniel Sunday",
  title =        "Fast Polygon Area and {Newell} Normal Computation",
  journal =      j-J-GRAPHICS-TOOLS,
  volume =       "7",
  number =       "2",
  pages =        "9--13 (??)",
  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/Sunday02/",
  abstract =     "The textbook formula for the area of an $n$-vertex
                 two-dimensional polygon uses $2n+1$ multiplications and
                 $2n-1$ additions. We give an improved formula that uses
                 $n+1$ multiplications and $2n-1$ additions. A similar
                 formula is derived for a three-dimensional planar
                 polygon where, given the unit normal, the textbook
                 equation cost of $6n+4$ multiplications and $4n+1$
                 additions is reduced to $n+2$ multiplications and
                 $2n-1$ additions. Our formula also speed up Newell's
                 method to compute a robust approximate normal for a
                 nearly planar three-dimensional polygon, using $3n$
                 fewer additions than the textbook formula. Further,
                 when using this method, one can get the polygon's
                 planar area as equal to the length of Newell's normal
                 for a small additional fixed cost.",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.tandfonline.com/loi/ujgt20",
  xxremark =     "Web site has 4-page gap between this article and the
                 next.",
}

Related entries