Community of electronics hobbyists established in 2002

Atom Feed | View unanswered posts | View active topics It is currently 18 Mar 2018 15:31

Reply to topic  [ 10 posts ] 
[Ternary] Need Ternary Algorithms for 3D Graphics 
Author Message
Reply with quote
Hello All,

I am working on a separate project for displaying 3D objects on an applet, and allowing rotation and scaling of the objects.

I expect that ternary logic will give me faster we require lots of mathematical operations during display/rotation and scaling.

I just wanted to know if any one has developed any code/theory on this topic using Ternary Logic? if not lets start....:-x

23 Jan 2009 04:45

Joined: 03 Aug 2003 23:37
Posts: 1483
Location: Moscow
Reply with quote
I know no attempts to use ternary logic to speed up 3D calculations. You'll be first there :)

23 Jan 2009 06:29
Reply with quote
Lets get started then, first thing I would need is Ternary algorithm for Matrix Addition ,Multiplication and Transform...

I will start working on these, if any one is interested in contributing...u r most welcome :-)

23 Jan 2009 08:06
Reply with quote
As first Step for 3D Ternary logic, I am working on creating a virtual 3D space which will contain the 3D objects.

It is going to sound strange but I am representing 3D space in a singular space :-), to reduce the time complexity from
n^3 to n
And i need to check space complexity.
.... i.e. in a 1D array,

And the 3D space will be compressible.

Will keep posting as I progress...

03 Feb 2009 09:59

Joined: 03 Aug 2003 23:37
Posts: 1483
Location: Moscow
Reply with quote
It sounds intriguing. Any news?

05 Feb 2009 01:34
Reply with quote

today while attending a training session i formulated the way to relate 1D(Singular) universe to 3D with something like this:

1. For Rotation:

where as,

Function of x,y,z and theta

return x;

2. For Transformation:

where as,


Function of x,y,z


return x;

And 1D-Universe is represented in "Trytes"

and still working to display 1D in 3D display, i.e. figure out way to efficiently use the advantage of 1D array in calculations for 3D display.

I also found something interesting here:
Ternary Display

05 Feb 2009 10:51
Reply with quote
I have started coding it and hv got a doubt i.e.

i am doing all 3D matrix operations in a 1D matrix.
Des it mean that here time colplexity O(T) has reduced from N^2 to N ?

31 Mar 2009 07:10

Joined: 17 Sep 2012 14:36
Posts: 277
Reply with quote
It's hard to say without seeing your code, but in general, it's quite easy to make algorithms appear to have different complexity.

What happens is that you shift your algorithm from say O(Q^2) to apparent complexity O(P), where in reality P=Q^2.

Matrix transforms are usually so small that complexity is a bad metric to look at. You're better off looking at runtime, or number of operations or something.

03 Apr 2009 11:59
Reply with quote
you got it consumes time at runtime....

14 May 2009 12:00
User avatar

Joined: 09 Jan 2003 00:22
Posts: 16355
Location: Colorado
Reply with quote
moving up


10 Nov 2012 09:57
Profile WWW
Display posts from previous:  Sort by  
Reply to topic   [ 10 posts ] 

Who is online

Users browsing this forum: No registered users and 3 guests

You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum

Search for:
Jump to:  
Powered by phpBB® Forum Software © phpBB Group
Designed by ST Software.