Computational Geometry
Intro¶
Sometimes, you can get insights just from the keywords associated with a problem. Here, I intend to list the problems I have encountered while studying computational geometry. The sources of the problems are described as:
- handcrafted by myself: No special explanation is provided.
- famous theorem or problem: Formatted like (famous theorem name).
- found from a specific source: References are provided within the explanation.
Boundless-X quiz¶
Problems¶
Some problems are not necessarily computational.
- 001 : three points - triangle
- 002 : four points - containment
- 003 : four points - convex quadrilateral
- 004 : three points - area
- 005 : polygon - area
- 006 : segment in square - average length
- 007 : polygon - triangulation
- 008 : triangle to rectangle
- 009 : rectangle to rectangle
- 010 : polygon to polygon
- 011 : 2*n points matching - line
- 012 : 2*n points matching - plane
- 013 : triangle on grid - grid point containment
- 014 : tetrahedron on grid - grid point containment
- 015 : polygon on grid - grid point containment
- 016 : diagonal of a rectangle - piercing cells
- 017 : diagonal of a cuboid - piercing cells