“线段求交算法”的概念、定义、翻译、参考文献-科学参考

单词	线段求交算法
释义	线段求交算法 Encyclopedia 理学计算几何算法释 segment intersection线段求交算法线段求交算法是解决线段求交问题的算法。在线段求交问题中，给定一组线段（用顶点坐标表示），要求：①判断是否有两条线段相交；②输出所有相交的线段对。
随便看	National Museum of Fine Arts of Algiers National Museum of Fine Arts of Cuba National Museum of Finland National Museum of Ghana National Museum of Hainan Tibetan Autonomous Prefecture National Museum of History National Museum of History and Art National Museum of History of Moldova National Museum of Huangnan Tibetan Autonomous Prefecture National Museum of Iceland National Museum of Ireland National Museum of Korea National Museum of Liberia National Museum of Lithuania National Museum of Malaysia National Museum of Mali National Museum of Medicine National Museum of Military History National Museum of Modern and Contemporary Art National Museum of Modern Chinese Literature National Museum of Montenegro National Museum of Myanmar National Museum of Namibia National Museum of Natural History National Museum of Nepal

科学参考收录了854744条科技类词条，基本涵盖了常见科技类参考文献及英语词汇的翻译，是科学学习和研究的有利工具。