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

International Symposium on Voronoi Diagrams in science and Engineering (ISVD)

作者： Iddo Hanniel Gill Barequet Research Group Solid Works Corporation Concord MA USA Center of Graphics and Geometric Computing Department of Computer Science Technion-Israel Institute of Technology Israel

The triangle-perimeter 2-site distance function defines the "distance" P(x, (p, q)) from a point x to two other points p, q as the perimeter of the triangle whose vertices are x, p, q. Accordingly, given a set S of n points in the plane, the Voronoi diagram of S with respect to P, denoted as V P (S), is the subdivision of the plane into regions, where the region of p, q ¿ S is the locus of all points closer to p, q (according to P) than to any other pair of sites in S. In this paper we prove a theorem about the perimeters of triangles, two of whose vertices are on a given circle. We use this theorem to show that the combinatorial complexity of V P (S) is O(n 2+¿ ) (for any ¿ > 0). Consequently, we show that one can compute V P (S) on O(n 2+¿ ) time and space.

关键词： computer science Q measurement Mobile antennas Transmitting antennas computer graphics Crystallography Geography Metrology Biology Mathematics

来源：评论

学校读者我要写书评

暂无评论

On Voronoi Diagrams for Lines in the Plane

On Voronoi Diagrams for Lines in the Plane

引用

International Conference on Computational science and its Applications (ICCSA)

作者： Gill Barequet Kira Vyatkina Center of Graphics and Geometric Computing Department of Computer Science Technion-Israel Institute of Technology Haifa Israel Department of Mathematics and Mechanics Saint Petersburg State University Saint Petersburg Russia

We describe a method based on the wavefront propagation, which computes a multiplicatively weighted Voronoi diagram for a set L of n lines in the plane in O(n 2 log n) time and O(n 2 ) space. In the process, we derive complexity bounds and certain structural properties of such diagrams. An advantage of our approach over the general purpose machinery, which requires computation of the lower envelope of a set of halfplanes in three-dimensional space, lies in its relative simplicity. Besides, we point out that the unweighted Voronoi diagram for n lines in the plane has a simple structure, and can be obtained in optimal thetas(n 2 ) time and space.

关键词： Machinery Euclidean distance Application software computer graphics computer science Mathematics

来源：评论

学校读者我要写书评

暂无评论

Geometric parameters based cubic PH curve interpolation and approximation

引用

Journal of Information and Computational science 2009年第6期6卷 2423-2432页

作者： Cheng, Min Wang, Guojin Department of Mathematics Zhejiang University Zhejiang Hangzhou 310000 China College of Science Zhejiang University of Technology Zhejiang Hangzhou 310000 China Institute of Computer Graphics and Image Processing Zhejiang University Zhejiang Hangzhou 310000 China

The Pythagorean-hodograph curves offer unique computational advantages in computer aided design and manufacturing. In this paper, geometric parameters based cubic PH curve interpolation and approximation algorithms are presented. The essential geometric parameters include the ratio ρ of the adjacent control polygon legs, the control polygon angle θ, the first control polygon leg L, the included angle δ between the first control polygon edge and the edge joining the origin O and the first control point, as well as the coefficient Dir of curve rotation. Furthermore the problem of PH curve approximation with endpoints interpolation to a cubic non-PH curve is studied, including the algorithms based on different geometric parameters input {δ, θ}, {ρ, θ} and {ρ, δ} respectively. © 2009 Binary Information Press.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Validation of velux daylight visualizer 2 against cie 171:2006 test cases

Validation of velux daylight visualizer 2 against cie 171:20...

引用

11th International IBPSA Conference - Building Simulation 2009, BS 2009

作者： Labayrade, Raphaël Jensen, Henrik Wann Jensen, Claus Université de Lyon Lyon F-69003 France Ecole Nationale des Travaux Publics de l'Etat CNRS URA 1652 France Département Génie Civil et Bâtiment 3 rue Maurice Audin Vaulx-en-Velin F-69120 France Computer Graphics Laboratory Computer Science and Engineering University of California San Diego 9500 Gilman Drive CSE 4116 La Jolla CA 92093-0404 United States Luxion Advanced Lighting Technology United States

