Efficient intersection detection of adjacent polynomial parametric surfaces
From MaRDI portal
Cites work
- A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections)
- A sampling algorithm computing self-intersections of parametric surfaces
- Computing intersection and self-intersection loci of parametrized surfaces using regular systems and Gröbner bases
- Computing self-intersection curves of rational ruled surfaces
- Efficient Collision Detection of Complex Deformable Models using AABB Trees
- ERIT—A Collection of Efficient and Reliable Intersection Tests
- scientific article; zbMATH DE number 1716506 (Why is no real title available?)
- scientific article; zbMATH DE number 2149746 (Why is no real title available?)
- Implementation of a divide-and-conquer method for intersection of parametric surfaces
- Implicit representation of parametric curves and surfaces
- Implicitization of a general union of parametric varieties
- Intersecting and trimming parametric meshes on finite element shells
- Intersection and self-intersection of surfaces by means of Bezoutian matrices
- Self-intersection computation for freeform surfaces based on a regional representation scheme for miter points
- Self-intersection detection and elimination in freeform curves and surfaces
- Surface/surface intersection
- Tangent, normal, and visibility cones on Bézier surfaces
This page was built for publication: Efficient intersection detection of adjacent polynomial parametric surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7266877)
