Curve Modeling (Spline) Dr. S.M. Malaek. Assistant: M. Younesi
|
|
- Elinor Sanders
- 5 years ago
- Views:
Transcription
1 Crve Modeling Sline Dr. S.M. Malae Assistant: M. Yonesi
2 Crve Modeling Sline Crve Control Points Convex Hll Shae of sline crve Interolation Slines Aroximation Slines Continity Conditions Parametric & Geometric Linear Sline Interolation Cbic Sline Interolation. Natral Cbic Slines. Hermit Slines 3. Cardinal Slines
3 Sline Crve
4 Sline Crve In drafting terminology, a sline is a flexible stri sed to rodce a smooth crve throgh a designated set of oints. Flexible Stri
5 Sline Crve Several small weights weights are distribted along the length of the stri to hold it in osition on the drafting table as the crve is drawn. Weights
6 Sline Crve crve originally The term sline crve referred to a crve drawn in this manner.
7 Sline Crve In modeling, the term sline crve refers to a any comosite crve formed with olynomial sections satisfying secified continity conditions at the bondary of the ieces.
8 Control Points A sline crve is secified by given a set of coordinate ositions, called control oints. Control oints indicates the general shae of the crve.
9 Control Points A sline crve is defined, modified, and manilated with oerations on the control oints.
10 Convex Hll The convex olygon bondary that enclose a set control oints is called the convex hll.
11 Convex Hll The convex hll is a rbber band stretched arond the ositions of the control oints so that each control oint is either on the erimeter of the hll or inside it.
12 Remind: Convex A region is convex if the line segment joining any two oints in the region is also within the region.
13 Shae of the Sline Crve
14 Shae of the Crve Control oints are fitted with iecewise continos arametric olynomial fnction in one of two way:. Interolation Slines. Aroximation Slines
15 Interolation Slines When olynomial sections are fitted so that the crve asses throgh each control oint, the reslting crve is said to interolate the set of control oints.
16 Interolation Slines Interolation crves are commonly sed to digitize drawing or to secify animation aths.
17 Aroximation Slines When olynomial sections are fitted to the general control oint ath withot necessarily assing throgh any control oint, the reslting crve is said to aroximate the set if control oints.
18 Aroximation Slines Aroximation crves are ses as design tools to strctre object srfaces.
19 Parametric Continity Conditions
20 Parametric Continity Conditions To reresent a crve as a series of iecewise arametric crves, these crves to fit together reasonably Continity!
21 Parametric Continity Conditions Each section of a sline is described with a set of arametric coordinate fnctions of the form: x x, y y, z z,
22 Parametric Continity Conditions Let C and C, be two arametric Crves. We set arametric continity by matching the arametric derivation of adjoining crve sections at their common bondary.
23 Parametric Continity Conditions Zero order arametric C : Simly the crves meet, C C. First order arametric C : The first arametric derivations for two sccessive crve sections are eqal at their joining oint, C C
24 Parametric Continity Conditions Second order arametric C : Both the first and second arametric derivatives of the two crve sections are the same at the intersection, C C
25 Geometric Continity Conditions
26 Geometric Continity Conditions Geometric Continity Conditions: Only reqire arametric derivatives of the two sections to be roortional to each other at their common bondary instead of eqal to each other.
27 Geometric Continity Conditions Zero order geometric G : Same as C C C First order geometric G : The arametric first derivatives are roortional at the intersection of two sccessive sections. C αc Second order geometric G : Both the first and second arametric derivatives of the two crve sections are roortional at their bondary, C αc
28 Parametric & Geometric Continity A crve generated with geometric continity condition is similar to one generated with arametric continity, bt with slight differences in crve shae. With geometric continity, the crve is lled toward the section with the greater tangent vector.
29 Sline Interolation
30 Sline Interolation Linear Sline Interolation Cbic Sline Interolation
31 Linear Sline Interolation
32 Linear Sline Definition Given a set of control oints, linear interolation sline is obtained by fitting the int oints with a iecewise linear olynomial crve that asses throgh every control oints.
33 Linear Sline Interolation A linear olynomial with nnowns a & b:, b a z b a y b a x z z y y x x, b a
34 Linear Sline Interolation We need to determine the vales of a and b in the linear olynomial for each of the n crve section. Sbstitting endoint vales and for arameter : [ ] b a b a b a
35 Linear Sline Interolation Solving this eqation for the olynomial coefficients: P can be written in terms of the bondary conditions: b a [ ] [ ] b a { { M sline M geometry { U
36 Linear Sline Interolation The matrix reresentation for linear sline reresentation: P U M sline M geometry M geometry is the matrix containing the geometry constraint vales bondary condition on the sline. M sline is the matrix that transform the geometric constraint vales to the olynomial coefficients and rovides a characterization for the sline crve Basis Matrix.
37 Linear Sline Interolation We can exand the matrix reresentation:, P b P { [ ] [ ] Blending Fnctions P P P P P b b
38 Linear Sline Interolation The Linear The Linear sline sline blending fnctions blending fnctions:, P b P P P P P P b b
39 Linear Sline Interolation The crve is linear combination of the blending fnctions. The iecewise linear interolation is C continos. For a linear olynomial, constraints are reqired for each segment. A olynomial of degree has coefficients and ths reqires indeendent constraints to niqely determine it.
40 Linear Sline Alications Constrction of domes with tblar or trss element. Used in some old airlanes bilt b sace trss
41 Cbic Sline Interolation
42 Cbic Sline Interolation Used to: Set aths for object motion A reresentation for an existing object or drawing Design of objects srface Cbic slines are more flexible for modeling arbitrary crve shaes sch as vehicle or aircraft body.
43 Cbic Sline Definition: Given a set of control oints: P x, y, z,,,, K, n Cbic interolation sline is obtained by fitting the int oints with a iecewise cbic olynomial crve that asses throgh every control oints.
44 Cbic Sline Interolation A cbic olynomial:, d c b a z d c b a y d c b a x z z z z y y y y x x x x, 3 d c b a
45 Linear Sline Interolation 3 a b c d, We need to determine the vales of a, b, c and d in the cbic olynomial for each of the n crve section. By setting enogh bondary conditions at the joints between crve sections we can obtain nmerical vales for all the coefficients.
46 Cbic Sline Tyes Methods for setting the bondary conditions for cbic interolation slines:. Natral Cbic Slines. Hermit Slines 3. Cardinal Slines 4. Kochane-Bartels Slines
47 Natral Cbic Slines
48 Natral Cbic Slines Natral cbic slines are develoed for grahics alication. Natral cbic slines have C continity.
49 Natral Cbic Slines If we have n control oints to fit, then: We have n crve sections 4n olynomial coefficients to be determined. 3 control oints n crve sections 4 olynomial coefficients to be determined.
50 Natral Cbic Slines At each n- interior control oints, we have 4 bondary condition: The two crve sections on either side of a control oint mst first and second arametric derivatives at that control oint, and each crve mst ass throgh that control oint. At P interior control:. C C'. C C 3. C P 4. C P
51 Natral Cbic Slines Additional eqation: First control oint P End control oints P n 5. C P 6. C P
52 Natral Cbic Slines We still need two more conditions to be able to determine vales for all coefficients.
53 Natral Cbic Slines Method : Set the second derivatives at and n to 7. C 8. C
54 Natral Cbic Slines Method : Add a control oint P - and a control oint P n. 7. P - 8. P 3 P - P 3
55 Natral Cbic Slines Natral cbic slines are a mathematical model for the drafting sline. Disadvantage: No Local Control : we cannot reconstrct art of the crve withot secifying an entirely new set of control oints.
56 Hermit Slines
57 Given a set of control oints: Hermit Slines Hermit slines is an interolating iecewise cbic olynomial with a secified tangent at each control oint. P x, y, z,,,, K, n
58 Hermit Slines Hermit slines can be adjsted locally becase each crve section is only deendent on its endoint constraints nlie the natral cbic slines.
59 Hermit Slines Examle: Change in Magnitde of T
60 Hermit Slines Examle: Change in Direction of T
61 Hermit Slines P reresents a arametric cbic oint fnction for the section between and. 3 a b c d, The bondary conditions are: D D D and D are the vales for the arametric derivations sloe of the crve at control oints P and P
62 Hermit Slines, 3 d c b a [ ] d c b a 3 [ ] d c b a 3 The derivative of the oint fnction: d c b a D D 3 Constraints in a matrix form: D D Bondary conditions
63 Hermit Slines Solving this eqation for the olynomial coefficients: d c b a D D H D D M D D D D d c b a M H, the Hermit matrix, is the inverse of the bondary constraint matrix.
64 [ ] d c b a 3 [ ] D D [ ] 3 H D D M Blending Fnctions 3 H H H H D D P d c b a D D 3
65 Hermit Slines Hermit Blending Fnctions
66 Hermit Slines Hermit olynomials can be sefl for some digitizing alications where it may not be too difficlt to secify or aroximate the crve sloes. Bt For most roblems in modeling, it is more sefl to generate sline crve withot reqiring int vales for crve sloes.
67 Cardinal Slines
68 Cardinal Slines Cardinal slines are interolating iecewise cbic with secified endoint tangents at the bondary of each crve section. The difference is that we do not have to give the vales for the endoint tangents. For a cardinal Sline, the vale for the sloe at a control oint is aroximately calclated from the coordinates of the two adjacent control oints.
69 Cardinal Slines A cardinal sline section is comletely secified with for consective control oints. The middle two control oints are the section endoints, and the other two oints are sed in the calclation of the endoint sloes.
70 Cardinal Slines The bondary conditions: P P P t P t Ths, the sloes at control oints and are taen to be roortional to the chords and
71 Cardinal Slines The bondary conditions: t t P P P P
72 Cardinal Slines Parameter t is called the tension arameter. Tension arameter controls how loosely or tightly the cardinal sline fits the int control oints. P P P t P t
73 Cardinal Slines When t is called the Catmll- Rom slines, or Overhaser slines.
74 Cardinal Slines t t P P P P [ ] 3 C M P 3 3 s s s s s s s s s s M C t s
75 Cardinal Slines t t P P P P ] 3 [ ] 3 [ CAR CAR CAR CAR s s s s s s s s s s P The olynomials CAR for,,,3 are the cardinal fnctions.
76 Cardinal Slines Cardinal fnctions
77 Homewor
78 Homewor بدنه هواپيمايA-38 را در نظر بگيريد. در مقطعي از بدنه كه مجاور بال و محل تقاطع بال با بدنه است بررسي كنيد شكل مقطع به كدام يك از اسپلاين هاي معرفي شده بيشتر شباهت دارد.
EECS 487: Interactive Computer Graphics f
Interpolating Key Vales EECS 487: Interactive Compter Graphics f Keys Lectre 33: Keyframe interpolation and splines Cbic splines The key vales of each variable may occr at different frames The interpolation
More informationCS 4204 Computer Graphics
CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types
More informationPicking and Curves Week 6
CS 48/68 INTERACTIVE COMPUTER GRAPHICS Picking and Crves Week 6 David Breen Department of Compter Science Drexel University Based on material from Ed Angel, University of New Mexico Objectives Picking
More informationCurves and Surfaces. CS 537 Interactive Computer Graphics Prof. David E. Breen Department of Computer Science
Crves and Srfaces CS 57 Interactive Compter Graphics Prof. David E. Breen Department of Compter Science E. Angel and D. Shreiner: Interactive Compter Graphics 6E Addison-Wesley 22 Objectives Introdce types
More informationToday. B-splines. B-splines. B-splines. Computergrafik. Curves NURBS Surfaces. Bilinear patch Bicubic Bézier patch Advanced surface modeling
Comptergrafik Matthias Zwicker Uniersität Bern Herbst 29 Cres Srfaces Parametric srfaces Bicbic Bézier patch Adanced srface modeling Piecewise Bézier cres Each segment spans for control points Each segment
More informationContinuity Smooth Path Planning Using Cubic Polynomial Interpolation with Membership Function
J Electr Eng Technol Vol., No.?: 74-?, 5 http://dx.doi.org/.537/jeet.5..?.74 ISSN(Print) 975- ISSN(Online) 93-743 Continity Smooth Path Planning Using Cbic Polomial Interpolation with Membership Fnction
More information521493S Computer Graphics Exercise 3 (Chapters 6-8)
521493S Comuter Grahics Exercise 3 (Chaters 6-8) 1 Most grahics systems and APIs use the simle lighting and reflection models that we introduced for olygon rendering Describe the ways in which each of
More informationCMSC 425: Lecture 16 Motion Planning: Basic Concepts
: Lecture 16 Motion lanning: Basic Concets eading: Today s material comes from various sources, including AI Game rogramming Wisdom 2 by S. abin and lanning Algorithms by S. M. LaValle (Chats. 4 and 5).
More informationCS 428: Fall Introduction to. Geometric Transformations. Andrew Nealen, Rutgers, /15/2010 1
CS 428: Fall 21 Introduction to Comuter Grahics Geometric Transformations Andrew Nealen, Rutgers, 21 9/15/21 1 Toic overview Image formation and OenGL (last week) Modeling the image formation rocess OenGL
More informationIntroduction to Computational Manifolds and Applications
IMPA - Institto de Matemática Pra e Aplicada, Rio de Janeiro, RJ, Brazil Introdction to Comptational Manifolds and Applications Part 1 - Constrctions Prof. Marcelo Ferreira Siqeira mfsiqeira@dimap.frn.br
More informationCOT5405: GEOMETRIC ALGORITHMS
COT5405: GEOMETRIC ALGORITHMS Objects: Points in, Segments, Lines, Circles, Triangles Polygons, Polyhedra R n Alications Vision, Grahics, Visualizations, Databases, Data mining, Networks, GIS Scientific
More informationIssues in the Blending of Curves for the Manufacture of Sculptured Surfaces
Fourth LACCEI International Latin American and Caribbean Conference for Engineering and Technology (LACCET 26) Breaking Frontiers and Barriers in Engineering: Education, Research and Practice 2-23 June
More informationLecture 3: Geometric Algorithms(Convex sets, Divide & Conquer Algo.)
Advanced Algorithms Fall 2015 Lecture 3: Geometric Algorithms(Convex sets, Divide & Conuer Algo.) Faculty: K.R. Chowdhary : Professor of CS Disclaimer: These notes have not been subjected to the usual
More informationIntegrated control of RTUs and refrigeration equipment in convenience stores
Prde University Prde e-pbs International High Performance Bildings Conference School of Mechanical Engineering 2016 Integrated control of RTUs and refrigeration eqiment in convenience stores Donghn Kim
More informationTHE METHOD OF A MATERIAL LOSS DETECTION FOR CYLINDRICAL SHAPE PARTS OF ELEMENTS WITH A 3D SCANNING APPLICATION
International Jornal of Modern Manfactring Technologies ISSN 2067 3604, Vol. V, No. 2 / 2013 THE METHOD OF A MATERIAL LOSS DETECTION FOR CYLINDRICAL SHAPE PARTS OF ELEMENTS WITH A 3D SCANNING APPLICATION
More informationHardware-Accelerated Free-Form Deformation
Hardware-Accelerated Free-Form Deformation Clint Cha and Ulrich Nemann Compter Science Department Integrated Media Systems Center University of Sothern California Abstract Hardware-acceleration for geometric
More informationShading Models. Simulate physical phenomena
Illumination Models & Shading Shading Models Simulate hysical henomena Real illumination simulation is comlicated & exensive Use aroximation and heuristics with little hysical basis that looks surrisingly
More informationBias of Higher Order Predictive Interpolation for Sub-pixel Registration
Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz
More informationNew Hermite cubic interpolator for two-dimensional curve generation
New Hermite cubic interolator for two-dimensional curve generation R. Szeliski, B.Eng., M.Sc., and M.R. Ito, Ph.D. Indexing term: Comuter grahics Abstract: The roblem of generating a smooth two-dimensional
More informationInformation Coding / Computer Graphics, ISY, LiTH. Splines
28(69) Splines Originally a drafting tool to create a smooth curve In computer graphics: a curve built from sections, each described by a 2nd or 3rd degree polynomial. Very common in non-real-time graphics,
More informationMultiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET
Mltiple-Choice Test Chapter 09.0 Golden Section Search Method Optimization COMPLETE SOLUTION SET. Which o the ollowing statements is incorrect regarding the Eqal Interval Search and Golden Section Search
More informationPoint Location. The Slab Method. Optimal Schemes. The Slab Method. Preprocess a planar, polygonal subdivision for point location queries.
Point Location The Slab Method Prerocess a lanar, olygonal sbdiision for oint location qeries. = (18, 11) raw a ertical line throgh each ertex. This decomoses the lane into slabs. In each slab, the ertical
More informationConstrained Path Optimisation for Underground Mine Layout
Constrained Path Otimisation for Underground Mine Layout M. Brazil P.A. Grossman D.H. Lee J.H. Rubinstein D.A. Thomas N.C. Wormald Abstract The major infrastructure comonent reuired to develo an underground
More informationCOMPOSITION OF STABLE SET POLYHEDRA
COMPOSITION OF STABLE SET POLYHEDRA Benjamin McClosky and Illya V. Hicks Department of Comptational and Applied Mathematics Rice University November 30, 2007 Abstract Barahona and Mahjob fond a defining
More informationA sufficient condition for spiral cone beam long object imaging via backprojection
A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral
More informationTriangle-Free Planar Graphs as Segments Intersection Graphs
Triangle-ree Planar Graphs as Segments Intersection Graphs N. de Castro 1,.J.Cobos 1, J.C. Dana 1,A.Márqez 1, and M. Noy 2 1 Departamento de Matemática Aplicada I Universidad de Sevilla, Spain {natalia,cobos,dana,almar}@cica.es
More informationClipping. Administrative. Assignment 1 Gallery. Questions about previous lectures? Overview of graphics pipeline? Assignment 2
Cliing MIT EECS 6.837 Frédo Durand and Seth Teller Some slides and images courtesy of Leonard McMillan MIT EECS 6.837, Teller and Durand 1 MIT EECS 6.837, Teller and Durand 2 Administrative Assignment
More informationEFFICIENT SOLUTION OF SYSTEMS OF ORIENTATION CONSTRAINTS
EFFICIENT SOLUTION OF SSTEMS OF OIENTATION CONSTAINTS Joseh L. Ganley Cadence Design Systems, Inc. ganley@cadence.com ABSTACT One sbtask in constraint-drien lacement is enforcing a set of orientation constraints
More informationConvex Hulls. Helen Cameron. Helen Cameron Convex Hulls 1/101
Convex Hulls Helen Cameron Helen Cameron Convex Hulls 1/101 What Is a Convex Hull? Starting Point: Points in 2D y x Helen Cameron Convex Hulls 3/101 Convex Hull: Informally Imagine that the x, y-lane is
More informationConstrained Empty-Rectangle Delaunay Graphs
CCCG 2015, Kingston, Ontario, August 10 12, 2015 Constrained Emty-Rectangle Delaunay Grahs Prosenjit Bose Jean-Lou De Carufel André van Renssen Abstract Given an arbitrary convex shae C, a set P of oints
More informationCS335 Fall 2007 Graphics and Multimedia. 2D Drawings: Lines
CS335 Fall 007 Grahics and Multimedia D Drawings: Lines Primitive Drawing Oerations Digital Concets of Drawing in Raster Arras PIXEL is a single arra element at x, - No smaller drawing unit exists Px,
More informationHIGH-ORDER BISECTION METHOD FOR COMPUTING INVARIANT MANIFOLDS OF TWO-DIMENSIONAL MAPS
International Journal of Bifurcation and Chaos, Vol., No. 7 () 7 4 c World Scientific Publishing Comany DOI:.4/S874964 HIGH-ORDER BISECTION METHOD FOR COMPUTING INVARIANT MANIFOLDS OF TWO-DIMENSIONAL MAPS
More informationConstrained Routing Between Non-Visible Vertices
Constrained Roting Between Non-Visible Vertices Prosenjit Bose 1, Matias Korman 2, André van Renssen 3,4, and Sander Verdonschot 1 1 School of Compter Science, Carleton University, Ottawa, Canada. jit@scs.carleton.ca,
More informationp 1 p 2 p 3 S u( ) θ
Preprint of a paper pblished in inimal Srfaces, Geometric Analysis and Symplectic Geometry Adv. Std. Pre ath, 34 (2002) 129 142. SOLUTION TO THE SHADOW PROBLE IN 3-SPACE OHAAD GHOI Abstract. If a convex
More informationTutte Embeddings of Planar Graphs
Spectral Graph Theory and its Applications Lectre 21 Ttte Embeddings o Planar Graphs Lectrer: Daniel A. Spielman November 30, 2004 21.1 Ttte s Theorem We sally think o graphs as being speciied by vertices
More informationMathematica(l) Roller Coasters
Mathematica(l) Roller Coasters Selwyn Hollis Department of Mathematics Armstrong Atlantic State University Savannah, GA 31419 shollis@armstrong.ed à Introdction Mathematica animations that simlate roller
More informationTu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization
T P7 15 First-arrival Traveltime Tomography with Modified Total Variation Reglarization W. Jiang* (University of Science and Technology of China) & J. Zhang (University of Science and Technology of China)
More informationThe Intersection of Two Ringed Surfaces and Some Related Problems
Graphical Models 63, 8 44 001) doi:10.1006/gmod.001.0553, available online at http://www.idealibrary.com on The Intersection of Two Ringed Srfaces and Some Related Problems Hee-Seok Heo and Sng Je Hong
More informationIDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION
ICAS 2 CONGRESS IDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION Christophe Le Garrec, Marc Hmbert, Michel Lacabanne Aérospatiale Matra
More information5.0 Curve and Surface Theory
5. Cre and Srface Theor 5.1 arametric Representation of Cres Consider the parametric representation of a cre as a ector t: t [t t t] 5.1 The deriatie of sch a ector ealated at t t is gien b t [ t t t ]
More informationCross products. p 2 p. p p1 p2. p 1. Line segments The convex combination of two distinct points p1 ( x1, such that for some real number with 0 1,
CHAPTER 33 Comutational Geometry Is the branch of comuter science that studies algorithms for solving geometric roblems. Has alications in many fields, including comuter grahics robotics, VLSI design comuter
More informationA Distributed Algorithm for Deadlock Detection and Resolution
A Distribted Algorithm for Deadlock Detection and Resoltion Don P. Mitchell Michael J. Merritt AT&T Bell Laboratories ABSTRACT This aer resents two distribted algorithms for detecting and resoling deadlocks.
More informationLecture 2: Fixed-Radius Near Neighbors and Geometric Basics
structure arises in many alications of geometry. The dual structure, called a Delaunay triangulation also has many interesting roerties. Figure 3: Voronoi diagram and Delaunay triangulation. Search: Geometric
More informationIntroduction to Visualization and Computer Graphics
Introduction to Visualization and Comuter Grahics DH2320, Fall 2015 Prof. Dr. Tino Weinkauf Introduction to Visualization and Comuter Grahics Grids and Interolation Next Tuesday No lecture next Tuesday!
More informationSummer 2017 MATH Suggested Solution to Exercise Find the tangent hyperplane passing the given point P on each of the graphs: (a)
Smmer 2017 MATH2010 1 Sggested Soltion to Exercise 6 1 Find the tangent hyperplane passing the given point P on each of the graphs: (a) z = x 2 y 2 ; y = z log x z P (2, 3, 5), P (1, 1, 1), (c) w = sin(x
More informationBlended Deformable Models
Blended Deformable Models (In IEEE Trans. Pattern Analysis and Machine Intelligence, April 996, 8:4, pp. 443-448) Doglas DeCarlo and Dimitri Metaxas Department of Compter & Information Science University
More informationTopological Drawings of Complete Bipartite Graphs
Topological Drawings of Complete Bipartite Graphs Jean Cardinal Stefan Felsner y Febrary 017 Abstract Topological drawings are natral representations of graphs in the plane, where vertices are represented
More informationThe effectiveness of PIES comparing to FEM and BEM for 3D elasticity problems
The effectiveness of PIES comparing to FEM and BEM for 3D elasticit problems A. Boltc, E. Zienik, K. Sersen Faclt of Mathematics and Compter Science, Universit of Bialstok, Sosnowa 64, 15-887 Bialstok,
More informationCurve Representation ME761A Instructor in Charge Prof. J. Ramkumar Department of Mechanical Engineering, IIT Kanpur
Curve Representation ME761A Instructor in Charge Prof. J. Ramkumar Department of Mechanical Engineering, IIT Kanpur Email: jrkumar@iitk.ac.in Curve representation 1. Wireframe models There are three types
More informationAugmenting the edge connectivity of planar straight line graphs to three
Agmenting the edge connectivity of planar straight line graphs to three Marwan Al-Jbeh Mashhood Ishaqe Kristóf Rédei Diane L. Sovaine Csaba D. Tóth Pavel Valtr Abstract We characterize the planar straight
More informationP Z. parametric surface Q Z. 2nd Image T Z
Direct recovery of shae from multile views: a arallax based aroach Rakesh Kumar. Anandan Keith Hanna Abstract Given two arbitrary views of a scene under central rojection, if the motion of oints on a arametric
More informationFINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES
FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES RICARDO G. DURÁN AND ARIEL L. LOMBARDI Abstract. We consider the nmerical approximation of a model convection-diffsion
More informationLearning Motion Patterns in Crowded Scenes Using Motion Flow Field
Learning Motion Patterns in Crowded Scenes Using Motion Flow Field Min Hu, Saad Ali and Mubarak Shah Comuter Vision Lab, University of Central Florida {mhu,sali,shah}@eecs.ucf.edu Abstract Learning tyical
More informationCMSC 754 Computational Geometry 1
CMSC 754 Comutational Geometry 1 David M. Mount Deartment of Comuter Science University of Maryland Fall 2002 1 Coyright, David M. Mount, 2002, Det. of Comuter Science, University of Maryland, College
More informationGeorgia Department of Education Common Core Georgia Performance Standards Framework Teacher Edition Accelerated CCGPS Pre-Calculus Unit 6
Hedwig and Errol The vector addition and sbtraction we have done so far has been qite easy, since we cold do them component-wise. That is, we jst added or sbtracted each component separately. Bt if vectors
More informationEUCLIDEAN SKELETONS USING CLOSEST POINTS. Songting Luo. Leonidas J. Guibas. Hong-Kai Zhao. (Communicated by the associate editor name)
Volme X, No. 0X, 200X, X XX Web site: http://www.aimsciences.org EUCLIDEAN SKELETONS USING CLOSEST POINTS Songting Lo Department of Mathematics, University of California, Irvine Irvine, CA 92697-3875,
More informationPurdue University. Abstract. We present algorithms for constructing iso-contours from image data or tting scattered point data
Data Fitting with Cubic A-Slines Chandrajit L. Bajaj Guoliang Xu y Deartment of Comuter Science Purdue Uniersity Abstract We resent algorithms for constructing iso-contours from image data or tting scattered
More informationFast Ray Tetrahedron Intersection using Plücker Coordinates
Fast Ray Tetrahedron Intersection sing Plücker Coordinates Nikos Platis and Theoharis Theoharis Department of Informatics & Telecommnications University of Athens Panepistemiopolis, GR 157 84 Ilissia,
More informationMathematician Helaman Ferguson combines science
L A B 19 MATHEMATICAL SCULPTURES Parametric Srfaces Mathematician Helaman Fergson combines science and art with his niqe mathematical sclptres. Fergson s sclptres are the concrete embodiments of mathematical
More informationChapter 3: Graphics Output Primitives. OpenGL Line Functions. OpenGL Point Functions. Line Drawing Algorithms
Chater : Grahics Outut Primitives Primitives: functions in grahics acage that we use to describe icture element Points and straight lines are the simlest rimitives Some acages include circles, conic sections,
More informationLast lecture: finishing up Chapter 22
Last lectre: finishing p Chapter 22 Hygens principle consider each point on a wavefront to be sorce of secondary spherical wavelets that propagate at the speed of the wave at a later time t, new wavefront
More informationSPACE-SCALE DIAGRAMS: UNDERSTANDING MULTISCALE INTERFACES
SPACE-SCALE DIAGRAMS: UNDERSTANDING MULTISCALE INTERFACES George W. Frnas Bellcore, 445 Soth Street Morristown, NJ 07962-1910 (201) 829-4289 gwf@bellcore.com Benjamin B. Bederson* Bellcore, 445 Soth Street
More informationGlobal Illumination with Photon Map Compensation
Institut für Comutergrahik und Algorithmen Technische Universität Wien Karlslatz 13/186/2 A-1040 Wien AUSTRIA Tel: +43 (1) 58801-18688 Fax: +43 (1) 58801-18698 Institute of Comuter Grahics and Algorithms
More informationLecture 10. Diffraction. incident
1 Introdction Lectre 1 Diffraction It is qite often the case that no line-of-sight path exists between a cell phone and a basestation. In other words there are no basestations that the cstomer can see
More informationCurves and Surfaces 1
Curves and Surfaces 1 Representation of Curves & Surfaces Polygon Meshes Parametric Cubic Curves Parametric Bi-Cubic Surfaces Quadric Surfaces Specialized Modeling Techniques 2 The Teapot 3 Representing
More informationLecture 8: Orthogonal Range Searching
CPS234 Comutational Geometry Setember 22nd, 2005 Lecture 8: Orthogonal Range Searching Lecturer: Pankaj K. Agarwal Scribe: Mason F. Matthews 8.1 Range Searching The general roblem of range searching is
More informationParametrization and smooth approximation of surface triangulations
Parametrization and smooth aroximation of surface triangulations Michael S. Floater * Deartamento de Matemática Alicada, Universidad de Zaragoza, Sain December 1995, revised June 1996 Abstract. A method
More informationCS 450: COMPUTER GRAPHICS REVIEW: CLIPPING SPRING 2015 DR. MICHAEL J. REALE
CS 45: COMPUTER GRAPHICS REVIEW: CLIPPING SPRING 215 DR. MICHAEL J. REALE CLIPPING Clipping = removing part or all of the primitives otside of the clipping volme/window Clipping volme in OpenGL nit cbe
More informationSketch-Based Aesthetic Product Form Exploration from Existing Images Using Piecewise Clothoid Curves
Sketch-Based Aesthetic Prodct Form Exploration from Existing Images Using Piecewise Clothoid Crves Günay Orbay, Mehmet Ersin Yümer, Levent Brak Kara* Mechanical Engineering Department Carnegie Mellon University
More informationMaximum Weight Independent Sets in an Infinite Plane
Maximm Weight Independent Sets in an Infinite Plane Jarno Nosiainen, Jorma Virtamo, Pasi Lassila jarno.nosiainen@tkk.fi, jorma.virtamo@tkk.fi, pasi.lassila@tkk.fi Department of Commnications and Networking
More informationPOWER-OF-2 BOUNDARIES
Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of
More information5. UDEC. 5.1 Introduction. 5.2 UDEC: Two-dimensional modelling
5. 5.1 Introduction On a conference in 1971 Peter A. Cundall, the doctorial student of Imerial College, introduced a novel software called Universal Distinct Element Code (). This software (Cundall, 1971)
More informationAn introduction to interpolation and splines
An introduction to interpolation and splines Kenneth H. Carpenter, EECE KSU November 22, 1999 revised November 20, 2001, April 24, 2002, April 14, 2004 1 Introduction Suppose one wishes to draw a curve
More informationOPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018
OPTI-502 Optical Design and Instrmentation I John E. Greivenkamp Assigned: 10/31/18 Lectre 21 De: 11/7/18 Lectre 23 Note that in man 502 homework and exam problems (as in the real world!!), onl the magnitde
More informationA GENERIC MODEL OF A BASE-ISOLATED BUILDING
Chapter 5 A GENERIC MODEL OF A BASE-ISOLATED BUILDING This chapter draws together the work o Chapters 3 and 4 and describes the assembly o a generic model o a base-isolated bilding. The irst section describes
More information11 - Bump Mapping. Bump-Mapped Objects. Bump-Mapped Objects. Bump-Mapped Objects. Limitations Of Texture Mapping. Bumps: Perturbed Normals
CSc 155 Advanced Compter Graphics Limitations Of extre Mapping extre mapping paints srfaces o extre image is typically fixed Some characteristics are difficlt to textre o Roghness, Wrinkles extre illmination
More informationCurve Reconstruction taken from [1]
Notes by Tamal K. Dey, OSU 47 Curve Reconstruction taken from [1] The simlest class of manifolds that ose nontrivial reconstruction roblems are curves in the lane. We will describe two algorithms for curve
More informationMulti-Scale Reconstruction of Implicit Surfaces with Attributes from Large Unorganized Point Sets
Multi-Scale Reconstruction of Imlicit Surfaces with Attributes from Large Unorganized Point Sets Ireneusz Tobor LaBRI - CNRS - INRIA Universite Bordeaux tobor@labri.fr Patrick Reuter LaBRI - CNRS - INRIA
More informationOPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 7 Fall, 2018
Assigned: 10/10/18 Lectre 15 De: 10/17/18 Lectre 17 Midterm Exam: Wednesda October 24 (Lectre 19) The eqation sheet for the exam has been posted on the corse website. This eqation sheet will be inclded
More informationExtracting Optimal Paths from Roadmaps for Motion Planning
Extracting Otimal Paths from Roadmas for Motion Planning Jinsuck Kim Roger A. Pearce Nancy M. Amato Deartment of Comuter Science Texas A&M University College Station, TX 843 jinsuckk,ra231,amato @cs.tamu.edu
More informationImage Enhancement in the Frequency Domain Periodicity and the need for Padding:
Prepared B: Dr. Hasan Demirel PhD Image Enhancement in the Freqenc Domain Periodicit and the need for Padding: Periodicit propert of the DFT: The discrete Forier Transform and the inverse Forier transforms
More informationCS 450: COMPUTER GRAPHICS 2D TRANSFORMATIONS SPRING 2016 DR. MICHAEL J. REALE
CS 45: COMUTER GRAHICS 2D TRANSFORMATIONS SRING 26 DR. MICHAEL J. REALE INTRODUCTION Now that we hae some linear algebra under our resectie belts, we can start ug it in grahics! So far, for each rimitie,
More informationAUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS. Ren Chen and Viktor K.
inuts er clock cycle Streaming ermutation oututs er clock cycle AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS Ren Chen and Viktor K.
More informationMulti-lingual Multi-media Information Retrieval System
Mlti-lingal Mlti-media Information Retrieval System Shoji Mizobchi, Sankon Lee, Fmihiko Kawano, Tsyoshi Kobayashi, Takahiro Komats Gradate School of Engineering, University of Tokshima 2-1 Minamijosanjima,
More informationNon-uniform Subdivision for B-splines of Arbitrary Degree
Non-niform Sbdivision for B-slines of Arbirary Degree S. Schaefer, R. Goldman We resen an efficien algorihm for sbdividing non-niform B-slines of arbirary degree in a manner similar o he Lane-Riesenfeld
More informationSpace-efficient Region Filling in Raster Graphics
"The Visual Comuter: An International Journal of Comuter Grahics" (submitted July 13, 1992; revised December 7, 1992; acceted in Aril 16, 1993) Sace-efficient Region Filling in Raster Grahics Dominik Henrich
More informationApplication of Gaussian Curvature Method in Development of Hull Plate Surface
Marine Engineering Frontiers (MEF) Volme 2, 204 Application of Gassian Crvatre Method in Development of Hll Plate Srface Xili Zh, Yjn Li 2 Dept. of Infor., Dalian Univ., Dalian 6622, China 2 Dept. of Naval
More informationSECOND order computational methods commonly employed in production codes, while sufficient for many applications,
th AIAA Comptational Flid Dynamics Conference 7-3 Jne, Honoll, Hawaii AIAA -384 Active Fl Schemes for Systems Timothy A. Eymann DoD HPCMP/CREATE Kestrel Team, Eglin AFB, FL 354 Philip L. Roe Department
More informationWe will then introduce the DT, discuss some of its fundamental properties and show how to compute a DT directly from a given set of points.
Voronoi Diagram and Delaunay Triangulation 1 Introduction The Voronoi Diagram (VD, for short) is a ubiquitious structure that aears in a variety of discilines - biology, geograhy, ecology, crystallograhy,
More informationABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS
Proceedings th FIG Symposim on Deformation Measrements Santorini Greece 00. ABSOUTE DEFORMATION PROFIE MEASUREMENT IN TUNNES USING REATIVE CONVERGENCE MEASUREMENTS Mahdi Moosai and Saeid Khazaei Mining
More informationArea, perimeter and volume
s 3 3 88 Area, erimeter and volme Exlanation Level A good starting oint is to know the dierence etween D shaes and 3D shaes. D shaes have two dimensions: length and width. They have no deth. They are lat
More informationUPDATING ALGORITHMS FOR CONSTRAINT DELAUNAY TIN
UPDATING ALGORITMS FOR CONSTRAINT DELAUNAY TIN WU LiXin a,b WANG YanBing a, c a Institute for GIS/RS/GPS & Subsidence Engineering Research, China Uni Mining & Technology, Beijing, China, 100083 - awulixin@263.net,
More informationMaster for Co-Simulation Using FMI
Master for Co-Simlation Using FMI Jens Bastian Christoph Claß Ssann Wolf Peter Schneider Franhofer Institte for Integrated Circits IIS / Design Atomation Division EAS Zenerstraße 38, 69 Dresden, Germany
More informationAppearance Based Tracking with Background Subtraction
The 8th International Conference on Compter Science & Edcation (ICCSE 213) April 26-28, 213. Colombo, Sri Lanka SD1.4 Appearance Based Tracking with Backgrond Sbtraction Dileepa Joseph Jayamanne Electronic
More informationEarthenware Reconstruction Based on the Shape Similarity among Potsherds
Original Paer Forma, 16, 77 90, 2001 Earthenware Reconstruction Based on the Shae Similarity among Potsherds Masayoshi KANOH 1, Shohei KATO 2 and Hidenori ITOH 1 1 Nagoya Institute of Technology, Gokiso-cho,
More informationIllumination Model. The governing principles for computing the. Apply the lighting model at a set of points across the entire surface.
Illumination and Shading Illumination (ighting) Model the interaction of light with surface oints to determine their final color and brightness OenG comutes illumination at vertices illumination Shading
More informationRepresenting Curves Part II. Foley & Van Dam, Chapter 11
Representing Curves Part II Foley & Van Dam, Chapter 11 Representing Curves Polynomial Splines Bezier Curves Cardinal Splines Uniform, non rational B-Splines Drawing Curves Applications of Bezier splines
More informationComputer Graphics. Computer Graphics. Lecture 3 Line & Circle Drawing
Comuter Grahics Comuter Grahics Lecture 3 Line & Circle Drawing Comuter Grahics Towards the Ideal Line We can onl do a discrete aroimation Illuminate iels as close to the true ath as ossible, consider
More informationChapter 7, Part B Sampling and Sampling Distributions
Slides Preared by JOHN S. LOUCKS St. Edward s University Slide 1 Chater 7, Part B Samling and Samling Distributions Samling Distribution of Proerties of Point Estimators Other Samling Methods Slide 2 Samling
More informationTri-Edge-Connectivity Augmentation for Planar Straight Line Graphs
Tri-Edge-Connectivity Agmentation for Planar Straight Line Graphs Marwan Al-Jbeh 1, Mashhood Ishaqe 1, Kristóf Rédei 1, Diane L. Sovaine 1, and Csaba D. Tóth 1,2 1 Department of Compter Science, Tfts University,
More information