Velux Daylight Visualizer 2 is a software tool dedicated to daylighting design and analysis. It is intended to simulate daylight transport in buildings and to aid professionals by predicting and documenting daylight levels and appearance of a space prior to realization of the building design. The critical question is whether Velux Daylight Visualizer 2 produces trustable simulations the user can be confident in. A key point to answer this question is to assess the software capability to simulate the light transport in a physically correct way. In this paper, we assess the accuracy of Velux Daylight Visualizer 2 against CIE 171:2006 test cases. Like many simulation softwares, several settings (tuned by the final user) rule the accuracy of the simulation and impact the rendering time. We propose an iterative workflow aimed at identifying a range of simulation settings which achieve accurate predictions, and calibrating the simulation settings in regards to accuracy and rendering time. This workflow needs less simulations to perform than simulating each test case for each setting, while remaining robust. We illustrate the proposed workflow by identying low, medium, and high values of the settings of Daylight Visualizer 2.

关键词： Daylighting

来源：评论

学校读者我要写书评

暂无评论

Life after tenure: Leadership roles in academia

Life after tenure: Leadership roles in academia

引用

2009 ASEE Annual Conference and Exposition

作者： Reese, Donna Nelson, Priscilla Schrader, Cheryl Davies, Patricia Roddis, W.M. Kim James Worth Bagley College of Engineering Mississippi State University United States Computer Science and Engineering United States Department of Civil and Environmental Engineering United States New Jersey Institute of Technology United States College of Engineering Professor of Electrical and Computer Engineering Boise State University United States School of Mechanical Engineering Purdue University United States Ray W. Herrick Laboratories United States Department of Civil and Environmental Engineering George Washington University United States

This is a panel presentation and is part of the joint ASEE-WIED coordination with the Women in Engineering ProActive Network (WEPAN) in making Wednesday of the ASEE general meeting overlap with the first day of the WEPAN annual conference. The leadership of WEPAN and ASEE-WIED have coordinated to plan a day of activities that will benefit members of both organizations and help to introduce members of each organization to each other and to both organizations. Following the panelist's presentations, there will be time for questions from the audience to the panel. © American Society for Engineering Education, 2009.

关键词： Professional aspects

来源：评论

学校读者我要写书评

暂无评论

Guest editorial network infrastructure configuration

引用

IEEE Journal on Selected Areas in Communications 2009年第3期27卷 249-252页

作者： Paul Anderson Carl A. Gunter Charles R. Kalmanek Sanjai Narain Jonathan M. Smith Rajesh Talpade Geoffrey G. Xie Researcher School of Informatics Edinburgh University Computer Science Department University of Illinois Urbana-Champaign Vice President of Networking & Services Research AT&T Labs Information Assurance and Security Department Telcordia Applied Technology Solutions Senior Research Scientist Olga and Alberico Pompa Professor of Engineering and Applied Science University of Pennsylvannia Chief Scientist and Director Information Assurance Group Telcordia Applied Technology Solutions Computer Science Department Naval Post Graduate School

The nine papers in this special issue focus on network infrastructure configuration and some of the problems encountered in the areas of specification, diagnosis, repair, synthesis, and anonymization.

关键词： Testing Routing Network synthesis Informatics computer science Network servers Personal digital assistants Robustness Resilience Data security

来源：评论

学校读者我要写书评

暂无评论

GPU-accelerated Adaptively Sampled Distance Fields

GPU-accelerated Adaptively Sampled Distance Fields

引用

IEEE International Conference on Shape Modeling and Applications

作者： Bastos, Thiago Celes, Waldemar Tecgraf - Computer Graphics Technology Group Department of Computer Science PUC-Rio Brazil

ISBN: (纸本)9781424422609

