Recently I got interested in Blender 3D, partly inspired by infinigen project.
One day I encountered Tellusim. Impressed by the quality of its rendering, I was browsing its blogs and see this. Wow, Tellusim really blowed others out of the water;others including Unreal, Unity, Omniverse and Blender. Wait, Blender is really that slow importing a USD scene?
Since Blender is open-source, why not try to figure out what's going on? Here we go.
For some array problems on leetcode, often we need to use some extra data structures to efficiently solve them. A useful one is so called auxiliary array. This is a typical space time tradeoff strategy. Here we use some examples to illustrate the different kinds of auxiliary arrays.
L/R Min/Max Array
This array is in the same size as the input array. They contain values which are min or max of the input array at the index i from left or right. Here is a problem to which this kind of array is very useful.
334 Increasing Triplet Subsequence
Some combimnatorial problems require a specific technique called backtracking. The common problems in this category are permuation, combination and subsets. Backtracking is a general algorithm for finding all (or some) solutions to some computational problems, that incrementally builds candidates to the solutions. As soon as it determines that a candidate cannot possibly lead to a valid complete solution, it abandons this partial candidate and “backtracks’’ (return to the upper level) and reset to the upper level’s state so that the search process can continue to explore the next branch. Backtracking always work in recursive functions. Here I want to emphasize one aspect of applying backtracking to these problems: the ordering.
The ordering in the current context is referring to the order in which the the items are listed to form the final product. For some problems, this order is not important; while for others, the order matters. In other words, to the former, all items forming only one list; in the latt
| //Applies BFS from both source and destination side and checks after each iteration if the visited | |
| //list from each side are intersecting at any point. If yes, then thats the meeting point and gives the | |
| //path from source to that point and from that point to destination | |
| #include <iostream> | |
| #include <vector> | |
| #include <list> | |
| #include <algorithm> | |
| #include <stdlib.h> | |
| using namespace std; |
