Vertex versus pixel based intersection: using the GPU for investigation of surface intersections
zbMATH Open1121.65055MaRDI QIDQ3595666FDOQ3595666
Authors: Arnt R. Kristoffersen, Dimiter T. Georgiev, Lubomir Dechevski, Arne Lakså, Joakim Gundersen, Børre Bang 
Publication date: 28 August 2007
Recommendations
- Solving non-linear systems of equations on graphics processing units
- A `marching simplex' algorithm for approximate solution of nonlinear systems of equations and applications to branching of solutions and intersection problems
- Intersection Algorithms and CAGD
- GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems
- NURBS approximation of surface / surface intersection curves
surfacetensor productsingularityLagrange interpolationsystem of nonlinear equationsvertexintersectioncurvepixelcentral processor unit (CPU)graphic processor unit (GPU)piecewise linear B-spline approximation
Numerical computation of solutions to systems of equations (65H10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cited In (4)
- Accuracy of GPU-based B-spline evaluation
- A visibility-based surface reconstruction method on the GPU
- Solving non-linear systems of equations on graphics processing units
- A `marching simplex' algorithm for approximate solution of nonlinear systems of equations and applications to branching of solutions and intersection problems
Uses Software
This page was built for publication: Vertex versus pixel based intersection: using the GPU for investigation of surface intersections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595666)
