The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 수치적으로 견고한 기하학적 알고리즘을 설계하는 두 가지 방법을 조사합니다. 첫 번째 방법은 정밀 산술 방법으로, 수치 계산이 충분히 높은 정밀도로 수행되어 모든 위상학적 판단이 올바르게 이루어질 수 있습니다. 이 방법은 일반적으로 계산 비용과 구현 비용을 줄이기 위해 지연 평가 및 기호 섭동을 수반합니다. 두 번째 방법은 위상 구조의 일관성을 수치 계산보다 우선 순위가 높은 정보로 간주하여 불일치를 방지하는 위상 기반 방법입니다. 두 가지 방법 모두 구현 예를 통해 설명됩니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Kokichi SUGIHARA, "How to Make Geometric Algorithms Robust" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 3, pp. 447-454, March 2000, doi: .
Abstract: This paper surveys two methods for designing numerically robust geometric algorithms. The first method is the exact-arithmetic method, in which numerical computations are done in sufficiently high precision so that all the topological judgements can be done correctly. This method is usually accompanied with lazy evaluation and symbolic perturbation in order to reduce the computational cost and the implementation cost. The second method is the topology-oriented method, in which the consistency of the topological structure is considered as higher-priority information than numerical computation, and thus inconsistency is avoided. Both of the methods are described with the implementation examples.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_3_447/_p
부
@ARTICLE{e83-d_3_447,
author={Kokichi SUGIHARA, },
journal={IEICE TRANSACTIONS on Information},
title={How to Make Geometric Algorithms Robust},
year={2000},
volume={E83-D},
number={3},
pages={447-454},
abstract={This paper surveys two methods for designing numerically robust geometric algorithms. The first method is the exact-arithmetic method, in which numerical computations are done in sufficiently high precision so that all the topological judgements can be done correctly. This method is usually accompanied with lazy evaluation and symbolic perturbation in order to reduce the computational cost and the implementation cost. The second method is the topology-oriented method, in which the consistency of the topological structure is considered as higher-priority information than numerical computation, and thus inconsistency is avoided. Both of the methods are described with the implementation examples.},
keywords={},
doi={},
ISSN={},
month={March},}
부
TY - JOUR
TI - How to Make Geometric Algorithms Robust
T2 - IEICE TRANSACTIONS on Information
SP - 447
EP - 454
AU - Kokichi SUGIHARA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2000
AB - This paper surveys two methods for designing numerically robust geometric algorithms. The first method is the exact-arithmetic method, in which numerical computations are done in sufficiently high precision so that all the topological judgements can be done correctly. This method is usually accompanied with lazy evaluation and symbolic perturbation in order to reduce the computational cost and the implementation cost. The second method is the topology-oriented method, in which the consistency of the topological structure is considered as higher-priority information than numerical computation, and thus inconsistency is avoided. Both of the methods are described with the implementation examples.
ER -