ScratchData LogoScratchData
Back to UntilThisDanceEnds's profile

Delaunay Triangulation

UNUntilThisDanceEnds•Created September 12, 2022
Delaunay Triangulation
25
16
248 views
View on Scratch

Instructions

Click to place points Click and hold to randomly generate points Click and drag to switch between between instant and animated point addition It looks better on turbowarp and you can generate 3000 points in like 1 second so check it out there: https://turbowarp.org/730934390?hqpen

Description

A Delaunay triangulation is a triangulation of a predefined set of points in which the circumcircle of every triangle does not contain any points. This project in particular uses Guibas & Stolfi’s incremental triangulation algorithm, explained by Ian Henry: https://ianthehenry.com/posts/delaunay/ I have put zero thought into making the code readable. Just check the site if you want to learn. Point movement and constrained triangulation coming maybe

Project Details

Project ID730934390
CreatedSeptember 12, 2022
Last ModifiedJune 11, 2024
SharedSeptember 12, 2022
Visibilityvisible
CommentsAllowed