منابع مشابه
The 3D Visibility Complex: A New Approach to the Problems of Accurate Visibility
Visibility computations are central in any computer graphics application. The most common way to reduce this expense is the use of approximate approaches using spatial subdivision. More recently analytic approaches efficiently encoding visibility have appeared for 2D (the visibility complex) and for certain limited cases in 3D (aspect graph, discontinuity meshes). In this paper we propose a new...
متن کاملNSCLC drug targets acquire new visibility.
F or researchers studying drug targets in non – small-cell lung cancer (NSCLC), 2010 was a very good year. The National Comprehensive Cancer Network recommended, for the fi rst time, that oncologists test their NSCLC patients for EGFR mutations and treat those testing positive with erlotinib (Tarceva). In June, the American Society of Clinical Oncology annual meeting featured a phase I/II trial...
متن کاملnew semigroup compactifications via the enveloping semigroups of associated flows
this thesis deals with the construction of some function algebras whose corresponding semigroup compactification are universal with respect to some properies of their enveloping semigroups. the special properties are of beigan a left zero, a left simple, a group, an inflation of the right zero, and an inflation of the rectangular band.
15 صفحه اولCone Visibility Decomposition Cone Visibility Decomposition Cone Visibility Decomposition Cone Visibility Decomposition Cone Visibility Decomposition Cone Visibility Decomposition
(a) (b) Figure 8: The nal set of directions from that covers G S in thick gray lines. Two views are provided with (a) presents the regular view of Figures 5 to 7 and (b) shows the entire Gauss map. See also Figure 1. (a) (b) Figure 6: The boundary and central silhouettes of G S in thick dark gray lines is projected onto the plane z = 1 in thick light gray lines, in (a). In (b), The convex hull ...
متن کاملWalking in the visibility complex with applications to visibility polygons and dynamic visibility
We first consider the set of faces of the complex representing rays issued from a given object. We define an order on these faces and show, once the visibility complex is computed, how to visit all of them with no additional data structure in optimal time O(kf ), where kf is the number of faces visited. Then we show how to use this walk to perform a topological sweep of the vertices incident to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Matrizes
سال: 2008
ISSN: 1982-8160,1982-2073
DOI: 10.11606/issn.1982-8160.v1i2p15-38