Category:Geometric algorithms

From Wikipedia, the free encyclopedia

This category deals with algorithms in geometry.

Subcategories

There is one subcategory to this category shown below (more may be shown on subsequent pages).

R

Researchers in geometric algorithms

Pages in category "Geometric algorithms"

There are 28 pages in this section of this category.

3

3SUM

A

Art gallery problem

B

C

D

De Casteljau's algorithm

D cont.

Delaunay triangulation

G

H

Ham sandwich problem

K

Klee's measure problem

L

L cont.

List of numerical computational geometry topics

O

Orthogonal convex hull

P

V

Voronoi diagram

W

Watchman route problem

X

Xiaolin Wu's line algorithm

Retrieved from "http://en.wikipedia.org../../../g/e/o/Category%7EGeometric_algorithms_2779.html"

Categories: Algorithms | Geometry

Views

Search

In other languages