Jump to content

Category:Geometric algorithms

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by A5b (talk | contribs) at 09:40, 12 June 2006 (link to ru:~). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This category deals with algorithms in geometry.

Subcategories

This category has the following 12 subcategories, out of 12 total.

C

Computational topology (1 C, 22 P)
Computer graphics algorithms (8 C, 47 P)
Computer-aided design (5 C, 107 P)
Convex hull algorithms (11 P)
Curve fitting (1 C, 17 P)

D

Digital geometry (1 C, 43 P)

G

Geographic information systems (9 C, 91 P)
Geometric intersection (2 C, 17 P)
Graph drawing (3 C, 36 P)

M

Mesh generation (3 C, 17 P)

R

Researchers in geometric algorithms (1 C, 120 P)

T

Triangulation (geometry) (27 P)

Pages in category "Geometric algorithms"

The following 88 pages are in this category, out of 88 total. This list may not reflect recent changes.

*

Geometric algorithms

B

C

D

E

Euclidean shortest path

F

G

H

J

JTS Topology Suite

K

Katchalski-Katzir algorithm

L

M

N

P

R

S

V

W

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:Geometric_algorithms&oldid=58182017"