[Solved]Stack overflow when detecting regions of a big tiled map.

Questions about the LÖVE API, installing LÖVE and other support related questions go here.
Forum rules
Before you make a thread asking for help, read this.
Post Reply
LXDominik
Prole
Posts: 26
Joined: Wed Oct 01, 2014 9:05 am

[Solved]Stack overflow when detecting regions of a big tiled map.

Post by LXDominik »

Hi everyone!
I'm trying to detect all regions of a tiled map, and store them in a table.
I found example of a "paint"-like flood fill, and tried to use that. Its working if map table is small 512x512 for example.
But if i chose map size 1024x1024 for example, i get stack overflow.

Code: Select all

function M:grid_get(x,y) return self.map[x][y].type end
function M:set(x,y,v) self.map[x][y].type = v end
function M:collect_regions(x,y,v)
	local region = {}
	region.type = self:grid_get(x,y)
	if self:grid_get(x,y) == v then return end
	local oldv = self:grid_get(x,y)
	local qx = {x}
	local qy = {y}
	local left = 0
	local right = 1

	local function enqueue(x,y)
		right = right + 1
		qx[right], qy[right] = x, y
	end

	while left < right do
		left = left + 1
		x, y = qx[left], qy[left]
		if x >= 1 and y >= 1 and x <= self.map_width and y <= self.map_width then
			if self:grid_get(x, y) == oldv then
				local r = {x=x,y=y}
				table.insert(region,r)
				self:set(x, y, v)
				self.map[x][y].looked = true
				enqueue(x+1, y)
				enqueue(x-1, y)
				enqueue(x, y+1)
				enqueue(x, y-1)
			end
		end
	end
	table.insert(regions, region)
	local t = self:get_next()
	if t ~= nil then
		self:collect_regions(t.x,t.y,_)
	end
end

function M:get_next()
	local x = self.prevx or 1
	local y = self.prevy or 1
	local max_x = self.map_width
	local max_y = self.map_width

	repeat 
		y = y+1
		if y > max_y then
			y = 1
			x = x+1
		end
		if x > max_x then
			return
		end
	until self.map[x][y].looked == false
	self.prevx, self.prevy = x,y
	local t = {x=x,y=y}
	return t
end
I guess problem is in M:get_next() function
Attachments
test.love
(6.44 KiB) Downloaded 76 times
Last edited by LXDominik on Sun May 20, 2018 2:14 pm, edited 1 time in total.
grump
Party member
Posts: 947
Joined: Sat Jul 22, 2017 7:43 pm

Re: Stack overflow when detecting regions of a big tiled map.

Post by grump »

Stack space is limited. Running a recursive algorithm this many times can easily exhaust that space. AFAIK, LuaJIT does tail call optimization. Read up on that for a possible solution to your problem. I don't know whether it is applicable or not in your case though.

See here for more information.
LXDominik
Prole
Posts: 26
Joined: Wed Oct 01, 2014 9:05 am

Re: Stack overflow when detecting regions of a big tiled map.

Post by LXDominik »

grump wrote: Sun May 20, 2018 1:56 pm Stack space is limited. Running a recursive algorithm this many times can easily exhaust that space. AFAIK, LuaJIT does tail call optimization. Read up on that for a possible solution to your problem. I don't know whether it is applicable or not in your case though.

See here for more information.
Thx! Calling a function like this at the end counts as a tail call.

Code: Select all

return self:collect_regions(t.x,t.y,_)
Post Reply

Who is online

Users browsing this forum: Google [Bot] and 143 guests