1-D and 2-D Elements. 1-D and 2-D Elements

Size: px
Start display at page:

Download "1-D and 2-D Elements. 1-D and 2-D Elements"

Transcription

1 merial Methods in Geophysis -D and -D Elements -D and -D Elements -D elements -D elements - oordinate transformation - linear elements linear basis fntions qadrati basis fntions bi basis fntions - oordinate transformation - trianglar elements linear basis fntions qadrati basis fntions - retanglar elements linear basis fntions qadrati basis fntions

2 merial Methods in Geophysis -D and -D Elements -D elements: oordinate tranformation We wish to approximate a fntion x defined in an interval [ab] by some set of basis fntions n x ϕ i i i where i is the nmber of grid points the edges of or elements defined at loations x i. As the basis fntions look the same in all elements apart from some onstant we make life easier by moving to a loal oordinate system x xi x x i i so that the element is defined for [].

3 merial Methods in Geophysis -D and -D Elements -D linear elements There is not mh hoie for the shape of a straight -D element! otably the length an vary aross the domain. We reqire that or fntion be approximated loally by the linear fntion Or node points are defined at and we reqire that A A -

4 merial Methods in Geophysis -D and -D Elements -D elements linear basis fntions As we have expressed the oeffiients i as a fntion of the fntion vales at node points we an now express the approximate fntion sing the node vales.. and x are the linear basis fntions for -D elements.

5 merial Methods in Geophysis -D and -D Elements -D qadrati elements -D qadrati elements ow we reqire that or fntion x be approximated loally by the qadrati fntion Or node points are defined at / and we reqire that.5.5 A A

6 merial Methods in Geophysis -D and -D Elements -D qadrati basis fntions... again we an now express or approximated fntion as a sm over or basis fntions weighted by the vales at three node points i i i... note that now we re sing three grid points per element... Can we approximate a onstant fntion?

7 merial Methods in Geophysis -D and -D Elements -D bi basis fntions -D bi basis fntions... sing similar argments the bi basis fntions an be derived as ζ... note that here we need derivative information at the bondaries... How an we approximate a onstant fntion?

8 merial Methods in Geophysis -D and -D Elements -D elements: oordinate transformation Let s now disss the geometry and basis fntions of -D elements again we want to onsider the problems in a loal oordinate system first we look at triangles y P P P P x P P before after

9 merial Methods in Geophysis -D and -D Elements -D elements: oordinate transformation Any triangle with orners P i x i y i i an be transformed into a retanglar eqilateral triangle with x y x y x y x y x y x y P P P P P P sing onterlokwise nmbering. ote that if then these eqations are eqivalent to the -D tranformations. We seek to approximate a fntion by the linear form we proeed in the same way as in the -D ase

10 merial Methods in Geophysis -D and -D Elements -D elements: oeffiients... and we obtain P P P P P P... and we obtain the oeffiients as a fntion of the vales at the grid nodes by matrix inversion A A ontaining the -D ase A -

11 merial Methods in Geophysis -D and -D Elements triangles: linear basis fntions from matrix A we an allate the linear basis fntions for triangles P P P P P P

12 merial Methods in Geophysis -D and -D Elements triangles: qadrati elements Any fntion defined on a triangle an be approximated by the qadrati fntion x y α α x α y α x α xy α y and in the transformed system we obtain P P P P P / P 5 // as in the -D ase we need additional points on the element. P 6 P 5 P 6 / P P P

13 merial Methods in Geophysis -D and -D Elements triangles: qadrati elements To determine the oeffiients we allate the fntion at eah grid point to obtain 5 6 / / / 6 / / / 6 6 / / 5 / 6 P 6 P P P P 5 P P P P / P 5 // P 6 / P... and by matrix inversion we an allate the oeffiients as a fntion of the vales at P i A

14 merial Methods in Geophysis -D and -D Elements triangles: basis fntions triangles: basis fntions P P P P P P P 5 // P / P 6 / P 5 P P 6 A A... to obtain the basis fntions 5... and they look like...

15 merial Methods in Geophysis -D and -D Elements triangles: qadrati basis fntions The first three qadrati basis fntions... P P P P P / P 5 // P 5 P 6 / P 6 P P P

16 merial Methods in Geophysis -D and -D Elements triangles: qadrati basis fntions.. and the rest... P P P P P / P 5 // P 5 P 6 / P 6 P P P

17 merial Methods in Geophysis -D and -D Elements retangles: transformation Let s onsider retanglar elements and transform them into a loal oordinate system y P P P P P P x P P before after

18 merial Methods in Geophysis -D and -D Elements retangles: linear elements retangles: linear elements With the linear Ansatz we obtain matrix A as A and the basis fntions

19 merial Methods in Geophysis -D and -D Elements retangles: qadrati elements With the qadrati Ansatz we obtain an 8x8 matrix A... and a basis fntion look e.g. like 5 P P 8 P P 7 P 5 P P 6 P

