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

6th Annual ACM Symposium on User Interface Software and Technology, UIST 1993

作者： Singh, Gurminder Linton, Mark Myers, Brad A. Szczur, Marti Institute of Systems Science Natitonal Unlverslty of Singapore Kent Ridge Singapore Singapore Silicon Graphics Inc. United States Computer Science Department Carnegie Mellon University United States Institute of Systems Science National University of Singapore Singapore NASA Goddard space Flight Center United States

来源：评论

学校读者我要写书评

暂无评论

Kinetic collision detection between two simple polygons 99

Kinetic collision detection between two simple polygons

引用

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

作者： Julien Basch Jeff Erickson Leonidas J. Guibas John Hershberger Li Zhang Computer Science Department Stanford University Stanford CA and Center for Geometric Computing Department of Computer Science Duke University Durham NC Center for Geometric Computing Department of Computer Science Duke University Durham NC and Department of Computer Science University of Illinois Urbana IL Computer Science Department Stanford University Stanford CA Mentor Graphics Corp. 8005 SW Boeckman Road Wilsonville OR

来源：评论

学校读者我要写书评

暂无评论

Variational Principles for Diffusion Weighted MRI Restoration and Segmentation

Variational Principles for Diffusion Weighted MRI Restoratio...

引用

Canadian Conference on computer and Robot Vision, CRV

作者： B.C. Vemuri Center of Vision Graphics and Medical Imaging Department of Computer & Information Science & Engineering University of Florida Gainesville FL USA

来源：评论

学校读者我要写书评

暂无评论

Implementing a database-driven solution for nominations and elections of faculty governance committees

Implementing a database-driven solution for nominations and ...

引用

114th Annual ASEE Conference and Exposition, 2007

作者： Acheson, Douglas Acheson, Lingma Indiana University Purdue University-Indianapolis United States Department of Computer Graphics Technology Purdue School of Engineering and Technology Indianapolis IN United States Computer Network Center Purdue School of Engineering and Technology Indianapolis United States School of Liberal Arts Butler University United States School of Science Purdue University Indianapolis United States

Institutions of higher education are self-governing bodies of which participating members must serve on various committees from time to time. To this end, nominations and elections of schoolwide committees are the vital link to this process of faculty governance. With each new academic year, there are numerous changes in faculty status such as new faculty being hired, tenure status, past positions being held and term limits on various committees. Depending on the complexity of each institution's governing document (which states the stipulations for each committee's required representation), making certain nominations and elections are carried out in a fair and equitable manner can prove to be a fairly daunting task. To streamline this yearly task and ensure continuity between former and current election committees, the authors of this paper developed a technology-based system which automates the nomination/election process. This paper presents an overview of this on-line, database-driven committee nomination and election system. This paper also points out several other institutions that have developed similar automated means of dealing with faculty governance logistics and presents issues that must be addressed when considering developing this type of a system. © American Society for Engineering Education, 2007.

关键词： Engineering education

来源：评论

学校读者我要写书评

暂无评论

A comparison of Gaussian and mean curvatures estimation methods on triangular meshes

A comparison of Gaussian and mean curvatures estimation meth...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： T. Surazhsky E. Magid O. Soldea G. Elber E. Rivlin Center for Graphics and Geometric Computing Israel Institute of Technology Haifa Israel Applied Mathematics Department Faculty of Computer Science

Estimating intrinsic geometric properties of a surface from a polygonal mesh obtained from range data is an important stage of numerous algorithms in computer and robot vision, computer graphics, geometric modeling, industrial and biomedical engineering. This work considers different computational schemes for local estimation of intrinsic curvature geometric properties. Five different algorithms and their modifications were tested on triangular meshes that represent tessellations of synthetic geometric models. The results were compared with the analytically computed values of the Gaussian and mean curvatures of the non-uniform rational B-spline (NURBs) surfaces, these meshes originated from. This work manifests the best algorithms suited for that indeed different algorithms should be employed to compute the Gaussian and mean curvatures.

