Convex hulls of objects bounded by algebraic curves
From MaRDI portal
Publication:802894
DOI10.1007/BF01759058zbMATH Open0726.68073OpenAlexW1970955419MaRDI QIDQ802894FDOQ802894
Authors: Myung-Soo Lim, Chanderjit L. Bajaj
Publication date: 1991
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01759058
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects of algebraic curves (14Q05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tracing surface intersections
- Title not available (Why is that?)
- Finding the convex hull of a simple polygon
- The Calculation of Multivariate Polynomial Resultants
- Automatic parameterization of rational curves and surfaces. III: Algebraic plane curves
- Title not available (Why is that?)
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- On finding the convex hull of a simple polygon
- Finding the convex hull of a simple polygon in linear time
- A new linear convex hull algorithm for simple polygons (Corresp.)
- A linear algorithm for finding the convex hull of a simple polygon
- Generation of configuration space obstacles: The case of moving algebraic curves
- Convex hulls of piecewise-smooth Jordan curves
- Sorting Points Along an Algebraic Curve
- Title not available (Why is that?)
Cited In (14)
- An algebraic algorithm to compute the exact general sweep boundary of a 2D curved object
- \(\alpha\)-concave hull, a generalization of convex hull
- An exact and efficient approach for computing a cell in an arrangement of quadrics
- On computing the convex hull of (piecewise) curved objects
- On determining optimal strategies in pursuit games in the plane
- A CONVEX DEFICIENCY TREE ALGORITHM FOR CURVED POLYGONS
- Curvature formulas for implicit curves and surfaces
- On determining optimal strategies in pursuit games in the plane
- An Output-Sensitive Convex Hull Algorithm for Planar Objects
- On the convex hull of a space curve
- Mean convex hulls and least area disks spanning extreme curves
- Computing pseudotriangulations via branched coverings
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Convex hulls of objects bounded by algebraic curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802894)