20 merial Methods in Geophysis -D and -D Elements -D and -D elements: smmary The basis fntions for finite element problems an be obtained by:. Transforming the system in to a loal to the element system. Making a linear qadrati bi Ansatz for a fntion defined aross the element.. Using the interpolation ondition whih states that the partilar basis fntions shold be one at the orresponding grid node to obtain the oeffiients as a fntion of the fntion vales at the grid nodes.. Using these oeffiients to derive the n basis fntions for the n node points or onditions.

CSCE 155N Fall Homework Assignment 3: Coordinates Transformation Tool 1. Assigned: September 29, 2016 Due: October 20, 2016

CSCE 155N Fall Homework Assignment 3: Coordinates Transformation Tool 1. Assigned: September 29, 2016 Due: October 20, 2016 CSCE N Fall 0 Homework Assignment : Coordinates Transformation Tool Assigned: September 9 0 De: Otober 0 0 Note: This assignment is to be ompleted in grops of or Points: 00 points Objeties Memo To: The

More information

CSCE 155N Spring Homework Assignment 3: Coordinates Transformation Tool 1. Assigned: February 15, 2013 Due: March 8, 2013

CSCE 155N Spring Homework Assignment 3: Coordinates Transformation Tool 1. Assigned: February 15, 2013 Due: March 8, 2013 CSCE N Spring 0 Homework Assignment : Coordinates Transformation Tool Assigned: Febrary 0 De: Marh 8 0 Note: This assignment is to be ompleted indiidally - ollaboration is stritly prohibited. Points: 00

More information

IPSJ SIG Tehnial Report data olletion in a WSN with a mbs. PNC spports removing the obsolete data. Eah ombined segment enodes only the part of latest

IPSJ SIG Tehnial Report data olletion in a WSN with a mbs. PNC spports removing the obsolete data. Eah ombined segment enodes only the part of latest IPSJ SIG Tehnial Report Distribted Coding Shemes for Continos Data Colletion in Wireless Sensor Networs XIUCAI YE This mansript addresses the ontinos data olletion in WSNs with a mobile Base Station (mbs).

More information

arxiv: v1 [cs.db] 13 Sep 2017

arxiv: v1 [cs.db] 13 Sep 2017 An effiient lustering algorithm from the measure of loal Gaussian distribution Yuan-Yen Tai (Dated: May 27, 2018) In this paper, I will introdue a fast and novel lustering algorithm based on Gaussian distribution

More information

Using Singular Value Decomposition to Compare Correlated Modal Vectors

Using Singular Value Decomposition to Compare Correlated Modal Vectors Using Singlar Vale Deomposition to Compare Correlated Modal Vetors James P. DeClerk Noise and Vibration Center General Motors North Amerian Operations Milford, Mihigan USA ABSTRACT A tool is needed to

More information

Abstract. We describe a parametric hybrid Bezier patch that, in addition. schemes are local in that changes to part of the data only aect portions of

Abstract. We describe a parametric hybrid Bezier patch that, in addition. schemes are local in that changes to part of the data only aect portions of A Parametri Hyrid Triangular Bezier Path Stephen Mann and Matthew Davidhuk Astrat. We desrie a parametri hyrid Bezier path that, in addition to lending interior ontrol points, lends oundary ontrol points.

More information

Supplementary Material: Geometric Calibration of Micro-Lens-Based Light-Field Cameras using Line Features

Supplementary Material: Geometric Calibration of Micro-Lens-Based Light-Field Cameras using Line Features Supplementary Material: Geometri Calibration of Miro-Lens-Based Light-Field Cameras using Line Features Yunsu Bok, Hae-Gon Jeon and In So Kweon KAIST, Korea As the supplementary material, we provide detailed

More information

3D Ideal Flow For Non-Lifting Bodies

