Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints
From MaRDI portal
Publication:2127702
DOI10.1016/J.CAGD.2022.102075zbMATH Open1489.65040OpenAlexW4220915195MaRDI QIDQ2127702FDOQ2127702
Authors: Q. Youn Hong, Gershon Elber
Publication date: 21 April 2022
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2022.102075
Recommendations
Cites Work
- An efficient algorithm for determining the convex hull of a finite planar set
- The quickhull algorithm for convex hulls
- Title not available (Why is that?)
- Visibility Algorithms in the Plane
- Subdivision methods for solving polynomial equations
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Computational geometry in a curved world
- The Robot Localization Problem
- Arc fibrations of planar domains
- A unified approach to verification in 5-axis freeform milling environments.
- Volumetric untrimming: precise decomposition of trimmed trivariates into tensor products
- THE KERNEL OF A FREEFORM SURFACE AND ITS DUALITY WITH THE CONVEX HULL OF ITS TANGENTIAL SURFACE
Cited In (2)
Uses Software
This page was built for publication: Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127702)