I read about R-Tree, kd-tree, bounding interval hierarchy etc for space-partitioning. I found that these data structures are useful for spatial querying. Although, they do partitioning, but I do not know how to retrieve those partitions from the data structure. So, my question boils down to "Given a number N and a map containing say X number of polygons, can I get N number of partitions that contain approximately equal number of polygons?"
Is there an algorithm, which can partition the space into N number of partitions given a random number N, where N<50
263 Views Asked by justin waugh At
1
There are 1 best solutions below
Related Questions in GRAPHICS
- Removing flashiness/ shakiness from scrolling text
- Algorithm for drawing tiles on screen
- Can this kind of SVG be simplified?
- Interactive bend image
- Plot: Add legend that overlay several Frames
- I made a function that uses graphics and I wanted to call it in the main it did not work
- Creating new shape palettes in ggplot2 and other R graphics
- How to move everything in Graphics2D by x,y coordinates.
- Java Graphics Dispose Method
- How can I convert PNG to GIF keeping the transparency?
- Java repaint() not calling paintComponent
- 1080p resolution is not detected by screen.bounds and reverts to 720p
- Creating a Texture2DArray and populate it with solid values
- paintComponent method not being called by repaint
- Dealing with and printing large text files
Related Questions in R-TREE
- ELKI DBSCAN for million files
- Python rtree nearest - what exactly it does?
- How to go about learning R-tree?
- How to iterate over a boost R-tree?
- Unsure of which multidimensional nearest neighbour algorithm to use
- Performance of RTree vs kd-trees
- Find closest line to each point on big dataset, possibly using shapely and rtree
- Storing or accessing objects in boost r-tree
- How to use an R-Tree for knnsearch in Matlab
- Boost r-tree "correct" way to access objects
- How to use a R-Tree in Cassandra as indexing
- K nearest neighbour search with weights on dimensions
- What clustering algorithm is suitable for 2d rectangles without knowing the number of clusters ahead of time?
- sqlite not using index on android
- STR trees and how they are different from an R-tree?
Related Questions in SPACE-PARTITIONING
- data structure for movable points in 3d
- How does space partitioning algorithm for finding nearest neighbors work?
- anything better than bounding boxes?
- Thousands of rays intersections with Triangles in 3D space
- QuadTree for spatial partitioning (Java)
- Binary Space Partitioning Data Structure For Donut 2D Space
- How to perform spatial partitioning in n-dimensions?
- C++ Data Structure for k Nearest Neighbour Search in D dimension using only point cloud as query points
- How to eliminate colliding markers in Google Maps
- determine if a region of space is empty
- Is there an algorithm, which can partition the space into N number of partitions given a random number N, where N<50
- Algorithm for partitioning 1-dimensional space
- Is there a k-d tree analog that uses hyperspheres to partition?
- I have x points in a 2D space. How can I split them into the largest clusters possible with max radius r for each cluster and no overlaps?
- Space partitioning algorithm
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?
Well, if you want exactly N partitions, any of the common bulk loading strategies for the R-Tree should work. It won't necessarily be optimal, but you can force these to produce exactly N partitions of approximately equal size.
The k-d-tree will have objects that are in neither the left nor the right side. But you can use the k-d-tree bulk loading strategy and modify it to produce N partitions. Another simple yet sometimes quite effective way of bulk-loading and R-tree, actually.
When you constrain N to be a power of 2, or even better the
dth power of some number, the splits will usually become better. So splitting a 3D dataset in 9 pages is much cleaner to implement than splitting it into 8 pages.