4 ms·
This algorithm is likely very slow. In fact, the authors didn't mention runtime at all.
by HardyLeung 14y ago
This algorithm is likely very slow. In fact, the authors didn't mention runtime at all.
- ynniv 14y agoYes, there are other high performance candidates that work well with line art. http://en.wikipedia.org/wiki/Hq3x http://en.wikipedia.org/wiki/Hq3x
- rsiqueira 14y agoDepixelizing Pixel Art may work even better for some types of images: http://research.microsoft.com/en-us/um/people/kopf/pixelart/ http://research.microsoft.com/en-us/um/people/kopf/pixelart/ "The algorithm extracts a smooth, resolution-independent vector representation from the image, which enables magnifying the results by an arbitrary amount without image degradation."
- Evbn 14y agoThis is great work. The one thing that bugs me is that the algorithm is rather timid about corners (even though we its major contribution is in aggressively committing to hard edges) and results are rather blobby instead of forming sharp outlines.
- scriptproof 14y agoI tried HQX and the results are impressive! I have abandonned the Python tool because the installation is tedious but this one is very straightforward.
- AshleysBrain 14y agoIt doesn't have to be slow - it may be possible to write a shader that does it on a GPU.