{{$t('user.suspension_warning')}}
Press escape to exit fullscreen

{{sketch.instructions}}

CC {{sketch.licenseObject.short}}

Archived Sketch

This sketch is created with an older version of Processing,
and doesn't work on browsers anymore.

View Source Code

Delaunay Triangulation & Convex Hull

{{$t('general.by')}}
Justin
Dailey
Click to add point Click and drag to add + move point Computes the Delaunay Triangulation of a set of points using the incremental algorithm. The algorithm can run in O(n log n) but mine takes some short cuts and does not run as efficient. It does not (currently) implement a Delaunay Tree, which makes searching for triangles faster. Here is a detailed post I made: http://justindailey.blogspot.com/2012/05/delaunay-triangulation-convex-hull.html For references see: http://en.wikipedia.org/wiki/Delaunay_triangulation http://users.aims.ac.za/~faniry/documents/faniry.pdf (Mostly section 4)
We recovered an unsaved version of this sketch. Please review your changes below.

As a Plus+ Member feature, this source code is hidden by the owner.

  • {{co.title}}
    •
    {{$t('sketch.mode-pjs')}} {{$t('general.learnMore')}}
    Select mode or a template
    {{liveCodeLink}}
    • {{l.url.substr(l.url.lastIndexOf('/') + 1)}}
    {{$t('sketch.layoutDescription')}}

    {{k.category}}
    {{k.label}}
    {{k.description}}

    {{$t('sketch.seeMoreShortcuts')}}

    Versions are only kept for 7 days.
    Join Plus+ to keep versions indefinitely!

    {{$t('general.joinPlus')}}

    {{$t('sketch.versionsSummarized')}}

    {{ $t('general.joinPlus') }}