Smallest enclosing cylinders

Elmar Schoemer; Juergen Sellen; Marek Teichmann; Chee Yap

Smallest enclosing cylinders

Elmar Schoemer, Juergen Sellen, Marek Teichmann, Chee Yap

Computer Science

Research output: Contribution to conference › Paper › peer-review

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 language	English (US)
Pages	C-13-C-14
State	Published - 1996
Event	Proceedings of the 1996 12th Annual Symposium on Computational Geometry - Philadelphia, PA, USA Duration: May 24 1996 → May 26 1996

Other

Other	Proceedings of the 1996 12th Annual Symposium on Computational Geometry
City	Philadelphia, PA, USA
Period	5/24/96 → 5/26/96

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Computational Mathematics

Cite this

@conference{da1aa3e7557d4d068cae1c120205ffcf,

title = "Smallest enclosing cylinders",

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.",

author = "Elmar Schoemer and Juergen Sellen and Marek Teichmann and Chee Yap",

note = "Funding Information: This work was supported by the grant SVV 260057/2014, GAUK 723912 and by the project PRVOUK P37 of the Charles University in Prague, Czech Republic.; Proceedings of the 1996 12th Annual Symposium on Computational Geometry ; Conference date: 24-05-1996 Through 26-05-1996",

year = "1996",

language = "English (US)",

pages = "C--13--C--14",

}

TY - CONF

T1 - Smallest enclosing cylinders

AU - Schoemer, Elmar

AU - Sellen, Juergen

AU - Teichmann, Marek

AU - Yap, Chee

N1 - Funding Information: This work was supported by the grant SVV 260057/2014, GAUK 723912 and by the project PRVOUK P37 of the Charles University in Prague, Czech Republic.

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

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

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

M3 - Paper

AN - SCOPUS:45849155167

SP - C-13-C-14

T2 - Proceedings of the 1996 12th Annual Symposium on Computational Geometry

Y2 - 24 May 1996 through 26 May 1996

ER -

Smallest enclosing cylinders

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this