期刊文献+

过测地线的调和Bézier曲面设计 被引量:3

Harmonic Bézier Surfaces Passing Given Geodesic
下载PDF
导出
摘要 极小曲面和测地线是建筑几何领域中2类重要的几何元素,而调和曲面常作为极小曲面的一种线性近似.文中将测地线和调和曲面结合起来,提出一种过给定测地线的调和Bézier曲面设计方法.首先给出了一种构造调和Bézier曲面的新方法,证明了调和Bézier曲面的形状由第一层和第二层的控制顶点完全决定;然后根据测地线的性质,证明了过给定测地线的调和Bézier曲面的形状由该测地线和第二层的首末2个控制顶点完全决定.最后通过若干实例验证了该方法的有效性.文中方法充分利用了测地线和调和曲面的特殊几何性质,对张拉膜建筑结构的几何设计具有一定的实用价值. Minimal surfaces and geodesics are two important kinds of elements in the field of architecture geometry, and the harmonic surface is often considered as a linear approximation of minimal surface. In this paper, by the combination of geodesic and harmonic surface, we propose a new method which generates harmonic B6zier surfaces determined by a given geodesic. We originally prove that the control points on the first and second layers of the control mesh are the only factors that determine the shape of a certain harmonic B6zier surface. With this property of harmonic surfaces, we further prove that the shape of harmonic B6zier surface through a given geodesic is entirely determined by the given geodesic and two control points on opposite end of the second layer..At the end of this paper, the effectiveness of the proposed method is illustrated by several examples with data analysis. The proposed construction method is derived from the geometric properties of geodesic and harmonic surfaces, which is valuable for the design of tension membrane structure.
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2013年第10期1439-1445,共7页 Journal of Computer-Aided Design & Computer Graphics
基金 国家自然科学基金(61004117,61272390,61003193) 浙江省自然科学基金(Y1090718) 国防基础科研计划(A3920110002) 教育部留学回国人员科研启动基金([2012]1707) 杭州电子科技大学校科研启动基金(KYS055611029)
关键词 建筑几何 调和曲面 测地线 极小曲面 architecture geometry harmonic surface geodesic minimal surface
  • 相关文献

参考文献4

二级参考文献42

  • 1肖春霞,冯结青,缪永伟,郑文庭,彭群生.基于Level Set方法的点采样曲面测地线计算及区域分解[J].计算机学报,2005,28(2):250-258. 被引量:16
  • 2Celniker G, Welch W. Linear constraints for deformable Bspline surfaces [C]//Proc of the 1992 Symp on Interactive 3D Graphics. New York: ACM, 1992:165-170
  • 3Welch W, Watkin A. Variational surface modeling [J]. Computer Graphics, 1992, 26(2): 157-166
  • 4Zhao H Y, Wang G J. A new approach for designing rational Bezier surfaces from a given geodesic [J]. Journal of Information and Computational Science, 2007, 4 (2) : 879 - 887
  • 5Terzopoulos D, Platt J, Barr A, et a l. Elastically deformable models [J]. Computer Graphics, 1987, 21(4) :205-214
  • 6Brond R, Jeulin D, Gateau P, et al. Estimation of the transport properties of polymer composites by geodesic propagation [J]. Journal of Microscopy, 1994, 176(2) : 167- 177
  • 7Bryson S. Virtual spacetime: An environment for the visualization of curved spacetimes via geodesic flows [C]// Proc of IEEE Visualization'92 Conference. Los Alamitos, CA: IEEE Computer Society, 1992:291-298
  • 8Haw R J, Munchmeyer R C. Geodesic curves on patched polynomial surfaces [J]. Computer Graphics Forum, 1983, 2 (4) : 225-232
  • 9Haw R J. An application of geodesic curves to sail design [J]. Computer Graphics Forum, 1985, 4(2): 137-139
  • 10Wang G J, Tang K, Tai C L. Parametric representation of a surface pencil with a common spatial geodesic [J]. Computer- Aided Design, 2004, 36(5): 447-459

共引文献24

同被引文献31

  • 1Attene M, Campen M, Kobbelt L. Polygon mesh repairing: anapplication perspective[J]. ACM Computing Surveys, 2013,45(2): Article No.15.
  • 2Pang X F, Song Z, Lau R W H. An effective quad-dominantmeshing method for unorganized point clouds[J]. GraphicalModels, 2014, 76 (2): 86-102.
  • 3Kustra J, Jalba A, Telea A. Robust segmentation of multiple intersectingmanifolds from unoriented noisy point clouds[J].Computer Graphics Forum, 2014, 33 (1): 73-87.
  • 4Campen M, Kobbelt L. Walking on broken mesh: defect-tolerantgeodesic distances and parameterizations[J]. ComputerGraphics Forum, 2011, 30 (2): 623-632.
  • 5Quynh D T P, He Y, Xin S Q, et al. An intrinsic algorithm forcomputing geodesic distance fields on triangle meshes withholes[J]. Graphical Models, 2012, 74 (4): 209-220.
  • 6Radwan M, Ohrhallinger S, Wimmer M. Efficient collision detectionwhile rendering dynamic point clouds[C] //Proceedingsof the Graphics Interface Conference. Toronto: Canadian InformationProcessing Society Press, 2014: 25-33.
  • 7Crane K, Weischedel C, Wardetzky M. Geodesics in heat: anew approach to computing distance based on heat flow[J].ACM Transactions on Graphics, 2013, 32 (5): Article No.152.
  • 8Mitchell J S B, Mount D M, Papadimitriou C H. The discretegeodesic problem[J]. SIAM Journal on Computing, 1987, 16(4): 647-668.
  • 9Sharir M, Schorr A. On shortest paths in polyhedral spaces[J].SIAM Journal on Computing, 1986, 15 (1): 193-215.
  • 10Xin S Q, Wang G J. Improving Chen and Han’s algorithm onthe discrete geodesic problem[J]. ACM Transactions on Graphics,2009, 28 (4): Article No.104.

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部