On the computation of the straight lines contained in a rational surface
classification
🧮 math.AG
cs.SC
keywords
linesalgorithmcontainedrationalstraightsurfacerealapproaches
read the original abstract
In this paper we present an algorithm to compute the (real and complex) straight lines contained in a rational surface, defined by a rational parameterization. The algorithm relies on the well-known theorem of Differential Geometry that characterizes real straight lines contained in a surface as curves that are simultaneously asymptotic lines, and geodesics. We also report on an implementation carried out in Maple 18, and we compare the behavior of our algorithm with two brute-force approaches.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.