Optimal development of doubly curved surfaces

Guoxin Yu, Nicholas M. Patrikalakis, Takashi Maekawa

Research output: Contribution to journalArticle

49 Citations (Scopus)

Abstract

This paper presents algorithms for optimal development (flattening) of a smooth continuous curved surface embedded in three-dimensional space into a planar shape. The development process is modeled by in-plane strain (stretching) from the curved surface to its planar development. The distribution of the appropriate minimum strain field is obtained by solving a constrained nonlinear programming problem. Based on the strain distribution and the coefficients of the first fundamental form of the curved surface, another unconstrained nonlinear programming problem is solved to obtain the optimal developed planar shape. The convergence and complexity properties of our algorithms are analyzed theoretically and numerically. Examples show the effectiveness of the algorithms.

Original languageEnglish
Pages (from-to)545-577
Number of pages33
JournalComputer Aided Geometric Design
Volume17
Issue number6
DOIs
Publication statusPublished - 2000 Jan 1
Externally publishedYes

Fingerprint

Curved Surface
Nonlinear programming
Nonlinear Programming
Plane Strain
Development Process
Stretching
Three-dimensional
Coefficient

ASJC Scopus subject areas

  • Modelling and Simulation
  • Automotive Engineering
  • Aerospace Engineering
  • Computer Graphics and Computer-Aided Design

Cite this

Optimal development of doubly curved surfaces. / Yu, Guoxin; Patrikalakis, Nicholas M.; Maekawa, Takashi.

In: Computer Aided Geometric Design, Vol. 17, No. 6, 01.01.2000, p. 545-577.

Research output: Contribution to journalArticle

Yu, Guoxin ; Patrikalakis, Nicholas M. ; Maekawa, Takashi. / Optimal development of doubly curved surfaces. In: Computer Aided Geometric Design. 2000 ; Vol. 17, No. 6. pp. 545-577.
@article{445fa655fd7a4f039f22174425a617aa,
title = "Optimal development of doubly curved surfaces",
abstract = "This paper presents algorithms for optimal development (flattening) of a smooth continuous curved surface embedded in three-dimensional space into a planar shape. The development process is modeled by in-plane strain (stretching) from the curved surface to its planar development. The distribution of the appropriate minimum strain field is obtained by solving a constrained nonlinear programming problem. Based on the strain distribution and the coefficients of the first fundamental form of the curved surface, another unconstrained nonlinear programming problem is solved to obtain the optimal developed planar shape. The convergence and complexity properties of our algorithms are analyzed theoretically and numerically. Examples show the effectiveness of the algorithms.",
author = "Guoxin Yu and Patrikalakis, {Nicholas M.} and Takashi Maekawa",
year = "2000",
month = "1",
day = "1",
doi = "10.1016/S0167-8396(00)00017-0",
language = "English",
volume = "17",
pages = "545--577",
journal = "Computer Aided Geometric Design",
issn = "0167-8396",
publisher = "Elsevier",
number = "6",

}

TY - JOUR

T1 - Optimal development of doubly curved surfaces

AU - Yu, Guoxin

AU - Patrikalakis, Nicholas M.

AU - Maekawa, Takashi

PY - 2000/1/1

Y1 - 2000/1/1

N2 - This paper presents algorithms for optimal development (flattening) of a smooth continuous curved surface embedded in three-dimensional space into a planar shape. The development process is modeled by in-plane strain (stretching) from the curved surface to its planar development. The distribution of the appropriate minimum strain field is obtained by solving a constrained nonlinear programming problem. Based on the strain distribution and the coefficients of the first fundamental form of the curved surface, another unconstrained nonlinear programming problem is solved to obtain the optimal developed planar shape. The convergence and complexity properties of our algorithms are analyzed theoretically and numerically. Examples show the effectiveness of the algorithms.

AB - This paper presents algorithms for optimal development (flattening) of a smooth continuous curved surface embedded in three-dimensional space into a planar shape. The development process is modeled by in-plane strain (stretching) from the curved surface to its planar development. The distribution of the appropriate minimum strain field is obtained by solving a constrained nonlinear programming problem. Based on the strain distribution and the coefficients of the first fundamental form of the curved surface, another unconstrained nonlinear programming problem is solved to obtain the optimal developed planar shape. The convergence and complexity properties of our algorithms are analyzed theoretically and numerically. Examples show the effectiveness of the algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0034230424&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034230424&partnerID=8YFLogxK

U2 - 10.1016/S0167-8396(00)00017-0

DO - 10.1016/S0167-8396(00)00017-0

M3 - Article

AN - SCOPUS:0034230424

VL - 17

SP - 545

EP - 577

JO - Computer Aided Geometric Design

JF - Computer Aided Geometric Design

SN - 0167-8396

IS - 6

ER -