This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
|
This article mentions an "MX octtree". Unfortunately, no where are such trees explained.
This article also mentions that PR octtrees can represent "infinite" space. To me, this is somewhat vague. Perhaps the word "unbounded" would be more appropriate? In any case, I do not quite see how it is possible for an octtree to keep track of things which may be arbitrarily far away from some center. This relates to my first question, because this seems to be where the difference lies between PR and MX varieties of octtrees.
Does the picture look messed up to anyone else? Mainly the right hand side.
this article could mention linear octrees (storing an octree as a list of gargantini-coded nodes, instead of a pointer-based tree), and the relatively easy set-operations(union, intersection, difference) which the linear representation makes possible. —Preceding unsigned comment added by 89.27.71.155 ( talk) 08:43, 10 April 2010 (UTC)
According to the tree overview at bottom of this article the octree is a BSP-Tree. But where should be the binary part in this structure? Each cell is not subdivided or subdivided in exactly 8 children. There is nothing binary to my mind.
Does anyone share my point of view? -- 139.30.216.151 ( talk) 07:28, 6 June 2011 (UTC)
Disclaimer : I worked in the same company as Don Meagher (Phoenix Data Systems) when he was building (and patented) the Octree. I'll start with a 1-line statement linking to the patent, and then I'll dig up some WP:RS links to expand on it. I referenced his first report. I also put 3d graphics in "common uses" Alanf777 ( talk) 20:19, 20 September 2012 (UTC)
The article describes pictures, but there don't seem to be any on the page. Where did they go? Yitz ( talk) 04:53, 14 June 2023 (UTC)
This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
|
This article mentions an "MX octtree". Unfortunately, no where are such trees explained.
This article also mentions that PR octtrees can represent "infinite" space. To me, this is somewhat vague. Perhaps the word "unbounded" would be more appropriate? In any case, I do not quite see how it is possible for an octtree to keep track of things which may be arbitrarily far away from some center. This relates to my first question, because this seems to be where the difference lies between PR and MX varieties of octtrees.
Does the picture look messed up to anyone else? Mainly the right hand side.
this article could mention linear octrees (storing an octree as a list of gargantini-coded nodes, instead of a pointer-based tree), and the relatively easy set-operations(union, intersection, difference) which the linear representation makes possible. —Preceding unsigned comment added by 89.27.71.155 ( talk) 08:43, 10 April 2010 (UTC)
According to the tree overview at bottom of this article the octree is a BSP-Tree. But where should be the binary part in this structure? Each cell is not subdivided or subdivided in exactly 8 children. There is nothing binary to my mind.
Does anyone share my point of view? -- 139.30.216.151 ( talk) 07:28, 6 June 2011 (UTC)
Disclaimer : I worked in the same company as Don Meagher (Phoenix Data Systems) when he was building (and patented) the Octree. I'll start with a 1-line statement linking to the patent, and then I'll dig up some WP:RS links to expand on it. I referenced his first report. I also put 3d graphics in "common uses" Alanf777 ( talk) 20:19, 20 September 2012 (UTC)
The article describes pictures, but there don't seem to be any on the page. Where did they go? Yitz ( talk) 04:53, 14 June 2023 (UTC)