نتایج جستجو برای: visibility

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

2007
Martin Brösamle Christoph Hölscher Georg Vrachliotis

This paper is inspired by a wayfinding study by Hölscher et al. (2005), who find serious wayfinding difficulties in a complex multi-level building and identify architectural properties related to the difficulties. The present study re-analyzes the qualitative results in terms of Space Syntax measures and thus ties them down to formal properties of the architectural structure. The analysis caref...

2006
Yi-Jun Yang Hui Zhang Jun-Hai Yong Wei Zeng Jean-Claude Paul Jia-Guang Sun

An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...

2010
Leyla Kazemi Farnoush Banaei Kashani Cyrus Shahabi Ramesh Jain

Visibility query is fundamental to many analysis and decisionmaking tasks in virtual environments. Visibility computation is time complex and the complexity escalates in large and dynamic environments, where the visibility set (i.e., the set of visible objects) of any viewpoint is probe to change at any time. However, exact visibility query is rarely necessary. Besides, it is inefficient, if no...

Journal: :PloS one 2015
Kangkang Yu Zhenghao Chen Jian Gao Yuechong Zhang Shulan Wang Fahe Chai

This study is to distinguish the objective and subjective measures of atmospheric visibility, and investigate the relationship between the two measures as well as the effect on the people's behavioral intentions on air pollution in China. A mixed method was adopted in this study combining both lab experiments to measure objective atmospheric visibility and a questionnaire survey to measure subj...

2018
Ping Li Sungyong You Christopher Nguyen Yanping Wang Jayoung Kim Deepika Sirohi Asha Ziembiec Daniel Luthringer Shih-Chieh Lin Timothy Daskivich Jonathan Wu Michael R Freeman Rola Saouaf Debiao Li Hyung L. Kim

MRI is used to image prostate cancer and target tumors for biopsy or therapeutic ablation. The objective was to understand the biology of tumors not visible on MRI that may go undiagnosed and untreated. Methods: Prostate cancers visible or invisible on multiparametric MRI were macrodissected and examined by RNAseq. Differentially expressed genes (DEGs) based on MRI visibility status were cross-...

2014
P. Goyal

The air pollution problem has been serious in Delhi due to the rapidly expanding economic, industrial and vehicular developments. It has significant influences on atmospheric visibility, whose degradation dominates in urban areas. Increased air pollution in urban area may lead to the atmospheric reactions, resulting into the formation of secondary pollutants similar to cloud the condensation pr...

2014
Giuseppe Antonio Di Luna Paola Flocchini Federico Poloni Nicola Santoro Giovanni Viglietta

Consider a finite set of identical entities, called robots, which can move freely in the Euclidean plane. Let p(t) denote the location of robot p at time t; a robot p can see robot q at time t if at that time no other robot lies in the line segment p(t)q(t). We consider the basic problem called Mutual Visibility: starting from arbitrary distinct locations, within finite time the robots must rea...

Journal: :Discrete Applied Mathematics 2013
Jérémie Chalopin Shantanu Das Yann Disser Matús Mihalák Peter Widmayer

This paper gives an introduction to the problem of mapping simple polygons with autonomous agents. We focus on minimalistic agents that move from vertex to vertex along straight lines inside a polygon, using their sensors to gather local observations at each vertex. Our attention revolves around the question whether a given configuration of sensors and movement capabilities of the agents allows...

Journal: :CoRR 2013
Mojtaba Nouri Bygi Mohammad Ghodsi

This paper considers the problem of computing the weak visibility polygon (WVP) of any query line segment pq (or WVP(pq)) inside a given simple polygon P. We present an algorithm that preprocesses P and creates a data structure from which WVP(pq) is efficiently reported in an output sensitive manner. Our algorithm needs O(n log n) time and O(n) space in the preprocessing phase to report WVP(pq)...

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

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