All Questions
10
questions
3
votes
1
answer
247
views
Algorithms for rendering overlapping (floating) windows in 2D
I'm trying to figure out a solution to a problem that looked simple at first: how to render overlapping windows in a 2D windowing system. Originally I was thinking about implementing a text-based UI ...
- 135
1
vote
0
answers
135
views
Turning colorized comic-art into uncolorized monochrome (line-art-inks-only B&W), not just very-light-grayscale
I'm trying to figure out how to go about removing the "colorization" of comic/cartoon/manga/etc drawn-art inputs where the black-ink strokes ("the line-art") are to be retained ...
- 11
1
vote
1
answer
184
views
What does an algorithm which handles mesh-based image morphing look like?
In recent years, the technology of Live2D has become particularly popular and I have been attempting to find any papers or articles which explain what the mathematics for the mesh-based image morphing ...
0
votes
1
answer
362
views
Rotate a Bitmap with Shearing
I am rotating a bitmap using the three shear algorithm documented in these articles [1][2].
From about 0-90°, the quality is acceptable, but beyond that it gets progressively more distorted until it's ...
1
vote
1
answer
2k
views
Rotating a Bitmap
I would like to rotate an bitmap image using math. I have two issues with my current implementation: the pixel-by-pixel rotation of the copied bitmap is extremely slow and it is leaving gaps between ...
2
votes
1
answer
77
views
Calculate set of rectangles covering pixel diffs?
I'd like to develop a system for web animation similar to animated gifs, like this one. I capture a series of screenshots at fixed time intervals, and then I'd like to animate them. I can trivially ...
- 121
5
votes
0
answers
136
views
Is there any open-source implementation of n*log(n) visibility graph construction algorithm?
Is there any open-source implementation of n*log(n) visibility graph construction algorithm?
I'm trying to understand S. K. GHOSH and D. M. MOUNT sweep line algorithm, but it's known for having very ...
- 393
9
votes
1
answer
5k
views
Understanding Jump Flooding Algorithm (JFA) for Voronoi Diagrams
I'm having trouble understanding the JFA. As far as I understood the algorithm, it walks log(n) times through every pixel (no matter if it is a seed or not) and looks at that pixel's neighbors in $(x+...
- 165
3
votes
2
answers
1k
views
Finding the nearest neighbor of polygons
I have a set of non-convex polygons and I want to merge them. I am able to find the connection between two polygons. If there are more than two polygons, one connection can intersect another polygon ...
- 105
3
votes
1
answer
2k
views
Image rotation algorithm
I would like to rotate a raster image by an arbitrary angle. I don't really care for speed: the rotation should be of highest quality possible. Could someone please suggest a suitable algorithm?
I'm ...
- 1,459