首页> 外文会议>Algorithms -ESA 2003 >Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves
【24h】

Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves

机译:Jacobi曲线:计算非奇异代数曲线排列的精确拓扑

获取原文
获取原文并翻译 | 示例

摘要

We present an approach that extends the Bentley-Ottmann sweep-line algorithm to the exact computation of the topology of arrangements induced by non-singular algebraic curves of arbitrary degrees. Algebraic curves of degree greater than 1 are difficult to handle in case one is interested in exact and efficient solutions. In general, the coordinates of intersection points of two curves are not rational but algebraic numbers and this fact has a great negative impact on the efficiency of algorithms coping with them. The most serious problem when computing arrangements of non-singular algebraic curves turns out be the detection and location of tangential intersection points of two curves. The main contribution of this paper is a solution to this problem, using only rational arithmetic. We do this by extending the concept of Jacobi curves introduced in [11]. Our algorithm is output-sensitive in the sense that the algebraic effort we need for sweeping a tangential intersection point depends on its multiplicity.
机译:我们提出了一种将Bentley-Ottmann扫频线算法扩展到由任意度数的非奇异代数曲线引起的排列拓扑的精确计算的方法。如果人们对精确和有效的解决方案感兴趣,则难以处理大于1的代数曲线。通常,两条曲线的交点的坐标不是有理数而是代数数,这一事实对处理它们的算法的效率有很大的负面影响。计算非奇异代数曲线的排列时,最严重的问题是两条曲线的切线交点的检测和位置。本文的主要贡献是仅使用有理算法即可解决该问题。为此,我们扩展了[11]中引入的雅可比曲线的概念。我们的算法在某种意义上是输出敏感的,因为我们扫切切交点所需的代数工作量取决于其多重性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号