### Abstract

The approximation and the exact algorithms to compute the minimum-width shell or annulus are discussed. To measure the S or the roundness of a set of n points in R^{d}, the S can be approximated with a sphere (Γ) so that the maximum distance between a point of S and Γ is minimized. It was found that the problem of measuring the roundness of S is equivalent to computing a shell of the smallest width that contains S.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the Annual Symposium on Computational Geometry |

Publisher | ACM |

Pages | 380-389 |

Number of pages | 10 |

State | Published - 1999 |

Event | Proceedings of the 1999 15th Annual Symposium on Computational Geometry - Miami Beach, FL, USA Duration: Jun 13 1999 → Jun 16 1999 |

### Other

Other | Proceedings of the 1999 15th Annual Symposium on Computational Geometry |
---|---|

City | Miami Beach, FL, USA |

Period | 6/13/99 → 6/16/99 |

### Fingerprint

### ASJC Scopus subject areas

- Chemical Health and Safety
- Software
- Safety, Risk, Reliability and Quality
- Geometry and Topology

### Cite this

*Proceedings of the Annual Symposium on Computational Geometry*(pp. 380-389). ACM.

**Approximation and exact algorithms for minimum-width annuli and shells.** / Agarwal, Pankaj K.; Aronov, Boris; Har-Peled, Sariel; Sharir, Micha.

Research output: Chapter in Book/Report/Conference proceeding › Chapter

*Proceedings of the Annual Symposium on Computational Geometry.*ACM, pp. 380-389, Proceedings of the 1999 15th Annual Symposium on Computational Geometry, Miami Beach, FL, USA, 6/13/99.

}

TY - CHAP

T1 - Approximation and exact algorithms for minimum-width annuli and shells

AU - Agarwal, Pankaj K.

AU - Aronov, Boris

AU - Har-Peled, Sariel

AU - Sharir, Micha

PY - 1999

Y1 - 1999

N2 - The approximation and the exact algorithms to compute the minimum-width shell or annulus are discussed. To measure the S or the roundness of a set of n points in Rd, the S can be approximated with a sphere (Γ) so that the maximum distance between a point of S and Γ is minimized. It was found that the problem of measuring the roundness of S is equivalent to computing a shell of the smallest width that contains S.

AB - The approximation and the exact algorithms to compute the minimum-width shell or annulus are discussed. To measure the S or the roundness of a set of n points in Rd, the S can be approximated with a sphere (Γ) so that the maximum distance between a point of S and Γ is minimized. It was found that the problem of measuring the roundness of S is equivalent to computing a shell of the smallest width that contains S.

UR - http://www.scopus.com/inward/record.url?scp=0032650948&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032650948&partnerID=8YFLogxK

M3 - Chapter

SP - 380

EP - 389

BT - Proceedings of the Annual Symposium on Computational Geometry

PB - ACM

ER -