Suchergebnisse - "Theory of computation Randomness, geometry and discrete structures Computational geometry"

Approximation Schemes for Independent Set and Sparse Subsets of Polygons.

Autoren: ADAMASZEK, ANNA HAR-PELED, SARIEL WIESE, ANDREAS

Quelle: Journal of the ACM; Aug2019, Vol. 66 Issue 4, p1-40, 40p

Robust visualization of trajectory data.

Autoren: Zhang, Ying Klein, Karsten Deussen, Oliver et al.

Quelle: IT: Information Technology; Aug2022, Vol. 64 Issue 4/5, p181-191, 11p

Schlagwörter: DATA visualization, BEHAVIORAL research, COLLECTIVE behavior, DISCRETE geometry, COMPUTATIONAL geometry

A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest.

Autoren: BORRADAILE, GLENCORA KLEIN, PHILIP N. MATHIEU, CLAIRE

Quelle: ACM Transactions on Algorithms; Jan2015, Vol. 11 Issue 3, p19:1-19:20, 20p

Schlagwörter: POLYNOMIAL approximation, EUCLIDEAN geometry, STEINER systems, COMPUTER terminals, RANDOMIZATION (Statistics)

Greedy Geometric Algorithms for Collection of Balls, with Applications to Geometric Approximation and Molecular Coarse-Graining.

Autoren: Cazals, F. Dreyfus, T. Sachdeva, S. et al.

Quelle: Computer Graphics Forum. Sep2014, Vol. 33 Issue 6, p1-17. 17p.

Schlagwörter: *ALGORITHMS, *GEOMETRIC modeling, *COMPUTER graphics, *COMPUTER software, *ROBOTICS