#### Filter Results:

#### Publication Year

1993

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We describe two new shape operators that superimpose wrinkles on top of a smooth NURBS surface. Previous research studying wrinkles focused mostly on cloth modeling or in animations, which are driven more by visual realism, but allow large elastic deformations. Our operators generate wrinkle-shaped deformations in a region of a smooth surface along a given… (More)

In this paper, a new dynamic developable surface model is proposed. The proposed model represents developable surfaces using triangle meshes. A novel algorithm is proposed to introduce the Hamilton principle into these meshes such that the resulting developable model is dynamic, i.e., it can offer a time-dependent continuous path to deform the model.… (More)

In this paper, we present a feature-based free-form shape modelling technique based on solving a fundamental problem of reconstructing the depth information from 2D sketch planes. First, to mathematically define the problem with the human perception, the proposed technique (1) formulates the 2D shaded regions on sketches by a hybrid thin plate surface model… (More)

—3-D CAD models are an important digital resource in the manufacturing industry. 3-D CAD model retrieval has become a key technology in product lifecycle management enabling the reuse of existing design data. In this paper, we propose a new method to retrieve 3-D CAD models based on 2-D pen-based sketch inputs. Sketching is a common and convenient method… (More)

In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region. Given four pieces of polynomial curves which enclose a simple region in the plane, the algorithm first constructs a Bézier patch which interpolates the four curves (as its four… (More)

A simple and linear-time algorithm is presented for solving the problem of traversing a machining graph with minimum retractions encountered in zigzag pocket machining and other applications. This algorithm finds a traversal of the machining graph of a general pocket P with N h holes, such that the number of retractions in the traversal is no greater than… (More)

Polygon partitioning is an important problem in computational geometry with a long history. In this paper we consider the problem of partitioning a polygon with holes into a minimum number of uniformly monotone components allowing arbitrary Steiner points. We call this the MUMC problem. We show that, given a polygon with n vertices and h holes and a scan… (More)