I got an Array with objects, each object contains x,y,width and height. e.g. arr[{10,20,200,300},{20,30,100,200},…] Now I would like to find the closest object in this array to a given object, taking its boundaries into account. How could I achieve that, having for example an x-precedence to the right(finding the closest object on the x-axis situated right from the given object)?
Algorithm: How to find closest element, having coordinates and dimension
276 Views Asked by algro At
1
There are 1 best solutions below
Related Questions in ALGORITHM
- Two different numbers in an array which their sum equals to a given value
- Given two arrays of positive numbers, re-arrange them to form a resulting array, resulting array contains the elements in the same given sequence
- Time complexity of the algorithm?
- Find a MST in O(V+E) Time in a Graph
- Why k and l for LSH used for approximate nearest neighbours?
- How to count the number of ways of choosing of k equal substrings from a List L(the list of All Substrings)
- Issues with reversing the linkedlist
- Finding first non-repeating number in integer array
- Finding average of an array
- How to check for duplicates with less time in a list over 9000 elements by python
- How to pick a number based on probability?
- Insertion Sort help in javascript -- Khan Academy
- Developing a Checkers (Draughts) engine, how to begin?
- Can Bellman-Ford algorithm be used to find shorthest path on a graph with only positive edges?
- What is the function for the KMP Failure Algorithm?
Related Questions in SORTING
- How to sort a multi-dimensional array by the second array in descending order?
- Ignore #VALUE! error in SORT function
- What is the code of the sorted function?
- Pull out first occurrences from array
- how to keep 10 biggest integer while reading a list in java?
- IQueryable<T> OrderBy<T> Extension Fails with Foreign Key Property
- Anagram test using C++ having compile time error
- How to sort a nested dictionary by the a nested value?
- sort through text file numerically by numbers in column
- Python elegant way to sort numerically named directories
- sorting all data on multiple pages by clicking on its header
- Sort oberservableArray by multiple parameters
- 2D array, sort rows by sum
- sorting RDD elements
- Less beautifier - format code
Related Questions in BOUNDS
- Need a sort of a reverse CATransform3d
- Update bounds in Angular-Google-Maps
- Rotation and getBounds() in Phaser
- How to findObject in UiAutomator using position on screen (bounds)
- getClientRects is not working for image in safari or chrome
- How to get the exact point of objects in swift?
- I keep getting an index out of bounds error and dont know why
- error: incompatible types: inference variable R has incompatible bounds (Lambda java 8)
- javaFX- what is getBoundsInLocal() ,getBoundsInParent() method?
- get google place bounding box from google maps api
- How to make circular clip bounds for ViewGroup
- c# how to apply WindowState, FormBorderStyle and Bounds changes to multiple forms at once?
- iOS 8.x alternative to detect iPhone 5s, using [UIScreen mainScreen].bounds.size.height == 568.0
- Bound a Leaflet map to many layers
- Algorithm: How to find closest element, having coordinates and dimension
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?
Let's say your object's center is
(x,y)with widthw, heighth.The objects (rectangles, I suppose) in the array has center
(xi, yi)and widthwi,hi.Your object will connect to the others either from right-edge, top-edge or bottom-edge whose coordinates are:
Objects in array may have shortest distance starting from their left-edge, top-edge or bottom-edges which are similar
Then,
You can skip some of these calculations according to the relative position of the objects in the array to your object. For example, if
Ti1 < B1, you don't need to calculate[Bi1,Bi2] lineparts.I feel that this solution is very straight-forward&dummy and will take rough criticisms from the mathematicians, but I wanted to try to see the receptions.