Image-triangulation

Creative

image triangulation art

SHOW HN2015

63points
21comments
#443of 2,565 in 2015
Top 18%of 2015 by points

How HN took it

CuriousMostly questions and neutral comments

5 positive, 6 neutral or asking, 0 mixed, 1 critical, out of 12 comments about the project. Thread score +0.35.

Execution: 3 for, 0 againstIdea: 1 for, 0 againstDocs: 1 for, 0 againstPerformance: 0 for, 1 against

The thread, comment by comment

Each row is a top-level comment and its replies, in HN's order. Select a cell to open that comment on HN.

positive neutral or mixed critical about another commenter or something else the maker

What HN said

What people liked

  • Fun, interesting project

    From 3 comments
    • It's a super fun project, thanks for sharing! I think you might have fun with some variations too: One way you can use the Voronoi diagram to influence your point selection is…
      dahart on HN
    • This is awesome! I worked on a very similar project a few months ago, which I also posted to HN: https://news.ycombinator.com/item?id=10418829 Looks like yours is quite a bit…
      NarcolepticFrog on HN
    • well done, i guess...
      jheriko on HN
  • Useful ideas for extensions like Lloyd's algorithm

    From 2 comments
    • It's a super fun project, thanks for sharing! I think you might have fun with some variations too: One way you can use the Voronoi diagram to influence your point selection is…
      dahart on HN
    • In that case, you might have a bunch of fun combining your interests implementing this paper: http://www.dgp.toronto.edu/papers/ahausner_SIGGRAPH2001.pdf For rejection sampling,…
      dahart on HN

Objections

  • Triangulation is slow for many points

    From 2 comments
    • Didn't think about that, good idea as a small extension! But I don't think, a video codec would work. Or maybe just with very few points/triangles. Depending on the…
      EllipticCurve on HN
    • I'm startled at your triangulation time. I last did serious work with Delauney triangulation in 1998 or so, and was triangulating ~1000000 points in a few of hours (on a machine…
      pacaro on HN

Requests

  • Add screenshots to the README

    From 1 comment
    • 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…
      nacs on HN
  • Interpolated vertex colors instead of flat triangle colors

    From 2 comments
    • I've played with this kind of stuff in the past, it's a lot of fun. Have you tried shading the triangles so each is colored as the interpolation of the color at the vertices?…
      pacaro on HN
    • Very cool! Is it possible to modify the algorithm to use vertex color instead of triangle color? It is possible to do interesting stuff like Homeworld 2 backgrounds.…
      ingenter on HN

Questions

  • Can the algorithm handle very large point counts efficiently

    From 1 comment
    • I'm startled at your triangulation time. I last did serious work with Delauney triangulation in 1998 or so, and was triangulating ~1000000 points in a few of hours (on a machine…
      pacaro on HN

Alternatives named

  • Fortune's sweep line Voronoi implementation in C++

    From 1 comment
    • Very cool! In case C++ is your jam, ten years or so ago I adapted Steven Fortunes highly efficient sweep line algorithm to C++. Some info here -…
      shaneos on HN

Category, keywords, summaries and labels on this page were made by AI (Thread Reader v2) and not checked by hand. Each point links to the comments it came from.

Add a badge to your READMEShown on HackerShow
[![Shown on HackerShow](https://hackershow.org/badge.svg)](https://hackershow.org/show/10811325)