Voit lisätä twiitteihisi sijainnin, esimerkiksi kaupungin tai tarkemman paikan, verkosta ja kolmannen osapuolen sovellusten kautta. Halutessasi voit poistaa twiittisi sijaintihistorian myöhemmin. Lue lisää
My natural next thought is wondering if/how this might work in higher dimensions (if you consider your examples to be 1D). Is there an analogous structure in those higher dimensions that lets me find all objects in an AABB overlap?
And more importantly, could such a structure be worthwhile, from a performance standpoint?
I'm trying to think of how it could work in higher dimensions and one thing I'm thinking of is maybe something like this could be good for finding the shape (boundary) of a local minimum. Not sure what that'd be good for specifically but fitting a surface or hyper volume to data
And using that to find a minimum (scratch the boundary idea) seems useful. I'm 100% sure this has been done if it makes any sense, as finding minima is a super important thing. Hrm...
Twitter saattaa olla ruuhkautunut tai ongelma on muuten hetkellinen. Yritä uudelleen tai käy Twitterin tilasivulla saadaksesi lisätietoja.
