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
278 Views Asked by algro At
1
There are 1 best solutions below
Related Questions in ALGORITHM
- MCNP 6 - Doubts about cells
- Given partially sorted array of type x<y => first apperance of x comes before first of y, sort in average O(n)
- What is the algorithm behind math.gcd and why it is faster Euclidean algorithm?
- Purpose of last 2 while loops in the merge algorithm of merge sort sorting technique
- Dots and Boxes with apha-beta pruning
- What is the average and worst-case time complexity of my string searching algorithm?
- Building a School Schedule Generator
- TC problem 5-2:how to calculate the probability of the indicator random variable?
- LCA of a binary tree implemented in Python
- Identify the checksum algorithm
- Algorithm for finding a subset of nodes in a weighted connected graph such that the distance between any pair nodes are under a postive number?
- Creating an efficent and time-saving algorithm to find difference between greater than and lesser than combination
- Algorithm to find neighbours of point by distance with no repeats
- Asking code suggestions about data structure and algorithm
- Heap sort with multithreading
Related Questions in SORTING
- Sorting a List by its property renames all the objects in the List
- Does Sort() method in C# use recursion?
- ARM Assembly code is not executing in Vitis IDE
- Creating an efficent and time-saving algorithm to find difference between greater than and lesser than combination
- Heap sort with multithreading
- Laravel Livewire data table sorting livewire update payload
- basic MergeSort exercise
- How to import a range into a variant array in Excel VBA and sort using the sort method?
- Looker Studio | pivot chart - sorting by metric and last month
- how to create an array of multiples of 5 and display it in reverse
- matplotlib sort barh by values
- Custom Sorting Javascript with A-Z set
- Mainframe Programming Sorting, OUTFIL REMOVECC,NODETAIL
- Soft list based on another list
- SQL query : creating table with distinct values on selected columns
Related Questions in BOUNDS
- Rust add bound to borrowed type
- Typescript generic bound any object except any class
- Bound & Unbound Method Object
- How to use CameraComponent.setBounds() in Flutter Flame?
- Remove extra blank elements in an array VBA
- How do I obtain the world-space position of PolygonCollider2D points?
- react-leaflet - SVGOverlay how update bounds rendering after new bounds selection
- Measure text in canvas with stroke - Android
- AppleScript: Save/Restore the Bounds of Every Open Window by Path/Name
- Bounds / BoundingVolume of a Model with source "#cube" in QML
- 'Index was outside the bounds of the array' for a String() Method
- Fitting Data with Scipy Optimize Minimize with Both Constraints and Bounds
- why setting bounds origin makes the subview move to another direction in iOS?
- Python - minimize with x[0] < x[1] < x[2] constraint
- moving the image (Animated.Image) only within the view react native
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 # Hahtags
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.