Delaunay_Triangulation

My own implementation of a Delaunay triangulation and Voronoi partition in Python applied to images.

Creative & Media

Explore on GitHub Read Hacker News discussions

3Distinct people

5Mentions

0Explicit recommenders

271GitHub stars

REPOSITORY AT A GLANCE

What to know before exploring

What it is

My own implementation of a Delaunay triangulation and Voronoi partition in Python applied to images.

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by 3-hour interval5 dated mentions

Observed mentions: 2015-12-29 10:21:07 UTC to 2015-12-30 21:13:00 UTC.

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges

UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
Period	Start (UTC)	End (exclusive, UTC)	Mentions	Submissions	Comments
Dec 29, 09:00	2015-12-29 09:00:00 UTC	2015-12-29 12:00:00 UTC	1	1	0
Dec 29, 12:00	2015-12-29 12:00:00 UTC	2015-12-29 15:00:00 UTC	0	0	0
Dec 29, 15:00	2015-12-29 15:00:00 UTC	2015-12-29 18:00:00 UTC	1	0	1
Dec 29, 18:00	2015-12-29 18:00:00 UTC	2015-12-29 21:00:00 UTC	0	0	0
Dec 29, 21:00	2015-12-29 21:00:00 UTC	2015-12-30 00:00:00 UTC	0	0	0
Dec 30, 00:00	2015-12-30 00:00:00 UTC	2015-12-30 03:00:00 UTC	0	0	0
Dec 30, 03:00	2015-12-30 03:00:00 UTC	2015-12-30 06:00:00 UTC	0	0	0
Dec 30, 06:00	2015-12-30 06:00:00 UTC	2015-12-30 09:00:00 UTC	1	1	0
Dec 30, 09:00	2015-12-30 09:00:00 UTC	2015-12-30 12:00:00 UTC	0	0	0
Dec 30, 12:00	2015-12-30 12:00:00 UTC	2015-12-30 15:00:00 UTC	0	0	0
Dec 30, 15:00	2015-12-30 15:00:00 UTC	2015-12-30 18:00:00 UTC	0	0	0
Dec 30, 18:00	2015-12-30 18:00:00 UTC	2015-12-30 21:00:00 UTC	1	0	1
Dec 30, 21:00	2015-12-30 21:00:00 UTC	2015-12-31 00:00:00 UTC	1	0	1

What Hacker News says

5 sources

EllipticCurve·Dec 30, 2015

Thanks! Did, for whatever reason, not think about that :) All right, added pictures to the readme and lowered the resolution to a maximum of 1000x1000 for mobile users. Original size up to very big sizes are still in the /Screenshots/ folder: https://github.com/MauriceGit/Delaunay_Triangulation/tree/ma...

In Show HN: Image-triangulation – Delaunay and Voronoi from scratch

nacs·Dec 30, 2015

Adding some screenshots examples to the README would be good. There's a bunch here for those who didn't dig through the repo (many are at huge resolutions for those on mobile 10k x 7k pixels and such): https://github.com/MauriceGit/Delaunay_Triangulation/tree/ma...

In Show HN: Image-triangulation – Delaunay and Voronoi from scratch

EllipticCurve·Dec 30, 2015Submission

Show HN: Image-triangulation – Delaunay and Voronoi from scratch

63 points · Open discussion

brudgers·Dec 29, 2015

Direct link: https://github.com/MauriceGit/Delaunay_Triangulation

In Show HN: Image-triangulation (delaunay and voronoi)

EllipticCurve·Dec 29, 2015Submission

Show HN: Image-triangulation (delaunay and voronoi)

Hey guys, it's my first post here, but I've been reading for a couple of months. And right now I am ready to share some stuff I made. Please feel free to ask, criticize or suggest alternatives :) https://github.com/MauriceGit/Delaunay_Triangulation A couple of months ago someone here (don't have the link anymore) inspired me to finally sit down and implement a delaunay-triangulation and voronoi from scratch. What the python-script does is: - take an image, extract points dependent on the contrast and color difference of the image (more points on edges or in contrast-rich parts). - triangulate the points with a delaunay-triangulation (from scratch). - transform the delaunay-triangles into voronoi-regions. - render the triangles and voronoi-regions into new images with the average color for each polygon (from the original image). The delaun

Read the rest

ay-triangulation runs in Omega(n logn) but I'm not 100% sure if also in O(n logn). The transformation into voronoi-regions runs in O(n). Please tell me what you think :) Best regards Maurice

2 points · Open discussion