Curved Surfaces. Thomas Funkhouser Princeton University C0S 426, Fall 1999

Size: px
Start display at page:

Download "Curved Surfaces. Thomas Funkhouser Princeton University C0S 426, Fall 1999"

Transcription

1 Curved Surfaces Thomas Funkhouser rinceton University C0S 46, Fall 1999 Curved Surfaces Motivation Exact boundary representation for some objects More concise representation than polygonal mesh H&B Figure

2 Curved Surfaces What makes a good surface representation? Accurate Concise Intuitive specification Local support Affine invariant Arbitrary topology Guaranteed continuity Natural parameterization Efficient display Efficient intersections Curved Surface Representations olygonal meshes Subdivision surfaces arametric surfaces Implicit surfaces

3 Curved Surface Representations olygonal meshes Implicit surfaces arametric surfaces Subdivision surfaces arametric Surfaces Boundary defined by parametric functions: x = f x (u,v) y = f y (u,v) z = f z (u,v) Example: ellipsoid x = rx cosφ cosθ y = ry cosφ sinθ z = r sinφ z H&B Figure

4 arametric Surfaces Advantages: Easy to enumerate points on surface v roblem: u Need piecewise-parametrics surfaces to describe complex shapes FvDFH Figure 11.4 iecewise arametric Surfaces Surface is partitioned into parametric patches: Same ideas as parametric splines! Watt Figure 6.5 4

5 arametric atches Each patch is defined by blending control points Same ideas as parametric curves! FvDFH Figure arametric atches oint Q(u,v) on the patch is the tensor product of parametric curves defined by the control points Q(0,1) Q(u,v) Q(1,1) Q(0,0) Q(1,0) Watt Figure 6.1 5

6 arametric Bicubic atches oint Q(u,v) on any patch is defined by combining control points with polynomial blending functions: Q( u, v) = UM 1,1,1 3,1 4,1 1,, 3, 4, 1,3,3 3,3 4,3 1,4,4 3,4 4,4 M T V T 3 3 U = [ u u u 1] V = [ v v v 1] Where M is a matrix describing the blending functions for a parametric cubic curve (e.g., Bezier, B-spline, etc.) B-Spline atches Q( u, v) = UM B Spline 1,1,1 3,1 4,1 1,, 3, 4, 1,3,3 3,3 4,3 1,4,4 3,4 4,4 M T B Spline V M B Spline = Watt Figure 6.8 6

7 Bezier atches Q( u, v) = UM Bezier 1,1,1 3,1 4,1 1,, 3, 4, 1,3,3 3,3 4,3 1,4,4 3,4 4,4 M T Bezier V M Bezier 1 = FvDFH Figure 11.4 Bezier atches roperties: Interpolates four corner points Convex hull Local control Watt Figure 6. 7

8 Bezier Surfaces Continuity constraints are similar to the ones for Bezier splines FvDFH Figure Bezier Surfaces C 0 continuity requires aligning boundary curves Watt Figure 6.6a 8

9 Bezier Surfaces C 1 continuity requires aligning boundary curves and derivatives Watt Figure 6.6b Drawing Bezier Surfaces Simple approach is to loop through uniformly spaced increments of u and v DrawSurface(void) { for (int i = 0; i < imax; i++) { float u = umin + i * ustep; for (int j = 0; j < jmax; j++) { float v = vmin + j * vstep; DrawQuadrilateral(...); } } } Watt Figure 6.3 9

10 Drawing Bezier Surfaces Better approach is to use adaptive subdivision: DrawSurface(surface) { if Flat (surface, epsilon) { DrawQuadrilateral(surface); } else { SubdivideSurface(surface,...); DrawSurface(surfaceLL); DrawSurface(surfaceLR); DrawSurface(surfaceRL); DrawSurface(surfaceRR); } } Uniform subdivision Adaptive subdivision Watt Figure 6.3 Drawing Bezier Surfaces One problem with adaptive subdivision is avoiding cracks at boundaries between patches at different subdivision levels Crack Avoid these cracks by adding extra vertices and triangulating quadrilaterals whose neighbors are subdivided to a finer level Watt Figure

11 arametric Surfaces Advantages: Easy to enumerate points on surface ossible to describe complex shapes Disadvantages: Control mesh must be quadrilaterals Continuity constraints difficult to maintain Hard to find intersections Curved Surface Representations olygonal meshes Subdivision surfaces arametric surfaces Implicit surfaces 11

12 Implicit Surfaces Boundary defined by implicit function: f (x, y, z) = 0 Example: linear (plane) ax + by +cz + d = 0 N = (a,b,c) (x,y,z) Implicit Surfaces Example: quadric f(x,y,z)=ax +by +cz +dxy+eyz+fxz+gx+hy+jz +k Common quadric surfaces: Sphere Ellipsoid Torus araboloid Hyperboloid x r x + y r y + z r z 1 = 0 H&B Figure

