Robustness problems and verified computations for computational geometry

Katsuhisa Ozaki, Takeshi Ogita, Shin'ichi Oishi

研究成果: Paper

抜粋

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
Shiga
期間09/10/709/10/9

ASJC Scopus subject areas

  • Modelling and Simulation

フィンガープリント Robustness problems and verified computations for computational geometry' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Ozaki, K., Ogita, T., & Oishi, S. (2009). Robustness problems and verified computations for computational geometry. 論文発表場所 Asia Simulation Conference 2009, JSST 2009, Shiga, Japan.