关键词： Biomedical computing Solid modeling Spline computer vision Service robots Robot vision systems computer graphics computer industry Biomedical engineering Testing

来源：评论

学校读者我要写书评

暂无评论

Computing the penetration depth of two convex polytopes in 3d 7th

引用

7th Scandinavian Workshop on Algorithm Theory, SWAT 2000

作者： Agarwal, Pankaj K. Guibas, Leonidas J. Har-Peled, Sariel Rabinovitch, Alexander Sharir, Micha Center for Geometric Computing Department of Computer Science Duke University Box 90129 DurhamNC27708-0129 United States Computer Graphics Laboratory Computer Science Department Stanford University StanfordCA94305 United States Synopsys Inc 154 Crane Meadow Rd Suite 300 MarlboroMA01752 United States School of Mathematical Sciences Tel Aviv University Tel Aviv69978 Israel Courant Institute of Mathematical Sciences New York University NY10012 United States

ISBN: (纸本)3540676902

Let A and B be two convex polytopes in R3 with m and n facets, respectively. The penetration depth of A and B, denoted as π(A, B), is the minimum distance by which A has to be translated so that A and B do not intersect. We present a randomized algorithm that computes π(A,B) in O(m3/4+ɛn3/4+ɛ + m1+ɛ + n1+ɛ) expected time, for any constant ɛ > 0. It also computes a vector t such that ||t|| = π(A,B) and int(A + t) ⊓ B = θ. We show that if the Minkowski sum B ⊗ (—A) has K facets, then the expected running time of our algorithm is O (K1/2+ɛm1/4n1/4 + m1+ɛ + n1+ɛ), for any ɛ > 0. We also present an approximation algorithm for computing π(A,B). For any δ > 0, we can compute, in time O(m + n + (log2(m + n))/δ), a vector t such that ||t|| 2 n)/δ), which is simpler and slightly faster than the recent algorithm by Chan. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Metabolic visualization and intelligent shape analysis of the hippocampus

引用

International Conference on Computational Intelligence and Security, CIS 2005

作者： Choi, Yoo-Joo Kim, Jeong-Sik Kim, Min-Jeong Choi, Soo-Mi Kim, Myoung-Hee Institute for Graphic Interfaces Ewha-SK Telecom Building 11-1 Daehyun-Dong Seodaemun-Ku Seoul Korea Republic of Department of Computer Science and Engineering Ewha Womans University Daehyun-Dong Seodaemun-Ku Seoul Korea Republic of Center for Computer Graphics and Virtual Reality Ewha Womans University Daehyun-Dong Seodaemun-Ku Seoul Korea Republic of School of Computer Engineering Sejong University Seoul Korea Republic of Department of Computer Application Technology Seoul University of Venture and Information Seoul Korea Republic of

ISBN: (纸本)3540308199

This paper suggests a prototype system for visualization and analysis of anatomic shape and functional features of the hippocampus. Based on the result of MR-SPECT multi-modality image registration, anatomical and functional features of hippocampus are extracted from MR and registered SPECT images, respectively. The hippocampus is visualized in 3D by applying volume rendering to hippocampus volume data extracted from the MR image with color coded by registered SPECT image. In order to offer the objective and quantitative data concerning to the anatomic shape and functional features of the hippocampus, the geometric volume and the SPECT intensity histogram of hippocampus regions are automatically measured based on the MR and the registered SPECT image, respectively. We also propose a new method for the analysis of hippocampal shape using an integrated Octree-based representation, consisting of meshes, voxels, and skeletons. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Image analysis

来源：评论

学校读者我要写书评

暂无评论

Archaeometric characterization and 3D survey: new perspectives for monitoring and valorisation of Morgantina silver Treasure (Sicily) 1

Archaeometric characterization and 3D survey: new perspectiv...

引用

