计算几何-邓俊辉-JunhuiDeng-清华大学.PPT,Computational Geometry 邓俊辉 清华大学计算机系 deng@ :10020/~deng ** Computational Geometry What CG Studies algorithms data structures for geometric problems discrete finite geometric objects one area of theoretica
算法过程: 判断两个凸链相交时,每次取两条链的中间边(medium edge,即单调链的中间一条边,例如:单调链 上有5条边,那就取第三条变)判断是否相交,如果相交则直接返回;如果不相交可去掉一半的链,然后递归遍历(PPT中叫bin search,类似于二分查找) 时间复杂度:O(log(n+m)) 2.构造问题(求相交多边形) 2.1 算法...
邓俊辉triangulationjunhui清华大学几何mwt Triangulation邓俊辉清华大学计算机系deng@tsinghua.eduhttp://vis.cs.tsinghua.edu:10020/~deng2017年4月10日星期一上午4时40分22JunhuiDeng,TsinghuaComputerTriangulationofPolygons☞Polygon–Existence:yeswith/withoutholes–Uniqueness:nousually☞Simplepolygons–O(nlogn)Garey...
计算几何-邓俊辉-清华大学.ppt,Triangulation;Triangulation of Polygons;Triangulation of Point Sets;Greedy triangulation;Greedy Triangulation;Delaunay triangulation;Minimum Weight Triangulation;Minimum Weight Triangulation;Steiner Triangulation