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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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
80 篇 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 篇 mpi informat saa...
4 篇 suny stony brook...
4 篇 zhejiang univ st...
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 条记录，以下是331-340 订阅

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

详细简洁

排序：

Non-photorealistic rendering and content-based image retrieval 11

Non-photorealistic rendering and content-based image retriev...

引用

11th pacific conference on computer graphics and applications, PG 2003

作者： Ji, Xiaowen Kato, Z. Huang, Zhiyong Department of Computer Science National University of Singapore Singapore117543 Singapore Department of Informatics University of Szeged P.O.Box 652 SzegedH-6701 Hungary

ISBN: (纸本)0769520286

In this paper, we will show how non-photorealistic rendering (NPR) can take a new role in content-based image retrieval (CBIR). The proposed CBIR method applies a novel image similarity measure: unlike traditional features like color, texture, or shape, our measure is based on a painted representation of the original image. This is produced by a stochastic paintbrush algorithm which simulates a painting process. We use the stroke parameters (color, size, orientation, and location) as features and similarity is measured by matching strokes of a pair of images. The advantage of our approach is that it provides information not only about the color content but also about the structural properties of an image without the segmentation of the image. Experimental results show that the CBIR method using paintbrush features has higher retrieval rate than traditional methods using color or texture features only. © 2003 IEEE.

关键词： Content based retrieval

来源：评论

学校读者我要写书评

暂无评论

Direct reconstruction of displaced subdivision surface from unorganized points 9

Direct reconstruction of displaced subdivision surface from ...

引用

9th pacific conference on computer graphics and applications, pacific graphics 2001

作者： Jeong, Won Ki Kim, Chang Hun Max-Planck-Institut für Informatik Stuhlsatzenhausweg 85 Saarbrücken66123 Germany Dept. of Computer Science and Engineering Korea University 5-1 Anam-Dong Sungbuk-Gu Seoul Korea Republic of

ISBN: (纸本)0769512275

In this paper we propose a new mesh reconstruction algorithm that produces a displaced subdivision mesh directly from unorganized points. The displaced subdivision surface is a new mesh representation that defines a detailed mesh with a displacement map over a smooth domain surface. This mesh representation has several benefits - compact mesh size, piecewise regular connectivity - to overcome limitations of irregular mesh produced by ordinary mesh reconstruction scheme, but the original displaced subdivision surface generation algorithm needs an explicit polygonal mesh to be converted. Our approach is producing displaced subdivision surface directly from input points during the mesh reconstruction process. The main ideas of our algorithm are building initial coarse control mesh by the shrink-wrapping like projection and sampling fine surface detail from unorganized points along the each limit vertex normal without any connectivity information of given points. We employ an existing subdivision surface fitting scheme to generate a parametric domain surface, and suggest a surface detail sampling scheme that determines a valid sampling triangle which can be made with combinations of input points. We show several reconstruction examples and applications to show the validity of suggested sampling technique and benefits of the result like multiresolution modeling. © 2001 IEEE.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Optimizing geometry-aware pants decomposition 20

Optimizing geometry-aware pants decomposition

引用

20th pacific conference on computer graphics and applications, PG 2012

作者： Zhang, Kang Li, Xin School of Electrical Engineering and Computer Science Louisiana State University United States

ISBN: (纸本)9783905673944

We present a computational framework to optimize the pants decomposition of surfaces with non-trivial topology. A pants decomposition segments a surface into a set of sub-patches each of which is genus-0 with 3 boundaries. A given surface usually admits infinitely-many pants decompositions that are topologically inequivalent. Given some pre-determined geometric criteria, our algorithm enumerates different classes of pants decompositions and search for the optimal one. The proposed framework is general, and can be used to generate different suitable segmentations according to different applications. We also generalize our algorithm for consistent decomposition of multiple surfaces. This algorithm can be used in constructing compatible cross-surface mapping, and facilitate many computer graphics tasks. © The Eurographics Association 2012.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Efficient Handling of Stream Buffers in GPU Stream-based Computing Platform

Efficient Handling of Stream Buffers in GPU Stream-based Com...

引用

IEEE pacific Rim conference on Communications, computers and Signal Processing (PACRIM)

作者： Yamagiwa, Shinichi Arai, Masahiro Wada, Koichi Kochi Univ Technol Kami Sch Informat Kochi 7828502 Japan Univ Tsukuba Dept Comp Sci Tsukuba Ibaraki 305 Japan

