Timeline for How to use Compile to optimize the performance of a function calculating the distance between two points?
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 8 at 21:28 | vote | accept | Andrew | ||
| Nov 3, 2023 at 2:03 | history | became hot network question | |||
| Nov 3, 2023 at 1:31 | answer | added | Henrik Schumacher | timeline score: 10 | |
| Nov 3, 2023 at 1:25 | answer | added | Daniel Lichtblau | timeline score: 8 | |
| Nov 3, 2023 at 0:28 | comment | added | Daniel Lichtblau | Nearest can deliver all points within a specified radius of a given one. I’ll post an example when I’m back at my desk. | |
| Nov 2, 2023 at 21:45 | answer | added | Chris K | timeline score: 1 | |
| Nov 2, 2023 at 21:29 | history | edited | user64494 | CC BY-SA 4.0 |
edited title
|
| Nov 2, 2023 at 21:21 | answer | added | Andrew | timeline score: 7 | |
| Nov 2, 2023 at 20:07 | comment | added | Andrew | @DanielLichtblau You're right. I only need distances between "close" pairs. But I'm not experienced enough to know the best way to do that; I need to do some research. A simple way might be to divide space into segments, and examine the current and neighboring segments first. Do you have any hints? | |
| Nov 2, 2023 at 19:32 | comment | added | Daniel Lichtblau | Meta question: does you end use actually require computing all point-point-pair distances? Or might you only really require distances between "close" pairs? | |
| Nov 2, 2023 at 18:57 | answer | added | Karl | timeline score: 12 | |
| Nov 2, 2023 at 18:07 | history | edited | Andrew | CC BY-SA 4.0 |
improved formatting
|
| Nov 2, 2023 at 18:01 | history | asked | Andrew | CC BY-SA 4.0 |