See this document in CiteSeerX!

On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm  (Make Corrections)  
Binay K. Bhattacharya, Sandeep Sen



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
cse.iitd.ernet.in/~sse...convhull.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cse.iitd.ernet.in/~ssen...reports (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper we present a truly practical and provably optimal O(n log h) time outputsensitive algorithm for the planar convex hull problem. The basic algorithm is similar to the algorithm presented in Chan, Snoeyink and Yap[2] where the median-finding step is replaced by an approximate median. We analyze two such schemes and show that for both methods, the algorithm runs in expected O(n log h) time. The expected number of comparisons can be made smaller than 5n log h for the upper-hull. We... (Update)

Active bibliography (related documents):   More   All
0.0:   Surface Reconstruction in Almost Linear Time under Locally.. - Dey, Funke, Ramos (2001)   (Correct)
0.0:   Practical Parallel Divide-and-Conquer Algorithms - Hardwick (1997)   (Correct)
0.0:   Design and Implementation of a Practical Parallel.. - Blelloch, Hardwick, .. (1999)   (Correct)

Similar documents based on text:   More   All
0.3:   Primal Dividing and Dual Pruning: Output-Sensitive.. - Chan, Snoeyink, Yap (1997)   (Correct)
0.1:   Output-Sensitive Rendering and Communication in Dynamic.. - Sudarsky, Gotsman (1997)   (Correct)
0.1:   Randomized Point Sampling for Output-Sensitive Rendering .. - Wand, Fischer, der Heide (2000)   (Correct)

BibTeX entry:   (Update)

@misc{ bhattacharya-simple,
  author = "Binay K. Bhattacharya and Sandeep Sen",
  title = "On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex
    Hull Algorithm",
  url = "citeseer.ist.psu.edu/206645.html" }
Citations (may not include all citations):
31   Output-Sensitive construction of polytopes in four dimension.. (context) - Chan, Snoeyink et al. - 1995  ACM   DBLP

Documents on the same site (http://www.cse.iitd.ernet.in/~ssen/reports.html):   More
Faster output-sensitive parallel algorithms for 3D convex hulls .. - Gupta, Sen (2003)   (Correct)
Parallel Computational Geometry : An approach using randomization - Reif, Sen (1999)   (Correct)
Towards a Theory of Cache-Efficient Algorithms (Extended Abstract) - Sen, al.   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC