Robustly and efficiently computing algebraic curves and surfaces
From MaRDI portal
Recommendations
Cited in
(14)- An efficient algorithm for the stratification and triangulation of an algebraic surface
- Efficient representation in spaces of plane curves
- Robust plotting of polar algebraic curves, space algebraic curves, and offsets of planar algebraic curves
- Plotting algebraic space curves by cluster computing
- Exact symbolic-numeric computation of planar algebraic curves
- scientific article; zbMATH DE number 1254234 (Why is no real title available?)
- scientific article; zbMATH DE number 696782 (Why is no real title available?)
- Algorithm 976
- On the complexity and computation of view graphs of piecewise smooth algebraic surfaces
- Algorithm 992
- A generic algebraic kernel for non-linear geometric applications
- Real-Time Algebraic Surface Visualization
- Efficient and exact manipulation of algebraic points and curves
- Effective computational geometry for curves and surfaces
This page was built for publication: Robustly and efficiently computing algebraic curves and surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879132)