|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Algorithms for Rendering Realistic Terrain Image Sequences and Their Parallel Implementation显示文摘 | GENNADY AGRANOV CRAIG GOTSMAN | 1995 | The Visual Computer1995，11，9： | 1 |
| 2 | High Quality Compatible Triangulations显示文摘 | Vitaly Surazhsky Craig Gotsman | 2004 | Engineering with Computers2004，20，2： | 1 |
| 3 | Fundamentals of spherical parameterization for 3D meshes 显示文摘 | Craig Gotsman Xianfeng Gu Alia Sheff | 2003 | ACM Transactions on Graphics (TOG)2003，22，3： | 1 |
| 4 | Visualization of large terrain in resource limited computing environments 显示文摘 | Rabnovich Boris Gotsman Craig | 2007 | Proc Visualization''2007，2007，： | 1 |
| 5 | Dynamic Color Quantization of Video Sequences显示文摘 | Evgeny Roytman Craig Gotsman | 1995 | IEEE Transactions on Visualization and Computer Graphics1995，1，3： | 1 |
| 6 | On the optimality of spectral compression of mesh data显示文摘 | Mirela Ben-Chen Craig Gotsman | 2005 | ACM Transactions on Graphics (TOG)2005，，1： | 1 |
| 7 | Enhancement by image-dependent warping显示文摘 | NUR ARAD CRAIG GOTSMAN | 1989 | IEEE Trans on Image Processing1989，8，1： | 1 |
| 8 | Antifaces :A Novel, Fast Method for Image Detection显示文摘 | D Keren M Osadchy Craig Gotsman | 2001 | IEEE Traps on Pattern Analysis and Machine Intelligence2001，23，7： | 1 |
| 9 | Antifaces: A Novel, Fast Method for Image Detection显示文摘 | EANIEL Keren MARGARITA Osadchy CRAIG Gotsman | 2001 | IEEE Trans PAMI2001，23，7： | 1 |
| 10 | Efficient fastest-path computations for road maps显示文摘In the age of real-time online traffic information and GPS-enabled devices,fastest-path computations between two points in a road network modeled as a directed graph,where each directed edge is weighted by a“travel time”value,are becoming a standard feature of many navigation-related applications.To support this,very efficient computation of these paths in very large road networks is critical.Fastest paths may be computed as minimal-cost paths in a weighted directed graph,but traditional minimal-cost path algorithms based on variants of the classical Dijkstra algorithm do not scale well,as in the worst case they may traverse the entire graph.A common improvement,which can dramatically reduce the number of graph vertices traversed,is the A*algorithm,which requires a good heuristic lower bound on the minimal cost.We introduce a simple,but very effective,heuristic function based on a small number of values assigned to each graph vertex.The values are based on graph separators and are computed efficiently in a preprocessing stage.We present experimental results demonstrating that our heuristic provides estimates of the minimal cost superior to those of other heuristics.Our experiments show that when used in the A*algorithm,this heuristic can reduce the number of vertices traversed by an order of magnitude compared to other heuristics. | Renjie Chen Craig Gotsman | 2021 | Computational Visual Media2021，7，2： | 1 |
| 11 | Fitting curves and surfaces with constrained implicit polynomials显示文摘 | D Keren Craig Gotsman | 1999 | IEEE Transactions on Pattern Analysis and Machine Intelligence1999，21，1： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员