Fuzzy visibility problems in computational geometry계산기하학에서의 퍼지 가시성 문제

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 526
  • Download : 0
By the classical visibility definition in computational geometry, two points are visible from each other if only the two points can be connected by a line segment without any disturbance. In the real world, however, the visibility is determined by more complicate conditions and the word "visible" has different meaning according to the application where the visibility is used. In order to represent such characteristics, fuzzy visibility defined based on the fuzzy set theory is proposed in this thesis. According to the condition by which the visibility degree is determined, two kinds of fuzzy visibilities are considered in this thesis. One is Type I fuzzy visibility which is defined on the common sense that the closer object is visible better. The other is Type II fuzzy visibility in which the visibility degree is determined by the number of guards from which an object is visible simultaneously. The relation between the distance and the degree of visibility is considered in Type I fuzzy visibility. Using a Type I fuzzy visibility, fuzzy polygons such as fuzzy kernel and fuzzy visibility polygons are introduced and their shapes and properties are discussed. All points in a fuzzy polygon have membership values which is defined by an Type I fuzzy visibility function and represent their degrees of membership for the kernel or the visibility polygons. By an $\alpha$-cut of the Type I fuzzy visibility, $\alpha$-visibility is defined. Two points are said to be $\alpha$-visible if they are visible to the degree of $\alpha$. Using the $\alpha$-visibility, two visibility problems are defined and solved. First, the linear algorithms are presented to compute the $\alpha$-visibility polygons. And a cubic algorithm is developed for computing a rectilinear path problem when the path must be constructed with the minimum number of edges and all adjacent vertices in the path must be $\alpha$-visible. The relation between the number of guards and the degree of visibility is conside...
Advisors
Lee, Kwang-Hyungresearcher이광형researcher
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
1995
Identifier
101785/325007 / 000895224
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전산학과, 1995.8, [ viii, 157 p. ]

URI
http://hdl.handle.net/10203/33043
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=101785&flag=dissertation
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0