Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 6073 for “"visibility"”.

  1. Visibility

    … unfair rituals in relation to women. Bringing visibility to what is ignored, I create works that are critical to the unfair expectations that society fosters, expectations which ultimately oppress women vis- -vis the (art) institution. Through different conceptual strategies, my work questions …

    csusb Repository record for Visibility (opens in a new tab)

  2. Unconscented Visibility

    … the research behind the work “Unconsented Visibility, (2022)” as part of my graduation thesis. In the following pages, I will elaborate on the aim of the piece and the related choices. This piece consists of three video pieces focusing on the Western gaze, surveillance and the events that …

    washington Repository record for Unconscented Visibility (opens in a new tab)

  3. Visibility of Performance

    … Damit einhergehend wird der Indikator der Visibility of Performance konstruiert, der über eine einfache Anwendung aussagen kann, wie gut ein PMS bezüglich seiner Wissensversorgung für ein Unternehmen passt. Mithin zeigt er die Güte der performancerelevanten Informationsversorgung in einem …

    qucosa-diss

  4. Visibility properties of polygons

    Two problems dealing with visibility in the interior of a polygon are investigated. We present a linear time algorithm for computing the stair-case visibility polygon from a point inside a simple polygon, which is optimal within a constant factor. We show that the problem of locating the minimum …

    unlv Repository record for Visibility properties of polygons (opens in a new tab) Download PDF for Visibility properties of polygons (opens in a new tab)

  5. Reconstruction Based on Visibility

    … itself in the interior of P. Let V(p) denote the visibility polygon of p. For any point p in P: for each tower t in V(p) the point p receives the coordinates of t and the Euclidean distance between t and p. From this information p can determine its coordinates. We show a tower-positioning …

    carleton Repository record for Reconstruction Based on Visibility (opens in a new tab)

  6. Fast and accurate visibility preprocessing

    Currently, the standard approach to visibility preprocessing algorithms is to use a form of approximate solution, known as conservative culling. Such algorithms over-estimate the set of visible polygons. This compromise has been considered necessary in order to perform visibility preprocessing …

    cape-town Repository record for Fast and accurate visibility preprocessing (opens in a new tab)

  7. The Visibility Freeze-Tag Problem

    … Problem in polygons, and we introduce the Visibility Freeze-Tag Problem, where one robot can awaken another robot by “seeing” it. Furthermore, we introduce a variant of the Visibility Freeze-Tag Problem, called the Line/Point Freeze Tag Problem, where each robot lies on an awakening line, …

    waterloo Repository record for The Visibility Freeze-Tag Problem (opens in a new tab)

  8. Dense Forests with Low Visibility

    … such that any line segment of length V(ε), the visibility function of the forest, comes within distance ε of an element of the set. The points with a ball of radius ε centred at them can be viewed as trees obstructing visibility, hence the name. Such sets are known to exist. The problem now is …

    toronto-retro Repository record for Dense Forests with Low Visibility (opens in a new tab)

  9. Rectangle Visibility Numbers of Graphs

    … to edges. We say that a graph G has a rectangle visibility representation if we can assign each vertex of G to a unique axis-aligned rectangle in the plane such that two vertices u and v are adjacent if and only if there exists an unobstructed horizontal or vertical channel of finite width …

    rit Repository record for Rectangle Visibility Numbers of Graphs (opens in a new tab)

  10. Visibility computation through image generalization

    … the image generalization paradigm for computing visibility. The paradigm is based on the observation that an image is a powerful tool for computing visibility. An image can be rendered efficiently with the support of graphics hardware and each of the millions of pixels in the image reports a …

    purdue-thes Repository record for Visibility computation through image generalization (opens in a new tab)

  11. Polygon visibility decompositions with applications.

    … decomposition of a polygon P. We call pi a visibility decomposition with respect to sigma if, for any object g ∈ sigma, we can cover g with o(|P|) of the subpolygons of pi. We investigate the application of visibility decompositions of polygons to solving problems of the forms …

    ottawa-retro Repository record for Polygon visibility decompositions with applications. (opens in a new tab)

  12. Visibility Analysis of Oahu Heiau

    … prominent locations. Heiau relied on their visibility to project power over the common people or makaʻainana-literally, the "eyes of the land." A spatial and statistical analysis is proposed to quantify the visibility of known heiau locations on the island of Oahu. This process relies on a …

    hawaii Repository record for Visibility Analysis of Oahu Heiau (opens in a new tab)

  13. Polygon reconstruction from visibility information

    … results attempt to rebuild polygons from visibility information. Reconstruction of a general polygon from its visibility graph is still open and only known to be in PSPACE; thus additional information, such as the ordering of the edges around nodes that corresponds to the order of the …

    lethbridge Repository record for Polygon reconstruction from visibility information (opens in a new tab)

  14. Visibility thresholds for flashing lights

    Thesis (Ph. D.)--Michigan State University. Department of Psychology, 1971

    msu Repository record for Visibility thresholds for flashing lights (opens in a new tab)

  15. On fully characterizing terrain visibility graphs

    … pairs of terrain vertices is called a terrain visibility graph. Understanding the graph theoretic properties of all terrain visibility graphs may help us understand the combinatorial structure of these geometric objects and help to address problems related to geometric visibility. The …

    ubc Repository record for On fully characterizing terrain visibility graphs (opens in a new tab) Download PDF for On fully characterizing terrain visibility graphs (opens in a new tab)

  16. Effect of Boundary Approximation on Visibility

    … In this thesis, we investigate the effect on the visibility properties of polygons when their boundaries are approximated to make them simpler. We present two algorithms for approximating a restricted class of polygons called 1.5 D terrain. We also present experimental investigations on the …

    unlv Repository record for Effect of Boundary Approximation on Visibility (opens in a new tab) Download PDF for Effect of Boundary Approximation on Visibility (opens in a new tab)

  17. Computational geometry algorithms for visibility problems

    … algorithmic problems involving k-crossing visibility. Given two points p and q and a set of polygonal obstacles in the plane, where p and q are in general position relative to the vertices of the obstacles, p and q are k -crossing visible to each other if and only if the line segment pq …

    manitoba Repository record for Computational geometry algorithms for visibility problems (opens in a new tab)

  18. Fast and High-Quality Visibility Determination

    … of this thesis is on improved algorithms for visibility queries that are used in graphics, motivated by challenges introduced by recent hardware developments. Geometry sampling lies at the core of rendering techniques, both for real-time and offline rendering, and generating images of higher …

    lund Repository record for Fast and High-Quality Visibility Determination (opens in a new tab) Download PDF for Fast and High-Quality Visibility Determination (opens in a new tab)

  19. Forward Scattering Meter for Visibility Measurements

    … through the atmosphere causing the effective visibility to decrease. The visibility is dependent on the extinction coefficient of the aerosol distribution that can be found using Mie scattering theory. In the case of a real environment a distribution of particle sizes must be considered where …

    maryland Repository record for Forward Scattering Meter for Visibility Measurements (opens in a new tab)

Page 1 of 304