13 ! " # $ % Implicit Surfaces Advantages: Easy to test if point is on surface Easy to intersect two surfaces Easy to compute z given x and y Disadvantages: Hard to describe complex shapes Hard to enumerate points on surface Summary Feature olygonal Mesh Implicit Surface arametric Surface Subdivision Surface Accurate No Yes Yes Yes Concise No Yes Yes Yes Intuitive specification No No Yes No Local support Yes No Yes Yes Affine invariant Yes Yes Yes Yes Arbitrary topology Yes No No Yes Guaranteed continuity No Yes Yes Yes Natural parameterization No No Yes No Efficient display Yes No Yes Yes Efficient intersections No Yes No No 13

Curves and Surfaces. Goals. How do we draw surfaces? How do we specify a surface? How do we approximate a surface?

Curves and Surfaces. Goals. How do we draw surfaces? How do we specify a surface? How do we approximate a surface? Curves and Surfaces Parametric Representations Cubic Polynomial Forms Hermite Curves Bezier Curves and Surfaces [Angel 10.1-10.6] Goals How do we draw surfaces? Approximate with polygons Draw polygons

More information

Computer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science - Technion. An Example.

Computer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science - Technion. An Example. An Example 2 3 4 Outline Objective: Develop methods and algorithms to mathematically model shape of real world objects Categories: Wire-Frame Representation Object is represented as as a set of points

More information

Computer Graphics CS 543 Lecture 12 (Part 1) Curves. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)

Computer Graphics CS 543 Lecture 12 (Part 1) Curves. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI) Computer Graphics CS 54 Lecture 1 (Part 1) Curves Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) So Far Dealt with straight lines and flat surfaces Real world objects include

More information

CSE 167: Lecture 13: Bézier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2011

CSE 167: Lecture 13: Bézier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2011 CSE 167: Introduction to Computer Graphics Lecture 13: Bézier Curves Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2011 Announcements Homework project #6 due Friday, Nov 18

More information

Geometric Modelling & Curves

Geometric Modelling & Curves Geometric Modelling & Curves Geometric Modeling Creating symbolic models of the physical world has long been a goal of mathematicians, scientists, engineers, etc. Recently technology has advanced sufficiently

More information

Modeling Curves and Surfaces

Modeling Curves and Surfaces Modeling Curves and Surfaces Graphics I Modeling for Computer Graphics!? 1 How can we generate this kind of objects? Umm!? Mathematical Modeling! S Do not worry too much about your difficulties in mathematics,

More information

We can display an object on a monitor screen in three different computer-model forms: Wireframe model Surface Model Solid model

We can display an object on a monitor screen in three different computer-model forms: Wireframe model Surface Model Solid model CHAPTER 4 CURVES 4.1 Introduction In order to understand the significance of curves, we should look into the types of model representations that are used in geometric modeling. Curves play a very significant

More information

EECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines

EECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation

More information

Essential Mathematics for Computer Graphics fast

Essential Mathematics for Computer Graphics fast John Vince Essential Mathematics for Computer Graphics fast Springer Contents 1. MATHEMATICS 1 Is mathematics difficult? 3 Who should read this book? 4 Aims and objectives of this book 4 Assumptions made

More information

B2.53-R3: COMPUTER GRAPHICS. NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions.

B2.53-R3: COMPUTER GRAPHICS. NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. B2.53-R3: COMPUTER GRAPHICS NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be answered in the TEAR-OFF ANSWER

More information

(Refer Slide Time: 1:42)

(Refer Slide Time: 1:42) Introduction to Computer Graphics Dr. Prem Kalra Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture - 10 Curves So today we are going to have a new topic. So far

More information

CHAPTER 1 Splines and B-splines an Introduction

CHAPTER 1 Splines and B-splines an Introduction CHAPTER 1 Splines and B-splines an Introduction In this first chapter, we consider the following fundamental problem: Given a set of points in the plane, determine a smooth curve that approximates the

More information

How To Use Design Mentor

How To Use Design Mentor DesignMentor: A Pedagogical Tool for Computer Graphics and Computer Aided Design John L. Lowther and Ching Kuang Shene Programmers: Yuan Zhao and Yan Zhou (ver 1) Budirijanto Purnomo (ver 2) Michigan Technological

More information

The Essentials of CAGD

The Essentials of CAGD The Essentials of CAGD Chapter 2: Lines and Planes Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/essentials-cagd c 2000 Farin & Hansford

More information

Mean Value Coordinates

Mean Value Coordinates Mean Value Coordinates Michael S. Floater Abstract: We derive a generalization of barycentric coordinates which allows a vertex in a planar triangulation to be expressed as a convex combination of its

More information

the points are called control points approximating curve

the points are called control points approximating curve Chapter 4 Spline Curves A spline curve is a mathematical representation for which it is easy to build an interface that will allow a user to design and control the shape of complex curves and surfaces.

More information

BEZIER CURVES AND SURFACES

BEZIER CURVES AND SURFACES Department of Applied Mathematics and Computational Sciences University of Cantabria UC-CAGD Group COMPUTER-AIDED GEOMETRIC DESIGN AND COMPUTER GRAPHICS: BEZIER CURVES AND SURFACES Andrés Iglesias e-mail:

More information

Seminar. Path planning using Voronoi diagrams and B-Splines. Stefano Martina stefano.martina@stud.unifi.it

Seminar. Path planning using Voronoi diagrams and B-Splines. Stefano Martina stefano.martina@stud.unifi.it Seminar Path planning using Voronoi diagrams and B-Splines Stefano Martina stefano.martina@stud.unifi.it 23 may 2016 This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International

More information

Computer Animation: Art, Science and Criticism

Computer Animation: Art, Science and Criticism Computer Animation: Art, Science and Criticism Tom Ellman Harry Roseman Lecture 4 Parametric Curve A procedure for distorting a straight line into a (possibly) curved line. The procedure lives in a black

More information

From Scattered Samples to Smooth Surfaces

From Scattered Samples to Smooth Surfaces From Scattered Samples to Smooth Surfaces Kai Hormann 1 California Institute of Technology (a) (b) (c) (d) Figure 1: A point cloud with 4,100 scattered samples (a), its triangulation with 7,938 triangles

More information

Figure 2.1: Center of mass of four points.

Figure 2.1: Center of mass of four points. Chapter 2 Bézier curves are named after their inventor, Dr. Pierre Bézier. Bézier was an engineer with the Renault car company and set out in the early 196 s to develop a curve formulation which would

More information

Dual Marching Cubes: Primal Contouring of Dual Grids

Dual Marching Cubes: Primal Contouring of Dual Grids Dual Marching Cubes: Primal Contouring of Dual Grids Scott Schaefer and Joe Warren Rice University 6100 Main St. Houston, TX 77005 sschaefe@rice.edu and jwarren@rice.edu Abstract We present a method for

More information

Dhiren Bhatia Carnegie Mellon University

Dhiren Bhatia Carnegie Mellon University Dhiren Bhatia Carnegie Mellon University University Course Evaluations available online Please Fill! December 4 : In-class final exam Held during class time All students expected to give final this date

More information

Topics in Computer Graphics Chap 14: Tensor Product Patches

Topics in Computer Graphics Chap 14: Tensor Product Patches Topics in Computer Graphics Chap 14: Tensor Product Patches fall, 2011 University of Seoul School of Computer Science Minho Kim Table of contents Bilinear Interpolation The Direct de Casteljau Algorithm

More information

SOLIDWORKS: SKETCH RELATIONS

SOLIDWORKS: SKETCH RELATIONS Sketch Feature: The shape or topology of the initial sketch or model is important, but exact geometry and dimensions of the initial sketched shapes are NOT. It recommended to work in the following order:

More information

Finite Element Formulation for Plates - Handout 3 -

Finite Element Formulation for Plates - Handout 3 - Finite Element Formulation for Plates - Handout 3 - Dr Fehmi Cirak (fc286@) Completed Version Definitions A plate is a three dimensional solid body with one of the plate dimensions much smaller than the

More information

L 2 : x = s + 1, y = s, z = 4s + 4. 3. Suppose that C has coordinates (x, y, z). Then from the vector equality AC = BD, one has

L 2 : x = s + 1, y = s, z = 4s + 4. 3. Suppose that C has coordinates (x, y, z). Then from the vector equality AC = BD, one has The line L through the points A and B is parallel to the vector AB = 3, 2, and has parametric equations x = 3t + 2, y = 2t +, z = t Therefore, the intersection point of the line with the plane should satisfy:

More information

Corollary. (f є C n+1 [a,b]). Proof: This follows directly from the preceding theorem using the inequality

Corollary. (f є C n+1 [a,b]). Proof: This follows directly from the preceding theorem using the inequality Corollary For equidistant knots, i.e., u i = a + i (b-a)/n, we obtain with (f є C n+1 [a,b]). Proof: This follows directly from the preceding theorem using the inequality 120202: ESM4A - Numerical Methods

More information

Chapter 13. Curves and Surfaces

Chapter 13. Curves and Surfaces Chapter 13 Curves and Surfaces There are two fundamental problems with surfaces in machine vision: reconstruction and segmentation. Surfaces must be reconstructed from sparse depth measurements that may

More information

H.Calculating Normal Vectors

H.Calculating Normal Vectors Appendix H H.Calculating Normal Vectors This appendix describes how to calculate normal vectors for surfaces. You need to define normals to use the OpenGL lighting facility, which is described in Chapter

More information

How To Draw A 3D Virtual World In 3D Space (Computer Graphics)

How To Draw A 3D Virtual World In 3D Space (Computer Graphics) 2 Computer Graphics What You Will Learn: The objectives of this chapter are quite ambitious; you should refer to the references cited in each Section to get a deeper explanation of the topics presented.

More information

Section 12.6: Directional Derivatives and the Gradient Vector

Section 12.6: Directional Derivatives and the Gradient Vector Section 26: Directional Derivatives and the Gradient Vector Recall that if f is a differentiable function of x and y and z = f(x, y), then the partial derivatives f x (x, y) and f y (x, y) give the rate

More information

Introduction to Computer Graphics Marie-Paule Cani & Estelle Duveau

Introduction to Computer Graphics Marie-Paule Cani & Estelle Duveau Introduction to Computer Graphics Marie-Paule Cani & Estelle Duveau 04/02 Introduction & projective rendering 11/02 Prodedural modeling, Interactive modeling with parametric surfaces 25/02 Introduction

