Iterative computation of the convex hull of a rational plane curve
Abstract
Reference
- Iterative computation of the convex hull of a rational plane curve
Recommendations
The Convex Hull of Rational Plane Curves
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 ...
Giftwrapping a curve with the convex hull
ACMSE '04: Proceedings of the 42nd annual ACM Southeast ConferenceWe develop an algorithm to compute the convex hull of a closed planar parametric curve. The algorithm sweeps a tangent around the curve, using bitangents to define events and effectively wrapping a tangent around the hull. First, a point on the hull is ...
Relative Convex Hull Determination from Convex Hulls in the Plane
IWCIA 2015: Proceedings of the 17th International Workshop on Combinatorial Image Analysis - Volume 9448A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and the problem ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in