The Convex Hull of Rational Plane Curves
β Scribed by Gershon Elber; Myung-Soo Kim; Hee-Seok Heo
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 220 KB
- Volume
- 63
- Category
- Article
- ISSN
- 1524-0703
No coin nor oath required. For personal study only.
β¦ Synopsis
We present an algorithm that computes the convex hull of multiple rational curves in the plane. The problem is reformulated as one of finding the zero-sets of polynomial equations in one or two variables; using these zero-sets we characterize curve segments that belong to the boundary of the convex hull. We also present a preprocessing step that can eliminate many redundant curve segments.
π SIMILAR VOLUMES
## w x Let K x, y be the polynomial algebra in two variables over a field K of characteristic 0. In this paper, we contribute toward a classification of two-variable Ε½ w x. polynomials by classifying up to an automorphism of K x, y polynomials of the e., polynomials whose New- . ton polygon is e
0. Introdnction. W. BLASCHXE proved in his book "Kreis und Kugel" ([ 11, p. 157) the following theorem: An ovaloid which for every direction e (unit vector) of parallel light has plnnnr shadow-lines L'i (fig. 1) is an ellipsoid.
## Abstract We provided an answer to an open problem of A. Pietsch by giving a direct construction of the bornologically surjective hull π²^bsur^ of an operator ideal π² on __LCS's.__ Discussion of some extension problems of operator ideals were given.
## Abstract In this paper, we estimate an upper bound of the number of the cusps of a cuspidal plane curve. We prove that a cuspidal plane curve of genus __g__ has no more than (21__g__ +17)/2 cusps. For example, a rational cuspidal plane curve has no more than 8 cusps and an elliptic one has no mo