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
|
|
- Veronica Todd
- 6 years ago
- Views:
Transcription
1 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. This oundary lend is neessary to generalize a funtional ross-oundary onstrution that relies on the natural parameterization of the funtional setting. When interpolating irregularly sattered data and when inreasing the tessellation of the data mesh, the new sheme shows improvement over representative parametri data tting shemes. x1. Introdution A large numer of loal parametri triangular surfae shemes have een developed over the past fteen years (see [10] for a survey of suh shemes). These shemes are loal in that hanges to part of the data only aet portions of the surfae near the hanged data. Surprisingly, all of these shemes exhiit similar shape defets. On loser inspetion, it is seen that these shemes all have a large numer of free parameters that are set using simple heuristis. By manually adjusting these parameters, one an improve the shape of the surfaes [7]. One way to improve automatially the shape of the onstruted surfaes is to use variational methods. Several authors have used suh shemes to improve the shape of the onstruted surfaes, ut usually at a high omputational ost due to the gloal nature of the solution (e.g., [11]). Similarly, we an use loal optimization methods to set the free parameters and improve the shape, although the results are not as good as the gloal methods [8]. In this paper, we will investigate a loal, non-optimization method for improving the onstrution of the ross-oundary derivatives in a triangular parametri sheme. This is a generalization of the hyrid sattered data tting sheme of Foley and Opitz [2] (their method is similar to a result independently developed y Goodman and Said [4]). The resulting surfaes show large improvement in shape over other loal, parametri, triangular surfae tting tehniques. More preisely, given a triangle of data (a set of three verties with normals), our sheme onstruts a hyrid, parametri path that Mathematial Methods for Curves and Surfaes II 1 Morten Dhlen, Tom Lyhe, Larry L. Shumaker (eds.), pp. 1{3. Copyright o 1998 y Vanderilt University Press, Nashville, TN. ISBN 1-xxxxx-xxx-x. All rights of reprodution in any form reserved.
2 2 S. Mann and M. Davidhuk p q Fig. 1. Domain ontrol net for the Foley-Opitz hyrid Bezier path. interpolates the positions and normals at the orners. When used to ll a triangular polyhedron, the resulting surfae pathes will meet with tangent plane ontinuity. x2. The Foley-Opitz Sheme Foley and Opitz [2] present a method for interpolation of sattered data aove the plane using a \hyrid" ui Bezier path ased on Nielson's sheme [12]. A hyrid ui path is similar to a ui Bezier path, exept the interior ontrol point is a rational lend of three points. With the Foley-Opitz method, the ui path oundaries are ompletely determined y the triangle verties and normals. The three inner ontrol points are onstruted using a C 1 ross oundary onstrution that gives the hyrid path ui preision. Figure 1 shows the domain ontrol net for two neighoring triangles. p2 is one of the three interior ontrol points assoiated with the left triangle and q2 is one of the three interior ontrol points assoiated with the right triangle. Foley and Opitz ompute p2 as follows. Let r, s, and t e the aryentri oordinates of 003 with respet to 003, 030, and 003. If oth pathes if Figure 1 form a single ui, then from sudividing Bezier uis it an e shown that p r 2 ( ) 2rs( ) 2rt201 2st021 s 2 ( ) t 2 ( ) (2(r + s)t) The point q2 is fored y ontinuity onditions to e q2 rp2 + s120 + t : When applied to data that does not ome from a ui, the Foley-Opitz onstrution of p2 and q2 ensures that the two triangles have a C 1 join along their ommon order. Idential alulations would e made to ensure C 1 ontinuity aross the remaining two edges giving three settings for the interior ontrol points of eah of the two pathes. :
3 Parametri Hyrid Triangular Path { DRAFT 3 Fig. 2. Isophotes of interpolants to the Franke data set. Fig. 3. One plane per path pair. The three interior points (p0 p0, p1, p2) are lended with Nielson's rational lend funtions, giving a i (t0; t1; t2) t j t k t i t j + t i t k + t j t k ; i 6 j 6 k: (1) 111(t0; t1; t2) a0(t0; t1; t2)p0 + a1(t0; t1; t2)p1 + a2(t0; t1; t2)p2 After lending, we are left with a 10 point ui Bezier path, whih is evaluated at (t0; t1; t2) in the standard way. Figure 2 shows isophote plots [5] of the Franke data set [3] (on the left), and isophote plots of this data interpolated with Clough-Toher (middle) and Foley-Opitz (right) pathes. The C 1 disontinuities in the isophote lines our along path oundaries, and are visile as shape artifats in shaded images [9]. The Foley-Opitz interpolant is generally smoother than the Clough-Toher interpolant. x3. A Hyrid, Parametri, Cui Sheme Our goal is to reate a parametri version of the Foley-Opitz sheme to ring its good surfae quality to the parametri setting. There are two prolems we must solve to reate this parametri version of the Foley-Opitz method: Finding loal parameterizations for the Foley-Opitz ross-oundary method, and nding lend funtions for the resulting points that have the appropriate properties. The Foley-Opitz ross-oundary onstrution relies on a natural parameterization etween path pairs sine the aryentri oordinates of neighoring pathes with respet to eah other are key in determining the tangent plane elds. In the parametri setting, there is no predened assoiation etween path domains. Therefore, some assoiation etween neighoring path domains must e made in order to use Foley's tangent plane eld onstrution. p2:
4 4 S. Mann and M. Davidhuk V ,2 201,1 210,1 201,2 120,2 111,2 111,1 102,1 111,0 120,0 102,0 V ,2 012,1 021,0 012,0 003 V 2 Fig. 4. Domain ontrol net for parametri hyrid path. 120,0 111,0 102,0 V ,0 003 V 2 012,0 Fig. 5. Tangent plane eld ontrol points along the edge. Our approah is to hoose a plane for eah path pair (Figure 3), projet the orner points of oth pathes onto the plane, and then perform Foley's C 1 onstrution. Three sets of ontrol points are alulated for eah hyrid path { eah set representing a C 1 onstrution along one triangle edge. The three sets of ontrol points will share the same triangle orner verties ut in general dier in the rest of the oundary and interior ontrol points. We must lend oth oundary and interior ontrol points to produe the nal interpolant. Figure 4 shows the domain ontrol net for a parametri version of Foley's sheme. The struture is similar to Foley's { the ontrol points are organized like the ontrol points of a ui triangular Bezier path exept a group of ontrol points orrespond to a single, regular ui ontrol point. When onstruting the tangent plane eld along a partiular oundary, only two parametri hyrid pathes are involved and onsequently only two Bezier pathes are needed for the onstrution. Eah Bezier path ontriutes seven ontrol points to a parametri hyrid path, as in Figure 5. These ontrol points determine the tangent plane eld along that oundary. To onstrut the seven points, a plane is hosen as a parameterization for the two Bezier pathes allowing the onstrution as in Foley's funtional sheme. One the plane is hosen, the Bezier path ontrol points are ompletely determined y the triangle verties and the assoiated normals { Hermite interpolation over a plane ompletely determines the ui oundary urves and Foley's
5 Parametri Hyrid Triangular Path { DRAFT 5 V V V Fig. 6. Control net after lending parametri hyrid ontrol points. ross oundary onstrution determines the interior ontrol points. After the ontrol points from three Bezier pathes are alulated, they an e used to formulate the parametri hyrid path. However, lending is not as straight forward as in the funtional ase { oundary points are inluded in the lend. Figure 6 illustrates the ontrol net for the parametri path. Eah point ijk is a rational lend of the assoiated ontrol points from the three Bezier pathes shown in Figure 4. The points 300; 030, and 003 are onstants, the remaining oundary ontrol points are rational lends of two Bezier path oundary ontrol points, and the interior point 111 is a lend of three points. The lend formulation must preserve the important properties of the three underlying Bezier pathes, oundary urves and ross oundary derivatives, when evaluating along the edges. The orner ontrol points are onstants so no lending funtion is needed. The lending funtion for the interior ontrol points is the same as used in Foley's funtional onstrution, giving us 111 a0111;0 + a1111;1 + a2111;2 where the a i are dened in (1). The oundary ontrol points are lended to give two properties: 1) When evaluated along a oundary the parametri Foley ontrol points eome the ontrol points of one of the three Bezier pathes 2) The tangent plane eld of the parametri hyrid path along a oundary mathes the tangent plane eld along the same oundary of one of the three Bezier pathes. An asymmetri lend of the following form has oth of these properties h ij (u0; u1; u2) (1 u i )u j 2 (1 u i )u j 2 + (1 uj )u i 2 (2) This lending funtion is used to weight all the non-vertex oundary Bezier ontrol points: ijk;i ijk (u0; u1; u2) h ij (u0; u1; u2) ijk;i ijk;j ijk;i + h ji ijk;k ijk;j ;
6 6 S. Mann and M. Davidhuk for ijk eing any permutation of 012. For example, the V1V2 oundary ontrol points would e 012(u0; u1; u2) h01(u0; u1; u2)012;0 + h10(u0; u1; u2)012;1 021(u0; u1; u2) h02(u0; u1; u2)021;0 + h20(u0; u1; u2)021;2 When evaluated along the V1V2 edge u0 0 we get 012(0; u1; u2) 012;0; 021(0; u1; u2) 021;0 sine Equation (2) gives h0j(0; u1; u2) 1 and h i0(0; u1; u2) 0. The V1V2 oundary urve is the ui Bezier urve given y the ontrol points 030, 021;0, 012;0, and 003, whih gives us C 0 ontinuity. This lend also gives us C 1 ontinuity, as desried in Davidhuk's thesis [1]. The ontrol points f ; 030; 003; ~i;j g are lended to form the ten ontrol points of a standard ui Bezier path, laeled as ~i. The Bezier path dened y the ~i is then evaluated X at u. The onise denition is F B 3 ~ ~i i j ij3 ~ x4. Choie of plane There is freedom in the hoie of the projetion plane, and there are some restritions. The orientation, not the position, of the plane determines the positions of the ontrol points thus giving two rotational degrees of freedom. The plane should e onstruted geometrially from the given information { triangle verties and normals. The two Bezier pathes must not have overlapping domains on the plane so the orientation is restrited to eing \underneath" oth pathes. One failsafe method of hoosing a plane is to take the plane perpendiular to the iseting plane of the two neighoring triangles and that ontains their ommon edge. With this hoie of plane, the projetion of the triangles will lie on opposite sides of the projetion of their ommon edge, so the path domains will never overlap. However, a etter hoie is the plane perpendiular to the average of the normals at the two data points, and either date point. Although this onstrution is not guaranteed to give us a valid plane (i.e., the two projetion of the two triangles along the edge may overlap), it does in general give us etter shaped surfaes [1].
7 Parametri Hyrid Triangular Path { DRAFT 7 Fig. 7. Triangular Gregory pathes and our sheme t to a torus. Fig. 8. Triangular Gregory pathes and our sheme t to a at data set. xresults To test our surfae onstrution method, we used it to t pathes to a at data set (where normals are estimated) and to samplings of a torus (where normals ome from the torus). We ompared our method to Triangular Gregory pathes [6]. In Figure 7, we see isophote plots of oth methods t to a 10x10 sampling of the torus. The isophotes for our method are notiealy smoother. In Figure 8, we see shaded images of oth methods t to a at data set. This data set has 366 verties and 698 faes. Normals to the verties were estimated y a simple averaging of fae normals. Many of the shape artifats that appear on triangular Gregory pathes our not present on the surfae onstruted y our sheme. One drawak to our sheme is that as the tangent planes on either side of an edge eome perpendiular to the edge, the interior points of the oundary urve move towards innity. Thus, normal estimation eomes a ritial step.
8 8 S. Mann and M. Davidhuk Aknowledgments. This researh was funded y the Natural Sienes and Engineering Researh Counil of Canada Referenes 1. Davidhuk, M., A Parametri Tyrid trianglar Bezier Path, dissertation, Master's, University of Waterloo (Waterloo ON), Foley, T. A. and K. Opitz, Hyrid Cui Bezier Triangle Pathes, in Mathematial Methods in Computer Aided Geometri Design II, T. Lyhe and L. Shumaker (eds), Aademi Press, New York, 1992, 275{ Franke, R., A ritial omparison of some methods for interpolation of sattered data, Report NPS , Naval Postgraduate Shool, Goodman, T. N. T. and H. B. Said, A C 1 triangular interpolant suitale for sattered data interpolation, Commun. Appl. Numer. Methods 7 (1991), 479{ Hagen, H., S. Hahmann, T. Shreier, Y. Nakajima, B. Wordenweer, and P. Hollemann-Grundetedt, Surfae interrogation algorithms, Comp. Graphis and Applis. 12 (1992), 53{ Longhi, L., Interpolating pathes etween ui oundaries, Tehnial Report T.R. UCB/CSD 87/313, University of California, Berkeley, Mann, S., Surfae Approximation Using Geometri Hermite Pathes, dissertation, Dotoral, University of Washington (Seattle, WA), Mann, S., Using loal optimization in surfae tting, in Mathematial Methods for Curves and Surfaes, Morten Dhlen, Tom Lyhe, Larry L. Shumaker (eds), Vanderilt University Press, Nashville & London, 1995, 323{ Mann, S., Cui preision Clough-Toher interpolation, sumitted for puliation. 10. Mann, S., C. Loop, M. Lounsery, D. Meyers, J. Painter, T. DeRose, and K. Sloan, A survey of parametri sattered data tting using triangular interpolants, in Curve and Surfae Design, H. Hagen (ed), SIAM Puliations, SIAM, Philadelphia PA, 1992, 145{ Moreton, H. P. and C. H. Sequin, Funtional Optimization for Fair Surfae Design, Computer Graphis (ACM SIGGRAPH) 26 (1992), 167{ Nielson, G. M., A transnite, visually ontinuous, triangular interpolant, in Geometri Modeling: Algorithms and New Trends, G. E. Farin (ed), SIAM Puliations, Philadelphia, 1987, 235{245. Stephen Mann and Matthew Davidhuk Computer Siene Department University of Waterloo, Waterloo, ON, N2L 2R7, CANADA smann@gl.uwaterloo.a, mdavidh@gl.uwaterloo.a
On Optimal Total Cost and Optimal Order Quantity for Fuzzy Inventory Model without Shortage
International Journal of Fuzzy Mathemat and Systems. ISSN 48-9940 Volume 4, Numer (014, pp. 193-01 Researh India Puliations http://www.ripuliation.om On Optimal Total Cost and Optimal Order Quantity for
More informationCleanUp: Improving Quadrilateral Finite Element Meshes
CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)
More informationDirected 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 informationDrawing 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 informationarxiv: 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 informationExtracting Partition Statistics from Semistructured Data
Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk
More informationA 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 informationCover Page. Title: Surface Approximation Using Geometric Hermite Patches Abstract:
Cover Page Title: Surface Approximation Using Geometric Hermite Patches Abstract: A high-order-of-approximation surface patch is used to construct continuous, approximating surfaces. This patch, together
More information1. 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 informationA {k, n}-secret Sharing Scheme for Color Images
A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University
More informationSmooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints
Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of
More informationPath Sharing and Predicate Evaluation for High-Performance XML Filtering*
Path Sharing and Prediate Evaluation for High-Performane XML Filtering Yanlei Diao, Mihael J. Franklin, Hao Zhang, Peter Fisher EECS, University of California, Berkeley {diaoyl, franklin, nhz, fisherp}@s.erkeley.edu
More informationPipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More informationGray 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 informationExploring the Commonality in Feature Modeling Notations
Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om
More informationFinding 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 information3D 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 informationColouring 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 informationSequential 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 informationAbstract A method for the extrusion of arbitrary polygon meshes is introduced. This method can be applied to model a large class of complex 3-D
Abstrat A method for the extrusion of arbitrary polygon meshes is introdued. This method an be applied to model a large lass of omplex 3-D losed surfaes. It onsists of defining a (typially small) set of
More informationStructural Topology Optimization Based on the Smoothed Finite Element Method
378 Strutural Topology Optimization Based on the Smoothed Finite Element Method Astrat In this paper, the smoothed finite element method, inorporated with the level set method, is employed to arry out
More informationConstructing Hierarchies for Triangle Meshes
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS VOL. 4 NO. APRIL-JUNE 1998 145 Construting Hierarhies for Triangle Meshes Tran S. Gieng Bernd Hamann Member IEEE Kenneth I. Joy Member IEEE Gregory
More informationSolutions to Tutorial 2 (Week 9)
The University of Syney Shool of Mathematis an Statistis Solutions to Tutorial (Week 9) MATH09/99: Disrete Mathematis an Graph Theory Semester, 0. Determine whether eah of the following sequenes is the
More informationSupplementary 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 information1-D and 2-D Elements. 1-D and 2-D Elements
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
More informationHIGHER ORDER full-wave three-dimensional (3-D) large-domain techniques in
FACTA UNIVERSITATIS (NIŠ) SER.: ELEC. ENERG. vol. 21, no. 2, August 2008, 209-220 Comparison of Higher Order FEM and MoM/SIE Approahes in Analyses of Closed- and Open-Region Eletromagneti Problems Milan
More informationlinearize discretize Galerkin optimize sample
Fairing by Finite Dierence Methods Leif Kobbelt Abstract. We propose an ecient and exible scheme to fairly interpolate or approximate the vertices of a given triangular mesh. Instead of generating a piecewise
More informationCalculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem
Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion
More informationMachine Vision. Laboratory Exercise Name: Student ID: S
Mahine Vision 521466S Laoratory Eerise 2011 Name: Student D: General nformation To pass these laoratory works, you should answer all questions (Q.y) with an understandale handwriting either in English
More informationSimultaneous 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 informationIncremental Mining of Partial Periodic Patterns in Time-series Databases
CERIAS Teh Report 2000-03 Inremental Mining of Partial Periodi Patterns in Time-series Dataases Mohamed G. Elfeky Center for Eduation and Researh in Information Assurane and Seurity Purdue University,
More informationSurface pasting is a hierarchical modeling technique that. places feature surface atop base surface with approximate continuity.
Better Pasting via Quasi-Interpolation Blair Conrad and Stephen Mann Abstract Surface pasting is a hierarchical modeling technique that places feature surface atop base surface with approximate continuity
More informationTo Do. Assignment Overview. Outline. Mesh Viewer (3.1) Mesh Connectivity (3.2) Advanced Computer Graphics (Spring 2013)
daned Computer Graphis (Spring 23) CS 283, Leture 5: Mesh Simplifiation Rai Ramamoorthi http://inst.ees.berkeley.edu/~s283/sp3 To Do ssignment, Due Feb 22 Start reading and working on it now. This leture
More informationTriangle LMN and triangle OPN are similar triangles. Find the angle measurements for x, y, and z.
1 Use measurements of the two triangles elow to find x and y. Are the triangles similar or ongruent? Explain. 1a Triangle LMN and triangle OPN are similar triangles. Find the angle measurements for x,
More informationOutline. CS38 Introduction to Algorithms. Administrative Stuff. Administrative Stuff. Motivation/Overview. Administrative Stuff
Outline CS38 Introdution to Algorithms Leture 1 April 1, 2014 administrative stuff motivation and overview of the ourse stale mathings example graphs, representing graphs graph traversals (BFS, DFS) onnetivity,
More informationOutline: Software Design
Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling
More informationPrecise Hausdorff Distance Computation between Polygonal Meshes
Preise Hausdorff Distane Computation between Polygonal Meshes Mihael Bartoň a, Iddo Hanniel a,b, Gershon Elber a, Myung-Soo Kim a Tehnion Israel Institute of Tehnology, Haifa 32000, Israel b SolidWorks
More informationNaïve Bayesian Rough Sets Under Fuzziness
IJMSA: Vol. 6, No. 1-2, January-June 2012, pp. 19 25 Serials Publiations ISSN: 0973-6786 Naïve ayesian Rough Sets Under Fuzziness G. GANSAN 1,. KRISHNAVNI 2 T. HYMAVATHI 3 1,2,3 Department of Mathematis,
More informationChapter 2: Introduction to Maple V
Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard
More informationNONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman
NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of
More informationFigure 1. LBP in the field of texture analysis operators.
L MEHODOLOGY he loal inary pattern (L) texture analysis operator is defined as a gray-sale invariant texture measure, derived from a general definition of texture in a loal neighorhood. he urrent form
More informationAn 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 informationIntroduction 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 information1 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 informationON CHARACTERIZING TERRAIN VISIBILITY GRAPHS
ON CHARACTERIZING TERRAIN VISIBILITY GRAPHS William Evans, and Noushin Saeedi Astrat. A terrain is an x-monotone polygonal line in the xy-plane. Two verties of a terrain are mutually visile if and only
More informationEnd mills are widely used in industry for high-speed machining. End milling cutters are C H A P T E R 2
C H A P T E R End Mill End mills are widely used in industry for high-speed mahining. End milling utters are multi-point milling utters with utting edges both on the fae end as well as on the periphery,
More information特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing
デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper
More informationThe Happy Ending Problem
The Happy Ending Problem Neeldhara Misra STATUTORY WARNING This doument is a draft version 1 Introdution The Happy Ending problem first manifested itself on a typial wintery evening in 1933 These evenings
More informationAlgorithms, Mechanisms and Procedures for the Computer-aided Project Generation System
Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department
More informationMultiple-Criteria Decision Analysis: A Novel Rank Aggregation Method
3537 Multiple-Criteria Deision Analysis: A Novel Rank Aggregation Method Derya Yiltas-Kaplan Department of Computer Engineering, Istanbul University, 34320, Avilar, Istanbul, Turkey Email: dyiltas@ istanbul.edu.tr
More informationGraph-Based vs Depth-Based Data Representation for Multiview Images
Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:
More informationProjections. 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 informationTriangles. 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 informationLAMC Junior Circle April 15, Constructing Triangles.
LAMC Junior Cirle April 15, 2012 Olga Radko radko@math.ula.edu Oleg Gleizer oleg1140@gmail.om Construting Triangles. Copyright: for home use only. This handout is a part of the book in preparation. Using
More informationPARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING. Yesheng Gao, Kaizhi Wang, Xingzhao Liu
20th European Signal Proessing Conferene EUSIPCO 2012) Buharest, Romania, August 27-31, 2012 PARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING Yesheng Gao, Kaizhi Wang,
More informationParticle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating
Original Artile Partile Swarm Optimization for the Design of High Diffration Effiient Holographi Grating A.K. Tripathy 1, S.K. Das, M. Sundaray 3 and S.K. Tripathy* 4 1, Department of Computer Siene, Berhampur
More informationThis fact makes it difficult to evaluate the cost function to be minimized
RSOURC LLOCTION N SSINMNT In the resoure alloation step the amount of resoures required to exeute the different types of proesses is determined. We will refer to the time interval during whih a proess
More informationCluster-Based Cumulative Ensembles
Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,
More informationA Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks
A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr
More informationOn - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2
On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,
More informationOrientation 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 informationMATH STUDENT BOOK. 12th Grade Unit 6
MATH STUDENT BOOK 12th Grade Unit 6 Unit 6 TRIGONOMETRIC APPLICATIONS MATH 1206 TRIGONOMETRIC APPLICATIONS INTRODUCTION 3 1. TRIGONOMETRY OF OBLIQUE TRIANGLES 5 LAW OF SINES 5 AMBIGUITY AND AREA OF A TRIANGLE
More informationDetection and Recognition of Non-Occluded Objects using Signature Map
6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,
More informationOn-the-Fly Adaptive Subdivision Terrain
On-the-Fly Adaptive Subdivision Terrain Dir Rose, Martin Kada, Thomas Ertl University of Stuttgart, Institute of Computer Siene Visualization and Interative Systems Group Breitwiesenstraße 20-22, 70565
More informationAlgebra Lab Investigating Trigonometri Ratios You an use paper triangles to investigate the ratios of the lengths of sides of right triangles. Virginia SOL Preparation for G.8 The student will solve realworld
More informationAnalysis 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 informationAbstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.
Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,
More informationFuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis
Journal of Computer Siene 4 (): 9-97, 008 ISSN 549-3636 008 Siene Publiations Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis Deepti Gaur, Aditya Shastri and Ranjit Biswas Department of Computer
More informationReal-time, Accurate Depth of Field using Anisotropic Diffusion and Programmable Graphics Cards
Real-time, Aurate Depth of Field using Anisotropi Diffusion and Programmale Graphis Cards Marelo Bertalmío and Pere Fort Departament de Tenologia Universitat Pompeu Fara Daniel Sánhez-Crespo Universitat
More informationA DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR
Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and
More informationPlot-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 informationMulti-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality
INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of
More informationEfficient and scalable trie-based algorithms for computing set containment relations
Effiient and salale trie-ased algorithms for omputing set ontainment relations Yongming Luo #1, George H. L. Flether #2, Jan Hidders 3, Paul De Bra #4 # Eindhoven University of Tehnology, The Netherlands
More informationA Support-Based Algorithm for the Bi-Objective Pareto Constraint
A Support-Based Algorithm for the Bi-Ojetive Pareto Constraint Renaud Hartert and Pierre Shaus UCLouvain, ICTEAM, Plae Sainte Bare 2, 1348 Louvain-la-Neuve, Belgium {renaud.hartert, pierre.shaus,}@ulouvain.e
More informationA Support-Based Algorithm for the Bi-Objective Pareto Constraint
Proeedings of the Twenty-Eighth AAAI Conferene on Artifiial Intelligene A Support-Based Algorithm for the Bi-Ojetive Pareto Constraint Renaud Hartert and Pierre Shaus UCLouvain, ICTEAM, Plae Sainte Bare
More informationCOMBINATION OF INTERSECTION- AND SWEPT-BASED METHODS FOR SINGLE-MATERIAL REMAP
Combination of intersetion- and swept-based methods for single-material remap 11th World Congress on Computational Mehanis WCCM XI) 5th European Conferene on Computational Mehanis ECCM V) 6th European
More informationBoundary Correct Real-Time Soft Shadows
Boundary Corret Real-Time Soft Shadows Bjarke Jakobsen Niels J. Christensen Bent D. Larsen Kim S. Petersen Informatis and Mathematial Modelling Tehnial University of Denmark {bj, nj, bdl}@imm.dtu.dk, kim@deadline.dk
More informationDetection of RF interference to GPS using day-to-day C/No differences
1 International Symposium on GPS/GSS Otober 6-8, 1. Detetion of RF interferene to GPS using day-to-day /o differenes Ryan J. R. Thompson 1#, Jinghui Wu #, Asghar Tabatabaei Balaei 3^, and Andrew G. Dempster
More informationVibration of buildings on pile groups due to railway traffic finiteelement boundary-element, approximating and prediction methods
ie 010 Nottingham University Press Proeedings of the International Conferene on Computing in Civil and Building Engineering W Tizani (Editor) Viration of uildings on pile groups due to railway traffi finiteelement
More informationAdaptive Implicit Surface Polygonization using Marching Triangles
Volume 20 (2001), Number 2 pp. 67 80 Adaptive Impliit Surfae Polygonization using Marhing Triangles Samir Akkouhe Eri Galin L.I.G.I.M L.I.G.I.M Eole Centrale de Lyon Université Claude Bernard Lyon 1 B.P.
More informationGrade 6 Math Circles Fall 2010 Tessellations I
1 University of Waterloo Faculty of Mathematics entre for Education in Mathematics and omputing Grade 6 Math ircles Fall 2010 Tessellations I tessellation is a collection of shapes that fit together with
More informationFairing Bicubic B-Spline Surfaces using Simulated Annealing
Fairing Bicubic B-Spline Surfaces using Simulated Annealing Stefanie Hahmann and Stefan Konz Abstract. In this paper we present an automatic fairing algorithm for bicubic B-spline surfaces. The fairing
More informationA Novel Validity Index for Determination of the Optimal Number of Clusters
IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers
More informationRotation 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 informationParametric Abstract Domains for Shape Analysis
Parametri Abstrat Domains for Shape Analysis Xavier RIVAL (INRIA & Éole Normale Supérieure) Joint work with Bor-Yuh Evan CHANG (University of Maryland U University of Colorado) and George NECULA (University
More informationMeasurement of the stereoscopic rangefinder beam angular velocity using the digital image processing method
Measurement of the stereosopi rangefinder beam angular veloity using the digital image proessing method ROMAN VÍTEK Department of weapons and ammunition University of defense Kouniova 65, 62 Brno CZECH
More informationA Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks
International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali
More information13.1 Numerical Evaluation of Integrals Over One Dimension
13.1 Numerial Evaluation of Integrals Over One Dimension A. Purpose This olletion of subprograms estimates the value of the integral b a f(x) dx where the integrand f(x) and the limits a and b are supplied
More informationTest Case Generation from UML State Machines
Test Case Generation from UML State Mahines Dirk Seifert Loria Université Nany 2 Campus Sientifique, BP 239 F-54506 Vandoeuvre lès Nany edex Dirk.Seifert@Loria.fr inria-00268864, version 2-23 Apr 2008
More informationAutomatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)
Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University
More informationCell Projection of Convex Polyhedra
Volume Graphis (2003) I. Fujishiro, K. Mueller, A. Kaufman (Editors) Cell Projetion of Convex Polyhedra Stefan Roettger and Thomas Ertl Visualization and Interative Systems Group University of Stuttgart
More informationA Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering
A Novel Bit Level Time Series Representation with Impliation of Similarity Searh and lustering hotirat Ratanamahatana, Eamonn Keogh, Anthony J. Bagnall 2, and Stefano Lonardi Dept. of omputer Siene & Engineering,
More information1 Disjoint-set data structure.
CS 124 Setion #4 Union-Fin, Greey Algorithms 2/20/17 1 Disjoint-set ata struture. 1.1 Operations Disjoint-set ata struture enale us to effiiently perform operations suh as plaing elements into sets, querying
More informationCracked Hole Finite Element Modeling
Craked Hole Finite Element Modeling (E-20-F72) Researh Report Submitted to: Lokheed Martin, Program Manager: Dr. Stephen P. Engelstad Prinipal Investigator: Dr. Rami M. Haj-Ali Shool of Civil and Environmental
More informationThe SPS Algorithm: Patching Figural Continuity and Transparency by Split-Patch Search
The SPS Algorithm: Pathing Figural Continuity and Transpareny y Split-Path Searh Astrat A. Criminisi and A. Blake Mirosoft Researh Ltd., 7 J J Thomson Ave, Camridge, CB3 0FB, UK antrim@mirosoft.om This
More informationarxiv: 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 informationHEXA: Compact Data Structures for Faster Packet Processing
Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for
More informationAn Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index
IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive
More informationGrade 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 informationImage Inpainting An Inclusive Review of the Underlying Algorithm and Comparative Study of the Associated Techniques
Image Inpainting An Inlusive Review of the Underlying Algorithm and Comparative Study of the Assoiated Tehniques Mahroosh Banday Post Graduate Sholar Department of Eletronis and Communiation, DIT Dehradun
More information