𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal output-sensitive convex hull algorithms in two and three dimensions

✍ Scribed by T. M. Chan

Book ID
110647783
Publisher
Springer
Year
1996
Tongue
English
Weight
439 KB
Volume
16
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On a Simple, Practical, Optimal, Output-
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
✍ Binay K Bhattacharya; Sandeep Sen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 212 KB

In this paper we present a truly practical and provably optimal O n log h time output-sensitive algorithm for the planar convex hull problem. The basic algorithm Ž is similar to the algorithm presented by Chan, Snoeyink, and Yap in ''Proceedings . of the 6th ACM᎐SIAM Symposium on Discrete Algorithms

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