[{"data":1,"prerenderedAt":136},["ShallowReactive",2],{"maker-33a":3},[4,31,50,65,81,94,115],{"id":5,"name":6,"line":7,"ai":8,"cat":9,"year":10,"points":11,"comments":12,"rec":13,"s":14,"top":15,"kw":16,"maker":21,"domain":22,"tier":23,"attempts":24,"strip":25,"url":26,"mix":27,"praise":-1,"objection":29,"sub":30},8351989,"gif-3d","3D animated GIF viewer",false,"creative",2014,15,3,"quiet",null,64,[17,18,19,20],"animated gif","3d viewer","gif viewer","webgl","33a","mikolalysenko.github.io","shown",0,"011","https:\u002F\u002Fmikolalysenko.github.io\u002Fgif-3d",[24,24,24,28],2,"Rotation controls are too sensitive and behave unintuitively","animated gif viewer",{"id":32,"name":33,"line":34,"ai":8,"cat":35,"year":10,"points":36,"comments":12,"rec":13,"s":14,"top":37,"kw":38,"maker":21,"domain":43,"tier":23,"attempts":24,"strip":44,"url":45,"mix":46,"praise":48,"objection":-1,"sub":49},8767279,"dynamic-forest","Dynamic graph connectivity data structure","languages",25,49,[39,40,41,42],"dynamic graph connectivity","spanning forest","connected components","graph data structure","github.com","005","https:\u002F\u002Fgithub.com\u002Fmikolalysenko\u002Fdynamic-forest",[47,24,24,24],1,"Good time and space properties for fully dynamic connectivity","graph algorithms library",{"id":51,"name":52,"line":53,"ai":8,"cat":35,"year":10,"points":54,"comments":28,"rec":13,"s":14,"top":55,"kw":56,"maker":21,"domain":43,"tier":23,"attempts":24,"strip":61,"url":62,"mix":63,"praise":-1,"objection":-1,"sub":64},8783074,"static kd-tree","A static kd-tree in JavaScript",44,33,[57,58,59,60],"kd-tree","javascript","spatial index","nearest neighbor","00","https:\u002F\u002Fgithub.com\u002Fmikolalysenko\u002Fstatic-kdtree",[24,24,24,24],"data structure library",{"id":66,"name":67,"line":68,"ai":8,"cat":9,"year":10,"points":37,"comments":69,"rec":13,"s":14,"top":70,"kw":71,"maker":21,"domain":43,"tier":23,"attempts":24,"strip":76,"url":77,"mix":78,"praise":79,"objection":-1,"sub":80},8796263,"Orthogami","Turn voxel models into foldable papercraft",6,29,[72,73,74,75],"voxel","papercraft","3d model unfolding","paper model","005355","https:\u002F\u002Fgithub.com\u002Fmikolalysenko\u002Forthogami",[12,47,24,24],"Fun and cool, seen as almost magical","papercraft generator",{"id":82,"name":83,"line":84,"ai":8,"cat":35,"year":10,"points":85,"comments":47,"rec":13,"s":14,"top":86,"kw":87,"maker":21,"domain":43,"tier":23,"attempts":24,"strip":91,"url":92,"mix":93,"praise":-1,"objection":-1,"sub":64},8806193,"functional red-black tree","A functional red-black tree in JavaScript",12,72,[88,58,89,90],"red-black tree","functional data structure","persistent tree","3","https:\u002F\u002Fgithub.com\u002Fmikolalysenko\u002Ffunctional-red-black-tree",[24,47,24,24],{"id":95,"name":96,"line":97,"ai":8,"cat":35,"year":98,"points":99,"comments":100,"rec":101,"s":102,"top":103,"kw":104,"maker":21,"domain":22,"tier":23,"attempts":24,"strip":109,"url":110,"mix":111,"praise":112,"objection":113,"sub":114},9463184,"L1-path-finder","A fast path planner for grids",2015,30,11,"debated",0.07,36,[105,106,107,108],"pathfinding","grid path planning","a star alternative","l1 norm","05100010530","http:\u002F\u002Fmikolalysenko.github.io\u002Fl1-path-finder\u002Fwww\u002F",[28,47,24,28],"Impressive speed for grid pathfinding","Pathfinding is only one component of a game","pathfinding library",{"id":116,"name":117,"line":118,"ai":8,"cat":119,"year":120,"points":121,"comments":11,"rec":122,"s":123,"top":99,"kw":124,"maker":21,"domain":43,"tier":129,"attempts":24,"strip":130,"url":131,"mix":132,"praise":133,"objection":134,"sub":135},11775776,"headless-gl","A conformant WebGL implementation for Node.js","dev_tools",2016,57,"curious",-0.05,[20,125,126,127,128],"node.js","headless rendering","opengl","server-side rendering","notable","310335103050033","https:\u002F\u002Fgithub.com\u002Fstackgl\u002Fheadless-gl",[28,69,24,28],"Useful for server-side WebGL use cases","Buggy and not production-ready yet","graphics library for node",1793991198778]