Adaptively Sampled Distance Fields (ADFs) are volumetric shape representations that support a broad range of applications in the areas of computer graphics, computer vision and physics. ADFs are especially beneficial for representing shapes with features at very diverse scales. In this paper, we propose a strategy to represent and reconstruct ADFs on modem graphics hardware (GPUs). We employ a 3D hashing scheme to store the underlying data structure and try to balance the tradeoff between memory requirements and reconstruction efficiency. To render ADFs on GPU, we use a general-purpose ray-casting technique based on sphere tracing, which guarantees the reconstruction of fine details. We also present a way to overcome the C-1 discontinuities inherent to ADFs and efficiently reconstruct smooth surface normals across cell boundaries. The effectiveness of our proposal is demonstrated for isosurface rendering and morphing.

关键词： ADFs GPU algorithms implicit surface rendering

来源：评论

学校读者我要写书评

暂无评论

Approximate merging of multiple Bézier segments

引用

Progress in Natural science:Materials International 2008年第6期18卷 757-762页

作者： Min Chenga,b,Guojin Wanga,* aInstitute of computer graphics and Image Processing,Zhejiang University,Hangzhou 310027,China bCollege of science,Zhejiang University of technology,Hangzhou 310032,China Institute of Computer Graphics and Image Processing Zhejiang University Hangzhou 310027 China College of Science Zhejiang University of Technology Hangzhou 310032 China

This paper deals with the approximate merging problem of multiple adjacent Bézier curves with dierent degrees by a single Bézier curve,which is a frequently seen problem in *** unified matrix representation for precise merging is presented and the approx-imate merging curve is further derived based on matrix *** at the endpoints of curves is also discussed in the merging *** show that the method in this paper achieves satisfying merging results.

关键词： computer-aided geometric design Bézier curve Approximate merging Matrix representation

来源：评论

学校读者我要写书评

暂无评论

Focus+Context visualization with distortion minimization

Focus+Context visualization with distortion minimization

引用

作者： Wang, Yu-Shuen Lee, Tong-Yee Tai, Chiew-Lan Computer Graphics Goup Department of Computer Science and Information Engineering National Cheng-Kung University No. 1 Ta-Hsueh Road Tainan 701 Taiwan Department of Computer Science and Engineering Hong Kong University of Science and Technology Clear Water Bay Hong Kong Hong Kong

The need to examine and manipulate large surface models is commonly found in many science, engineering, and medical applications. On a desktop monitor, however, seeing the whole model in detail is not possible. In this paper, we present a new, interactive Focus+Context method for visualizing large surface models. Our method, based on an energy optimization model, allows the user to magnify an area of interest to see it in detail while deforming the rest of the area without perceivable distortion. The rest of the surface area is essentially shrunk to use as little of the screen space as possible in order to keep the entire model displayed on screen. We demonstrate the efficacy and robustness of our method with a variety of models. © 2008 IEEE.

关键词： Medical applications

来源：评论

学校读者我要写书评

暂无评论

GPU-accelerated Adaptively Sampled Distance Fields

GPU-accelerated Adaptively Sampled Distance Fields

引用

International Conference on Shape Modeling and Applications

作者： Thiago Bastos Waldemar Celes Department of Computer Science Tecgraf Computer Graphics Technology Group Brazil

Adaptively Sampled Distance Fields (ADFs) are volumetric shape representations that support a broad range of applications in the areas of computer graphics, computer vision and physics. ADFs are especially beneficial for representing shapes with features at very diverse scales. In this paper, we propose a strategy to represent and reconstruct ADFs on modern graphics hardware (GPUs). We employ a 3D hashing scheme to store the underlying data structure and try to balance the tradeoff between memory requirements and reconstruction efficiency. To render ADFs on GPU, we use a general-purpose ray-casting technique based on sphere tracing, which guarantees the reconstruction of fine details. We also present a way to overcome the Cl discontinuities inherent to ADFs and efficiently reconstruct smooth surface normals across cell boundaries. The effectiveness of our proposal is demonstrated for isosurface rendering and morphing.

关键词： Shape computer graphics Application software computer vision Physics Hardware Data structures Rendering (computer graphics) Surface reconstruction Proposals

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：