1 November 1992 Convex hulls of algebraic curves
Author Affiliations +
Proceedings Volume 1830, Curves and Surfaces in Computer Vision and Graphics III; (1992) https://doi.org/10.1117/12.131738
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States
A new algorithm based on curve tracing and decomposition techniques is presented for computing the convex hull of an algebraic curve defined implicitly by f(x,y) equals 0; the curve may have multiple components as well as singular points. The output is an ordered collection of line segments and sections of the curve represented by a sample point and interval bounds; this representation is suitable for rendering the convex hull by classical curve tracing techniques. Additionally, we present a point classification function for the convex hull based on Sturm sequences. Progress toward extending these results to algebraic surfaces is briefly discussed.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
David J. Kriegman, David J. Kriegman, Erliang Yeh, Erliang Yeh, Jean Ponce, Jean Ponce, } "Convex hulls of algebraic curves", Proc. SPIE 1830, Curves and Surfaces in Computer Vision and Graphics III, (1 November 1992); doi: 10.1117/12.131738; https://doi.org/10.1117/12.131738

Back to Top