Polygonalization
Polygon through a set of points
In computational geometry, a polygonalization of a finite set of points in the Euclidean plane is a simple polygon with the given points as its vertices.
ATK 4739DEF 6228
Polygon through a set of points
In computational geometry, a polygonalization of a finite set of points in the Euclidean plane is a simple polygon with the given points as its vertices.
Polygon through a set of points
Nobody has pulled this card yet. The first copy makes you its discoverer.
In computational geometry, 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 also be called a polygonization, simple polygonalization, Hamiltonian polygon, non-crossing Hamiltonian cycle, or crossing-free straight-edge spanning cycle.
No sale yet.
None on the Market right now.