An Efficient Surface Intersection Algorithm Based on Lower-Dimensional Formulation

@article{Krishnan1997AnES,
  title={An Efficient Surface Intersection Algorithm Based on Lower-Dimensional Formulation},
  author={Shankar Krishnan and Dinesh Manocha},
  journal={ACM Trans. Graph.},
  year={1997},
  volume={16},
  pages={74-106}
}
We present an efficient algorithm to compute the intersection of algebraic and NURBS surfaces. Our approach is based on combining the marching methods with the algbraic formulation. In particular, we propose and matrix computations. We present algorithms to compute a start point on each component of the intersection curve (both open and closed components), detect the presence of singularities, and find all the curve branches near the singularity. We also suggest methods to compute the step size… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
73 Extracted Citations
7 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 73 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-7 of 7 references

A new family of curves for industrial applications

  • D. A. FIELD, R. FIELD
  • Tech. Rep. GMR-7571, General Motors Research…
  • 1992
Highly Influential
4 Excerpts

The eliminant of three quantics in two independent variables

  • A. L. DIXON
  • Proc. London Math. Soc. 6, 49–69, 209–236.
  • 1908
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…