Computational geometry

Aucun article

Binary space partitioning Fat object Geometric separator Geometric set cover problem Graham scan Minimum bounding box Point location Subpaving Bentley ottmann algorithm Bowyer watson algorithm Chans algorithm Clipping computer graphics Closest pair problem Cohen sutherland Collision detection Constrained delaunay triangulation Convex hull algorithms Cyrus beck Euclidean distance map Fast clipping Fortunes algorithm Geometric hashing Jump and walk algorithm Kabsch algorithm Kirkpatrick seidel algorithm Liang barsky algorithm Line clipping Line segment intersection Minimum bounding box algorithms Nesting algorithm Point set registration Quasitriangulation Quickhull Ramer douglas peucker algorithm Ruzzo tompa algorithm Shoelace algorithm Sutherland hodgman Sweep and prune Sweep line algorithm Triangulation geometry Vatti clipping algorithm Weiler atherton Shamos hoey algorithm Newest vertex bisection Snap rounding Bin computational geometry

Pas encore d'articles dans cette catégorie — ça arrive.