Posts Tagged .Net
Gale Shapley Algorithm for Stable Matching
Posted by Sai Panyam in Technology on September 13, 2011
Achieving Stable Matching between two sets of entities with various preferences for each other is a real world problem (a.k.a Stable Marriage Problem). Examples include dating sites, matching medical students to hospital jobs (National Resident Matching Program) etc. How can we ensure that there is a stable matching (defined as any pairings, such that no [...]
Algorithms in Computational Geometry – Part 2
Posted by Sai Panyam in Technology on April 8, 2010
In Part 1 we discussed the base technique for determining relative orientation. We used that to answer the first two questions: To find relative orientation of two points and two directed segments with a common end point. In Part 2 we answer the next two questions: Given two line segments p0p1 and p1p2, if we [...]
Algorithms in Computational Geometry – Part 1
Posted by Sai Panyam in Technology on April 8, 2010
Computational Geometry (CG) deals with algorithms for solving geometric problems. It is used in computer graphics, robotics, computer aided design,statistics among others. A typical CG problem takes as input a set of geometric objects like a set of points, a set of line segments etc. The output is most commonly finding certain attributes of the [...]
