Algebraic pruning: a fast technique for curve and surface intersection
From MaRDI portal
Publication:1389457
DOI10.1016/S0167-8396(97)00008-3zbMath0897.65010MaRDI QIDQ1389457
Dinesh Manocha, Shankar Krishnan
Publication date: 30 June 1998
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
algorithm; resultants; algebraic curves; solid modeling; ray tracing; Bézier curves and surfaces; eigendecomposition; selected eigenvalues; curve-surface intersections
65D17: Computer-aided design (modeling of curves and surfaces)
Related Items
An optimal online algorithm for halfplane intersection, Intersection of a ruled surface with a free-form surface, Interface handling for three-dimensional higher-order XFEM-computations in fluid-structure interaction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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