Skip to content

Complex polygon triangulation. A fast O(n*log(n)) algorithm based on "Triangulation of monotone polygons". The result can be represented as a Delaunay triangulation.

active 2023-08-22 → 2025-05-31 (UTC)

Complete coverage27,355 / 27,355 hourly files (100%) · 2 absent upstream2023-08-15 → 2026-09-27 (UTC)
Events
53
Pushes
3
Pull requests
2
Issues
8
Stars
19
Forks
2

Activity over time

Daily event counts in the loaded window

Line chart, 649 days from 2023-08-22 to 2025-05-31. Pushes: 3 total, peak 2 in a day. Pull requests: 2 total, peak 1 in a day. Issues: 8 total, peak 4 in a day. Comments: 15 total, peak 3 in a day. Stars: 19 total, peak 1 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Stars, PRs, issues and forks are under-captured in the later part of this window. GH Archive progressively stopped capturing non-push events during 2026 — −95% or worse by the end of the window. Every series here except Pushes fades for that reason, so a decline above reflects the archive, not this repository. Pushes stay reliable throughout, so read them, and the contributor counts derived from them, as the real signal. Data health has the measurements.

Top contributors

Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity

ContributorContributionsPushesPRsComments
NailxSharipov14317
EricBeetsOfficial-Opuscope4003
Dsearle23002
JSeligstein3002
lgarczyn2001
murphkev1000
bytroli1010

Recent activity

Latest issues, pull requests and releases

Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 19 stars here means stars gained during the window, not the repo's star count.