3 ms·
I'm not convinced the complexity is really independent from the size of the map. With large emptyish maps the rays can travel a long distance before they hit so
by praptak 8y ago
I'm not convinced the complexity is really independent from the size of the map. With large emptyish maps the rays can travel a long distance before they hit something. And tracking the ray is linear wrt its length.
- joshvm 8y agoComplexity is proportional to the size of the view distance (linearly? Or square if you do a field of view). The map size doesn't matter, assuming array lookup is instant.
- taneq 8y agoAgreed. It's linear in the average view distance per column, which has the map size as its upper bound. I guess you could make a case for the average view distance being independent of map size for a given map style.