Subdivision-Based Representations for Surface Styling and Design - - PDF document

subdivision based representations for surface styling and
SMART_READER_LITE
LIVE PREVIEW

Subdivision-Based Representations for Surface Styling and Design - - PDF document

DIMACS03 Subdivision-Based Representations for Surface Styling and Design Ioana Boier-Martin & Fausto Bernardini IBM T. J. Watson Research Center ioana@us.ibm.com, fausto@us.ibm.com DIMACS03 Motivation IBM-Dassault-NYU


slide-1
SLIDE 1

1

DIMACS’03

Subdivision-Based Representations for Surface Styling and Design

Ioana Boier-Martin & Fausto Bernardini IBM T. J. Watson Research Center

ioana@us.ibm.com, fausto@us.ibm.com

DIMACS’03

Motivation

IBM-Dassault-NYU collaboration Address limitations of NURBS

Arbitrary topology Multiple resolutions Efficient transition from styling to class A

surfaces

Interactive styling operations Integration into CATIA

slide-2
SLIDE 2

2

DIMACS’03

Outline

Subdivision surfaces

Catmull-Clark subdivision Multiresolution

Modeling operations

Surface pasting Engraving, embossing, trimming Free-form variational design

Conversion / remeshing

DIMACS’03

subdivision = repeated refinement many attractive features:

arbitrary topology scalability, LOD uniformity code simplicity, etc

Subdivision

slide-3
SLIDE 3

3

DIMACS’03

Multiresolution Subdivision

multiresolution = subdivision + details

detail vector in local frame add details

DIMACS’03

Surface Pasting

(SIGGRAPH 2002)

With Henning Biermann and Denis Zorin (NYU)

slide-4
SLIDE 4

4

DIMACS’03

Surface Pasting

Transfer geometry between surfaces Interactive placement

DIMACS’03

Method Overview

target region joint parameterization result details base surface feature selection

slide-5
SLIDE 5

5

DIMACS’03

Base / Detail Separation

Controlled by a single

parameter: flatness

Smoothly varying from

soapfilm to the original surface

Use soapfilm surface to get a

flatter base than the coarsest level

Use fitting/quasi-interpolation

at different subdivision levels to get discrete set

DIMACS’03

Target Region Finding

Problem

Find the target region for pasting Closely match feature size and shape

source: selected region boundary parameterization target region

slide-6
SLIDE 6

6

DIMACS’03

Parameterization

Approach: parameterize both source and

target onto a plane

Requirements: one-to-one, minimize

distortion, free boundary

DIMACS’03

Demo

slide-7
SLIDE 7

7

DIMACS’03

Sharp Feature Editing

With Henning Biermann and Denis Zorin (NYU)

DIMACS’03

Sharp Features

Sharp features are important for the creation of non-trivial models

engraving, embossing, trimming, …

slide-8
SLIDE 8

8

DIMACS’03

Problem

Features only at certain locations

features restricted to seams between patches

and iso-parameter lines

We want arbitrary placement without repatching!

DIMACS’03

Method Overview

Reparameterize surface Add feature profile Subdivide with special rules

displace & subdivide input reparameterize

slide-9
SLIDE 9

9

DIMACS’03

Align feature with parameter lines

snap vertices recursively to feature

align

Reparameterization

DIMACS’03

Creating Features

mark features as creases apply offsets along features

slide-10
SLIDE 10

10

DIMACS’03

Demo

DIMACS’03

Variational Design

With Remi Ronfard (INRIA)

slide-11
SLIDE 11

11

DIMACS’03

Free-Form Modeling

  • riginal

point constraints normal constraints curve constraints

DIMACS’03

Method Overview

Energy:

Define energy functional over the mesh Ensure optimization does not smooth out details

Locally parameterize mesh:

fit quadratic interpolant at each control point construct divided difference operators

Deform mesh:

impose constraints and propagate them across

levels

minimize global energy under constraints

slide-12
SLIDE 12

12

DIMACS’03

Avoid smoothing out details

preserve multiresolution details

Minimize only the deformation energy

i.e., in the presence of no constraints, the rest

shape is the initial shape

Energy Minimization

+ ∆ + ∆ + = ∆ +

i i i

const P f P E P E P P E ) ( ) ( ) (

DIMACS’03

Multiresolution Constraints

Linear constraints are propagated across subdivision levels

slide-13
SLIDE 13

13

DIMACS’03

Demo

DIMACS’03

Semi-Regular Remeshing

slide-14
SLIDE 14

14

DIMACS’03

Remeshing: Loop

Irregular-connectivity mesh Semi-regular multiresolution representation

DIMACS’03

Algorithm Overview

slide-15
SLIDE 15

15

DIMACS’03

F# 78 F# 1,718 5 levels Spherical (Brechbühler) F# 236 F# 3,060 5 levels Conformal (Desbrun)

DIMACS’03

Results

F# 142 F# 1,705 F# 14,569 4 levels

slide-16
SLIDE 16

16

DIMACS’03

THE END

DIMACS’03