a polygonalization of a finite set of points in the Euclidean plane is a simple polygon with the given points as its vertices. A polygonalization may...

Schwarz–Christoffel mapping, used to find conformal maps involving simple polygons, polygonalization of point sets, constructive solid geometry formulas for polygons, and...

salesman problem forms a simple polygon through all of the points, a polygonalization of the points. Any non-optimal solution with crossings can be made...

remaining steps of the Graham scan produces a star-shaped polygon, a polygonalization of the input. The stack technique used in Graham's scan is very similar...

total length due to the triangle inequality. Therefore, it forms a polygonalization of the input. When compared to other tours that might not be bitonic...

Euclidean traveling salesman problem, the problem of finding the shortest polygonalization of a point set. Walking around the boundary of the minimum spanning...