Entry Vranek:2002: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{Vranek:2002:FAC,
  author =       "David Vranek",
  title =        "Fast and Accurate Circle-Circle and Circle-Line {$3$D}
                 Distance Computation",
  journal =      j-J-GRAPHICS-TOOLS,
  volume =       "7",
  number =       "1",
  pages =        "23--32",
  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/Vranek02/",
  abstract =     "This paper presents a novel high-precision algorithm
                 for the calculation of the minimal distance between two
                 circles in three dimensions. Contrary to the common
                 approach that mainly utilizes a solution of an
                 eighth-degree polynomial equation, the proposed
                 algorithm is based on directly using the distance
                 function and its derivatives. As the theory is not too
                 complicated, the algorithm is very easy to implement.
                 The paper also suggests a small modification of the
                 circle-circle distance algorithm for the circle-line
                 distance calculation. Results of computational
                 simulation compared with Eberly's Wild Magic library
                 are given and summarized in detail at the end of the
                 paper. They show that the proposed algorithm always
                 correctly finds the global minimum with much higher
                 accuracy at the same speed in the circle-circle
                 distance calculation case, whereas circle-line
                 calculation is approximately four times faster. The
                 source code is available online at the web site given
                 at the end of the paper.",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://www.tandfonline.com/loi/ujgt20",
}

Related entries