More information

Algorithms for Real-Time Tool Path Generation

Algorithms for Real-Time Tool Path Generation Algorithms for Real-Time Tool Path Generation Gyula Hermann John von Neumann Faculty of Information Technology, Budapest Polytechnic H-1034 Nagyszombat utca 19 Budapest Hungary, hermgyviif.hu Abstract:The

More information

Recovering Primitives in 3D CAD meshes

Recovering Primitives in 3D CAD meshes Recovering Primitives in 3D CAD meshes Roseline Bénière a,c, Gérard Subsol a, Gilles Gesquière b, François Le Breton c and William Puech a a LIRMM, Univ. Montpellier 2, CNRS, 161 rue Ada, 34392, France;

More information

3. Interpolation. Closing the Gaps of Discretization... Beyond Polynomials

3. Interpolation. Closing the Gaps of Discretization... Beyond Polynomials 3. Interpolation Closing the Gaps of Discretization... Beyond Polynomials Closing the Gaps of Discretization... Beyond Polynomials, December 19, 2012 1 3.3. Polynomial Splines Idea of Polynomial Splines

More information

Modelling with Implicit Surfaces that Interpolate

Modelling with Implicit Surfaces that Interpolate Modelling with Implicit Surfaces that Interpolate Greg Turk GVU Center, College of Computing Georgia Institute of Technology James F O Brien EECS, Computer Science Division University of California, Berkeley

More information

Name Class. Date Section. Test Form A Chapter 11. Chapter 11 Test Bank 155

Name Class. Date Section. Test Form A Chapter 11. Chapter 11 Test Bank 155 Chapter Test Bank 55 Test Form A Chapter Name Class Date Section. Find a unit vector in the direction of v if v is the vector from P,, 3 to Q,, 0. (a) 3i 3j 3k (b) i j k 3 i 3 j 3 k 3 i 3 j 3 k. Calculate

More information

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203.

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year & Semester : III Year, V Semester Section : CSE - 1 & 2 Subject Code : CS6504 Subject

More information

Efficient Storage, Compression and Transmission

Efficient Storage, Compression and Transmission Efficient Storage, Compression and Transmission of Complex 3D Models context & problem definition general framework & classification our new algorithm applications for digital documents Mesh Decimation

More information

Degree Reduction of Interval SB Curves

Degree Reduction of Interval SB Curves International Journal of Video&Image Processing and Network Security IJVIPNS-IJENS Vol:13 No:04 1 Degree Reduction of Interval SB Curves O. Ismail, Senior Member, IEEE Abstract Ball basis was introduced

More information

Open Access Research on 3D Modeling Method Based on Hybrid Octree Structure

Open Access Research on 3D Modeling Method Based on Hybrid Octree Structure Send Orders for Reprints to reprints@benthamscience.ae The Open Electrical & Electronic Engineering Journal, 2014, 8, 323-329 323 Open Access Research on 3D Modeling Method Based on Hybrid Octree Structure

More information

A Geometric Characterization of Parametric Cubic Curves

A Geometric Characterization of Parametric Cubic Curves A Geometric Characterization of Parametric Cubic Curves MAUREEN C. STONE Xerox PARC and TONY D. DEROSE University of Washington In this paper, we analyze planar parametric cubic curves to determine conditions

More information

GAME ENGINE DESIGN. A Practical Approach to Real-Time Computer Graphics. ahhb. DAVID H. EBERLY Geometrie Tools, Inc.

GAME ENGINE DESIGN. A Practical Approach to Real-Time Computer Graphics. ahhb. DAVID H. EBERLY Geometrie Tools, Inc. 3D GAME ENGINE DESIGN A Practical Approach to Real-Time Computer Graphics SECOND EDITION DAVID H. EBERLY Geometrie Tools, Inc. ahhb _ jfw H NEW YORK-OXFORD-PARIS-SAN DIEGO fl^^h ' 4M arfcrgsbjlilhg, SAN

More information

Hydrogeological Data Visualization

Hydrogeological Data Visualization Conference of Junior Researchers in Civil Engineering 209 Hydrogeological Data Visualization Boglárka Sárközi BME Department of Photogrammetry and Geoinformatics, e-mail: sarkozi.boglarka@fmt.bme.hu Abstract

More information

Pro/ENGINEER Wildfire 4.0 Basic Design

Pro/ENGINEER Wildfire 4.0 Basic Design Introduction Datum features are non-solid features used during the construction of other features. The most common datum features include planes, axes, coordinate systems, and curves. Datum features do

More information

NURBS with Extraordinary Points: High-degree, Non-uniform, Rational Subdivision Schemes

NURBS with Extraordinary Points: High-degree, Non-uniform, Rational Subdivision Schemes NURBS with Extraordinary Points: High-degree, Non-uniform, Rational Subdivision Schemes Thomas J. Cashman University of Cambridge Ursula H. Augsdörfer University of Cambridge Neil A. Dodgson University

More information

COMPUTER GRAPHICS IMPORTANT QUESTION AND ANSWERS. Computer graphics

