Many applications in computer graphics and related fields can benefit from automatic simplification of complex polygonal surface models. Applications are often confronted with either very densely over-sampled surfaces or models too complex for the limited available hardware capacity. An effective algorithm for rapidly producing high-quality approximations of the original model is a valuable too...

We study the ∗-Ricci operator on Hopf real hypersurfaces in complex quadric. prove that for quadric, tensor is symmetric if and only unit normal vector field singular. In following, we obtain of quadric symmetric, then both Reeb-flow-invariant Reeb-parallel. As correspondence to semi-symmetric Ricci tensor, give a classification with tensor.

Computing the intersection curve of two quadrics is a fundamental problem in computer graphics and solid modeling. We present an algebraic method for classifying and parameterizing the intersection curve of two quadric surfaces. The method is based on the observation that the intersection curve of two quadrics is birationally related to a plane cubic curve. In the method this plane cubic curve ...

The Monte Carlo programme PENEPMA performs simulations of X-ray emission from samples bombarded with electron beams. It is both based on the general-purpose Monte Carlo simulation package PENELOPE, an elaborate system for the simulation of coupled electron-photon transport in arbitrary materials, and on the geometry subroutine package PENGEOM, which tracks particles through complex material str...

Quadratic surfaces are frequently used primitives in geometric modeling and scientific visualization, such as rendering of tensor fields, particles, and molecular structures. While high visual quality can be achieved using sophisticated ray tracing techniques, interactive applications typically use either coarsely tessellated polygonal approximations or pre-rendered depth sprites, thereby tradi...

We present an elementary proof of the fact that any nonsingular cubic surface in P3 over an algebraically closed field not of characteristic 2 will contain exactly 27 lines. During the course of this proof, we present a way to label these lines in terms of a fixed line l and another fixed line m which is disjoint from l in such a way that we can determine which of the 26 other lines a given lin...

To support exactly tracking a neutron moving along a given line segment through a CAD model with quadric surfaces, this paper considers the arithmetic precision required to compute the order of intersection points of two quadrics along the line segment. When the orders of all but one pair of intersections are known, we show that a resultant can resolve the order of the remaining pair using only...

Abstract A robust and efficient algorithm for the identification of algebraic surface patches from noisy data is detailed here. The aim is to reconstruct the B-rep of solids made of engineering forms constructs. There is no apriori knowledge on the number of patches. Algebraic surfaces are embedded on hyperplanes in , where is the number of points sufficient to determine an algebraic surface. A...

Making suitable generalizations of known results we prove some general facts about Gaussian maps. The above are then used, in the second part of the article, to give a set of conditions that insure the surjectivity of Gaussian maps for curves on Enriques surfaces. To do this we also solve a problem of independent interest: a tetragonal curve of genus g ≥ 7 lying on an Enriques surface and gener...