ISBN: (纸本)9781457702518

GPU-based computing has become one of the popular high performance computing fields. The field is called GPGPU. This paper presents design and implementation of a uniform GPGPU application that is optimized for both the legacy and the recent GPU architectures. As a typical example of such the GPGPU application, this paper will discuss the uniform implementation of the Caravela platform, with focusing on the method of handling stream buffers. Two methods for handling streams have been proposed and implemented. To verify the effectiveness of the proposed methods, evaluation has been done using applications.

关键词： Caravela platform computer architecture GPGPU application GPU stream-based computing platform graphics graphics processing unit Instruction sets Kernel Programming Runtime buffer circuits computer graphic equipment coprocessors integrated circuit design s

来源：评论

学校读者我要写书评

暂无评论

Regionsketch: Interactive and rapid creation of 3D models with rich details 27

Regionsketch: Interactive and rapid creation of 3D models wi...

引用

27th pacific conference on computer graphics and applications, pacific graphics 2019

作者： Liu, Shuai Hou, Fei Hao, Aimin Qin, Hong State Key Laboratory of Virtual Reality Technology and Systems Beihang University China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China Department of Computer Science Stony Brook University United States

ISBN: (纸本)9783038680994

In this paper, we articulate a new approach to interactive generation of 3D models with rich details by way of sketching sparse 2D strokes. Our novel method is a natural extension of Poisson vector graphics (PVG). We design new algorithms that distinguish themselves from other existing sketch-based design systems with three unique features: (1) A novel sketch metaphor to create freeform surface based on Poisson's equation, which is simple, intuitive, and free of ambiguity;(2) Convenient and flexible user interface that affords the user to add rich details to the surface with simple sketch input;and (3) Rapid model creation with sparse strokes, which enables novice users to enjoy the utilities of our system to create expected 3D models. We validate the proposed method through a large repository of interactively sketched examples. Our experiments and produced results confirm that our new method is a simple yet efficient design tool for modeling free-form shapes with simple and intuitive 2D sketches input. © 2019 The Author(s) Eurographics Proceedings © 2019 The Eurographics Association.

关键词： User interfaces

来源：评论

学校读者我要写书评

暂无评论

Robust and efficient SPH simulation for high-speed fluids with the dynamic particle partitioning method 26

Robust and efficient SPH simulation for high-speed fluids wi...

引用

26th pacific conference on computer graphics and applications, pacific graphics 2018

作者： Zheng, Zhong Gao, Yang Li, Shuai Qin, Hong Hao, Aimin State Key Laboratory of Virtual Reality Technology and Systems Beihang University China Beihang University Qingdao Research Institute Beihang University China Department of Computer Science Stony Brook University United States

ISBN: (纸本)9783038680734

In this paper, our research efforts are devoted to the efficiency issue of the SPH simulation when the ratio of velocities among fluid particles is large. Specifically, we introduce a k-means clustering method into the SPH framework to dynamically partition fluid particles into two disjoint groups based on their velocities, we then use a two-scale time step scheme for these two types of particles. The smaller time steps are for particles with higher speed in order to preserve temporal details and guarantee the numerical stability. In contrast, the larger time steps are used for particles with smaller speeds to reduce the computational expense, and both types of particles are tightly coupled in the simulation. We conduct various experiments which have manifested the advantages of our methods over the conventional SPH technique and its new variants in terms of efficiency and stability. © 2018 The Author(s).

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

A new adaptive density estimator for particle-tracing radiosity 8

A new adaptive density estimator for particle-tracing radios...

引用

8th pacific conference on computer graphics and applications, PG 2000

作者： Wah, Wong Kam Department of Computer Science and Information Systems University of Hong Kong Pokfulam Road Hong Kong Hong Kong

ISBN: (纸本)0769508685

