• Corpus ID: 212680487

Heaphull?

@inproceedings{Mantler2001Heaphull,
  title={Heaphull?},
  author={Andrea Mantler and Jack Snoeyink},
  booktitle={CCCG},
  year={2001}
}
Because Heapsort was the one major sorting algorithm without a corresponding planar convex hull algorithm, we present a planar convex hull algorithm, Heaphull, whose main data structure is a kinetic heap. Unfortunately, the best bound on the running time that we can establish is O(n lg n). 

Figures from this paper

References

SHOWING 1-3 OF 3 REFERENCES
Sweeping lines and line segments with a heap
TLDR
It is shown how a heap on the intersections can be maintained during the sweep of the Bentley-Ottmann sweep, which maintains the exact ordering of the intersections of the segments with a vertical liie.
Data structures for mobile data
TLDR
This talk will survey the general ideas behind Kinetic data structures and illustrate their application to simple geometric problems that arise in virtual and physical environments.
Computational geometry: an introduction
TLDR
This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.