3D Ideal Flow For Non-Lifting Bodies 3D Ideal Flow For Non-Lifting Bodies 3D Doublet Panel Method 1. Cover body with 3D onstant strength doublet panels of unknown strength (N panels) 2. Plae a ontrol point at the enter of eah panel (N ontrol

More information

Multiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET

Multiple-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 information

Information Granulation: a Search for Data Structures

Information Granulation: a Search for Data Structures Information Granlation: a Searh for Data Strtres Witold PEDRYCZ * and Andrzej BARGIELA ** * University of Alberta, Edmonton, Canada * Syems Researh Initte, Polish Aademy of Sienes, Poland (pedryz@ee.alberta.a)

More information

Control of industrial robots. Control with vision sensors

Control of industrial robots. Control with vision sensors Control of indstrial robots Control with ision sensors Prof. Paolo Roo (paolo.roo@polimi.it) Politenio di Milano Dipartimento di Elettronia Informazione e Bioingegneria Visal measrements Artifiial ision

More information

FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES

FINITE 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 information

DETERMINING THE MAXIMUM SPEED BORNE BY THE ELASTIC STRUCTURE OF A MACHINE TOOL, PREVIONSTY ITS REMANUFACTURING

DETERMINING THE MAXIMUM SPEED BORNE BY THE ELASTIC STRUCTURE OF A MACHINE TOOL, PREVIONSTY ITS REMANUFACTURING THE ITERATIOAL COFERECE OF THE CARPATHIA EURO-REGIO SPECIALISTS I IDUSTRIAL SYSTEMS 7 th EDITIO DETERMIIG THE MAXIMUM SPEED BORE BY THE ELASTIC STRUCTURE OF A MACHIE TOOL, PREVIOSTY ITS REMAUFACTURIG Din

More information

On New Sorting-Based Lossless Motion Estimation Algorithms

On New Sorting-Based Lossless Motion Estimation Algorithms On New Sorting-Based Lossless Motion Estimation Algorithms D. QUAGLIA, M. PERGA, B. MONTRUCCHIO, P. MONTUSCHI Dipartimento di Atomatia e Informatia Politenio di Torino Corso Da degli Abrzzi, 24 - I-029

More information

Fuzzy Clustering-Based Approach for Outlier Detection

Fuzzy Clustering-Based Approach for Outlier Detection Fzzy Clstering-Based Approah for Otlier Detetion MOH'D BELAL AL-ZOUBI 1, AL-DAHOUD ALI 2, ABDELFATAH A. YAHYA 3 1 Department of Compter Information Systems, KASIT University Of Jordan Amman JORDAN E-mail:

More information

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0; Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;

More information

Active Contour without Edges

Active Contour without Edges Ative Contor withot Edges Tony Chan and Lminita Vese Basi idea in lassial ative ontors Crve evoltion and deformation internal fores: Min LengthC+AreainsideC Bondary detetion: stopping edge-fntion external

More information

f3 for a blade section.

f3 for a blade section. AAA-99-4 CORRECTNG NFLOW MEASUREMENTS FROM HAWTS USNG A LFTNG-SURFACE CODE J. Whale: C. J. Fisihella' and M.S. Selig 1 University of inois at Urbana-Champaign Urbana, L 6181 Abstrat Aerodynami performane

More information

ICCGLU. A Fortran IV subroutine to solve large sparse general systems of linear equations. J.J. Dongarra, G.K. Leaf and M. Minkoff.

ICCGLU. A Fortran IV subroutine to solve large sparse general systems of linear equations. J.J. Dongarra, G.K. Leaf and M. Minkoff. http://www.netlib.org/linalg/ig-do 1 of 8 12/7/2009 11:14 AM ICCGLU A Fortran IV subroutine to solve large sparse general systems of linear equations. J.J. Dongarra, G.K. Leaf and M. Minkoff July, 1982

More information

Ma Lesson 18 Section 1.7

Ma Lesson 18 Section 1.7 Ma 15200 Lesson 18 Section 1.7 I Representing an Ineqality There are 3 ways to represent an ineqality. (1) Using the ineqality symbol (sometime within set-bilder notation), (2) sing interval notation,

More information

Projections. Let us start with projections in 2D, because there are easier to visualize.

Projections. Let us start with projections in 2D, because there are easier to visualize. Projetions Let us start ith projetions in D, beause there are easier to visualie. Projetion parallel to the -ais: Ever point in the -plane ith oordinates (, ) ill be transformed into the point ith oordinates

More information

Picking and Curves Week 6

Picking 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 information

CS 4204 Computer Graphics

CS 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 information

Scheduling Contract Algorithms on Multiple Processors

Scheduling Contract Algorithms on Multiple Processors Shedling Contrat Algorithms on Mltiple Proessors Daniel S. Bernstein, Theodore J. Perkins, Shlomo Zilberstein Department of Compter Siene University of Massahsetts Amherst, MA 0100 bern,perkins,zilberstein

More information

Citation for published version (APA): Malki, S., & Spaanenburg, L. (2004). An exploration of digital CNN implementations. In Proceedings SSOCC

Citation for published version (APA): Malki, S., & Spaanenburg, L. (2004). An exploration of digital CNN implementations. In Proceedings SSOCC An exploration of digital CNN implementations Malki, Sleyman; Spaanenbrg, Lambert Pblished in: Proeedings SSOCC 2004 Link to pbliation Citation for pblished version (APA): Malki, S., & Spaanenbrg, L. (2004).

More information

An Introduction to GPU Computing. Aaron Coutino MFCF

An Introduction to GPU Computing. Aaron Coutino MFCF An Introdction to GPU Compting Aaron Cotino acotino@waterloo.ca MFCF What is a GPU? A GPU (Graphical Processing Unit) is a special type of processor that was designed to render and maniplate textres. They

More information

Object Pose from a Single Image

Object Pose from a Single Image Object Pose from a Single Image How Do We See Objects in Depth? Stereo Use differences between images in or left and right eye How mch is this difference for a car at 00 m? Moe or head sideways Or, the

More information

Parallel Algorithms and Library Software for the Generalized Eigenvalue Problem on Distributed Memory Computer Systems

Parallel Algorithms and Library Software for the Generalized Eigenvalue Problem on Distributed Memory Computer Systems Parallel Algorithms and Library Software for the Generalized Eigenvale Problem on Distribted Memory ompter Systems Björn Adlerborn Lientiate Thesis DEPARTMENT OF OMPUTING SIENE UMEÅ UNIVERSITY, SWEDEN

More information

Stereoscopic Motion Tracking in Biomedical Visualisation. Michael Cheng

Stereoscopic Motion Tracking in Biomedical Visualisation. Michael Cheng Stereosopi otion Traking in Biomedial Visalisation ihael Cheng This report is sbmitted as partial flfilment of the reqirements for the Gradate Diploma Programme of the Department of Compter Siene The Uniersity

More information

arxiv: v1 [cs.gr] 10 Apr 2015

arxiv: v1 [cs.gr] 10 Apr 2015 REAL-TIME TOOL FOR AFFINE TRANSFORMATIONS OF TWO DIMENSIONAL IFS FRACTALS ELENA HADZIEVA AND MARIJA SHUMINOSKA arxiv:1504.02744v1 s.gr 10 Apr 2015 Abstrat. This work introdues a novel tool for interative,

More information

Dynamic Algorithms Multiple Choice Test

Dynamic Algorithms Multiple Choice Test 3226 Dynami Algorithms Multiple Choie Test Sample test: only 8 questions 32 minutes (Real test has 30 questions 120 minutes) Årskort Name Eah of the following 8 questions has 4 possible answers of whih

More information

Recall: Function Calls to Create Transform Matrices

Recall: Function Calls to Create Transform Matrices Reall: Fntion Calls to Create Transform Matries Previosl made fntion alls to generate 44 matries for identit, translate, sale, rotate transforms Pt transform matri into CTM Eample mat4 m = Identit(; CTM

More information

MOTORCYCLE HELMET DROP TESTS USING A HYBRID III DUMMY

MOTORCYCLE HELMET DROP TESTS USING A HYBRID III DUMMY MOTORCYCLE HELMET DROP TESTS USING A HYBRID III DUMMY A. M. Hering, S. Derler Swiss Federal Laboratories for Material Testing and Researh, St. Gallen, Switzerland ABSTRACT Falling headform tests, whih

More information

The extra single-cycle adders

The extra single-cycle adders lticycle Datapath As an added bons, we can eliminate some of the etra hardware from the single-cycle path. We will restrict orselves to sing each fnctional nit once per cycle, jst like before. Bt since

More information

Directed Rectangle-Visibility Graphs have. Abstract. Visibility representations of graphs map vertices to sets in Euclidean space and

Directed Rectangle-Visibility Graphs have. Abstract. Visibility representations of graphs map vertices to sets in Euclidean space and Direted Retangle-Visibility Graphs have Unbounded Dimension Kathleen Romanik DIMACS Center for Disrete Mathematis and Theoretial Computer Siene Rutgers, The State University of New Jersey P.O. Box 1179,

More information

The four lines of symmetry have been drawn on the shape.

The four lines of symmetry have been drawn on the shape. 4Geometry an measures 4.1 Symmetry I an ientify refletion symmetry in 2D shapes ientify rotation symmetry in 2D shapes Example a i How many lines of symmetry oes this shape have? ii Colour two squares

More information

Review Multicycle: What is Happening. Controlling The Multicycle Design

Review Multicycle: What is Happening. Controlling The Multicycle Design Review lticycle: What is Happening Reslt Zero Op SrcA SrcB Registers Reg Address emory em Data Sign etend Shift left Sorce A B Ot [-6] [5-] [-6] [5-] [5-] Instrction emory IR RegDst emtoreg IorD em em

More information

Grade 6. Mathematics. Student Booklet SPRING 2009 RELEASED ASSESSMENT QUESTIONS. Assessment of Reading, Writing and Mathematics, Junior Division

Grade 6. Mathematics. Student Booklet SPRING 2009 RELEASED ASSESSMENT QUESTIONS. Assessment of Reading, Writing and Mathematics, Junior Division Grade 6 Assessment of Reading, Writing and Mathematis, Junior Division Student Booklet Mathematis SPRING 2009 RELEASED ASSESSMENT QUESTIONS Please note: The format of these booklets is slightly different

More information

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation

More information

Unit 8 Chapter 3 Properties of Angles and Triangles

Unit 8 Chapter 3 Properties of Angles and Triangles Unit 8 Chapter 3 Properties of Angles and Triangles May 16 7:01 PM Types of lines 1) Parallel Lines lines that do not (and will not) cross each other are labeled using matching arrowheads are always the

More information

1. Introduction. 2. The Probable Stope Algorithm

1. Introduction. 2. The Probable Stope Algorithm 1. Introdution Optimization in underground mine design has reeived less attention than that in open pit mines. This is mostly due to the diversity o underground mining methods and omplexity o underground

More information

Instruction fetch. MemRead. IRWrite ALUSrcB = 01. ALUOp = 00. PCWrite. PCSource = 00. ALUSrcB = 00. R-type completion

Instruction fetch. MemRead. IRWrite ALUSrcB = 01. ALUOp = 00. PCWrite. PCSource = 00. ALUSrcB = 00. R-type completion . (Chapter 5) Fill in the vales for SrcA, SrcB, IorD, Dst and emto to complete the Finite State achine for the mlti-cycle datapath shown below. emory address comptation 2 SrcA = SrcB = Op = fetch em SrcA

More information

2. Triangle ABC and triangle DEF are graphed on the set of axes below. 3. Quadrilateral ABCD is graphed on the set of axes below.

2. Triangle ABC and triangle DEF are graphed on the set of axes below. 3. Quadrilateral ABCD is graphed on the set of axes below. Review Session 1 Pratie Problems l. The verties of AJKL have oordinates J(5,1), K( 2, 3), and Under whih transformation is the image AJ'K t L t not ongruent to AJKL? l) a translation of two units to the

More information

Define - starting approximation for the parameters (p) - observational data (o) - solution criterion (e.g. number of iterations)

Define - starting approximation for the parameters (p) - observational data (o) - solution criterion (e.g. number of iterations) Global Iterative Solution Distributed proessing of the attitude updating L. Lindegren (21 May 2001) SAG LL 37 Abstrat. The attitude updating algorithm given in GAIA LL 24 (v. 2) is modified to allow distributed

More information

Flight path strategies for 3-D scene reconstruction from bistatic SAR

Flight path strategies for 3-D scene reconstruction from bistatic SAR Flight path strategies for 3-D sene reonstrtion from bistati SAR B.D. Rigling and R.L. Moses Abstrat: Proper design of reeiver flight paths allows three-dimensional information to be enoded in sensed bistati

More information

We P9 16 Eigenray Tracing in 3D Heterogeneous Media

We P9 16 Eigenray Tracing in 3D Heterogeneous Media We P9 Eigenray Traing in 3D Heterogeneous Media Z. Koren* (Emerson), I. Ravve (Emerson) Summary Conventional two-point ray traing in a general 3D heterogeneous medium is normally performed by a shooting

More information

P-admissible Solution Space

P-admissible Solution Space P-admissible Solution Spae P-admissible solution spae or Problem P: 1. the solution spae is inite, 2. every solution is easible, 3. evaluation or eah oniguration is possible in polynomial time and so is

More information

Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors

Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors Eurographis Symposium on Geometry Proessing (003) L. Kobbelt, P. Shröder, H. Hoppe (Editors) Rotation Invariant Spherial Harmoni Representation of 3D Shape Desriptors Mihael Kazhdan, Thomas Funkhouser,

More information

FUZZY WATERSHED FOR IMAGE SEGMENTATION

FUZZY WATERSHED FOR IMAGE SEGMENTATION FUZZY WATERSHED FOR IMAGE SEGMENTATION Ramón Moreno, Manuel Graña Computational Intelligene Group, Universidad del País Vaso, Spain http://www.ehu.es/winto; {ramon.moreno,manuel.grana}@ehu.es Abstrat The

More information

A sufficient condition for spiral cone beam long object imaging via backprojection

A 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 information

Colouring contact graphs of squares and rectilinear polygons de Berg, M.T.; Markovic, A.; Woeginger, G.

Colouring contact graphs of squares and rectilinear polygons de Berg, M.T.; Markovic, A.; Woeginger, G. Colouring ontat graphs of squares and retilinear polygons de Berg, M.T.; Markovi, A.; Woeginger, G. Published in: nd European Workshop on Computational Geometry (EuroCG 06), 0 Marh - April, Lugano, Switzerland

More information

Greedy strikes back: Improved Facility Location Algorithms. this problem is NP-hard.

Greedy strikes back: Improved Facility Location Algorithms. this problem is NP-hard. Greedy stries ba Improved Faility Loation Algorithms Sdipto Gha Dept. o Compter Siene Stanord University Stanord, CA 9435 Samir Khller y Compter Siene Dept. and UMIACS University o Maryland College Par,

More information

A Unified Subdivision Scheme for Polygonal Modeling

A Unified Subdivision Scheme for Polygonal Modeling EUROGRAPHICS 2 / A. Chalmers and T.-M. Rhyne (Guest Editors) Volume 2 (2), Number 3 A Unified Subdivision Sheme for Polygonal Modeling Jérôme Maillot Jos Stam Alias Wavefront Alias Wavefront 2 King St.

More information

Orientation of the coordinate system

Orientation of the coordinate system Orientation of the oordinate system Right-handed oordinate system: -axis by a positive, around the -axis. The -axis is mapped to the i.e., antilokwise, rotation of The -axis is mapped to the -axis by a

More information

Module: 2 Finite Element Formulation Techniques Lecture 3: Finite Element Method: Displacement Approach

Module: 2 Finite Element Formulation Techniques Lecture 3: Finite Element Method: Displacement Approach 11 Module: 2 Finite Element Formulation Techniques Lecture 3: Finite Element Method: Displacement Approach 2.3.1 Choice of Displacement Function Displacement function is the beginning point for the structural

More information

Joint Server Selection and Routing for Geo-Replicated Services

Joint Server Selection and Routing for Geo-Replicated Services Joint Server Seletion and Routing for Geo-Repliated Servies Srinivas Narayana, Wenjie Jiang, Jennifer Rexford, Mung Chiang Prineton University Abstrat The performane and osts of geo-repliated online servies

More information

Curves and Surfaces. CS 537 Interactive Computer Graphics Prof. David E. Breen Department of Computer Science

Curves 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 information

Prediction of Workpiece Location Due to Fixture-Induced Error

Prediction of Workpiece Location Due to Fixture-Induced Error Predition of Workpiee Loation Due to Fixture-Indued Error Anand Raghu: Graduate Student Dr. Shreyes Melkote: Faulty Advisor IAB Meeting for PMRC Otober 29 th, 2002 Outline: Projet goal Prior work Model

More information

Finding the Equation of a Straight Line

Finding the Equation of a Straight Line Finding the Equation of a Straight Line You should have, before now, ome aross the equation of a straight line, perhaps at shool. Engineers use this equation to help determine how one quantity is related

More information

p[4] p[3] p[2] p[1] p[0]

p[4] p[3] p[2] p[1] p[0] CMSC 425 : Sring 208 Dave Mount and Roger Eastman Homework Due: Wed, Marh 28, :00m. Submit through ELMS as a df file. It an either be distilled from a tyeset doument or handwritten, sanned, and enhaned

More information

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,

More information

Hard-Potato Routing. Maurice Herlihy y Brown University Providence, Rhode Island packets.

Hard-Potato Routing. Maurice Herlihy y Brown University Providence, Rhode Island packets. Hard-Potato Routing Costas Bush Λ Brown University Providene, Rhode Island b@s.brown.edu Maurie Herlihy y Brown University Providene, Rhode Island herlihy@s.brown.edu Roger Wattenhofer z Brown University

More information

Sequential Incremental-Value Auctions

Sequential Incremental-Value Auctions Sequential Inremental-Value Autions Xiaoming Zheng and Sven Koenig Department of Computer Siene University of Southern California Los Angeles, CA 90089-0781 {xiaominz,skoenig}@us.edu Abstrat We study the

More information

Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse knn

Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse knn Lazy Updates: An Effiient Tehniue to Continuously onitoring Reverse k uhammad Aamir Cheema, Xuemin Lin, Ying Zhang, Wei Wang, Wenjie Zhang The University of ew South Wales, Australia ICTA, Australia {maheema,

More information

Mesh-Based Inverse Kinematics

Mesh-Based Inverse Kinematics CS468, Wed Nov 9 th 2005 Mesh-Based Inverse Kinematics R. W. Sumner, M. Zwicker, C. Gotsman, J. Popović SIGGRAPH 2005 The problem 1 General approach Learn from experience... 2 As-rigid-as-possible shape

More information

Gray Codes for Reflectable Languages

Gray Codes for Reflectable Languages Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings

More information

The LS-STAG Method : A new Immersed Boundary / Level-Set Method for the Computation of Incompressible Viscous Flows in Complex Geometries

The LS-STAG Method : A new Immersed Boundary / Level-Set Method for the Computation of Incompressible Viscous Flows in Complex Geometries The LS-STAG Method : A new Immersed Bondary / Level-Set Method for the Comptation of Incompressible Viscos Flows in Complex Geometries Yoann Cheny & Olivier Botella Nancy Universités LEMTA - UMR 7563 (CNRS-INPL-UHP)

More information

Chapter 18. Geometric Operations

Chapter 18. Geometric Operations Chapter 18 Geometric Operations To this point, the image processing operations have computed the gray value (digital count) of the output image pixel based on the gray values of one or more input pixels;

More information

Triangles. Learning Objectives. Pre-Activity

Triangles. Learning Objectives. Pre-Activity Setion 3.2 Pre-tivity Preparation Triangles Geena needs to make sure that the dek she is building is perfetly square to the brae holding the dek in plae. How an she use geometry to ensure that the boards

More information

Introduction to Seismology Spring 2008

Introduction to Seismology Spring 2008 MIT OpenCourseWare http://ow.mit.edu 1.510 Introdution to Seismology Spring 008 For information about iting these materials or our Terms of Use, visit: http://ow.mit.edu/terms. 1.510 Leture Notes 3.3.007

More information

Lecture 10. Diffraction. incident

Lecture 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 information

Tu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization

Tu 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 information

C 2 C 3 C 1 M S. f e. e f (3,0) (0,1) (2,0) (-1,1) (1,0) (-1,0) (1,-1) (0,-1) (-2,0) (-3,0) (0,-2)

C 2 C 3 C 1 M S. f e. e f (3,0) (0,1) (2,0) (-1,1) (1,0) (-1,0) (1,-1) (0,-1) (-2,0) (-3,0) (0,-2) SPECIAL ISSUE OF IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION: MULTI-ROBOT SSTEMS, 00 Distributed reonfiguration of hexagonal metamorphi robots Jennifer E. Walter, Jennifer L. Welh, and Nany M. Amato Abstrat

More information

1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0.

1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0. C HPTER 1 SETS I. DEFINITION OF SET We begin our study of probability with the disussion of the basi onept of set. We assume that there is a ommon understanding of what is meant by the notion of a olletion

More information

A radiometric analysis of projected sinusoidal illumination for opaque surfaces

A radiometric analysis of projected sinusoidal illumination for opaque surfaces University of Virginia tehnial report CS-21-7 aompanying A Coaxial Optial Sanner for Synhronous Aquisition of 3D Geometry and Surfae Refletane A radiometri analysis of projeted sinusoidal illumination

More information

Image Warping, Linear Algebra CIS581

Image Warping, Linear Algebra CIS581 Image Warping, Linear Algebra CIS581 From Plane to Plane Degree of freedom Translation: # correspondences? How many correspondences needed for translation? How many Degrees of Freedom? What is the transformation

More information

EXODUS II: A Finite Element Data Model

EXODUS II: A Finite Element Data Model SAND92-2137 Unlimited Release Printed November 1995 Distribution Category UC-705 EXODUS II: A Finite Element Data Model Larry A. Shoof, Vitor R. Yarberry Computational Mehanis and Visualization Department

More information

Complex Rational Expressions

Complex Rational Expressions Comple ational Epressions What is a Comple ational Epression? A omple rational epression is similar to a omple fration whih has one or more frations in its numerator, denominator, or both The following

More information

a I _ = 3x 7 = _ C D B f-----t ( 14. AD = 30; AB = 2x + 2 = ;BC = 4x 1 = ; CD Review: Chapter 1 Date: Period:

a I _ = 3x 7 = _ C D B f-----t ( 14. AD = 30; AB = 2x + 2 = ;BC = 4x 1 = ; CD Review: Chapter 1 Date: Period: Geometry Name: -------- Review: Chapter 1 Date: Period: ---- **s always make sure you know all voabulary words overed in this-first unit!** ~ Name the 3 undefined terms in geometry: 1. 2. 3. For problems

More information

1 The Knuth-Morris-Pratt Algorithm

1 The Knuth-Morris-Pratt Algorithm 5-45/65: Design & Analysis of Algorithms September 26, 26 Leture #9: String Mathing last hanged: September 26, 27 There s an entire field dediated to solving problems on strings. The book Algorithms on

More information

CS 559 Computer Graphics Midterm Exam March 22, :30-3:45 pm

CS 559 Computer Graphics Midterm Exam March 22, :30-3:45 pm CS 559 Computer Graphics Midterm Exam March 22, 2010 2:30-3:45 pm This exam is closed book and closed notes. Please write your name and CS login on every page! (we may unstaple the exams for grading) Please

More information

Topic: Orientation, Surfaces, and Euler characteristic

Topic: Orientation, Surfaces, and Euler characteristic Topic: Orientation, Surfaces, and Euler characteristic The material in these notes is motivated by Chapter 2 of Cromwell. A source I used for smooth manifolds is do Carmo s Riemannian Geometry. Ideas of

More information

Basics of Digital Logic Design

Basics of Digital Logic Design ignals, Logic Operations and Gates E 675.2: Introdction to ompter rchitectre asics of igital Logic esign Rather than referring to voltage levels of signals, we shall consider signals that are logically

More information

1.2 Numerical Solutions of Flow Problems

1.2 Numerical Solutions of Flow Problems 1.2 Numerical Solutions of Flow Problems DIFFERENTIAL EQUATIONS OF MOTION FOR A SIMPLIFIED FLOW PROBLEM Continuity equation for incompressible flow: 0 Momentum (Navier-Stokes) equations for a Newtonian

More information

ANNALS of Faculty Engineering Hunedoara International Journal of Engineering

ANNALS of Faculty Engineering Hunedoara International Journal of Engineering ANNALS of Falt Engineering Hnedoara International Jornal of Engineering Tome XIII [15] Fasile 4 [Noember] ISSN: 1584-673 [CD-Rom; online] a free-aess mltidisiplinar pbliation of the Falt of Engineering

More information

A Minimum-Energy Path-Preserving Topology-Control Algorithm

A Minimum-Energy Path-Preserving Topology-Control Algorithm A Minimm-Energy Path-Presering Topology-Control Algorithm Li (Erran Li Joseph Y. Halpern Dept. of Compter Siene Dept. of Compter Siene Cornell Uniersity Cornell Uniersity Ithaa NY 5 Ithaa NY 5 lili@s.ornell.ed

More information

And, the (low-pass) Butterworth filter of order m is given in the frequency domain by

And, the (low-pass) Butterworth filter of order m is given in the frequency domain by Problem Set no.3.a) The ideal low-pass filter is given in the frequeny domain by B ideal ( f ), f f; =, f > f. () And, the (low-pass) Butterworth filter of order m is given in the frequeny domain by B

More information

OPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018

OPTI-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 information

Design of tree-type support structure of free-form shell generated using fractal geometry

Design of tree-type support structure of free-form shell generated using fractal geometry 6 30 September, 06, Too, Japan K. Kawaguhi, M. Ohsai, T. Taeuhi (eds.) Design of tree-tpe support struture of free-form shell generated using fratal geometr Jinglan CUI*, Guanghun ZHOU a, Maoto OHSAKI

More information

An Event Display for ATLAS H8 Pixel Test Beam Data

An Event Display for ATLAS H8 Pixel Test Beam Data An Event Display for ATLAS H8 Pixel Test Beam Data George Gollin Centre de Physique des Partiules de Marseille and University of Illinois April 17, 1999 g-gollin@uiu.edu An event display program is now

More information

Oral and Mental calculation

Oral and Mental calculation Oral and Mental calculation Read and write any integer and know what each digit represents. Read and write decimal notation for tenths, hundredths and thousandths and know what each digit represents. Order

More information

Get Ready. Solving Equations 1. Solve each equation. a) 4x + 3 = 11 b) 8y 5 = 6y + 7

Get Ready. Solving Equations 1. Solve each equation. a) 4x + 3 = 11 b) 8y 5 = 6y + 7 Get Ready BLM... Solving Equations. Solve each equation. a) 4x + = 8y 5 = 6y + 7 c) z+ = z+ 5 d) d = 5 5 4. Write each equation in the form y = mx + b. a) x y + = 0 5x + y 7 = 0 c) x + 6y 8 = 0 d) 5 0

