Abstract
We obtain new results for manipulating and searching semi-dynamic planar convex hulls (subject to deletions only), and apply them to derive improved bounds for two problems in geometry and scheduling. The new convex hull results are logarithmic time bounds for set splitting and for finding a tangent when the two convex hulls are not linearly separated. Using these results, we solve the following two problems optimally inO(n logn) time: (1) [matching] givenn red points andn blue points in the plane, find a matching of red and blue points (by line segments) in which no two edges cross, and (2) [scheduling] givenn jobs with due dates, linear penalties for late completion, and a single machine on which to process them, find a schedule of jobs that minimizes the maximum penalty.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Akiyama and N. Alon.Disjoint simplices and geometric hypergraphs. Annals New York Academy of Science, pages 1–3, 1989.
M. Atallah.A matching problem in the plane. Journal of Computer and System Sciences, 31: 63–70, 1985.
M. Ben-Or.Lower bounds for algebraic computation trees. In Proceedings of the 15th ACM Symposium on Theory of Computing, pages 80–86, 1983.
K. Q. Brown.Geometric Transforms for Fast Geometric Algorithms. PhD thesis, Carnegie-Mellon University, 1980.
B. Chazelle.On the convex layers of a planar set. IEEE Transactions on Information Theory, IT-31 (4): 509–517, July 1985.
H. Edelsbrunner.Algorithms in Combinatorial Geometry, volume 10 ofEATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1987.
M. Fields and G. Frederickson.A faster algorithm for the maximum weighted tardiness problem. Manuscript, 1989.
J. Friedman, J. Hershberger and J. Snoeyink.Compliant motion in a simple polygon. In Proceedings of the 5th ACM Symposium on Computational Geometry, pages 175–186, 1989.
R. Graham.An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1: 132–133, 1972.
L. Guibas, J. Hershberger and J. Snoeyink.Compact interval trees: A data structure for convex hulls. International Journal of Computational Geometry & Applications, 1 (1): 1–22, 1991.
J. Hershberger and S. Suri.Finding tailored partitions. Journal of Algorithms, 12 (3): 431–463, September 1991.
D. Hochbaum and R. Shamir.An O log 2 n)algorithm for the maximum weighted tardiness problem. Information Processing Letters, 31: 215–219, 1989.
D. Kirkpatrick and R. Seidel.The ultimate planar convex hull algorithm? SIAM Journal on Computing, 15: 287–299, 1986.
L. C. Larson.Problem-Solving Through Problems. Springer-Verlag, New York, 1983.
E. L. Lawler,Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19: 544–546, 1973.
M. Overmars and J. van Leeuwen.Maintenance of configurations in the plane. Journal of Computer and System Sciences, 23: 166–204, 1981.
F. P. Preparata.An optimal real time algorithm for planar convex hulls. Communications of the ACM, 22: 402–405, 1979.
F. P. Preparata and M. I. Shamos.Computational Geometry. Springer-Verlag, New York, 1985.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hershberger, J., Suri, S. Applications of a semi-dynamic convex hull algorithm. BIT 32, 249–267 (1992). https://doi.org/10.1007/BF01994880
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01994880