Some problems in distributed computational geometry
β Scribed by Sergio Rajsbaum; Jorge Urrutia
- Book ID
- 113927474
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 301 KB
- Volume
- 412
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Fast solution of the computational geometry problems is important for computer graphics, image processing and pattern recognition, The capability of the network Mesh of Trees for application in VLSI systems solving fastly the computational geometry problems is shown on two examples: determination of
The question of how uften the same dzstance can occur between k distinct points in n-dimensional Euclidean space E, ;~a: been exteasively studied by Paul Erdijs and others. Sir Alexander Oppenheim posed the somewhat simi:ar problem of investigating how many triangle:; with vertices chosen from ar$Io