𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast Algorithms for Computing the Smallestk-Enclosing Circle

✍ Scribed by Sariel Har-Peled; Soham Mazumdar

Book ID
106148574
Publisher
Springer
Year
2004
Tongue
English
Weight
283 KB
Volume
41
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast algorithms for computing Ξ²-skeleton
Fast algorithms for computing Ξ²-skeletons and their relatives
✍ S.V. Rao; Asish Mukhopadhyay πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 191 KB

In this paper we present fast algorithms for computing -skeletons (Kirkpatrick and Radke, in: Toussaint (Ed.), Computational Geometry, North-Holland, Amsterdam, 1985, pp. 217}248) and two of its relatives, namely, k -skeletons, and additively weighted -skeletons. A -skeleton is a generalization of t