COMPUTER GRAPHICS IMPORTANT QUESTION AND ANSWERS. Computer graphics Computer graphics 1. Define Computer graphics. Computer graphics remains one of the most existing and rapidly growing computer fields. Computer graphics may be defined as a pictorial representation or

More information

The Australian Journal of Mathematical Analysis and Applications

The Australian Journal of Mathematical Analysis and Applications The Australian Journal of Mathematical Analysis and Applications Volume 7, Issue, Article 11, pp. 1-14, 011 SOME HOMOGENEOUS CYCLIC INEQUALITIES OF THREE VARIABLES OF DEGREE THREE AND FOUR TETSUYA ANDO

More information

Subdivision for Modeling and Animation

Subdivision for Modeling and Animation SIGGRAPH 99 Course Notes Subdivision for Modeling and Animation Organizers: Denis Zorin, New York University Peter Schröder, California Institute of Technology Lecturers Denis Zorin Media Research Laboratory

More information

Overview. Gaudi Design Tools. The Design Process. The Design Process. Overview. Target Audience

Overview. Gaudi Design Tools. The Design Process. The Design Process. Overview. Target Audience Overview Gaudi Design Tools Kyle, Eric, Emily & Barb The Design Process Target Audience Our Demands Rule Sets System Diagram Other The Design Process 1. Programming relationship to site 2. Conceptual Design

More information

The Fourth International DERIVE-TI92/89 Conference Liverpool, U.K., 12-15 July 2000. Derive 5: The Easiest... Just Got Better!

The Fourth International DERIVE-TI92/89 Conference Liverpool, U.K., 12-15 July 2000. Derive 5: The Easiest... Just Got Better! The Fourth International DERIVE-TI9/89 Conference Liverpool, U.K., -5 July 000 Derive 5: The Easiest... Just Got Better! Michel Beaudin École de technologie supérieure 00, rue Notre-Dame Ouest Montréal

More information

(a) We have x = 3 + 2t, y = 2 t, z = 6 so solving for t we get the symmetric equations. x 3 2. = 2 y, z = 6. t 2 2t + 1 = 0,

(a) We have x = 3 + 2t, y = 2 t, z = 6 so solving for t we get the symmetric equations. x 3 2. = 2 y, z = 6. t 2 2t + 1 = 0, Name: Solutions to Practice Final. Consider the line r(t) = 3 + t, t, 6. (a) Find symmetric equations for this line. (b) Find the point where the first line r(t) intersects the surface z = x + y. (a) We

More information

1. Abstract 2. Introduction 3. Algorithms and Techniques

1. Abstract 2. Introduction 3. Algorithms and Techniques MS PROJECT Virtual Surgery Piyush Soni under the guidance of Dr. Jarek Rossignac, Brian Whited Georgia Institute of Technology, Graphics, Visualization and Usability Center Atlanta, GA piyush_soni@gatech.edu,

More information

Point Cloud Segmentation via Constrained Nonlinear Least Squares Surface Normal Estimates

Point Cloud Segmentation via Constrained Nonlinear Least Squares Surface Normal Estimates Point Cloud Segmentation via Constrained Nonlinear Least Squares Surface Normal Estimates Edward Castillo Radiation Oncology Department University of Texas MD Anderson Cancer Center, Houston TX ecastillo3@mdanderson.org

More information

Lecture 7 - Meshing. Applied Computational Fluid Dynamics

Lecture 7 - Meshing. Applied Computational Fluid Dynamics Lecture 7 - Meshing Applied Computational Fluid Dynamics Instructor: André Bakker http://www.bakker.org André Bakker (2002-2006) Fluent Inc. (2002) 1 Outline Why is a grid needed? Element types. Grid types.

More information

This week. CENG 732 Computer Animation. Challenges in Human Modeling. Basic Arm Model

This week. CENG 732 Computer Animation. Challenges in Human Modeling. Basic Arm Model CENG 732 Computer Animation Spring 2006-2007 Week 8 Modeling and Animating Articulated Figures: Modeling the Arm, Walking, Facial Animation This week Modeling the arm Different joint structures Walking

More information

PREPRINT PREPRINT PREPRINT PREPRINT To appear TOG 2012. Feature Adaptive GPU Rendering of Catmull-Clark Subdivision Surfaces

PREPRINT PREPRINT PREPRINT PREPRINT To appear TOG 2012. Feature Adaptive GPU Rendering of Catmull-Clark Subdivision Surfaces PREPRINT PREPRINT PREPRINT PREPRINT To appear TOG 22 Feature Adaptive GPU Rendering of Catmull-Clark Subdivision Surfaces Matthias Nießner University of Erlangen-Nuremberg and Charles Loop Microsoft Research

More information

Content. Chapter 4 Functions 61 4.1 Basic concepts on real functions 62. Credits 11

Content. Chapter 4 Functions 61 4.1 Basic concepts on real functions 62. Credits 11 Content Credits 11 Chapter 1 Arithmetic Refresher 13 1.1 Algebra 14 Real Numbers 14 Real Polynomials 19 1.2 Equations in one variable 21 Linear Equations 21 Quadratic Equations 22 1.3 Exercises 28 Chapter

