Robustness problems and verified computations for computational geometry

Katsuhisa Ozaki, Takeshi Ogita, Shin'ichi Oishi

研究成果査読

抄録

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.

本文言語English
出版ステータスPublished - 2009 1 1
外部発表はい
イベントAsia Simulation Conference 2009, JSST 2009 - Shiga, Japan
継続期間: 2009 10 72009 10 9

Conference

ConferenceAsia Simulation Conference 2009, JSST 2009
国/地域Japan
CityShiga
Period09/10/709/10/9

ASJC Scopus subject areas

  • モデリングとシミュレーション

フィンガープリント

「Robustness problems and verified computations for computational geometry」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル