E-mail

E-mail a Wiley Online Library Link

F. Cazals, T. Dreyfus, S. Sachdeva and N. Shah Greedy Geometric Algorithms for Collection of Balls, with Applications to Geometric Approximation and Molecular Coarse-Graining Computer Graphics Forum 33

Version of Record online: 13 MAR 2014 | DOI: 10.1111/cgf.12270

Thumbnail image of graphical abstract

Choosing balls which best approximate a 3D object is a nontrivial problem. To answer it, we first address the inner approximation problem, which consists of approximating an object inline image defined by a union of n balls with inline image balls defining a region inline image. This solution is further used to construct an outer approximation enclosing the initial shape, and an interpolated approximation sandwiched between the inner and outer approximations.

Complete the form below and we will send an e-mail message containing a link to the selected article on your behalf

Required = Required Field

SEARCH