Automatic Version
Voronoi diagram -Area of Voronoi region
-Higher order -Farthest-point
-MW(multiplicatively weighted) -AW(additively) -PW(additively power) -CW(Compoundly) -LW
-Elliptic -Manhattan -Supremum -Karlsruhe
-Higher order MW -HAW -HPW -HCW -HLW
-HElliptic -HManhattan -HSupremum -HKarlsruhe
-Farthest-Point Manhattan
Line-segment Voronoi diagram -segments sometimes cross each other -segments need to cross each other
-Higher order line-segment -segments sometimes cross each other -segments need to cross each other
Delaunay Tessellation -2nd order -3rd order -Farthest
Convex Hull -Higher order convex hull
X-grap -Y-graph
B-spline curve -X-dimension -Y-dimension -Higher-order Convex Hull
Overlaid Convex Hulls from considering four color problem
-Version 2 -1 color version -two color version
-3 color version -5 color version -6 color version
Catmull-Rom spline curve
Bezier curve -X-dimension -Y-dimension -Higher-order Convex Hull
Whirlpool
Hilbert Curve's Variation 1 Variation 2
Hilbert Curve's approximating polygon(Variation 1) (Variation 2)
Heauristic algorithm for Traveling salesman problem by using Hilbert curve
Heauristic algorithm for Traveling salesman problem by using Approximating polygon of Hilbert curve
Dog locustic diagram Primary expression Quadratic expression Expression of degree 3 Expression of degree 4
Expression of degree 5 Expression of degree 6 Expression of degree 7 Expression of degree 50(Heavy) Expression of degree 100(very heavy) Clump
Gabriel graph Relative neighborhood graph
Minimum spanning tree problem -Network minimum spanning tree problem -Weighted network minimum spanning tree problem
Shortest path problem -Weighted Shortest path problem
Hakimi Problem -Hakimi with weighted demands
-Hakimi with weighted links -Hakimi with weighted demands and weighted links
Nearest point,farthest point pair -Higher order -2nd order -3rd order -Farthest point
Weber problem -Weighted Weber Problem
Center problem Largest empty circle problem Largest empty Ellipse problem
Traveling Salesman problem's heauristic algorithm
-when end point differs from startpoint
-when start point is given and end point is arbitrary
-when start point and end are given
Heauristic algorithm for Traveling salesman problem by Incremental method
Steiner tree problem's heauristic algorithm
Points
Paths of salesman who doesn't have objective function
Overlaid Paths of salesman who doesn't have objective function
Segments which need not cross each other Segments which do not cross each other Segments which need to cross others
Circles Circles which do not include others Circles which do not include and cross others
Rectangles which have edges are parallel to x-axis, y-axis
Squares which have edges are parallel to x-axis, y-axis
Higher order ellipse(fictious) Higher order ellipse(fictious,fictious)

Graphs of various functions Newton method
Chord method Secant method Regula Falsi
Newton method for obtaining extremum
Chord method for obtaining extremum
Secant method for obtaining extremum
Regula Falsi for obtaining extremum
Experiments of random variables of uniform distribution Experiments of geometric distribution Experiments of binomial distribution
Experiments of exponential distribution

Click Version
Voronoi diagram -Area of Voronoi region
-Higher order -Farthest-point
-Manhattan -Supremum -Karlsruhe
-HManhattan -HSupremum -HKarlsruhe
-Farthest-Point Manhattan
Delaunay Tessellation -2nd order -3rd order -Farthest
Convex Hull -Higher order convex hull
X-grap -Y-graph
B-spline curve(Not coming back to 1) -B-spline curve(Coming back to 1) -X-dimension -Y-dimension -Higher-order Convex Hull
Catmull-Rom spline curve cal
Bezier curve(Not coming back to 0) -Bezier curve(Coming back to 0) -X-dimension -Y-dimension -Higher-order Convex Hull
Clump
Gabriel graph Relative neighborhood graph
Minimum spanning tree problem -Network minimum spanning tree problem
Shortest path problem
Hakimi Problem
Nearest point,farthest point pair -Higher order -2nd order -3rd order -Farthest point
Weber problem
Center problem Largest empty circle problem
Traveling Salesman problem with a lot of time
Traveling Salesman problem's heauristic algorithm
-when end point differs from startpoint
-when start point is given and end point is arbitrary
-when start point and end are given
Steiner tree problem's heauristic algorithm
Higher order ellipse(fictious) Higher order ellipse(fictious,fictious)

Queueing Version
M/M/1 Queue -M/M/2 Queue

BBS