Refine
Year of publication
- 2026 (37)
- 2025 (399)
- 2024 (406)
- 2023 (431)
- 2022 (416)
- 2021 (295)
- 2020 (195)
- 2019 (503)
- 2018 (526)
- 2017 (528)
- 2016 (564)
- 2015 (638)
- 2014 (691)
- 2013 (700)
- 2012 (688)
- 2011 (693)
- 2010 (680)
- 2009 (728)
- 2008 (506)
- 2007 (661)
- 2006 (449)
- 2005 (343)
- 2004 (434)
- 2003 (358)
- 2002 (252)
- 2001 (212)
- 2000 (232)
- 1999 (207)
- 1998 (115)
- 1997 (140)
- 1996 (133)
- 1995 (77)
- 1994 (63)
- 1993 (68)
- 1992 (21)
- 1991 (21)
- 1990 (39)
- 1989 (39)
- 1988 (34)
- 1987 (36)
- 1986 (29)
- 1985 (28)
- 1984 (34)
- 1983 (21)
- 1982 (16)
- 1981 (11)
- 1980 (7)
- 1979 (8)
- 1978 (4)
- 1976 (2)
- 1975 (2)
- 1974 (1)
Document Type
- Diploma Thesis (8616)
- Bachelor Thesis (2832)
- Master's Thesis (1178)
- Doctoral Thesis (351)
- Article (333)
- Part of a Book (274)
- Book (75)
- Working Paper (16)
- Review (14)
- Other (12)
Institute
- Maschinenbau und Kraftfahrzeugtechnik (bis 2018) (4525)
- Physikalische Technik, Informatik (2066)
- Gesundheits- und Pflegewissenschaften (1856)
- Wirtschaftswissenschaften (1574)
- Elektrotechnik (842)
- Sprachen (705)
- Angewandte Kunst (624)
- Kraftfahrzeugtechnik (534)
- Architektur (374)
- Automobil- und Maschinenbau (281)
Language
- German (13187)
- English (495)
- French (18)
- Portuguese (14)
- Multiple languages (5)
- Spanish (4)
- Italien (2)
- Kazakh (2)
Based on Welzl's algorithm for smallest circles and spheres we develop a simple linear time algorithm for finding the smallest circle enclosing a point cloud on a sphere. The algorithm yields correct results as long as the point cloud is contained in a hemisphere, but the hemisphere does not have to be known in advance and the algorithm automatically detects whether the hemisphere assumption is met. For the full-sphere case, that is, if the point cloud is not contained in a hemisphere, we provide hints on how to adapt existing linearithmic time algorithms for spherical Voronoi diagrams to find the smallest enclosing circle.