More information

Computational Fluid Dynamics - CFD Francisco Palacios & Markus Widhalm fpalacios@gmail.com, markus.widhalm@dlr.de Basque Center for Applied

Computational Fluid Dynamics - CFD Francisco Palacios & Markus Widhalm fpalacios@gmail.com, markus.widhalm@dlr.de Basque Center for Applied Computational Fluid Dynamics - CFD Francisco Palacios & Markus Widhalm fpalacios@gmail.com, markus.widhalm@dlr.de Basque Center for Applied Mathematics (BCAM). February 22nd to 26th, 2010 1 Grid generation

More information

3D shapes. Level A. 1. Which of the following is a 3-D shape? A) Cylinder B) Octagon C) Kite. 2. What is another name for 3-D shapes?

3D shapes. Level A. 1. Which of the following is a 3-D shape? A) Cylinder B) Octagon C) Kite. 2. What is another name for 3-D shapes? Level A 1. Which of the following is a 3-D shape? A) Cylinder B) Octagon C) Kite 2. What is another name for 3-D shapes? A) Polygon B) Polyhedron C) Point 3. A 3-D shape has four sides and a triangular

More information

1 Review of Least Squares Solutions to Overdetermined Systems

1 Review of Least Squares Solutions to Overdetermined Systems cs4: introduction to numerical analysis /9/0 Lecture 7: Rectangular Systems and Numerical Integration Instructor: Professor Amos Ron Scribes: Mark Cowlishaw, Nathanael Fillmore Review of Least Squares

More information

A Mathematica Package for CAGD and Computer Graphics

A Mathematica Package for CAGD and Computer Graphics A Mathematica Package for CAGD and Computer Graphics Andrés Iglesias 1, Flabio Gutiérrez 1,2 and Akemi Gálvez 1 1 Departament of Applied Mathematics and Computational Sciences University of Cantabria,

More information

B4 Computational Geometry

B4 Computational Geometry 3CG 2006 / B4 Computational Geometry David Murray david.murray@eng.o.ac.uk www.robots.o.ac.uk/ dwm/courses/3cg Michaelmas 2006 3CG 2006 2 / Overview Computational geometry is concerned with the derivation

More information

ISO 1101 Geometrical product specifications (GPS) Geometrical tolerancing Tolerances of form, orientation, location and run-out

ISO 1101 Geometrical product specifications (GPS) Geometrical tolerancing Tolerances of form, orientation, location and run-out INTERNATIONAL STANDARD ISO 1101 Third edition 2012-04-15 Geometrical product specifications (GPS) Geometrical tolerancing Tolerances of form, orientation, location and run-out Spécification géométrique

More information

A Short Introduction to Computer Graphics

A Short Introduction to Computer Graphics A Short Introduction to Computer Graphics Frédo Durand MIT Laboratory for Computer Science 1 Introduction Chapter I: Basics Although computer graphics is a vast field that encompasses almost any graphical

More information

42 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE. Figure 1.18: Parabola y = 2x 2. 1.6.1 Brief review of Conic Sections

42 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE. Figure 1.18: Parabola y = 2x 2. 1.6.1 Brief review of Conic Sections 2 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE Figure 1.18: Parabola y = 2 1.6 Quadric Surfaces 1.6.1 Brief review of Conic Sections You may need to review conic sections for this to make more sense. You

More information

A matrix method for degree-raising of B-spline curves *