More information

OPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 7 Fall, 2018

OPTI-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 information

Introduction to Computer Graphics. Modeling (3) April 27, 2017 Kenshi Takayama

Introduction to Computer Graphics. Modeling (3) April 27, 2017 Kenshi Takayama Introduction to Computer Graphics Modeling (3) April 27, 2017 Kenshi Takayama Solid modeling 2 Solid models Thin shapes represented by single polygons Unorientable Clear definition of inside & outside

More information

THE VIEWING TRANSFORMATION

THE VIEWING TRANSFORMATION ECS 178 Course Notes THE VIEWING TRANSFORMATION Kenneth I. Joy Institute for Data Analysis and Visualization Department of Computer Science University of California, Davis Overview One of the most important

More information

Rapid, accurate particle tracking by calculation of radial symmetry centers

Rapid, accurate particle tracking by calculation of radial symmetry centers Rapid, aurate partile traing by alulation of radial symmetry enters Raghuveer Parthasarathy Supplementary Text and Figures Supplementary Figures Supplementary Figure 1 Supplementary Figure Supplementary

More information

1. Inversions. A geometric construction relating points O, A and B looks as follows.

1. Inversions. A geometric construction relating points O, A and B looks as follows. 1. Inversions. 1.1. Definitions of inversion. Inversion is a kind of symmetry about a irle. It is defined as follows. he inversion of degree R 2 entered at a point maps a point to the point on the ray

More information

Simultaneous image orientation in GRASS

Simultaneous image orientation in GRASS Simultaneous image orientation in GRASS Alessandro BERGAMINI, Alfonso VITTI, Paolo ATELLI Dipartimento di Ingegneria Civile e Ambientale, Università degli Studi di Trento, via Mesiano 77, 38 Trento, tel.

More information

CS 450: COMPUTER GRAPHICS REVIEW: CLIPPING SPRING 2015 DR. MICHAEL J. REALE

CS 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 information

downloaded from: TCI Library Source: Connections Museum, Seattle, WA

downloaded from: TCI Library Source: Connections Museum, Seattle, WA , BELL SYSTEM PACTCES AT&TCo Standqrd / SECTON sse, Jly 7 ECOE COSSCONNECTONS PANEL OFFCES,. GENEAL CONTENTS _// PAGE. METHO A. Assignment of Code Point Terminals B. Assignment of Code Grop Terminals C.

More information