1st International Conference on Metrology for Archaeology, MetroArchaeo 2015

作者： Alberghina, Maria Francesca Alberghina, Filippo Allegra, Dario Paola, Francesco Di Maniscalco, Laura Milotta, Filippo L.M. Schiavone, Salvatore Stanco, Filippo ECOX di M. Alberghina & C Niscemi Italy Department of Mathematics and Computer Science University of Catania Catania Italy Department of Architecture University of Palermo Palermo Italy IEMEST Euro Mediterranean Institute of Science and Technology Department of "Communication Interactive Graphics and Augmented Reality" Palermo Italy Museo Regionale di Aidone Italy S.T.Art-Test di S. Schiavone & C Niscemi Italy

ISBN: (纸本)9788894045338

The Morgantina silver Treasure belonging to the collections of the Archaeological Museum of Aidone (Sicily) were involved in a 3D survey and diagnostics campaign for monitoring over time of the finds, in anticipation of their temporary transfer to the Metropolitan Museum of Art in New York, for a period of four years. According to a multidisciplinary approach, it has been developed a scientific and methodological protocol based on non-invasive techniques to achieve a complete and integrated knowledge of the precious items, of their conservation state and increasing their valorisation. All acquired data, i.e. 3D models, UV fluorescence and X-Ray images and chemical information, will be made available, in a integrated way, within a web oriented platform, that will represent a in progress tool to deepen the existing archaeological knowledge and technologies of production and to obtain referenced information of the state of preservation, before and after moving of the finds from their exposure site. © 2015 Metrology for Archaeology, MetroArchaeo

关键词： Silver

来源：评论

学校读者我要写书评

暂无评论

Advanced medical image visualization and analysis systems for diagnosis and treatment planning

Advanced medical image visualization and analysis systems fo...

引用

IEEE International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)

作者： Myoung-Hee Kim Yu-Bu Lee Yoo-Joo Choi Center for Computer Graphics and Virtual Reality Ewha Womans University Seoul South Korea Department of Computer Science and Engineering Ewha Womans University Seoul South Korea

ISBN: (纸本)0780386396

Most medical image processing techniques require the clinician to form a mental model of the anatomy being depicted. We present systems that allow a more direct visualization of anatomical shapes and measurement of parameters from medical image data, including time-dependent and multi-modal image sets. Cardiac-Station realistically represents heart motion and extracts clinical parameters from ventricular MR images, in the diagnosis of heart disease. Brain-Reg displays abnormal regions of the brain by registering multi-modal images, and supports the analysis of differences in the hippocampus between patients and a control group.

关键词： Biomedical imaging Medical diagnostic imaging Image analysis Medical treatment Data visualization Shape measurement Biomedical image processing Cognitive science Anatomy Heart

来源：评论

学校读者我要写书评

暂无评论

Polar, Spherical and Orthogonal Space Subdivisions for an Algorithm Acceleration: O(1) Point-in-Polygon/Polyhedron Test

arXiv

引用

arXiv 2022年

作者： Skala, Vaclav The University of West Bohemia Faculty of Applied Sciences Department .of Computer Science and Engineering Center of Computer Graphics and Visualization Univerzitni 8 PlzenCZ 30614 Czech Republic

Acceleration of algorithms is becoming a crucial problem, if larger data sets are to be processed. Evaluation of algorithms is mostly done by using computational geometry approach and evaluation of computational complexity. However in today’s engineering problems this approach does not respect that number of processed items is always limited and a significant role plays also speed of read/write operations. One general method how to speed up an algorithm is application of space subdivision technique and usually the orthogonal space subdivision is used. In this paper non-orthogonal subdivisions are described. The proposed approach can significantly improve memory consumption and run-time complexity. The proposed modified space subdivision techniques are demonstrated on two simple problems Point-in-Convex Polygon and Point-in-Convex Polyhedron *** Codes 65D17, 65D18 © 2022, CC BY.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：