维普期刊资源整合服务平台（V6.5）

480篇 您的检索式：期刊名="Computational Geometry"

选中清除导出查看参考文献查看引证文献引用追踪共24页首页上一页第1页下一页末页 /24 跳转

	题名	作者	年代	出处	被引量
1	Delaunay refinement algorithms for triangular mesh generation显示文摘	Shewchuk J R	2002	Computational Geometry2002，22，1：	1
2	Reverse nearest neighbor queries in fixed dimension显示文摘	Cheong O Vigneron A Yon J	2011	Int J Comput Geometry Appl2011，21，2：	1
3	Self-customized BSP trees for collision detection 显示文摘	Sigal A Bernard C Ayellet T	2000	Computational Geometry2000，15，1：	1
4	Optimal triangulation and quadricbased surface simplification 显示文摘	Heckbert P S Garland M	1999	Computational Geometry1999，14，11：	1
5	High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension显示文摘	Donoho D	2006	Discrete Computation Geometry2006，35，4：	1
6	The point in polygon problem for arbitrary polygons 显示文摘	Kai Hormann Alexander Agathos	2001	Computational Geometry2001，20，3：	1
7	Isomorphic Triangulations with Small Number of Steiner Points显示文摘	E Kranakis J Urrutia	1999	International Journal of Computational Geometry and Applications1999，9，2：	1
8	Culling a set of points for roundness or cylindricity evaluations显示文摘	Olivier D Franco P P	2003	International Journal of Computational Geometry2003，13，2：	1
9	A comparison of sequential delaunay triangulation algorithms显示文摘	SU P ROBERT L DRYSDALE S	1995	Proceedings of the Eleventh Annual Symposium on Computational Geometry (Vancouver British Columbia Canada) ACM1995，6170，：	1
10	Simple algorithms for enumerating interpoint distances and finding k nearest neighbors 显示文摘	Dicherson M T Drysdale R L S Sack J R	1992	International Journal of Computational Geometry and Applications1992，2，3：	1
11	Computing the shortest watchtower of a polyhedral terrain in O(nlogn) time显示文摘	Zhu B	1997	Computational Geometry Theory Ap- plications1997，8，1：	1
12	COMBiNAtORiAL AND ExpERiMENtALRESuLtS fOR RANDOMiZED pOiNt MAtChiNg ALgORithMS显示文摘	IRANI S RAGHAVAN P	1999	COMputAtiONAL GEOMEtRy1999，12，12：	1
13	Curve reconstruction:Connecting dots with good reason显示文摘	Dey T K Mehlhorn K Ramos E A	2000	Computational Geometry Theory and Applications2000，15，4：	1
14	Surface reconstruction by voronoi filtering显示文摘	Amenta N Bern M	1999	Discrete Computational Geometry1999，22，4：	1
15	Divide-and-conquer for Voronoi Diagrams Revisted 显示文摘	Aichholzer O Aigner W Aurenhammer F	2010	Computational Geometry2010，43，8：	1
16	Interactive texture mapping for polygonal models显示文摘	HUJUN Bao	2000	Computational Geometry2000，15，3：	1
17	Variants for the Hough transform for line detection显示文摘	Tetsuo Asano Naoki Katoh	1996	Computational Geometry1996，6，：	1
18	Covering Squares with Squares 显示文摘	ABBOTT H L KACHALSKI M	2000	Discrete and Computational Geometry2000，24，：	1
19	A local search Approximation algo- rithm for k-means clustering显示文摘	Kanungo T Mount D M	2004	Computational Geometry2004，28，23：	1
20	More on an Erdos-Szekeres-Type problem for interior points显示文摘	WEI Xiang-lin DING Ren	2009	Discrete and Computational Geometry2009，42，：	1

返回顶部每页显示：

共24页首页上一页第1页下一页末页 /24 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示