First very special point event: vertical aligned beachline splitting. The new focus3.x is exactly same as point u8.x, it creates vertical edge. No arc is splitted, but new vertex is inserted on the cross point of two arcs. It creates no circle event. Beachline after event: (p1, u2, u9, u10, u6, p4) ...

Making images with transparent key value - it looks like chroma key.
https://en.m.wikipedia.org/wiki/Chroma_key

Dithering with pseudo-hexagonal matrix pattern: function dithering(data) local width, height = data:getDimensions() local canvasImageData = love.image.newImageData(width, height) local matrix = { -- 9 colors { 28, 85, 28, 85 }, { 142, 198, 142, 198 }, { 113, 57, 113, 57 }, { 227, 170, 227, 170 }, } ...

Any post is better with examples. We are have an image: hexadecagon2.png Open file: 2024-04-26T17_15_39-Image to Polygon converter.png Drag-n-drop the image. Input 16 vertices and "Generate polygon": 2024-04-26T17_16_00-Image to Polygon converter.png Output formats: {36, 112, 58, 68, 84, 4...

Two parabolas with common directrix have crossings on the same line: The the function to get crossing for the given horizontal line is: function focusFocusLineYCrossing (p1x, p1y, p2x, p2y, y) local cx = (p1x+p2x)/2 local cy = (p1y+p2y)/2 local m = (p2y-p1y)/(p2x-p1x) -- slope local x = cx - m*(y-p1...

Another desmos graphic solutions:
https://www.desmos.com/calculator/kzff2hb9d3
https://www.desmos.com/calculator/onvynga3da

Your code works, but try this code: function love.load() love.window.setTitle ('press WASD to move') gridSize = 64 player = { -- Initial grid position of the player gridPos = {x=1, y=1}, -- Change in grid position (due to movement) deltaGrid = {x=0, y=0}, -- Movement speed of the player (cells per s...

Event 6: Parabola vertex event. 1) Subdivide arc (u10, u8) to left arc (u10, u11), flat (u11, u12) and arc (u12, u8). (Left arc has event to be collapsed at point v16) 2)Subdivide arc (u8, u9) to arc (u8, u13), flat (u13, u14) and right arc (u14, u9). (Right arc has event to be collapsed at point v...

I've tried to make the Fortune's algorithm in Lua, but within limited frame, so it needs flat beach line and several new events: Event 1: First site event. Creating frame with x, y, w, h and finding any highest site (point with x, y). Adding first site to the diagram. Creating the beach line, first ...

RNavega wrote: ↑Fri Apr 19, 2024 12:30 am for every pixel of the image, it loops through every segment of the polygon to see which has the nearest distance.

I've made this exactly same way! But for not closed polyline:
viewtopic.php?p=243686#p243686