In this paper we present methods for triangulation of infinite cylinders from image line silhouettes. We show numerically that linear estimation a general quadric surface is inherently badly posed problem. Instead propose to constrain the conic section circle, and give algebraic constraints on dual conic, models manifold. Using these derive fast minimal solver based three silhouette lines, can ...

We report numerical performance of self-adaptive triangulation approach to improve numerical solutions of Poisson equations using bivariate spline functions. Starting with a uniform triangulation, we use the gradient values of an initial spline solution to generate an updated triangulation. Both refining and coarsening the initial triangulation are combined together and a global triangulation i...

Given a set S of disjoint line segments in the plane, which we call sites, a segment triangulation of S is a partition of the convex hull of S into sites, edges, and faces. The set of faces is a maximal set of disjoint triangles such that the vertices of each triangle are on three distinct sites. The segment Delaunay triangulation of S is the segment triangulation of S whose faces are inscribab...

This study was to examine the effect of triangulation on depression in children. Clinical samples and nonclinical samples were taken from Utah and Illinois. Families were assessed for marital satisfaction and stability, family triangulation, and children’s depression levels by the Marital Adjustment Test, Marital Status Inventory, Nuclear Family Triangulation, and Children’s Depression Inventor...

Given a planar straight line graph we seek a covering triangulation whose minimumangle is as large as possible A covering triangulation is a Steiner triangulation with the following restriction No Steiner vertices may be added on an input edge We give an explicit upper bound on the largest possible minimum angle in any covering triangulation of a given input This upper bound depends only on loc...