RSS
Welcome to my blog, hope you enjoy reading :)

Sunday, August 27, 2017

Notification about European Union Cookies

Today I noticed the following message when I was blogging:

Then I looked around to understand what this means and if my blog-site confirms to this and found this: https://productforums.google.com/forum/#!topic/blogger/0HBkufYRymQ;context-place=topicsearchin/blogger/cookies

So I went to GeoPeeker and checked if my site shows up find in EU - and sure it was fine.

The Art of Movie Editing

Here I am after a long break... 
Here is a classic book by Walter Murch that every movie maker should read "In the Blink of an Eye: A Perspective on Film Editing"
Here is one important idea from his book:

Saturday, June 3, 2017

Sorting algorithms

I know it has been a while since I blogged last. I really wanted to post something on movies but I'm going to do something really crazy. This is not a post on movies or movie techniques. It is on sorting algorithms. I have been seeing so many sorting algorithms like bubble sort, quicksort, merge sort, heap sort and so on. And as you probably know the complexities of these algorithms are measured in a certain notation. It is called the big O notation. For example bubble sort is of complexity O(n^2). The complexities of other algorithms are O(n log n). Is it not possible to come up with an algorithm with complexity O(n)? I think I might have just come up with one such  algorithm. Here is it:
This works best if the array to be sorted does not have huge gaps. 
1. Put each element from the array in an hashmap (key set to the value of the array element and value set to the number of times it occurs in the input array). 
2.  While doing the above step remember the smallest value and the biggest value.
3. Once that is done loop through from the smallest value to the biggest value that you remembered and print the loop index if that index is in the hashmap. 

Now tell me, is it not an O(n) implementation? Someone please tell me that i am wrong. 

I am going to call this "Yash sort" 😇 I am super excited ...

Here is a simple implementation [Am not handling duplicate values in this implementation because that would lead you to think that it is O(n2)]:
private static int[] yashSort(int[] ip) {
        HashSet h = new HashSet();
        int min = 0, max = 0;
        for (int i = 0; i < ip.length; i++) {
            if (min > ip[i]) min = ip[i];
            if (max < ip[i]) max = ip[i];
            h.add(Integer.valueOf(ip[i]));
        }

        int tmp =0;
        for (int i = min; i <= max; i++) {
            if (h.contains(Integer.valueOf(i))) {
                    ip[tmp++] = i;
            }
        }
        return(ip);
    }

Cheers!

Saturday, October 29, 2016

Free tool to help writers!

Have you seen this?
http://www.inklestudios.com/inklewriter/
They say that this is a free tool to write interactive stories. Have you tried it? Do you think it is useful?
Here is a sample: https://writer.inklestudios.com/stories/musgraveritual and here is a tutorial!

Sunday, October 16, 2016

Struggling to make 3D Character Animations

After seeing Rosa, I have been trying to make a short video using opensource/free software but I must admit that this is hard. I found Daz3d easy to use (compared to Blender etc) but then I have been unsuccessful in creating realistic motion. Even a simple walk cycle is difficult. I found a pretty neat run that was created quite a while ago using Natural Motion's software which is not available any more :(
I collected many links like http://www.posermocap.com/resources/ (nice info on clothing using Marvelous Designer)
I thought of capturing motion using software like http://www.kinovea.org or http://b-tk.googlecode.com/svn/web/mokka/index.html or https://www.cabrillo.edu/~dbrown/tracker/ and using with Daz3d's characters but in vain :(

Can anyone suggest how I can create or learn to create a short character animation? I don't care if it is 3D or 2D for now. Please share some ideas.

Wednesday, September 21, 2016

Scratching your head after hitting a production issue!

This is something not related to movie making... when programming in Java have you ever wanted to capture information about memory utilization etc so you have some data to help you in debugging should you run into weird issues... I ran into one such issue and was badly needing and hoping if I could have had some sort of profiler. Anyway, I ended up using something like TimedMemberStateFactoryHelper.java of Hazelcast. Have you developed any such tool yourself? Tell us...

Wednesday, September 14, 2016

Angular 2 - Special Event at Google

I was there today! And it was a special event to announce the release of Angular 2!!

I met with Misko, Vivek(?), Naomi and a few others whose names I can't recall now :(
It was super cool to be there today! 
This release announcement would help me coax some of the development teams I work with to use Angular 2 - they can no longer give the excuse that it is still in beta :)
Have you tried Angular 2? I think it is cool - give it a shot and tell me what you think...