This paper is concerned with robustness problems in computational geometry. To solve geometric problems, numerical computations by floating-point arithmetic are preferred in terms of computational performance. However, when the rounding errors of floating-point computations accumulate, meaningless results of the problems may be obtained. It is called robustness problem in computational geometry. Recently, several verified algorithms for a two-dimensional orientation problem have been developed. By applying these algorithms, we develop an algorithm which overcomes this problem. Finally, we present numerical examples for a convex hull for a set of points on two-dimensional spaces to illustrate an efficiency of the proposed algorithm.
|出版ステータス||Published - 2009 1月 1|
|イベント||Asia Simulation Conference 2009, JSST 2009 - Shiga, Japan|
継続期間: 2009 10月 7 → 2009 10月 9
|Conference||Asia Simulation Conference 2009, JSST 2009|
|Period||09/10/7 → 09/10/9|
ASJC Scopus subject areas