How I can change an unbalanced bsp to a balanced bsp tree?
Convert unbalanced to balanced bsp tree?
230 Views Asked by Saba At
1
There are 1 best solutions below
Related Questions in BINARY-SEARCH-TREE
- Why would one use a heap over a self balancing binary search tree?
- Search list for objects valid in a time range
- Couting nodes with onyl one child in BST
- Trouble implementing avl tree in java
- Find the parent node of a node in binary search tree
- Function that return average depth of a binary search tree
- Print a Binary Search Tree with Correct Formatting
- How to calculate depth of each node in Binary Search Tree?
- How to rotate Binary Tree recursion given a null stopper
- Segmentation fault when using if statement with pointers (BST tree)
- Finding the minimum and maximum height in a AVL tree, given a number of nodes?
- Binary Search Tree insertion - root remains null
- How do I go about the traversal of Binary Search Trees?
- Insert function in a Binary Search Tree
- Implementing a parent node in AVL tree
Related Questions in BSP-TREE
- 3D BSP tree links?
- Am I rendering BSP trees incorrectly?
- Practical Examples of BSP based polygon triangulation
- How to render a BSP Tree without splitting
- Generating BSP tree from raw data
- Orthographic projection and BSP-tree to render objects from back to front
- Convert unbalanced to balanced bsp tree?
- Trouble rendering Quake 3 maps
- Will BSP trees work on single, transparent objects?
- How to traverse a BSP tree back to front
- How can the equation for a line in 2d space be represented as an array of three values?
- Difficulty Constructing Binary Tree from Array
- Geometry of binary space partitioning tree
- Does anyone have a BSP example?
- polygons from BSP
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
In Quake, this is really left up to the mapper. The Quake BSP compiler starts bisecting volumes from the origin
(0, 0, 0). So, in order to produce a more balanced and BSP-friendly map, the mapper should center their geometry, on all three axis, around the origin.I think a similar strategy could apply to your problem. Find the absolute bounds (mins and maxs) of your BSP nodes, and calculate the point in the center. That is where you should begin partitioning your tree. Now, unless your map is perfectly symmetrical, you will never achieve a perfectly balanced tree. But, for practical purposes, this gets you relatively close.