A matrix method for degree-raising of B-spline curves * VOI. 40 NO. 1 SCIENCE IN CHINA (Series E) February 1997 A matrix method for degree-raising of B-spline curves * QIN Kaihuai (%*>/$) (Department of Computer Science and Technology, Tsinghua University,

More information

Derive 5: The Easiest... Just Got Better!

Derive 5: The Easiest... Just Got Better! Liverpool John Moores University, 1-15 July 000 Derive 5: The Easiest... Just Got Better! Michel Beaudin École de Technologie Supérieure, Canada Email; mbeaudin@seg.etsmtl.ca 1. Introduction Engineering

More information

FINAL EXAM SOLUTIONS Math 21a, Spring 03

FINAL EXAM SOLUTIONS Math 21a, Spring 03 INAL EXAM SOLUIONS Math 21a, Spring 3 Name: Start by printing your name in the above box and check your section in the box to the left. MW1 Ken Chung MW1 Weiyang Qiu MW11 Oliver Knill h1 Mark Lucianovic

More information

ON FOCK-GONCHAROV COORDINATES OF THE ONCE-PUNCTURED TORUS GROUP

ON FOCK-GONCHAROV COORDINATES OF THE ONCE-PUNCTURED TORUS GROUP ON FOCK-GONCHAROV COORDINATES OF THE ONCE-PUNCTURED TORUS GROUP YUICHI KABAYA Introduction In their seminal paper [3], Fock and Goncharov defined positive representations of the fundamental group of a

More information

Finite Elements for 2 D Problems

Finite Elements for 2 D Problems Finite Elements for 2 D Problems General Formula for the Stiffness Matrix Displacements (u, v) in a plane element are interpolated from nodal displacements (ui, vi) using shape functions Ni as follows,

More information

An Overview of the Finite Element Analysis

An Overview of the Finite Element Analysis CHAPTER 1 An Overview of the Finite Element Analysis 1.1 Introduction Finite element analysis (FEA) involves solution of engineering problems using computers. Engineering structures that have complex geometry

More information

c 2002 I.P. Ivrissimtzis, M.A. Sabin, N.A. Dodgson

c 2002 I.P. Ivrissimtzis, M.A. Sabin, N.A. Dodgson Technical Report UCAM-CL-TR-544 ISSN 476-2986 Number 544 Computer Laboratory On the support of recursive subdivision I.P. Ivrissimtzis, M.A. Sabin, N.A. Dodgson September 2002 An updated, improved version

More information

Point Location. Preprocess a planar, polygonal subdivision for point location queries. p = (18, 11)

Point Location. Preprocess a planar, polygonal subdivision for point location queries. p = (18, 11) Point Location Prerocess a lanar, olygonal subdivision for oint location ueries. = (18, 11) Inut is a subdivision S of comlexity n, say, number of edges. uild a data structure on S so that for a uery oint

More information

Surface Normals and Tangent Planes

Surface Normals and Tangent Planes Surface Normals and Tangent Planes Normal and Tangent Planes to Level Surfaces Because the equation of a plane requires a point and a normal vector to the plane, nding the equation of a tangent plane to

More information

Compression of parametric surfaces for efficient 3D model coding

Compression of parametric surfaces for efficient 3D model coding 1 Compression of parametric surfaces for efficient 3D model coding Diego Santa-Cruz a, Touradj Ebrahimi b Signal Processing Laboratory Swiss Federal Institute of Technology, Lausanne ABSTRACT In the field

More information

Section 1.1. Introduction to R n

Section 1.1. Introduction to R n The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to

More information

Data Warehousing und Data Mining

Data Warehousing und Data Mining Data Warehousing und Data Mining Multidimensionale Indexstrukturen Ulf Leser Wissensmanagement in der Bioinformatik Content of this Lecture Multidimensional Indexing Grid-Files Kd-trees Ulf Leser: Data

More information

Selective Degree Elevation for Multi-Sided Bézier Patches

Selective Degree Elevation for Multi-Sided Bézier Patches EUROGRAPHICS 2015 / O. Sorkine-Hornung and M. Wimmer (Guest Editors) Volume 34 (2015), Number 2 Selective Degree Elevation for Multi-Sided Bézier Patches J. Smith 1 and S. Schaefer 1 1 Texas A&M University

More information

Numerical algorithms for curve approximation and novel user oriented interactive tools

Numerical algorithms for curve approximation and novel user oriented interactive tools UNIVERSITÀ DEGLI STUDI DI BARI Dottorato di Ricerca in Matematica XXI Ciclo A.A. 2008/2009 Settore Scientifico-Disciplinare: MAT/08 Analisi Numerica Tesi di Dottorato Numerical algorithms for curve approximation

More information

Copyrighted Material. Chapter 1 DEGREE OF A CURVE

Copyrighted Material. Chapter 1 DEGREE OF A CURVE Chapter 1 DEGREE OF A CURVE Road Map The idea of degree is a fundamental concept, which will take us several chapters to explore in depth. We begin by explaining what an algebraic curve is, and offer two

More information

4.2. LINE INTEGRALS 1. 2 2 ; z = t. ; y = sin

4.2. LINE INTEGRALS 1. 2 2 ; z = t. ; y = sin 4.2. LINE INTEGRALS 1 4.2 Line Integrals MATH 294 FALL 1982 FINAL # 7 294FA82FQ7.tex 4.2.1 Consider the curve given parametrically by x = cos t t ; y = sin 2 2 ; z = t a) Determine the work done by the

More information

Planar Curve Intersection

Planar Curve Intersection Chapter 7 Planar Curve Intersection Curve intersection involves finding the points at which two planar curves intersect. If the two curves are parametric, the solution also identifies the parameter values

More information

A New Approach to Cutting Tetrahedral Meshes

A New Approach to Cutting Tetrahedral Meshes A New Approach to Cutting Tetrahedral Meshes Menion Croll August 9, 2007 1 Introduction Volumetric models provide a realistic representation of three dimensional objects above and beyond what traditional

More information

12.5 Equations of Lines and Planes

12.5 Equations of Lines and Planes Instructor: Longfei Li Math 43 Lecture Notes.5 Equations of Lines and Planes What do we need to determine a line? D: a point on the line: P 0 (x 0, y 0 ) direction (slope): k 3D: a point on the line: P

More information

Exam 1 Sample Question SOLUTIONS. y = 2x

Exam 1 Sample Question SOLUTIONS. y = 2x Exam Sample Question SOLUTIONS. Eliminate the parameter to find a Cartesian equation for the curve: x e t, y e t. SOLUTION: You might look at the coordinates and notice that If you don t see it, we can

More information

OpenFOAM Optimization Tools

OpenFOAM Optimization Tools OpenFOAM Optimization Tools Henrik Rusche and Aleks Jemcov h.rusche@wikki-gmbh.de and a.jemcov@wikki.co.uk Wikki, Germany and United Kingdom OpenFOAM Optimization Tools p. 1 Agenda Objective Review optimisation

More information

Appearance Preserving Rendering of Out-of-Core Polygon and NURBS Models

Appearance Preserving Rendering of Out-of-Core Polygon and NURBS Models Appearance Preserving Rendering of Out-of-Core Polygon and NURBS Models Dissertation zur Erlangung des Doktorgrades (Dr. rer. nat.) der Mathematisch-Naturwissenschaftlichen Fakultät der Rheinischen Friedrich-Wilhelms-Universität

More information

Interactive Computer Graphics

Interactive Computer Graphics Interactive Computer Graphics A Top-Down Approach Using OpenGL FIFTH EDITION EDWARD ANGEL UNIVERSITY OF NEW MEXICO PEARSON Addison Wesley Boston San Francisco New York London Toronto Sydney Tokyo Singapore

More information

Adding vectors We can do arithmetic with vectors. We ll start with vector addition and related operations. Suppose you have two vectors

Adding vectors We can do arithmetic with vectors. We ll start with vector addition and related operations. Suppose you have two vectors 1 Chapter 13. VECTORS IN THREE DIMENSIONAL SPACE Let s begin with some names and notation for things: R is the set (collection) of real numbers. We write x R to mean that x is a real number. A real number

More information

Intersection of a Line and a Convex. Hull of Points Cloud

Intersection of a Line and a Convex. Hull of Points Cloud Applied Mathematical Sciences, Vol. 7, 213, no. 13, 5139-5149 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ams.213.37372 Intersection of a Line and a Convex Hull of Points Cloud R. P. Koptelov

More information

High-Dimensional Image Warping

High-Dimensional Image Warping Chapter 4 High-Dimensional Image Warping John Ashburner & Karl J. Friston The Wellcome Dept. of Imaging Neuroscience, 12 Queen Square, London WC1N 3BG, UK. Contents 4.1 Introduction.................................

More information

Introduction to Computer Graphics. Reading: Angel ch.1 or Hill Ch1.

Introduction to Computer Graphics. Reading: Angel ch.1 or Hill Ch1. Introduction to Computer Graphics Reading: Angel ch.1 or Hill Ch1. What is Computer Graphics? Synthesis of images User Computer Image Applications 2D Display Text User Interfaces (GUI) - web - draw/paint

More information

Automated Reverse Engineering of Free Formed Objects Using Morse Theory

Automated Reverse Engineering of Free Formed Objects Using Morse Theory Automated Reverse Engineering of Free Formed Objects Using Morse Theory John William Branch Escuela de Sistemas Universidad Nacional de Colombia - Sede Medellín, Colombia jwbranch@unalmed.edu.co Flavio

More information

Model Repair. Leif Kobbelt RWTH Aachen University )NPUT $ATA 2EMOVAL OF TOPOLOGICAL AND GEOMETRICAL ERRORS !NALYSIS OF SURFACE QUALITY

