Doubly Connected Edge Lists

DCEL (doubly connected edge list) is very useful data structure which provides linear access to various components of a flat graph. I looked for an implementation in C# , but I couldn’t find one, so I decided to re-write my C++ code in DotNet framework and now...
Fit an arbitrary set of points into a given rectangle.

Fit an arbitrary set of points into a given rectangle.

A simple problem : Fit a flat set of points on XY plane into a given rectangle. Or in other words place the given rectangle around the set of points which contains all the points. In the same time determine if the problem has a solution or not? In this video I used...