<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	
	>
<channel>
	<title>Comments on: C# for 3D visualizations and Plotting in .NET</title>
	<atom:link href="https://ilnumerics.net/blog/3d-visualization-and-scientific-plotting-for-net/feed/" rel="self" type="application/rss+xml" />
	<link>https://ilnumerics.net/blog/3d-visualization-and-scientific-plotting-for-net/</link>
	<description>The Productivity Machine  &#124;  A fresh attempt for scientific computing  &#124;  http://ilnumerics.net</description>
	<lastBuildDate>Wed, 10 Mar 2021 05:36:00 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>https://wordpress.org/?v=4.1.41</generator>
	<item>
		<title>By: Ali Adams</title>
		<link>https://ilnumerics.net/blog/3d-visualization-and-scientific-plotting-for-net/#comment-14073</link>
		<dc:creator><![CDATA[Ali Adams]]></dc:creator>
		<pubDate>Sat, 10 Oct 2020 22:33:00 +0000</pubDate>
		<guid isPermaLink="false">http://ilnumerics.net/blog/?p=467#comment-14073</guid>
		<description><![CDATA[I need to build a 3D visualization application of the internal structure of the Quran&#039;s Text as a graph network with nodes and links connecting words with same text, same root, or same value with full pan/tilt/zoom support.

Any help is much appreciated.

Quran&#039;s Text Properties:
  - There are 29 unique letters (Alphabet).
  - There are 77878 words (14637 unique words).
  - Word length = 1 to 11 letters.
  - Longest repeated word range consists of 26 words in 4 consecutive verses (23:5-8 == 70:29-32).
  - Most repeated word range consists of 4 words in 31 verses in very close proximity within chapter 55.

Graph Properties:
  - x-axis = chapter number.     (1 to 114)
  - y-axis = verses per chapter. (3 to 286)
  - z-axis = words per verse.    (1 to 128)

Each NODE (x,y,z) represents a Word drawn as a 3D sphere with a diameter of 1 to 11 proportional to the number of its letters.
Each LINK (x1,y1,z1 to x2,y2,z2) is 1 to 11 SUBLINKs proportional to the number of letters per Words it is connecting.
Each SUBLINK has 1 of 29 colors representing a letter within the LINK&#039;s Words.

CONNECT LONGEST WORD RANGES FIRST, THEN NEAREST IF EQUAL LENGTH:
  - for each word range, get its length (number of words)
    and its nearest repeated word range (if any).
  - if a word range is a subset of a longer range,
    connect the longest repeated word ranges only,
    else connect to nearest word range.

Ali Adams
http://heliwave.com]]></description>
		<content:encoded><![CDATA[<p>I need to build a 3D visualization application of the internal structure of the Quran&#8217;s Text as a graph network with nodes and links connecting words with same text, same root, or same value with full pan/tilt/zoom support.</p>
<p>Any help is much appreciated.</p>
<p>Quran&#8217;s Text Properties:<br />
  &#8211; There are 29 unique letters (Alphabet).<br />
  &#8211; There are 77878 words (14637 unique words).<br />
  &#8211; Word length = 1 to 11 letters.<br />
  &#8211; Longest repeated word range consists of 26 words in 4 consecutive verses (23:5-8 == 70:29-32).<br />
  &#8211; Most repeated word range consists of 4 words in 31 verses in very close proximity within chapter 55.</p>
<p>Graph Properties:<br />
  &#8211; x-axis = chapter number.     (1 to 114)<br />
  &#8211; y-axis = verses per chapter. (3 to 286)<br />
  &#8211; z-axis = words per verse.    (1 to 128)</p>
<p>Each NODE (x,y,z) represents a Word drawn as a 3D sphere with a diameter of 1 to 11 proportional to the number of its letters.<br />
Each LINK (x1,y1,z1 to x2,y2,z2) is 1 to 11 SUBLINKs proportional to the number of letters per Words it is connecting.<br />
Each SUBLINK has 1 of 29 colors representing a letter within the LINK&#8217;s Words.</p>
<p>CONNECT LONGEST WORD RANGES FIRST, THEN NEAREST IF EQUAL LENGTH:<br />
  &#8211; for each word range, get its length (number of words)<br />
    and its nearest repeated word range (if any).<br />
  &#8211; if a word range is a subset of a longer range,<br />
    connect the longest repeated word ranges only,<br />
    else connect to nearest word range.</p>
<p>Ali Adams<br />
<a href="http://heliwave.com" rel="nofollow">http://heliwave.com</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>
