Smallest enclosing cylinders

Elmar Schoemer, Juergen Sellen, Marek Teichmann, Chee Yap

Research output: Contribution to conferencePaper

Abstract

This work addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. In addition, an experimental work involving an exact and a numerical strategy is also reported.

Original languageEnglish (US)
PagesC-13-C-14
StatePublished - 1996
EventProceedings of the 1996 12th Annual Symposium on Computational Geometry - Philadelphia, PA, USA
Duration: May 24 1996May 26 1996

Other

OtherProceedings of the 1996 12th Annual Symposium on Computational Geometry
CityPhiladelphia, PA, USA
Period5/24/965/26/96

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Smallest enclosing cylinders'. Together they form a unique fingerprint.

  • Cite this

    Schoemer, E., Sellen, J., Teichmann, M., & Yap, C. (1996). Smallest enclosing cylinders. C-13-C-14. Paper presented at Proceedings of the 1996 12th Annual Symposium on Computational Geometry, Philadelphia, PA, USA, .