全文获取类型
收费全文 | 299篇 |
免费 | 24篇 |
国内免费 | 18篇 |
专业分类
化学 | 13篇 |
力学 | 33篇 |
综合类 | 4篇 |
数学 | 213篇 |
物理学 | 78篇 |
出版年
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 5篇 |
2019年 | 5篇 |
2018年 | 7篇 |
2017年 | 4篇 |
2016年 | 8篇 |
2015年 | 6篇 |
2014年 | 12篇 |
2013年 | 14篇 |
2012年 | 11篇 |
2011年 | 17篇 |
2010年 | 12篇 |
2009年 | 21篇 |
2008年 | 25篇 |
2007年 | 18篇 |
2006年 | 16篇 |
2005年 | 14篇 |
2004年 | 25篇 |
2003年 | 13篇 |
2002年 | 10篇 |
2001年 | 12篇 |
2000年 | 10篇 |
1999年 | 12篇 |
1998年 | 14篇 |
1997年 | 11篇 |
1996年 | 9篇 |
1995年 | 3篇 |
1994年 | 8篇 |
1993年 | 2篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1987年 | 2篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 2篇 |
排序方式: 共有341条查询结果,搜索用时 15 毫秒
91.
Delaunay triangulation and its complementary structure the Voronoi polyhedra form two of the most fundamental constructs of computational geometry. Delaunay triangulation offers an efficient method for generating high-quality triangulations. However, the generation of Delaunay triangulations in 3D with Watson's algorithm, leads to the appearance of silver tetrahedra, in a relatively large percentage. A different method for generating high-quality tetrahedralizations, based on Delaunay triangulation and not presenting the problem of sliver tetrahedra, is presented. The method consists in a tetrahedra division procedure and an efficient method for optimizing tetrahedral meshes, based on the application of a set of topological Delaunay transformations for tetrahedra and a technique for node repositioning. The method is robust and can be applied to arbitrary unstructured tetrahedral meshes, having as a result the generation of high-quality adaptive meshes with varying density, totally eliminating the appearance of sliver elements. In this way it offers a convenient and highly flexible algorithm for implementation in a general purpose 3D adaptive finite element analysis system. Applications to various engineering problems are presented 相似文献
92.
Julien Basch Jeff Erickson Leonidas J. Guibas John Hershberger Li Zhang 《Computational Geometry》2004,27(3):191-235
We design a kinetic data structure for detecting collisions between two simple polygons in motion. In order to do so, we create a planar subdivision of the free space between the two polygons, called the external relative geodesic triangulation, which certifies their disjointness. We show how this subdivision can be maintained as a kinetic data structure when the polygons are moving, and analyze its performance in the kinetic setting. 相似文献
93.
V. Lombardo T. Marzulli C. Pappalettere P. Sforza 《Optics and Lasers in Engineering》2003,39(2):247-254
This paper reports the development of an electro-optic device for relative distance measurement. The time-of-scan triangulation technique has been used as measurement principle and a rotating mirror employed as beam deflection system. A calibration technique is needed to calculate the geometrical parameters of the system. The device has an accuracy of 100 μm, a working distance of 20 cm and a range of 10 mm. The accuracy obtained depends on the instability of the rotation speed of the mechanical scanner that affects the measurement of the scanning time. 相似文献
94.
95.
A triangulation is said to be even if each vertex has even degree. For even triangulations, define the N‐flip and the P2‐flip as two deformations preserving the number of vertices. We shall prove that any two even triangulations on the sphere with the same number of vertices can be transformed into each other by a sequence of N‐ and P2‐flips. © 2005 Wiley Periodicals, Inc. J. Graph Theory 相似文献
96.
We extend Whitney's Theorem that every plane triangulation without separating triangles is hamiltonian by allowing some separating triangles. More precisely, we define a decomposition of a plane triangulation G into 4‐connected ‘pieces,’ and show that if each piece shares a triangle with at most three other pieces then G is hamiltonian. We provide an example to show that our hypothesis that each piece shares a triangle with at most three other pieces' cannot be weakened to ‘four other pieces.’ As part of our proof, we also obtain new results on Tutte cycles through specified vertices in planar graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 138–150, 2002 相似文献
97.
98.
99.
100.
基于非结构自适应网格的复合有限体积法 总被引:5,自引:0,他引:5
利用文献[1]中将Lax-Wendroff格式和Lax-Friedrichs格式整体复合作用构成二维无结构网格上的复合型有限体积法,同时利用Delaunay方法,根据流场流动特性变化的梯度值为指示器对网格进行加密和粗化,实现自适应,并将此方法应用到二维浅水波方程的求解上,进行了二维部分溃坝,倾斜水跃的数值实验.结果表明,该方法是一个计算稳定、能适应复杂的求解域、能很好地捕捉激波、且计算速度快的算法. 相似文献