The paper presents a topology-oriented robust algorithm for the incremental construction of line arrangements. In order to achieve a robust implementation, the topological and geometrical computations are strictly separated. The topological part is proved to be reliable without any assumption on the accuracy of the geometrical part. A self-correcting property is introduced to minimize the effect of numerical errors. Computational experiments show how the self-correcting property works, and we also discuss some applications of the algorithm.
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.
Copy
Daniel FOGARAS, Kokichi SUGIHARA, "Topology-Oriented Construction of Line Arrangements" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 5, pp. 930-937, May 2002, doi: .
Abstract: The paper presents a topology-oriented robust algorithm for the incremental construction of line arrangements. In order to achieve a robust implementation, the topological and geometrical computations are strictly separated. The topological part is proved to be reliable without any assumption on the accuracy of the geometrical part. A self-correcting property is introduced to minimize the effect of numerical errors. Computational experiments show how the self-correcting property works, and we also discuss some applications of the algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_5_930/_p
Copy
@ARTICLE{e85-a_5_930,
author={Daniel FOGARAS, Kokichi SUGIHARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Topology-Oriented Construction of Line Arrangements},
year={2002},
volume={E85-A},
number={5},
pages={930-937},
abstract={The paper presents a topology-oriented robust algorithm for the incremental construction of line arrangements. In order to achieve a robust implementation, the topological and geometrical computations are strictly separated. The topological part is proved to be reliable without any assumption on the accuracy of the geometrical part. A self-correcting property is introduced to minimize the effect of numerical errors. Computational experiments show how the self-correcting property works, and we also discuss some applications of the algorithm.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Topology-Oriented Construction of Line Arrangements
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 930
EP - 937
AU - Daniel FOGARAS
AU - Kokichi SUGIHARA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2002
AB - The paper presents a topology-oriented robust algorithm for the incremental construction of line arrangements. In order to achieve a robust implementation, the topological and geometrical computations are strictly separated. The topological part is proved to be reliable without any assumption on the accuracy of the geometrical part. A self-correcting property is introduced to minimize the effect of numerical errors. Computational experiments show how the self-correcting property works, and we also discuss some applications of the algorithm.
ER -