机译:计算多边形中漫反射路径的算法
School of Technology & Computer Science, Tata Institute of Fundamental Research, Mumbai 400005, India;
Institute of Radiophysics and Electronics, University of Calcutta, Kolkata 700009, India;
School of Computer Science, Carleton University, Ottawa KIS 5B6, Canada;
Advanced Computing and Microelectronics Unit, Indian Statistical Institute, Kolkata 700108, India;
Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur 721302, India;
School of Mathematical Sciences, Ramakrishna Mission Vivekananda University, Belur 711202, India;
diffuse reflection; specular reflection; visibility polygon; visibility graph; shortest path; minimum link path; greedy path;
机译:多边形障碍物计算高质量路径的高效算法
机译:一种快速的多边形膨胀算法,用于计算三组分系统可行解的面积。 II:理论基础,多边形反膨胀和FAC-PACK实施
机译:简单多边形的漫反射半径
机译:多边形中漫反射路径的计算算法
机译:R2中最短路径和可见性多边形的算法
机译:基于动态基本路径驱动程序的云计算系统调度算法
机译:用于计算多边形中的漫反射路径的算法