نتایج جستجو برای: intersection lines and points

تعداد نتایج: 16867196  

2006
Cécile Barat Jean-François Menudet Hanene Louhichi Thierry Fournel

We address the problem of feature correspondences in images of coplanar ellipses with objective to benefit of robust ellipse fitting algorithm. The main difficulty is the lack of projective invariant points immediately available. Therefore, our key idea is to construct virtual line and point features using the property of tangent invariance under perspective projection. The proposed method requ...

Journal: :Periodica Mathematica Hungarica 2006

Journal: :Theoretical Computer Science 2004

Journal: :Comput. Geom. 2007
Prosenjit Bose Anil Maheshwari Pat Morin Jason Morrison Michiel H. M. Smid Jan Vahrenhold

We develop a number of space-efficient tools including an approach to simulate divide-and-conquer space-efficiently, stably selecting and unselecting a subset from a sorted set, and computing the kth smallest element in one dimension from a multi-dimensional set that is sorted in another dimension. We then apply these tools to solve several geometric problems that have solutions using some form...

Journal: :Computer-Aided Design 2001
Cha-Soo Jun Dong-Soo Kim Deok-Soo Kim Hyun-Chan Lee Ji Seon Hwang Tien-Chien Chang

Presented in this paper is an algorithm to compute the intersections of a parametric regular surface with a set of parallel planes. Rather than using an ordinary surface-plane intersection algorithm repeatedly, we pre-process a surface to identify points, called topology transition points (TTP's), on the surface where the topologies of intersection curves change. It turns out that such points c...

Journal: : 2021

This paper aim to create method observe elevation of points, tower and structure that can’t be reach (or don’t need reach), this depend on concept space intersection where intersect two known direction vectors start from location points or can located simple computation. discuss too accuracy improvement for observed by above method.

2000
Kurt Mehlhorn Michael Seel

Many geometric algorithms that are usually formulated for points and segments generalize easily to inputs also containing rays and lines. The sweep algorithm for segment intersection is a prototypical example. Implementations of such algorithms do, in general, not extend easily. For example, segment endpoints cause events in sweep line algorithms, but lines have no endpoints. We describe a gene...

2011
BRIAN OSSERMAN JOSEPH RABINOFF

We prove that if X,X are closed subschemes of a torus T over a non-Archimedean field K, of complementary codimension and with finite intersection, then the stable tropical intersection along a (possibly positive-dimensional, possibly unbounded) connected component C of Trop(X) ∩ Trop(X) lifts to algebraic intersection points, with multiplicities. This theorem requires potentially passing to a s...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید