Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints
From MaRDI portal
Publication:2127702
Recommendations
Cites work
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- A unified approach to verification in 5-axis freeform milling environments.
- An Optimal Algorithm for Finding the Kernel of a Polygon
- An efficient algorithm for determining the convex hull of a finite planar set
- Arc fibrations of planar domains
- Computational geometry in a curved world
- Subdivision methods for solving polynomial equations
- THE KERNEL OF A FREEFORM SURFACE AND ITS DUALITY WITH THE CONVEX HULL OF ITS TANGENTIAL SURFACE
- The Robot Localization Problem
- The quickhull algorithm for convex hulls
- Visibility Algorithms in the Plane
- Volumetric untrimming: precise decomposition of trimmed trivariates into tensor products
Cited in
(2)
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)