Skip to main content
Springer Nature Link
Log in

Convex hulls of objects bounded by algebraic curves

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We present an0(n ·d o(1)) algorithm to compute the convex hull of a curved object bounded by0(n) algebraic curve segments of maximum degreed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abhyankar, S., and Bajaj, C. (1988), Automatic Rational Parameterization of Curves and Surfaces, III: Algebraic Plane Curves,Computer-Aided Geometric Design, Vol. 5, pp. 309–321.

    Article  MATH  MathSciNet  Google Scholar 

  2. Aho, A., Hopcroft, J., and Ullman, J. (1974),The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass.

    MATH  Google Scholar 

  3. Bajaj, C. (1988), Algorithmic Implicitization of Algebraic Curves and Surfaces, CAPO Research Report CER-88-11, Department of Computer Science, Purdue University.

  4. Bajaj, C., Huffman, C. M., Hopcroft, J. E., and Lynch, R. E. (1988), Tracing Surface Intersections,Computer-Aided Geometric Design, Vol. 5, pp. 285–307.

    Article  MATH  MathSciNet  Google Scholar 

  5. Bajaj, C., and Kim, M.-S. (1987), Generation of Configuration Space Obstacles: The Case of Moving Algebraic Curves,Proceedings of the 1987 IEEE International Conference on Robotics and Automation, North Carolina, pp. 979–984. An updated version appears inAlgorithmica, Vol. 4, No. 2 (1989), pp. 157–172.

  6. Bajaj, C., and Kim, M.-S. (1988), Algorithms for Planar Geometric Models,Proceedings of the 15th International Colloquium on Automata, Languages and Programming (1CALP 88), Tempere, Finland, Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 67–81.

    Google Scholar 

  7. Bajaj, C., and Royappa, A. (1988), A Note on an Efficient Implementation of the Sylvester Resultant for Multivariate Polynomials, Computer Science Technical Report CSD-TR-718, Purdue University.

  8. Bhattacharya, B., and El Gindy, H. (1984), A New Linear Convex Hull Algorithm for Simple Polygons,IEEE Transactions on Information Theory, Vol. 30, No. 1, pp. 85–88.

    Article  MATH  Google Scholar 

  9. Canny, J. (1988),The Complexity of Robot Motion Planning, ACM Doctoral Dissertation Series, MIT Press, Cambridge, Mass.

    Google Scholar 

  10. Collins, G. (1971), The Calculation of Multivariate Polynomial Resultants,Journal of the Association for Computing Machinery, Vol. 18, No. 4, pp. 515–532.

    MATH  MathSciNet  Google Scholar 

  11. Graham, R., and Yao, F. (1983), Finding the Convex Hull of a Simple Polygon,Journal of Algorithms, Vol. 4, pp. 324–331.

    Article  MATH  MathSciNet  Google Scholar 

  12. Guibas, L., Ramshaw, L., and Stolfi, J. (1983), A Kinetic Framework for Computational Geometry,Proceedings of the 24th Annual Symposium on Foundations of Computer Science, pp. 100–111.

  13. Johnstone, J., and Bajaj, C. (1990), The Sorting of Points along an Algebraic Curve,SIAM Journal on Computing, to appear.

  14. Lee, D. T. (1983), On Finding the Convex Hull of a Simple Polygon,International Journal of Computer and Information Sciences, Vol. 12, No. 2, pp. 87–98.

    Article  MATH  MathSciNet  Google Scholar 

  15. Lee, D. T., and Preparata, F. P. (1984), Computational Geometry—A Survey,IEEE Transactions on Computers, Vol. 33, No. 12, December 1984, pp. 872–1101.

    Article  MathSciNet  Google Scholar 

  16. Macaulay, F. (1902), Some Formulae in Elimination,Proceedings of the London Mathematical Society, Vol. 35, No. 1, pp. 3–27.

    Article  Google Scholar 

  17. McCallum, D., and Avis, D. (1979), A Linear Algorithm for Finding the Convex Hull of a Simple Polygon,Information Processing Letters, Vol. 9, No. 5, pp. 201–206.

    Article  MATH  MathSciNet  Google Scholar 

  18. Preparata, F. P., and Shamos, M. I. (1985),Computational Geometry: An Introduction, Springer-Verlag, New York.

    Google Scholar 

  19. Requicha, A. (1980), Representations of Rigid Solid Objects, inComputer-Aided Design, Lecture Notes in Computer Science, No. 89, Springer-Verlag, Berlin, pp. 2–78.

    Google Scholar 

  20. Schäffer, A., and Van Wyk C. (1987), Convex Hulls of Piecewise-Smooth Jordan Curves,Journal of Algorithms, Vol. 8, No. 1, pp. 66–94.

    Article  MATH  MathSciNet  Google Scholar 

  21. Schwartz, J. T. and Sharir, M. (1983), On the Piano Movers Problem: II, General Techniques for Computing Topological Properties of Real Algebraic Manifolds,Advances in Applied Mathematics, Vol. 4, pp. 298–351.

    Article  MATH  MathSciNet  Google Scholar 

  22. Shin, S., and Woo, T. (1986), Finding the Convex Hull of Simple Polygon in Linear Time,Pattern Recognition, Vol. 19, No. 6, pp. 453–458.

    Article  MATH  MathSciNet  Google Scholar 

  23. Souvaine, D. L. (1986), Computational Geometry in a Curved World, Ph.D Thesis, Computer Science Technical Report CS-TR-094-87, Princeton University.

  24. van der Waerden, B. (1950),Modern Algebra, Vol. II, Ungar, New York.

    Google Scholar 

  25. Walker, R., (1978),Algebraic Curves, Springer-Verlag, New York.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Purdue University, 47907, West Lafayette, IN, USA

    Chanderjit Bajaj

  2. Department of Computer Science, POSTECH, P.O. Box 125, 790-600, Pohang, Korea

    Myung -Soo Kim

Authors
  1. Chanderjit Bajaj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Myung -Soo Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by D. T. Lee.

Research supported in part by NSF Grant MIP-85 21356, ARO Contract DAA G29-85-C0018 under Cornell MSI, and ONR Contract N00014-88-K-0402. This paper is an updated version of a part of [6].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bajaj, C., Kim, M.S. Convex hulls of objects bounded by algebraic curves. Algorithmica 6, 533–553 (1991). https://doi.org/10.1007/BF01759058

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01759058

Key words