Algebraic pruning: a fast technique for curve and surface intersection
From MaRDI portal
Publication:1389457
DOI10.1016/S0167-8396(97)00008-3zbMath0897.65010OpenAlexW2093395777MaRDI QIDQ1389457
Dinesh Manocha, Shankar Krishnan
Publication date: 30 June 1998
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8396(97)00008-3
algorithmresultantsalgebraic curvessolid modelingray tracingBézier curves and surfaceseigendecompositionselected eigenvaluescurve-surface intersections
Related Items (4)
Interrogation of spline surfaces with application to isogeometric design and analysis of lattice-skin structures ⋮ Intersection of a ruled surface with a free-form surface ⋮ An optimal online algorithm for halfplane intersection ⋮ Interface handling for three-dimensional higher-order XFEM-computations in fluid-structure interaction
Uses Software
Cites Work
- A dimensionality paradigm for surface interrogations
- On the numerical condition of polynomials in Bernstein form
- Fat arcs: A bounding region with cubic convergence
- Algorithm for algebraic curve intersection
- The evaluation of the zeros of ill-conditioned polynomials. I, II
- Implicit representation of parametric curves and surfaces
- Algorithms for intersecting parametric and algebraic curves I
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algebraic pruning: a fast technique for curve and surface intersection