Topology-Oriented Construction of Line Arrangements(Special Section on Discrete Mathematics and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 2002-05-01
著者
-
FOGARAS Daniel
The authors are with the Department of Mathematical Engineering and Information Physics, Graduate Sc
-
SUGIHARA Kokichi
Presently, with the Department of Computer Science and Information Theory, Budapest University of Te
-
Fogaras D
The Authors Are With The Department Of Mathematical Engineering And Information Physics Graduate Sch
-
Fogaras Daniel
The Authors Are With The Department Of Mathematical Engineering And Information Physics Graduate Sch
-
Sugihara Kokichi
Presently With The Department Of Computer Science And Information Theory Budapest University Of Tech