In particle-tracing radiosity algorithms, energy-carrying particles are traced through an environment for simulating global illumination. Illumination on a surface is reconstructed from particle "hit points" on the surface, which is a density estimation problem (B.W. Silverman, 1986). Several methods can be used to solve this problem, such as the adaptive meshing method (R.F. Tobler et al., 1997), the kernel method (B. Walter et al., 1997), and the orthogonal series estimator (M. Feda, 1996). An orthogonal series estimator is proposed to tackle the problem. In the new method, the appropriate number of terms that should be used in the series is determined adaptively and automatically. Moreover a surface subdivision scheme is combined with the estimator to increase the accuracy of estimation. The new method has several advantages over other existing methods: (1) it requires less memory than the adaptive meshing method;(2) it does not store all the particle-hit points as in the kernel method;(3) it determines automatically how many terms should be used in the orthogonal series;(4) it incorporates surface subdivision to further increase the accuracy of estimation. © 2000 IEEE.

关键词： computer graphics

来源：评论

学校读者我要写书评

暂无评论

3D object compression using enhanced stripification technique

3D object compression using enhanced stripification techniqu...

引用

IEEE pacific Rim conference on Communications, computers and Signal Processing (PACRIM)

作者： Khairy, Fatma Mousa, Mohamed H. Nassar, Hamed Yasein, Mohamed S. Suez Canal Univ Dept Comp Sci Ismailia Egypt Port Said Univ Dept Elect & Comp Engn Port Said Egypt

ISBN: (纸本)9781457702518

3D meshes are one of the most common representations of 3D objects that have been used in graphics applications. They often require a huge amount of data for storage and/or transmission. In this paper, we present a new compression algorithm based on stripification of the geometric models that enables us to progressively visualize the 3D models during their transmission. The proposed algorithm encodes the geometry and the connectivity of the input model in an interwoven fashion. The main idea is to store 3D objects as strips files. The algorithm achieves compression ratios above 61 : 1 over ASCII encoded formats resulting in faster transmission and rendering of complex graphical objects.

关键词： 3D meshes 3D model visualization 3D object compression 3D object representation Compression algorithms Geometry Joining processes Rendering (computer graphics) Solid modeling Strips Three dimensional displays complex graphical object rendering data compression data visualisation geometric model stripification graphics application interwoven fashion mesh generation rendering (computer graphics) solid modelling

来源：评论

学校读者我要写书评

暂无评论

Fine timing: Curve and surface deformation by scaling derivatives 9

Fine timing: Curve and surface deformation by scaling deriva...

引用

9th pacific conference on computer graphics and applications, pacific graphics 2001

作者： Miura, Kenjiro T. Cheng, Fuhua Wang, Lazhu Shizuoka University Realistic Modeling Laboratory Hamamatsu Shizuoka Japan University of Kentucky Department of Computer Science LexingtonKY United States Raindrop Geomagic Inc. Research Triangle ParkNC United States

ISBN: (纸本)0769512275

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. © 2001 IEEE.

关键词： Deformation

来源：评论

学校读者我要写书评

暂无评论

Automatic creation of object hierarchies for radiosity clustering 7

Automatic creation of object hierarchies for radiosity clust...

引用

7th pacific conference on computer graphics and applications, pacific graphics 1999

作者： Muller, Gordon Schafer, Stephan Fellner, Dieter W. Institute of Computer Graphics Technical University of Braunschweig Rebenring 18 BraunschweigD-38106 Germany

ISBN: (纸本)0769502938

Using object clusters for hierarchical radiosity greatly improves the efficiency and thus usability of radiosity computations. By eliminating the quadratic starting phase very large scenes containing about 100 K polygons can be handled efficiently. Although the main algorithm extends rather easily to using object clusters, the creation of »good» object hierarchies is a difficult task both in terms of construction time and in the way how surfaces or objects are grouped to clusters. The quality of an object hierarchy for clustering depends on its ability to accurately simulate the hierarchy of the energy flow in a given scene. Additionally it should support visibility computations by providing efficient ray acceleration techniques. In this paper we present a new approach of building hierarchies of object clusters. Our hybrid structuring algorithm provides accuracy and speed by combining a highly optimized bounding volume hierarchy together with uniform spatial subdivisions for nodes with regular object densities. The algorithm works without user intervention and is well suited for a wide variety of scenes. First results of using these hierarchies in a radiosity clustering environment are very promising and will be presented here. The combination of very deep hierarchies (we use a binary tree) together with an efficient ray acceleration structure shifts the computational effort away from form factor and visibility calculation towards accurately propagating the energy through the hierarchy. We show how an efficient single pass gathering can be used to minimize traversal costs. © 1999 IEEE.

关键词： Binary trees

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共91页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：