HC/spatialhash.lua
Matthias Richter c681391033 Fix triangulation. Use class-commons. Add hash:draw()
Polygon triangulation bug:
In some cases Kongs triangulation algorithm produces triangles
with collinear points. The Polygon constructor removes one of
these and throws an error because there are not enough vertices.
Checking if the current points in a triangulation step are
collinear and discarding those triangles fixes the problem.

Class-commons lets you use any supporting class system as
backend for HC.

Add SpatialHash:draw() for debug purposes.
2012-01-22 00:09:54 +01:00

153 lines
4.3 KiB
Lua

--[[
Copyright (c) 2011 Matthias Richter
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
Except as contained in this notice, the name(s) of the above copyright holders
shall not be used in advertising or otherwise to promote the sale, use or
other dealings in this Software without prior written authorization.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
]]--
local floor = math.floor
local min, max = math.min, math.max
local _PACKAGE = (...):match("^(.+)%.[^%.]+")
if not (common and common.class and common.instance) then
class_commons = true
require(_PACKAGE .. '.class')
end
local vector = require(_PACKAGE .. '.vector')
-- special cell accesor metamethods, so vectors are converted
-- to a string before using as keys
local cell_meta = {}
function cell_meta.__newindex(tbl, key, val)
return rawset(tbl, key.x..","..key.y, val)
end
function cell_meta.__index(tbl, key)
local key = key.x..","..key.y
local ret = rawget(tbl, key)
if not ret then
ret = setmetatable({}, {__mode = "kv"})
rawset(tbl, key, ret)
end
return ret
end
local Spatialhash = {}
function Spatialhash:init(cell_size)
self.cell_size = cell_size or 100
self.cells = setmetatable({}, cell_meta)
end
function Spatialhash:cellCoords(v)
return {x=floor(v.x / self.cell_size), y=floor(v.y / self.cell_size)}
end
function Spatialhash:cell(v)
return self.cells[ self:cellCoords(v) ]
end
function Spatialhash:insert(obj, ul, lr)
local ul = self:cellCoords(ul)
local lr = self:cellCoords(lr)
for i = ul.x,lr.x do
for k = ul.y,lr.y do
rawset(self.cells[ {x=i,y=k} ], obj, obj)
end
end
end
function Spatialhash:remove(obj, ul, lr)
-- no bbox given. => must check all cells
if not ul or not lr then
for _,cell in pairs(self.cells) do
rawset(cell, obj, nil)
end
return
end
local ul = self:cellCoords(ul)
local lr = self:cellCoords(lr)
-- else: remove only from bbox
for i = ul.x,lr.x do
for k = ul.y,lr.y do
rawset(self.cells[{x=i,y=k}], obj, nil)
end
end
end
-- update an objects position
function Spatialhash:update(obj, ul_old, lr_old, ul_new, lr_new)
local ul_old, lr_old = self:cellCoords(ul_old), self:cellCoords(lr_old)
local ul_new, lr_new = self:cellCoords(ul_new), self:cellCoords(lr_new)
if ul_old.x == ul_new.x and ul_old.y == ul_new.y and
lr_old.x == lr_new.x and lr_old.y == lr_new.y then
return
end
for i = ul_old.x,lr_old.x do
for k = ul_old.y,lr_old.y do
rawset(self.cells[{x=i,y=k}], obj, nil)
end
end
for i = ul_new.x,lr_new.x do
for k = ul_new.y,lr_new.y do
rawset(self.cells[{x=i,y=k}], obj, obj)
end
end
end
function Spatialhash:getNeighbors(obj, ul, lr)
local ul = self:cellCoords(ul)
local lr = self:cellCoords(lr)
local set = {}
for i = ul.x,lr.x do
for k = ul.y,lr.y do
local cell = self.cells[{x=i,y=k}] or {}
for other,_ in pairs(cell) do
rawset(set, other, other)
end
end
end
rawset(set, obj, nil)
return set
end
function Spatialhash:draw(how, show_empty, print_key)
if show_empty == nil then show_empty = true end
for k,cell in pairs(self.cells) do
local empty = true
(function() for _ in pairs(cell) do empty = false; return end end)()
if show_empty or not empty then
local x,y = k:match("([^,]+),([^,]+)")
x = x * self.cell_size
y = y * self.cell_size
love.graphics.rectangle(how, x,y, self.cell_size, self.cell_size)
if print_key then
love.graphics.print(k, x+3,y+3)
end
end
end
end
return common.class('Spatialhash', Spatialhash)