The identification of the relative position of two real coplanar ellipses can be reduced to the identification of the nature of the singular conics in the pencil they define and, in general, their location with respect to these singular conics in the pencil. This latter problem reduces to find the relative location of the roots of univariate polynomials. Since it is usually desired that all generated expressions are algebraic to simplify further analysis, including the case in which the ellipses undergone temporal variations, all recent methods available in the literature rely mathematical tools such as Sturm–Habicht sequences or subresultant sequences. This paper presents an alternative based on more elementary tools which results in a binary decision tree to classify the relative location of two ellipses in 12 different classes. The decision at each node is taken based on the sign of a set of algebraic/rational expressions on the ellipses coefficients, the most complex of them being third and second order polynomial discriminants.
This paper describes a contrained fairing method for implicit surfaces defined on a voxelization. This method is suitable for computing a closed smooth surface that approximates an initial set of face connected
Several CAD applications require a surface model of the modeled object consisting of a mesh of triangular facets. In this paper, a new algorithm for triangulation of trimmed surfaces is presented. The algorithm generates a triangulation that approximates the initial surface within a predefined tolerance. The approximation is conformal, without cracks in edges: a closed polyhedron is obtained in the case of a closed initial surface. The proposed algorithm improves the algorithm presented in (Brunet and Vigo, 1995) because it is based on more precise bounds which take into account the directional behavior of local surface curvature, and the resulting triangulation has a lower number of triangles.