Model Repair. Leif Kobbelt RWTH Aachen University )NPUT $ATA 2EMOVAL OF TOPOLOGICAL AND GEOMETRICAL ERRORS !NALYSIS OF SURFACE QUALITY )NPUT $ATA 2ANGE 3CAN #!$ 4OMOGRAPHY 2EMOVAL OF TOPOLOGICAL AND GEOMETRICAL ERRORS!NALYSIS OF SURFACE QUALITY 3URFACE SMOOTHING FOR NOISE REMOVAL 0ARAMETERIZATION 3IMPLIFICATION FOR COMPLEXITY REDUCTION

More information

A Comparison of. Gaussian and Mean Curvature Estimation Methods. on Triangular Meshes of. Range Image Data

A Comparison of. Gaussian and Mean Curvature Estimation Methods. on Triangular Meshes of. Range Image Data A Comparison of Gaussian and Mean Curvature Estimation Methods on Triangular Meshes of Range Image Data Evgeni Magid, Octavian Soldea, and Ehud Rivlin Computer Science Faculty, The Technion, Israel Institute

More information

Feature Sensitive Surface Extraction from Volume Data

Feature Sensitive Surface Extraction from Volume Data Feature Sensitive Surface Extraction from Volume Data Leif P. Kobbelt Mario Botsch Ulrich Schwanecke Hans-Peter Seidel Computer Graphics Group, RWTH-Aachen Computer Graphics Group, MPI Saarbrücken Figure

More information

Piecewise Cubic Splines

Piecewise Cubic Splines 280 CHAP. 5 CURVE FITTING Piecewise Cubic Splines The fitting of a polynomial curve to a set of data points has applications in CAD (computer-assisted design), CAM (computer-assisted manufacturing), and

More information

FACIAL RIGGING FOR 3D CHARACTER

FACIAL RIGGING FOR 3D CHARACTER FACIAL RIGGING FOR 3D CHARACTER Matahari Bhakti Nendya 1, Eko Mulyanto Yuniarno 2 and Samuel Gandang Gunanto 3 1,2 Department of Electrical Engineering, Institut Teknologi Sepuluh Nopember, Surabaya, Indonesia

More information