Share Email Print
cover

Proceedings Paper

Convex hulls of algebraic curves
Author(s): David J. Kriegman; Erliang Yeh; Jean Ponce
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 1 November 1992
PDF: 10 pages
Proc. SPIE 1830, Curves and Surfaces in Computer Vision and Graphics III, (1 November 1992); doi: 10.1117/12.131738
Show Author Affiliations
David J. Kriegman, Yale Univ. (United States)
Erliang Yeh, Yale Univ. (United States)
Jean Ponce, Univ. of Illinois/Urbana-Champaign (United States)


Published in SPIE Proceedings Vol. 1830:
Curves and Surfaces in Computer Vision and Graphics III
Joe D. Warren, Editor(s)

© SPIE. Terms of Use
Back to Top