Search results
Results from the WOW.Com Content Network
This is a list of surfaces in mathematics. They are divided into minimal surfaces , ruled surfaces , non-orientable surfaces , quadrics , pseudospherical surfaces , algebraic surfaces , and other types of surfaces.
In mathematics, a quadric or quadric surface (quadric hypersurface in higher dimensions), is a generalization of conic sections (ellipses, parabolas, and hyperbolas).It is a hypersurface (of dimension D) in a (D + 1)-dimensional space, and it is defined as the zero set of an irreducible polynomial of degree two in D + 1 variables; for example, D = 1 in the case of conic sections.
The two families of lines on a smooth (split) quadric surface. In mathematics, a quadric or quadric hypersurface is the subspace of N-dimensional space defined by a polynomial equation of degree 2 over a field. Quadrics are fundamental examples in algebraic geometry. The theory is simplified by working in projective space rather than affine ...
Labs surface, a certain septic with 99 nodes; Endrass surface, a certain surface of degree 8 with 168 nodes; Sarti surface, a certain surface of degree 12 with 600 nodes; Quotient surfaces, surfaces that are constructed as the orbit space of some other surface by the action of a finite group; examples include Kummer, Godeaux, Hopf, and Inoue ...
A hyperboloid is a quadric surface, that is, a surface defined as the zero set of a polynomial of degree two in three variables. Among quadric surfaces, a hyperboloid is characterized by not being a cone or a cylinder, having a center of symmetry, and intersecting many planes into hyperbolas.
For example, a hyperboloid of one sheet is a quadric surface in ruled by two different families of lines, one line of each passing through each point of the surface; each family corresponds under the Plücker map to a conic section within the Klein quadric in .
Hidden-surface algorithms can be used for hidden-line removal, but not the other way around. Reif and Sen [17] proposed an O(log 4 n)-time algorithm for the hidden-surface problem, using O((n + v)/log n) CREW PRAM processors for a restricted model of polyhedral terrains, where v is the output size.
This page was last edited on 15 December 2005, at 11:04 (UTC).; Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply.