Research Papers

Variational Discrete Developable Surface Interpolation

[+] Author and Article Information
Wen-Yong Gong

Institute of Mathematics,
Jilin University,
Changchun 130012, China
e-mail: gongwenyong@gmail.com

Yong-Jin Liu

Department of Computer
Science and Technology,
Tsinghua University,
Beijing 100084, China
e-mail: liuyongjin@tsinghua.edu.cn

Kai Tang

Department of Mechanical Engineering,
Hong Kong University of
Science and Technology,
Hong Kong 00852, China
e-mail: mektang@ust.hk

Tie-Ru Wu

Institute of Mathematics,
Jilin University,
Changchun 130012, China
e-mail: wutr@jlu.edu.cn

Contributed by the Design Engineering Division of ASME for publication in the JOURNAL OF Computing AND INFORMATION SCIENCE IN ENGINEERING. Manuscript received February 27, 2012; final manuscript received December 16, 2013; published online February 26, 2014. Editor: Bahram Ravani.

J. Comput. Inf. Sci. Eng 14(2), 021002 (Feb 26, 2014) (9 pages) Paper No: JCISE-12-1028; doi: 10.1115/1.4026291 History: Received February 27, 2012; Revised December 16, 2013

Modeling using developable surfaces plays an important role in computer graphics and computer aided design. In this paper, we investigate a new problem called variational developable surface interpolation (VDSI). For a polyline boundary P, different from previous work on interpolation or approximation of discrete developable surfaces from P, the VDSI interpolates a subset of the vertices of P and approximates the rest. Exactly speaking, the VDSI allows to modify a subset of vertices within a prescribed bound such that a better discrete developable surface interpolates the modified polyline boundary. Therefore, VDSI could be viewed as a hybrid of interpolation and approximation. Generally, obtaining discrete developable surfaces for given polyline boundaries are always a time-consuming task. In this paper, we introduce a dynamic programming method to quickly construct a developable surface for any boundary curves. Based on the complexity of VDSI, we also propose an efficient optimization scheme to solve the variational problem inherent in VDSI. Finally, we present an adding point condition, and construct a G1 continuous quasi-Coons surface to approximate a quadrilateral strip which is converted from a triangle strip of maximum developability. Diverse examples given in this paper demonstrate the efficiency and practicability of the proposed methods.

Copyright © 2014 by ASME
Your Session has timed out. Please sign back in to continue.


Carmo, M. P. D., 1976, Differential Geometry of Curves and Surfaces, Vol. 1, Prentice-Hall, Englewood Cliffs, NJ.
Frey, W. H., 2004, “Modeling Buckled Developable Surfaces by Triangulation,” Comput.-Aided Des., 36(4), pp. 299–313. [CrossRef]
Liu, Y. J., Tang, K., and Joneja, A., 2007, “Modeling Dynamic Developable Meshes by the Hamilton Principle,” Comput.-Aided Des., 39(9), pp. 719–731. [CrossRef]
Liu, Y. J., Tang, K., Gong, W. Y., and Wu, T. R., 2011, “Industrial Design Using Interpolatory Discrete Developable Surfaces,” Comput.-Aided Des., 43(9), pp. 1089–1098. [CrossRef]
Rose, K., Sheffer, A., Wither, J., Cani, M. P., and Thibert, B., 2007, “Developable Surfaces from Arbitrary Sketched Boundaries,” Proceedings of the Fifth Eurographics Symposium on Geometry Processing, pp. 163–172.
Wang, C. C. L., and Tang, K., 2005, “Optimal Boundary Triangulations of an Interpolating Ruled Surface,” ASME J. Comput. Inf. Sci. Eng., 5(4), pp. 291–301. [CrossRef]
Zeng, L., Liu, Y. J., Chen, M., and Yuen, M. F., 2012, “Least Squares Quasi-Developable Mesh Approximation,” Comput. Aided Geom. Des., 29(7), pp. 565–578. [CrossRef]
Shelden, D. R., 2002, “Digital Surface Representation and the Constructability of Gehry’s Architecture,” PhD thesis, Massachusetts Institute of Technology, Cambridge, MA.
Liu, Y. J., Zhang, D. L., and Yuen, M. M., 2010, “A Survey on CAD Methods in 3D Garment Design,” Comput. Ind., 61(6), pp. 576–593. [CrossRef]
Tang, K., and Wang, C. C. L., 2005, “Modeling Developable Folds on a Strip,” J. Comput. Inf. Sci. Eng., 5(1), pp. 35–47. [CrossRef]
Pottmann, H., and Wallner, J., 2010, Computational Line Geometry, Springer Verlag, Berlin, Germany.
Frey, W. H., 2002, “Boundary Triangulations Approximating Developable Surfaces that Interpolate a Closed Space Curve,” Int. J. Found. Comput. Sci., 13(2), pp. 285–302. [CrossRef]
Gurunathan, B., and Dhande, S. G., 1987, “Algorithms for Development of Certain Classes of Ruled Surfaces,” Comput. Graphics, 11(2), pp. 105–112. [CrossRef]
Weiss, G., and Furtner, P., 1988, “Computer-Aided Treatment of Developable Surfaces,” Comput. Graphics, 12(1), pp. 39–51. [CrossRef]
Chu, C. H., and Séquin, C. H., 2002, “Developable Bezier Patches: Properties and Design,” Comput.-Aided Des., 34(7), pp. 511–527. [CrossRef]
Pottmann, H., and Farin, G., 1995, “Developable Rational Bezier and B-spline Surfaces,” Comput. Aided Geom. Des., 12(5), pp. 513–531. [CrossRef]
Bodduluri, R. M. C., and Ravani, B., 1993, “Design of Developable Surfaces Using Duality Between Point and Plane Geometries,” Comput. Aided Des., 25(10), pp. 621–632. [CrossRef]
Park, F. C., Yu, J., Chun, C., and Ravani, B., 2002, “Design of Developable Surfaces Using Optimal Control,” ASME J. Mech. Des., 124(4), pp. 602–608. [CrossRef]
Aumann, G., 2003, “A Simple Algorithm for Designing Developable Bézier Surfaces,” Comput. Aided Geom. Des., 20(8–9), pp. 601–619. [CrossRef]
Robson, C., Maharik, R., Sheffer, A., and Carr, N., 2011, “Context-Aware Garment Modeling from Sketches,” Comput. Graphics, 35(3), pp. 604–613. [CrossRef]
Wang, C. C. L., 2008, “Flattenable Mesh Surface Fitting on Boundary Curves,” ASME J. Comput. Inf. Sci. Eng., 8(2), p. 021006. [CrossRef]
Wang, C. C. L., 2008, “Towards Flattenable Mesh Surfaces,” Comput.-Aided Des., 40(1), pp. 109–122. [CrossRef]
Liu, Y. J., Lai, Y. K., and Hu, S. M., 2009, “Stripification of Free-Form Surfaces with Global Error Bounds for Developable Approximation,” IEEE Trans. Autom. Sci. Eng., 6(4), pp. 700–709. [CrossRef]
Catmull, E., and Rom, R., 1974, “A Class of Local Interpolating Splines,” Comput. Aided Geom. Des., R. E.Barnhill and R. F.Reisenfeld, eds. Academic Press, New York, 74, pp. 317–326.
Zoutendijk, G., 1960, Methods of Feasible Directions: A Study in Linear and Non-linear Programming, Elsevier Publishing Co., Amsterdam.


Grahic Jump Location
Fig. 1

(a) Discrete developable surface. (b) Normal map

Grahic Jump Location
Fig. 2

Boundary bridge triangulation (a) and boundary triangulation (b) generated by the same closed polyline

Grahic Jump Location
Fig. 3

Two halves P(l+) and P(l-) by a rung 〈i,j〉. (a) Two bridge triangles from 〈i,j〉. (b) Visibility vertex Pk of rung 〈i,j〉.

Grahic Jump Location
Fig. 4

A multiple connected region (a) and a cut (b)

Grahic Jump Location
Fig. 5

Two Catmull–Rom splines with τ = 0.5 in (a) and τ = 1.0 in (b)

Grahic Jump Location
Fig. 6

A tent model is generated by different methods. (a) Wang and Tang’s result [6]. (b) The result of Liu et al. [4]. (c) Our result.

Grahic Jump Location
Fig. 7

Modify a polygon boundary by moving its vertices within a bound. Adjusting the vertex Pi finally obtains Pi'.

Grahic Jump Location
Fig. 8

The diagram of adding point rule

Grahic Jump Location
Fig. 9

(a) An umbrella model. (b) Wire umbrella model. (c) Unfolded planar mesh of an optimal triangulation.

Grahic Jump Location
Fig. 10

(a) A tower model is made up of five optimal triangulation strips. (b) The solid model of the tower. Right column: unfolded planar meshes of several optimal triangulation strips.

Grahic Jump Location
Fig. 11

(a) The top surface of a mouse is made up of five optimal triangulation strips. (b) The variational developable surface interpolation, and the black points represent the varying points. Right column: unfolded planar meshes.

Grahic Jump Location
Fig. 12

(a) A hat model consists of three optimal triangulation strips (except the feather model and top surface). (b) The variational developable surface interpolation, and the black points represent the varying points. Right column: unfolded planar meshes.

Grahic Jump Location
Fig. 13

(a) A flower model. (b) The flower model after varying several points. (c)–(j) Unfolded planar meshes corresponding to the optimal triangulation strips in (b). (k) The solid flower model.

Grahic Jump Location
Fig. 14

(a) The top surface of a mouse is made up of two optimal triangulation strips. (b) Two strips in (a) are converted into two quadrilateral strips. (c) The top surface is approximated by two G1 continuous quasi-Coons surfaces.




Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In