咨询与建议

限定检索结果

文献类型

  • 5,253 篇 会议
  • 328 篇 期刊文献
  • 6 册 图书

馆藏范围

  • 5,588 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 4,476 篇 工学
    • 4,174 篇 计算机科学与技术...
    • 3,745 篇 软件工程
    • 546 篇 控制科学与工程
    • 409 篇 光学工程
    • 407 篇 信息与通信工程
    • 280 篇 生物工程
    • 195 篇 建筑学
    • 176 篇 土木工程
    • 171 篇 电子科学与技术(可...
    • 151 篇 电气工程
    • 146 篇 生物医学工程(可授...
    • 112 篇 机械工程
    • 101 篇 化学工程与技术
    • 100 篇 力学(可授工学、理...
    • 80 篇 测绘科学与技术
    • 74 篇 仪器科学与技术
  • 1,781 篇 理学
    • 1,046 篇 数学
    • 680 篇 物理学
    • 292 篇 生物学
    • 149 篇 统计学(可授理学、...
    • 106 篇 系统科学
    • 93 篇 化学
  • 498 篇 管理学
    • 297 篇 图书情报与档案管...
    • 224 篇 管理科学与工程(可...
    • 121 篇 工商管理
  • 140 篇 教育学
    • 139 篇 教育学
  • 124 篇 医学
    • 123 篇 临床医学
    • 52 篇 基础医学(可授医学...
    • 42 篇 药学(可授医学、理...
  • 100 篇 法学
    • 96 篇 社会学
  • 35 篇 农学
  • 29 篇 经济学
  • 4 篇 艺术学
  • 3 篇 文学
  • 3 篇 军事学

主题

  • 502 篇 interactive comp...
  • 497 篇 computer graphic...
  • 215 篇 three dimensiona...
  • 183 篇 rendering (compu...
  • 150 篇 virtual reality
  • 135 篇 animation
  • 120 篇 visualization
  • 104 篇 human computer i...
  • 95 篇 data visualizati...
  • 87 篇 computer aided d...
  • 86 篇 computer vision
  • 79 篇 user interfaces
  • 76 篇 interactive comp...
  • 62 篇 computer science
  • 52 篇 application soft...
  • 52 篇 computational mo...
  • 51 篇 hardware
  • 50 篇 graphics process...
  • 45 篇 graphics
  • 45 篇 augmented realit...

机构

  • 24 篇 university of to...
  • 21 篇 department of co...
  • 17 篇 pixar animation ...
  • 16 篇 school of comput...
  • 15 篇 walt disney anim...
  • 14 篇 program of compu...
  • 12 篇 school of comput...
  • 11 篇 school of comput...
  • 11 篇 computer animati...
  • 11 篇 program of compu...
  • 11 篇 department of co...
  • 11 篇 department of co...
  • 10 篇 department of co...
  • 10 篇 department of co...
  • 9 篇 department of co...
  • 9 篇 brown university...
  • 9 篇 stanford univers...
  • 9 篇 department of co...
  • 9 篇 institute of com...
  • 8 篇 university of ca...

作者

  • 31 篇 greenberg donald...
  • 26 篇 hanrahan pat
  • 24 篇 myers brad a.
  • 23 篇 hughes john f.
  • 22 篇 igarashi takeo
  • 19 篇 feiner steven
  • 17 篇 dorsey julie
  • 17 篇 schmalstieg diet...
  • 16 篇 manocha dinesh
  • 16 篇 hudson scott e.
  • 16 篇 balakrishnan rav...
  • 15 篇 lin ming c.
  • 15 篇 bailey mike
  • 15 篇 badler norman i.
  • 14 篇 levoy marc
  • 13 篇 sharir micha
  • 13 篇 van dam andries
  • 12 篇 anon
  • 12 篇 salesin david h.
  • 12 篇 greenberg saul

语言

  • 5,532 篇 英文
  • 50 篇 其他
  • 3 篇 中文
  • 1 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 俄文
检索条件"任意字段=Proceedings of the ACM on Computer Graphics and Interactive Techniques"
5588 条 记 录,以下是4881-4890 订阅
排序:
Optimal shortest path queries in a simple polygon  87
Optimal shortest path queries in a simple polygon
收藏 引用
3rd Annual Symposium on Computational Geometry, SCG 1987
作者: Guibas, Leonidas J. Hershberger, John Computer Science Department Stanford University StanfordCA94305 United States DEC Systems Research Center Palo AltoCA94301 United States
Let P be a simple polygon with n sides. This paper shows how to preprocess the polygon so that, given twoquery points p and g inside P, the length of the shortest path inside the polygon from p to q can be found intim... 详细信息
来源: 评论
Compliant motion planning with geometric models  87
Compliant motion planning with geometric models
收藏 引用
3rd Annual Symposium on Computational Geometry, SCG 1987
作者: Bajaj, Chanderjit Kim, Myung-Soo Department of Computer Science Purdue University West LafayetteIN47907 United States
We present algebraic algorithms to generate the boundary of configuration space obstacles arising from the translatory motion of objects amongst obstacles. In particular we consider obtaining compliant motion pathswhe... 详细信息
来源: 评论
Rectangular convolution for fast filtering of characters  87
Rectangular convolution for fast filtering of characters
收藏 引用
14th Annual Conference on computer graphics and interactive techniques, SIGGRAPH 1987
作者: Naiman, Avi Fournier, Alain Computer Systems Research Institute Department of Computer Science University of Toronto TorontoONM5S 1A4 Canada
While the race towards higher-resolution bitmap displays is still on, many grayscale displays have appeared on the scene. To fully utilize their capabilities, grayscale fonts are needed, and these can be produced by f... 详细信息
来源: 评论
Finding the visibility graph of a simple polygon in time proportional to its size  87
Finding the visibility graph of a simple polygon in time pro...
收藏 引用
3rd Annual Symposium on Computational Geometry, SCG 1987
作者: Hershberger, John Computer Science Department Stanford University StanfordCA94305 United States
Let P be a given simple polygon with n sides. The visibility graph of P has an edge between every pair of polygon vertices that can be connected by an open segment in the interior of P. We describe an algorithm that f... 详细信息
来源: 评论
Polygon properties calculated from the vertex neighborhoods  87
Polygon properties calculated from the vertex neighborhoods
收藏 引用
3rd Annual Symposium on Computational Geometry, SCG 1987
作者: Franklin, Wm. Randolph Electrical Computer and Systems Engineering Dept. 6026 J.E.C. Rensselaer Polytechnic Institute TroyNY12180 United States
Calculating properties of polyhedra given only the set of the locations and neighborhoods of the verticesis easy. Possible properties include volume, surface area, and point containment testing. No global topological ... 详细信息
来源: 评论
SIGGRAPH '87 CONFERENCE proceedings.
SIGGRAPH '87 CONFERENCE PROCEEDINGS.
收藏 引用
SIGGRAPH '87 Conf Proc
This conference proceedings contains 34 papers. The main subjects are computer graphics animation, ray tracing techniques and algorithms, graphics systems surface rendering, curve and surface algorithms, volumetric mo... 详细信息
来源: 评论
Moving a ladder in three dimensions: Upper and lower bounds  87
Moving a ladder in three dimensions: Upper and lower bounds
收藏 引用
3rd Annual Symposium on Computational Geometry, SCG 1987
作者: Ke, Yan O'Rourke, Joseph Department of Computer Science Johns Hopkins University BaltimoreMD21218 United States
This paper summarizes two results in motion planning, the details of which are in two technical *** first establishes an ω[n4) lower bound on moving a ladder (a line segment) in threedimensions in the presence of pol... 详细信息
来源: 评论
Constrained delaunay triangulations  87
Constrained delaunay triangulations
收藏 引用
3rd Annual Symposium on Computational Geometry, SCG 1987
作者: Chew, L. Paul Department of Math and Computer Science Dartmouth College HanoverNH03755 United States
Given a set of n vertices in the plane together with a set of noncrossing edges, the constrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the prespecified ed... 详细信息
来源: 评论
Algorithms for line transversals in space  87
Algorithms for line transversals in space
收藏 引用
3rd Annual Symposium on Computational Geometry, SCG 1987
作者: Avis, David Wenger, Rephael School of Computer Science McGill University 805 Sherbrooke St. W. MontrealH3A 42K6 Canada
Algorithms are developed for determining if a set of polyhedral objects in R3 can be intersected by a common transversal (stabbing) line. It can be determined in O (n ) time if a set of n lines in space has a line tra...
来源: 评论
The all-geodesic-furthest neighbors problem for simple polygons  3
The all-geodesic-furthest neighbors problem for simple polyg...
收藏 引用
3rd Annual Symposium on Computational Geometry, SCG 1987
作者: Suri, Subhash Department of Computer Science Johns Hopkins University BaltimoreMD21218 United States
We present an O(nlogn) time and 0{n) space algorithm for the following problem in a simple polygon P withn vertices: For each vertex u al P, find another vertex φ(u) that is furthest from u , where the distancebetwee... 详细信息
来源: 评论