<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Re: Contour plot algorithm? in Discussions</title>
    <link>https://community.jmp.com/t5/Discussions/Contour-plot-algorithm/m-p/7375#M7369</link>
    <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Contour Plot uses &lt;A href="http://en.wikipedia.org/wiki/Delaunay_triangulation"&gt;Delaunay triangulation&lt;/A&gt;. The triangulation algorithm doesn't handle duplicates. For duplicate locations, the mean of the response variable at that location is used instead.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
    <pubDate>Fri, 06 Sep 2013 17:57:03 GMT</pubDate>
    <dc:creator>XanGregg</dc:creator>
    <dc:date>2013-09-06T17:57:03Z</dc:date>
    <item>
      <title>Contour plot algorithm?</title>
      <link>https://community.jmp.com/t5/Discussions/Contour-plot-algorithm/m-p/7374#M7368</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Can someone point me to a reference that describes what function JMP uses to define the contours on the Contour Plot platform?&amp;nbsp; I found this in tech help: &lt;SPAN style="color: #222222; font-family: Helvetica, 'Arial Unicode MS', Arial, Verdana, Tahoma, sans-serif; font-size: 12px;"&gt;JMP uses a method of triangulation and linear interpolation to generate the contours in the Contour Plot where a combination of three data points are used to generate a triangle. To see the triangulations, opt to "Save Triangulations".&lt;/SPAN&gt; but is there somewhere that provides more details? I need to describe the process for a publication; reviewers are grumbling about me using a "black box" analysis.&lt;/P&gt;&lt;P&gt;Thank you.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Fri, 06 Sep 2013 05:57:53 GMT</pubDate>
      <guid>https://community.jmp.com/t5/Discussions/Contour-plot-algorithm/m-p/7374#M7368</guid>
      <dc:creator>dzeke</dc:creator>
      <dc:date>2013-09-06T05:57:53Z</dc:date>
    </item>
    <item>
      <title>Re: Contour plot algorithm?</title>
      <link>https://community.jmp.com/t5/Discussions/Contour-plot-algorithm/m-p/7375#M7369</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Contour Plot uses &lt;A href="http://en.wikipedia.org/wiki/Delaunay_triangulation"&gt;Delaunay triangulation&lt;/A&gt;. The triangulation algorithm doesn't handle duplicates. For duplicate locations, the mean of the response variable at that location is used instead.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Fri, 06 Sep 2013 17:57:03 GMT</pubDate>
      <guid>https://community.jmp.com/t5/Discussions/Contour-plot-algorithm/m-p/7375#M7369</guid>
      <dc:creator>XanGregg</dc:creator>
      <dc:date>2013-09-06T17:57:03Z</dc:date>
    </item>
  </channel>
</rss>

