We present a certified algorithm based on subdivision for computing an isotopic approximation to a pair of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main challenge in this computation is to correctly and efficiently compute the intersections of the curves. To address this issue, we introduce a new, but simple test that guarantees the global correctness of our output.
翻译:我们提出了一个基于分层的认证算法,用于计算平面上一对曲线的同位素近似值。我们的算法基于普朗廷加和维格特的认证曲线近近似算法。这个计算的主要挑战是正确和有效地计算曲线的交叉点。为了解决这个问题,我们引入了一个新的但简单的测试,保证了我们输出的全球正确性。