Abstract
We consider planar geometric models given by an explicit boundary of O(n) algebraic curve segments of maximum degree d. We present an O(n · d O(1)) time algorithm to compute its convex hull and an O((n loglogn+K) · d O(1)) time algorithms to compute various decompositions of an object, where K is the characteristic number of this object. Both operations, besides being solutions to interesting computational geometry problems, prove useful in motion planning with planar geometric models.
Research supported in part by NSF grant MIP-85-21356, ARO contract DAAG29-85-C0018 under Cornell MSI and a David Ross Fellowship.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Abhyankar, S., (1983), “Desingularization of Plane Curves,” Proc. of the Symp. in Pure Mathematics, Vol. 19, No. 1, pp. 11–14.
Abhyankar, S., and Bajaj, C., (1988), “Automatic Rational Parameterization of Curves and Surfaces III: Algebraic Plane Curves,” Computer Aided Geometric Design, to appear.
Aho, A., Hopcroft, J., and Ullman, J., (1974), The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass.
Bajaj, C., (1988), “Algorithmic Implicitization of Algebraic Curves and Surfaces,” CAPO Research Report CER-88-11, Department of Computer Science, Purdue University.
Bajaj, C., Hoffmann, C.M., Hopcroft, J.E., and Lynch, R.E., (1988), “Tracing Surface Intersections,” Computer Aided Geometric Design, to appear.
Bajaj, C., and Kim, M.-S., (1987), “Compliant Motion Planning with Geometric Models,” Proc. of the 3rd ACM Symposium on Computational Geometry, pp. 171–180, Modified version with title “Generation of Configuration Space Obstacles: The Case of Moving Algebraic Surfaces,” to appear in International Journal of Robotics Research.
Bajaj, C., and Kim, M.-S., (1987), “Generation of Configuration Space Obstacles: The Case of Moving Algebraic Curves,” Proc. 1987 IEEE International Conference on Robotics and Automation, North Carolina, pp. 979–984, Modified version to appear in Algorithmica.
Bajaj, C., and Kim, M.-S., (1987), “Decompositions of Objects Bounded by Algebraic Curves,” Computer Science Technical Report CSD-TR-677, Purdue University.
Bajaj, C., and Kim, M.-S., (1987), “Convex Hull of Objects Bounded by Algebraic Curves,” Computer Science Technical Report CSD-TR-697, Purdue University.
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.
Bhattacharya, B., and El Gindy, H., (1984), “A New Linear Convex Hull Algorithm for Simple Polygons,” IEEE Trans. Inform. Theory, Vol. 30, No. 1, pp. 85–88.
Canny, J., (1987), “The Complexity of Robot Motion Planning,” Ph.D. thesis, Dept. of EE and CS, MIT.
Dobkin, D.P., Souvaine, D.L., and Van Wyk, C.J., (1986), “Decomposition and Intersection of Simple Splinegons,” Computer Science Technical Report CS-TR-051-86, Princeton University.
Graham, R., and Yao, F., (1983), “Finding the Convex Hull of a Simple Polygon,” Journal of Algorithms, Vol. 4, pp. 324–331.
Hopcroft., (1986), “The Impact of Robotics on Computer Science,” CACM, Vol. 29, No. 6, pp. 486–498.
Johnston, J., (1987), “The Sorting of Points along an Algebraic Curve,” Ph.D Thesis, Cornell University.
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.
Lee, D. T., and Preparata, F. P., (1984), “Computational Geometry — A Survey,” IEEE Transactions on Computers, Vol. C-33, No. 12, pp. 872–1101.
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.
Preparata, F.P., and Shamos, M.I., (1985), Computational Geometry: An Introduction, Springer-Verlag, New York.
Requicha, A., (1980), “Representations of Rigid Solid Objects,” Computer Aided Design, Springer Lecture Notes in Computer Science 89, pp. 2–78.
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.
Schwartz, J. and Sharir, M., (1983), “On the Piano Movers Problem: II, General Techniques for Computing Topological Properties of Real Algebraic Manifolds,” Adv. Appl. Math. Vol. 4, pp. 298–351.
Schwartz, J. and Sharir, M., (1986), “Motion Planning and Related Geometric Algorithms in Robotics,” Robotics Research Technical Report, No. 79, New York University.
Souvaine, D.L., (1986), Computational Geometry in a Curved World, Ph.D. Thesis, Computer Science Technical Report CS-TR-094-87, Princeton University.
Tarjan, R.E., and Van Wyk, C.J., (1988), “An O (n log log n)-Time Algorithm for Triangulating Simple Polygons”, SIAM Journal on Computing, Vol. 17, No. 1, pp. 143–178.
van der Waerden, B., (1950), Modern Algebra Vol. II, New York, Ungar.
Walker, R., (1978), Algebraic Curves, Springer Verlag, New York.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bajaj, C., Kim, MS. (1988). Algorithms for planar geometric models. In: Lepistö, T., Salomaa, A. (eds) Automata, Languages and Programming. ICALP 1988. Lecture Notes in Computer Science, vol 317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19488-6_107
Download citation
DOI: https://doi.org/10.1007/3-540-19488-6_107
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19488-0
Online ISBN: 978-3-540-39291-0
eBook Packages: Springer Book Archive