𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Output-Sensitive Algorithm for Computing β-Skeletons

✍ Scribed by A. Mukhopadhyay; S. V. Rao

Publisher
Springer Vienna
Year
2000
Tongue
English
Weight
99 KB
Volume
65
Category
Article
ISSN
0010-485X

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

Parallel Output-Sensitive Algorithms for
Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems
✍ John H. Reif 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 160 KB

This paper gives output-sensitive parallel algorithms whose performance depends on the output size and are significantly more efficient tan previous algorithms for problems with sufficiently small output size. Inputs are n\_n matrices over a fixed ground field. Let P(n) and M(n) be the PRAM processo

Faster output-sensitive parallel algorit
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima
✍ Neelima Gupta; Sandeep Sen 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 263 KB

In this paper we focus on the problem of designing very fast parallel algorithms for the convex hull and the vector maxima problems in three dimensions that are output-size sensitive. Our algorithms achieve Oðlog log 2 n log hÞ parallel time and optimal Oðn log hÞ work with high probability in the C