Graph-theoretical properties of parallelism in the digital plane
نویسندگان
چکیده
منابع مشابه
Graph-theoretical properties of parallelism in the digital plane
We propose different graph-theoretical algorithms to partition a set of digitized lines into parallel groups, i.e., subsets in which each line is parallel to the other lines in the subset. The slope of a digitized line is not a fixed real number, but is represented by an interval. Likewise, the parallel relations of a collection of lines is represented by an interval graph. The extraction of pa...
متن کاملGraph Theoretical Properties of Arcs in the Plane and Fashoda Meet Theorem
We define a graph on an abstract set, edges of which are pairs of any two elements. For any finite sequence of a plane, we give a definition of nodic, which means that edges by a finite sequence are crossed only at terminals. If the first point and the last point of a finite sequence differs, simpleness as a chain and nodic condition imply unfoldedness and s.n.c. condition. We generalize Goboar...
متن کاملcontrol of the optical properties of nanoparticles by laser fields
در این پایان نامه، درهمتنیدگی بین یک سیستم نقطه کوانتومی دوگانه(مولکول نقطه کوانتومی) و میدان مورد مطالعه قرار گرفته است. از آنتروپی ون نیومن به عنوان ابزاری برای بررسی درهمتنیدگی بین اتم و میدان استفاده شده و تاثیر پارامترهای مختلف، نظیر تونل زنی(که توسط تغییر ولتاژ ایجاد می شود)، شدت میدان و نسبت دو گسیل خودبخودی بر رفتار درجه درهمتنیدگی سیستم بررسی شده اشت.با تغییر هر یک از این پارامترها، در...
15 صفحه اولParallelism of the Occlusal Plane with the Ala-tragus Line in Various Posterior References in Dentate Patients
Background and purpose: Occlusal plane in edentulous patients is lost and needs to be reconstructed. The most common method for reconstructing occlusal plane is to make it parallel to the ala-tragus line. There are disagreements about the posterior reference of ala-tragus line. The aim of this study was to determine the best posterior reference of ala-tragus line (superior, middle and anterior ...
متن کاملDigital metrics: A graph-theoretical approach
Consider the following two graphs M a n d N, both with vertex set Z×Z, where Z is the set of all integers. In M, two vertices are adjacent when their euclidean distance is 1, while in N, adjacency is obtained when the distance is either 1 or 1/2. By definition, H is a metric subgraph of the graph G if the distance between any two points o f / 4 is the same as their distance in G. We determine a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00228-7