🔗
- Confusion on Delaunay triangulation and largest inscribed circle – Stack Overflow
- Largest circle inside a non-convex polygon – Stack Overflow
Problem: in the given set of
n ≥ 2points in a metric space, find a pair of points with the smallest distance between them.
🔗
- Closest pair of points – Wikipedia
🎥
- E.Izzy. Divide and conquer algorithms – PWL NYC (2019)
📖
- Sec. 33.4: Finding the closest pair of points – T.H.Cormen, C.E.Leiserson, R.L.Rivest, C.Stein. Introduction to algorithms (2009)
📖
- Sec. 1.5: G.Turk. Generating random points in triangles – A.S.Glassner. Graphics gems (1990)
Problem: given three points
A,BandCthat describe a triangle, pick a random point in it with uniform probability.
❔
- Uniform random point in triangle – Mathematics
Problem: given
NpointsA1,A2, ...,ANthat describe a polygon, pick a random point in it with uniform probability.
❔
- How to get a random point on the interior of an irregular polygon? – Stack Overflow
🔗
- Ramer–Douglas–Peucker algorithm – Wikipedia
🔗
- Bresenham’s line algorithm – Wikipedia
📄
- R.F.Sproull. Using program transformations to derive line-drawing algorithms – ACM Transactions on Graphics 1, 259 (1982)
🔗
- Midpoint circle algorithm – Wikipedia
- J.Kennedy. A fast Bresenham type algorithm for drawing circles