Looping through a real spiral on a discrete grid
The goal is to find a closest pixel with a certain value. To do that, I want to loop over the pixel, starting from the closest, with increasing distance, untill I reach a pixel which matches my requirements (edge of the grid or the desired value).
I believe this is not a duplicate, although very similar question have appeared before.
Looping in a spiral or another spiral answer are useful, but they won't result in the points ordered by distance to the center.
Justin L. actually mentions his application to find the closest point, but overlook the actual distance.
For example the algorithm in this image would find [1, 1] before [0, 1] although [0, 1] is much closer (distance of 1) compared to [1, 1] (distance of √2).
I'd like to get the points ordered by distance
[1, 0] [0, 1] [-1, 0] [0, -1] [1, 1] ...
otherwise it wouldn't be a real spiral.
This answer suggests spiraling with a very small step size, but since I don't know how far I need to spiral, this sounds very inefficient.
I hope this graphic makes the order clearer.
I wouldn't name it a spiral loop what you are describing. A spiral is a (connected) path. What you are looking for is not a path. Anyways, I would do the following:
In a pre-process step, add all coordinates of the grid including their distance to the center to an e.g.
std::vectorand have it sorted by the distance to the center. Then build an index table by storing the offset in the grid for each coordinate.At runtime use the index table to walk through the grid.
I am not sure though, if this pragmatic approach is what you are looking for. The runtime relevant step 2 is fast for sure.
- Why does an empty preprocessor command still evaluate to something?
- How to implement variable sized array within C struct
- Character array typecasting to integer
- How can I exclude non-numeric keys? CS50 Caesar Pset2
- How to get the sign, mantissa and exponent of a floating point number
- Why do MCU libraries use logic operations instead of bitfield structs?
- What kind of implementation can I use for a static associative array on a vintage system with very limited resources?
- Determine libraries to link against for a windows library function?
- Passing macro values to arm linker that places variable at a specific location
- running a program with wildcards as arguments
- How to perform addition of two vectors of 8-bit integers with a single addition in C/C++
- GNU RISC-V Embedded GCC throws "x ISA extension `xw' must be set with the versions" error
- Counting pulses using a swiss flow meter with an Arduino, how is it done?
- How to create a folder in C (need to run on both Linux and Windows)
- Is there any way to compute the width of an integer type at compile-time?
- How can I initialize all members of an array to the same value?
- Is C notably faster than C++
- How to get the Windows SDK version number a program is compiling with at compile time
- Confused by difference between expression inside if and expression outside if
- Equivalent of atoi for unsigned integers
- k&r: Exercise 1-18. Program takes input but doesnt produce any output?
- Using in C thrd_sleep() to either wait for time or interrupt by signal. Example?
- How can I compute `exp(x)/2` when `x` is large?
- c programming: answer always equates to 0
- Is it possible to access a parameter of a function from another function in C?
- Will this expression evaluate to true or false (1 or 0) in C?
- What Is the Return Value of strcspn() When Str1 Does not Contain Str2?
- Mapping a numeric range onto another
- Signalled and non-signalled state of event
- Why is faster to do a branch than a lookup?