اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTangent Quadrics in Real 3-Space
88
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We examine quadratic surfaces in 3-space that are tangent to nine given figures. These figures can be points, lines, planes or quadrics. The numbers of tangent quadrics were determined by Hermann Schubert in 1879. We study the associated systems of polynomial equations, also in the space of complete quadrics, and we solve them using certified numerical methods. Our aim is to show that Schuberts problems are fully real.
قيم البحث
اقرأ أيضاً
Two triples of triangles having pairwise disjoint outlines in 3-space are called combinatorially isotopic if one triple can be obtained from the other by a continuous motion during which the outlines of the triangles remain pairwise disjoint. We conj
ecture that it can be algorithmically checked if an (ordered or unordered) triple of triangles is combinatorially isotopic to a triple of triangles having pairwise disjoint convex hulls. We also conjecture that any unordered triple of pairwise disjoint triangles in 3-space belongs to one of the 5 types of such triples listed in the paper. We present an elementary proof that triples of different types are not combinatorially isotopic.
We provide an algorithm to check whether two rational space curves are related by a similarity. The algorithm exploits the relationship between the curvatures and torsions of two similar curves, which is formulated in a computer algebra setting. Heli
cal curves, where curvature and torsion are proportional, need to be distinguished as a special case. The algorithm is easy to implement, as it involves only standard computer algebra techniques, such as greatest common divisors and resultants, and Grobner basis for the special case of helical curves. Details on the implementation and experimentation carried out using the computer algebra system Maple 18 are provided.
Two-dimensional linear spaces of symmetric matrices are classified by Segre symbols. After reviewing known facts from linear algebra and projective geometry, we address new questions motivated by algebraic statistics and optimization. We compute the
reciprocal curve and the maximum likelihood degrees, and we study strata of pencils in the Grassmannian.
The intersection of a quadric and a cubic surface in 3-space is a canonical curve of genus 4. It has 120 complex tritangent planes. We present algorithms for computing real tritangents, and we study the associated discriminants. We focus on space sex
tics that arise from del Pezzo surfaces of degree one. Their numbers of planes that are tangent at three real points vary widely; both 0 and 120 are attained. This solves a problem suggested by Arnold Emch in 1928.
We present a real-time algorithm that finds the Penetration Depth (PD) between general polygonal models based on iterative and local optimization techniques. Given an in-collision configuration of an object in configuration space, we find an initial
collision-free configuration using several methods such as centroid difference, maximally clear configuration, motion coherence, random configuration, and sampling-based search. We project this configuration on to a local contact space using a variant of continuous collision detection algorithm and construct a linear convex cone around the projected configuration. We then formulate a new projection of the in-collision configuration onto the convex cone as a Linear Complementarity Problem (LCP), which we solve using a type of Gauss-Seidel iterative algorithm. We repeat this procedure until a locally optimal PD is obtained. Our algorithm can process complicated models consisting of tens of thousands triangles at interactive rates.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
