Sweep Line Algorithm
CHF 37.15
Auf Lager
SKU
IJVVU1NRHGB
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Do., 30.10.2025 und Fr., 31.10.2025
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational geometry, a sweep line algorithm or plane sweep algorithm is a type of algorithm that uses a conceptual sweep line or sweep surface to solve various problems in Euclidean space. It is one of the key techniques in computational geometry.The idea behind algorithms of this type is to imagine that a line (often a vertical line) is swept or moved across the plane, stopping at some points. Geometric operations are restricted to geometric objects that either intersect or are in the immediate vicinity of the sweep line whenever it stops, and the complete solution is available once the line has passed over all objects.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786131233906
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Größe H220mm x B220mm
- EAN 9786131233906
- Format Fachbuch
- Titel Sweep Line Algorithm
- Herausgeber Betascript Publishing
- Anzahl Seiten 72
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
