维普中文期刊产品整合服务
142篇 您的检索式:期刊名="Discrete Computational Geometry"
    题名 作者 年代 出处 被引量
1High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension显示文摘Donoho D 2006Discrete Computation Geometry2006,35,4:1
2Surface reconstruction by voronoi filtering显示文摘Amenta N Bern M 1999Discrete Computational Geometry1999,22,4:1
3Covering Squares with Squares 显示文摘ABBOTT H L KACHALSKI M 2000Discrete and Computational Geometry2000,24,:1
4More on an Erdos-Szekeres-Type problem for interior points显示文摘WEI Xiang-lin DING Ren 2009Discrete and Computational Geometry2009,42,:1
5Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pair-wise interactions 显示文摘Eppstein D Erickson J 1999Discrete and Computational Geometry1999,22,4:1
6Algorithms on Minimizing the Maxi- mum Sensor Movement for Barrier Coverage of a Linear Domain 显示文摘Chen D Z Gu Y Li J 2012Discrete & Computational Geometry2012,50,2:1
7Simplified voronoi diagram显示文摘CANNY J DONALD B 1988Discrete and Computational Geometry1988,3,3:1
8Maximal f-vectors of Minkowski sums of large numbers of polytopes 显示文摘Christophe W 2012Discrete & Computational Geometry2012,47,3:1
9Finding the medial axis of a simple polygon in linear time 显示文摘Chin Francis Snoeyink Jack Wang Caoan 1999Discrete and Computational Geometry1999,21,3:1
10Adaptive precision floating-point arithmetic and fast robust geometric predicates 显示文摘SHEWCHUK J R 1997Discrete Computational Geometry1997,18,3:1
11Generic Global Rigidity显示文摘Robert Connelly 2005Discrete & Computational Geometry2005,,4:1
12K-means requires exponentially many iterations e- ven in the plane 显示文摘VATrANI A 2011Discrete and Computational Geometry2011,45,4:1
13Three-dimensional delaunay mesh generation显示文摘Cheng S W Poon S H 2006Discrete & Computational Geometry archive2006,36,3:1
14Generalized Delaunay Triangulation for Planar Graphs显示文摘LEE D LIN A 1986Discrete and Computational Geometry1986,,1:1
15Adaptive precision floating-point arithme- tic and fast robust geometric predicates显示文摘Shewchuk J R 1997Discrete & Computational Geometry1997,18,3:1
16A Discrete Laplace–Beltrami Operator for Simplicial Surfaces显示文摘Alexander I. Bobenko Boris A. Springborn 2007Discrete & Computational Geometry2007,,4:1
17ComputingCartograms with Optimal Complexity 显示文摘Alam M J Biedl T Felsner S 2013Discrete &Computational Geometry (S0179-5376)2013,50,3:1
18Topologically sweeping visibility complexes via pseudo-triangulations 显示文摘Pocchiola M Vegter G 1996Discrete Computational Geometry1996,16,4:1
19The Euclidean distortion of complete binary trees显示文摘Linial N Saks M 2003Discrete and Computational Geometry2003,29,1:1
20Optimal output-sensitive convex hull algorithms in two and three dimensions显示文摘Chan T M 1996Discrete and Computational Geometry1996,16,4:1
返回顶部 每页显示:
共8页 首页 上一页 第1页 下一页 末页 /8 跳转

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

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