OnlineWoerterBuecher.de
Internes

Lexikon


computational geometry


The study of algorithms for combinatorial, topological, and metric problems concerning sets of points, typically in Euclidean space. Representative areas of research include geometric search, convexity, proximity, intersection, and linear programming. (1997-08-03)

In addition suitable contents:
[ = ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ bi ] [ ca ] [ ch ] [ cl ] [ co ] [ com ] [ combinator ] [ con ] [ de ] [ du ] [ E ] [ ec ] [ er ] [ es ] [ et ] [ Euclid ] [ fi ] [ file ] [ fo ] [ for ] [ ge ] [ gi ] [ gr ] [ h ] [ hm ] [ hr ] [ id ] [ il ] [ in ] [ inc ] [ include ] [ int ] [ io ] [ it ] [ Lex ] [ li ] [ line ] [ linear programming ] [ logical ] [ lu ] [ ly ] [ ma ] [ metric ] [ mm ] [ mo ] [ mod ] [ module ] [ ms ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ om ] [ op ] [ pa ] [ ph ] [ point ] [ pr ] [ program ] [ programming ] [ query ] [ rc ] [ re ] [ ro ] [ se ] [ set ] [ space ] [ st ] [ T ] [ th ] [ to ] [ tr ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (4029 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0919 Seconds, with 17 Database-Queries
Zurück zur Startseite