检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

758 篇 会议
135 篇 期刊文献
17 册 图书

馆藏范围

910 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

558 篇 工学
- 354 篇 软件工程
- 285 篇 计算机科学与技术...
- 106 篇 机械工程
- 47 篇 电子科学与技术（可...
- 28 篇 电气工程
- 24 篇 信息与通信工程
- 18 篇 光学工程
- 14 篇 控制科学与工程
- 14 篇 建筑学
- 11 篇 仪器科学与技术
- 11 篇 土木工程
- 10 篇 生物医学工程（可授...
- 8 篇 生物工程
- 7 篇 力学（可授工学、理...
- 6 篇 化学工程与技术
- 4 篇 冶金工程
- 3 篇 动力工程及工程热...
- 3 篇 测绘科学与技术
107 篇 理学
- 65 篇 数学
- 35 篇 物理学
- 11 篇 系统科学
- 9 篇 生物学
- 6 篇 化学
- 3 篇 大气科学
- 3 篇 地球物理学
- 3 篇 统计学（可授理学、...
21 篇 管理学
- 12 篇 管理科学与工程(可...
- 11 篇 图书情报与档案管...
- 4 篇 工商管理
10 篇 医学
- 10 篇 临床医学
3 篇 艺术学
2 篇 经济学
2 篇 农学
2 篇 军事学
1 篇 法学

主题

305 篇 computer graphic...
178 篇 rendering (compu...
149 篇 application soft...
132 篇 computer science
95 篇 shape
87 篇 geometry
86 篇 layout
78 篇 animation
74 篇 solid modeling
73 篇 hardware
72 篇 computational mo...
53 篇 categories and s...
50 篇 visualization
47 篇 data visualizati...
45 篇 humans
38 篇 topology
37 篇 lighting
36 篇 spline
36 篇 surface reconstr...
35 篇 graphics

机构

11 篇 university of to...
9 篇 microsoft resear...
8 篇 school of comput...
7 篇 state key labora...
7 篇 department of co...
6 篇 department of co...
6 篇 university of to...
5 篇 hokkaido univers...
5 篇 tsinghua univers...
5 篇 mpi informatik s...
4 篇 department of co...
4 篇 department of co...
4 篇 max planck insti...
4 篇 department of co...
4 篇 max planck inst ...
4 篇 computer science...
4 篇 suny stony brook...
4 篇 zhejiang univ st...
4 篇 department of co...
4 篇 department of co...

作者

13 篇 t. nishita
10 篇 h.-p. seidel
8 篇 seidel hp
7 篇 hong qin
7 篇 y. dobashi
7 篇 k.i. joy
6 篇 ming ouhyoung
6 篇 l. kobbelt
5 篇 kwan-liu ma
5 篇 t. kanai
5 篇 chen bing-yu
5 篇 seungyong lee
5 篇 kaihuai qin
4 篇 m.c. lin
4 篇 b. hamann
4 篇 qunsheng peng
4 篇 k.t. miura
4 篇 g. elber
4 篇 d. cohen-or
4 篇 r. klein

语言

910 篇 英文

检索条件"任意字段=Pacific Conference on Computer Graphics and Applications"

共 910 条记录，以下是561-570 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

A morphing with geometric continuity between two arbitrary planar polygons

A morphing with geometric continuity between two arbitrary p...

引用

pacific conference on computer graphics and applications

作者： Youdong Liang Hujun Bao Weihua Zhou State Key Laboratory of CAD&CG University of Zhejiang Hangzhou China

ISBN: (纸本)0769517846

This paper introduces the geometric continuity equations of the closed planar polygons and gives the definition of a morphing with geometric continuity between two arbitrary planar polygons, including simple, non-3 and even degenerated polygons. A simple morphing technique based on linear interpolation of the geometric continuity equations is proposed. The closureness of the in-between polygons is precisely achieved. Two global invariants: rotation indexes and winding numbers are introduced to describe the most general polygons. The demo shows that this technique is efficient and natural for morphing between polygons with arbitrary rotation indexes and winding numbers.

关键词： Equations Interpolation computer graphics Turning Image segmentation Animation Roads Fractal art Shape Length measurement

来源：评论

学校读者我要写书评

暂无评论

Selective non-uniform subdivision

Selective non-uniform subdivision

引用

pacific conference on computer graphics and applications

作者： K.T. Miura H. Masuda Department of Mechanical Engineering Shizuoka University Hamamatsu Shizuoka Japan Research into Artifacts University of Tokyo Meguro Tokyo Japan

The control polygons of B-spline subdivision curves are usually refined uniformly using a technique called knot-doubling. This uniform refinement approach would perform unnecessary subdivision steps on portions already close to the limit curve enough and, consequently, cause unnecessary (exponential) increase on the number of line segments in the refined polygons. This paper overcomes this problem by proposing a local refinement technique for the control polygons of B-spline subdivision curves. Local refinement is achieved by selectively inserting new knots at midpoints of knot intervals. Efficient adaptive subdivision can be easily realized based on the new technique.

关键词： computer graphics Application software

来源：评论

学校读者我要写书评

暂无评论

Contour Correspondence via Ant Colony Optimization

Contour Correspondence via Ant Colony Optimization

引用

pacific conference on computer graphics and applications

作者： Oliver van Kaick Ghassan Hamarneh Hao Zhang Paul Wighton School of Computing Science Simon Fraser University Burnaby BC Canada

ISBN: (纸本)9780769530093

We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way, we show that better matching results are obtained in practice. We propose the first Ant Colony Optimization (ACO) algorithm specifically aimed at solving the QAP-based shape correspondence problem. Our ACO framework is flexible in the sense that it can handle general point correspondence, but also allows extensions, such as order preservation, for the more specialized contour matching problem. Various experiments are presented which demonstrate that this approach yields high-quality correspondence results and is computationally efficient when compared to other methods.

关键词： Ant colony optimization Application software Shape measurement computer graphics Biomedical imaging Biomedical computing Computational geometry computer vision Anatomical structure Animation

来源：评论

学校读者我要写书评

暂无评论

Prefiltered Cross-Section Occluders

Prefiltered Cross-Section Occluders

引用

pacific conference on computer graphics and applications

作者： Timothy Condon Bruce Walter Kavita Bala Donald Greenberg Cornell University Ithaca NY USA

We introduce an impostor-based visibility technique to provide approximate, average visibility for point-to-cluster and cluster-to-cluster visibility queries. Processing each object in a view-independent manner allows us to generate a mip-map-like hierarchy of approximate visibility information that can report approximate average visibility over conical shafts or conical shaft frustums. We demonstrate how these impostors can be used to approximate smooth soft shadow calculation, and improve the quality of light cuts and multidimensional light cuts. In addition, we describe how to use approximate visibility of shafts to estimate a tighter error bound for the light cuts visibility term, yielding speedup by reducing over-aggressive cut refinement.

关键词： Shafts Approximation methods Geometry Rendering (computer graphics) Kernel Shadow mapping Testing

来源：评论

学校读者我要写书评

暂无评论

Efficient dynamic image retrieval using the Á trous wavelet transformation 2nd

引用

2nd IEEE pacific-Rim conference on Multimedia, IEEE-PCM 2001

作者： Joubert, G.R. Kao, O. Department of Computer Science Technical University of Clausthal Clausthal-Zellerfeld38678 Germany

ISBN: (纸本)3540426809

The increasing use of digital images in applications ranging from remote sensing to medical applications and industrial control systems results in a demand for well-suited and efficient techniques for their storage, management and retrieval. The state-of-the-art approach for image retried considers a priori extracted features, which are compared to query information supplied by a user in the form of, for example, a list of keywords or the corresponding features of a sample image or sketch. In this paper an alternative, object-based approach for image retrieval is presented. This allows the user to specify and to search for certain regions of interest in images. The marked regions are represented by wavelet coefficients and searched in all image sections during query runtime. All other image elements are ignored, thus a detailed search can be realised. The resulting computational effort can be overcome by utilisation of parallel architectures. An example for a cluster-based image database is discussed in the last part of this paper. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

An analytical ray casting of volume data

An analytical ray casting of volume data

引用

pacific conference on computer graphics and applications

作者： Moon-Ryun Jung Hyunwoo Park Doowon Paik School of Computing Soongsil University Seoul South Korea

ISBN: (纸本)0818686200

When volume data is visualized by the ray casting method, the color value of each pixel in the image is obtained by composing the color contributions of the sample points that lie on the ray cast from the pixel point. In most ray tracing methods, including M. Levoy's (1988; 1990) classical method, the color composition is formulated as a summation of the color contributions of the discrete sample points. However the more precise color composition is formulated as differential equations over the color contributions of the continuous sample points. The discrete formulation is used, because analytical solutions to the continuous formulation are hard to find. However we have discovered a semi-analytical solution to the continuous formulation of a typical ray tracing of volume data. We have applied both Levoy's method and ours to the same set of data, and compared the visual quality of both results. The comparison shows that our method produces a more fine grained visualization of volume data.

关键词： Casting Rendering (computer graphics) Ray tracing Read only memory Equations Computed tomography Magnetic resonance imaging Positron emission tomography Data visualization Color

来源：评论

学校读者我要写书评

暂无评论

Efficient processing of large 3D meshes

Efficient processing of large 3D meshes

引用

pacific conference on computer graphics and applications

作者： H.-P. Seidel Max Planck Institute of Computer Science Saarbrucken Germany

Summary form only given, as follows. Due to their simplicity, triangle meshes are often used to represent geometric surfaces. Their main drawback is the large number of triangles that are required to represent a smooth surface. This problem has been addressed by a large number of mesh simplification algorithms which reduce the number of triangles and approximate the initial mesh. Hierarchical triangle mesh representations provide access to a triangle mesh at a desired resolution, without omitting any information. The article presents an infrastructure for discrete geometry processing, including algorithms for 3D reconstruction, curvature computation, reverse engineering, mesh reduction, interactive multiresolution modeling and progressive transmission of arbitrary unstructured triangle meshes.

关键词： computer science Computational geometry Solid modeling

来源：评论

学校读者我要写书评

暂无评论

Fine tuning: curve and surface deformation by scaling derivatives

Fine tuning: curve and surface deformation by scaling deriva...

引用

pacific conference on computer graphics and applications

作者： K.T. Miura Fuhua Cheng Lazhu Wang Realistic Modeling Laboratory Shizuoka University Hamamatsu Shizuoka Japan Department of Computer Science University of Kentucky Lexington KY USA Raindrop Geomagic Inc. NC USA

A deformation-based fine tuning technique for parametric curves and surfaces is presented. A curve or surface is deformed by scaling its derivative, instead of manipulating its control points. Since only the norm of the derivative is adjusted, the resulting curve or surface keeps the basic shape of the original profile and curvature distribution. Therefore, the new technique is especially suitable for last minute fine tuning of the design process. Other advantages include: (1) the fine tuning process is a real local method, it can be performed on any portion of a curve or a surface, not just on a set of segments or patches; (2) by allowing a user to drag a scalar function to directly adjust the curvature (and, consequently, fairness) of a curve or surface, the new technique makes the shape design process more intuitive and effective; (3) the new technique is suitable for precise shaping and deforming such as making the curvature of a specific portion twice as big. In many cases, it can achieve results that other methods such as FFD can not; (4) the fine tuning process can also be used for subdivision curves and surfaces. Related techniques and test results are included.

关键词： Timing Process design computer graphics Shape control computer worms Spline Application software Lattices

来源：评论

学校读者我要写书评

暂无评论

An automatic modeling method for fitting volumetric objects with metacubes

An automatic modeling method for fitting volumetric objects ...

引用

pacific conference on computer graphics and applications

作者： Eun-Seok Kim Jay Jeong Kim Department of Computer Science Chonnam National University Kwangju South Korea

ISBN: (纸本)0769508685

Implicit modeling is an important technique in the modeling of informal objects. However, the available automatic modeling algorithms with implicit skeletal elements are not very advanced. In this paper, we propose a new skeletal element, called a metacube, and an automatic modeling technique for informal objects represented by volumetric data. The metacube has the merits of a metaball and also enhances the modeling ability of informal objects containing planar surfaces. For a 256/spl times/256/spl times/256 size of input volume, the proposed method takes a short generation time (less than ten minutes) on an SGI Indigo 2 workstation.

关键词： Isosurfaces Deformable models Shape computer science Workstations Surface fitting Ray tracing Data mining

来源：评论

学校读者我要写书评

暂无评论

Modeling hairy plants

Modeling hairy plants

引用

pacific conference on computer graphics and applications

作者： M. Fuhrer H.W. Jensen P. Prusinkiewicz University of Calgary Canada University of California San Diego USA

The appearance of computer generated plants has improved significantly due to advances in both modeling and rendering. In this paper we describe a system that further improves the appearance of CG plants by including the tiny hairs that cover many plant organs. A plant skeleton is generated using an L-system and graphically interpreted using generalized cylinders. The individual hairs are then mapped onto the surfaces and boundary edges of the mesh. Hair properties are specified and adjusted according to positional information. Sample images included in the paper illustrate the impact of hairs on the appearance of rendered plants.

关键词： Hair Rendering (computer graphics) Animals Character generation Skeleton Epidermis Scattering Insects Context modeling Humans

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共91页 << < 53 54 55 56 57 58 59 60 61 62 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：