Local and Global Accessibility Evaluation with Tool Geometry

Size: px
Start display at page:

Download "Local and Global Accessibility Evaluation with Tool Geometry"

Transcription

1 19 Local and Global Accessblty Evaluaton wth Tool Geometry Jnnan Wang 1, Chell A. Roberts 2 and Scott Danelson 3 1 Arzona State Unversty, wangn@asu.edu 2 Arzona State Unversty, chell.roberts@asu.edu 2 Arzona State Unversty, scott.danelson@asu.edu ABSTRACT Accessblty analyss s an mportant step for the automatc generaton of machnng plannng. One am of accessblty analyss s to fnd a doman n whch the tool can maneuver wthout colldng wth the workpece. Most approaches to accessblty analyss use rays or half-lne proectons that do not nclude tool geometry consderatons. In ths paper we present an approach for the global accessblty analyss that ncludes tool geometry. The paper demonstrates how local accessblty analyss forms an upper bound for the tool radus selecton and how a global accessblty approach determnes pont and part accessblty. The results n ths paper are lmted to ball-endmll tool geometry. The paper also only consders tool workpece nterference and collsons and does not consder tool holder geometry. Experments on sample parts are shown to valdate the approach. Keywords: accessblty evaluaton, manufacturng plannng, tool geometry 1. INTRODUCTION Automated machnng plannng ncludes machne selecton, tool selecton, part orentaton, fxture plannng, toolpath plannng, and parameter selecton operatons towards optmzng obectves, such as cost, tme and/or qualty [4]. Much of the automated manufacturng plannng research for machnng processes s based on manufacturng features (MFs). Over the last decade, the concept of MFs has emerged as a powerful and wdely adopted representaton to assst n the converson of desgn nformaton nto machnng nstructons. MFs have proved to be convenent because they characterze the capabltes of machnng processes such as 3-axs mllng and turnng farly well. However, the feature-based approach s not wthout ts dsadvantages [1]. Frst, any feature-based system s lmted by the extent of ts vocabulary. Secondly, MFs are not drectly avalable from CAD representatons. They must be extracted by a process referred to as feature extracton or they must be desgned nto the model. Whle there has been sgnfcant progress wth feature-based approaches, there stll reman problems to fully automated manufacturng plannng due to recognton of nteractng features and complex features wthn sculptured surfaces. Decades of machnng plannng research has resulted n some lmted successes of algorthmc plannng, but has faled to produce a complete and consstent approach. Ths s due, n large part, to the complexty of analyzng a computer product model relatve to a specfc manufacturng process and a specfc tool. Common problems nclude matng the geometry of a tool wth the geometry of the product model, determnng the set of possble tool orentatons for the model geometry and tolerances, and fttng nspecton data to the model geometry and tolerances. Key to the soluton of these problems s the avalablty of mathematcal models for tool/part accessblty. Both the feature-based approach and the prmtve-based approach need to solve the problem of tool/part accessblty. One am of accessblty analyss s to fnd a doman n whch the tool can maneuver wthout colldng wth the workpece [6]. There are two approaches to analyzng the accessblty of a workpece: (a) entre feature accessblty, where the accessblty of the whole workpece s evaluated, and (b) pont accessblty, where the drectons along whch the tool can reach a specfc pont are examned. The entre feature accessblty doman can be derved from the pont accessblty domans. The accessblty domans are ndependent of the part orentaton, and optmal part orentatons are determned after analyzng the accessblty domans of cuttng locaton (CL) ponts. Pont p s accessble to a tool n NC machnng f the tool does not penetrate the part when ts cuttng pont s placed at p [5]. Fxturng devces and other obstacles are not consdered n ths paper.

2 20 In collson-free machnng, both local and global gougng effects should be avoded. Local gougng means that n all arbtrary small neghborhoods of the current touchng pont, the mllng tool cuts nto the fnal surface of the workpece, thereby destroyng t. More complcated are global collsons occurrng at some dstance from the touchng pont [7]. Local accessblty means the tool s cuttng wthout local gougng; so does global accessblty. Fg. 1 demonstrates the dstncton between local and global accessblty. To perform automated machnng plannng, the accessblty nformaton wth tool geometry of the part should be evaluated. Ths can then be used for machne selecton, tool selecton, part orentaton, fxture plannng, tool path plannng and parameter selecton operatons. tool a. Global Accessblty Cone b. Fg.1: a. Global accessblty: tool relatve to entre part, and, b. Local accessblty: tool relatve to part surface. In ths paper, we present an approach for the global accessblty analyss wth tool geometry. In secton 2, we show how local accessblty analyss forms an upper bound for the tool radus selecton. Secton 3 presents an approach to analyze global accessblty wth tool geometry. Secton 4 presents the experments performed on the sample parts to verfy and valdate the approaches. Fnally, n secton 5, we draw our conclusons. 2. LOCAL ACCESSIBILITY ANALYSIS To fnd a feasble tool radus for a gven surface, both local and global accessblty are analyzed. In ths secton we consder the tool radus constrcted by the local accessblty sets an upper bound of the mnmum sze tool (whch means that ths tool can cut entre part). In the next secton, local accessblty s used as an ntal mnmum sze tool for global accessblty analyss. In mult-axs (4-axs and 5-axs) NC machnng, usng dfferent types of endmlls (e.g., flat-endmlls or torus-endmlls) for sculptured surface machnng s generally far more effcent than usng tradtonal sphercal endmlls on 3-axs machnes. Ths s due manly to the number of paths needed to obtan small cusps and to the cuttng neffcency of a sphercal endmll, whch has a low speed cuttng zone at ts bottom [3]. But n ths work, we only consder sphercal endmlls for sculptured machnng to smplfy the problem. The local accessblty of a pont on a free form surface for a sphercal endmll s equvalent to the maxmum curvature of that pont. We wll use both NURBS models and trangular mesh models to demonstrate our approach. We tessellate NURBS models by parttonng them nto small facets. Each facet s a trangular patch that s small enough to approxmate the curved surface by a plane trangle wthn a prescrbed tolerance. We set the centrods of the trangular facets as access ponts (the pont we wll consder for accessblty). The local accessblty of the entre feature can be derved from the local accessblty of these access ponts. On the NURBS model, the two prncple curvatures of the pont can be found by ts surface parameters. The maxmum prncple curvature s the maxmum curvature at the pont. On the trangular mesh model, an approxmated quadratc surface of a trangular facet s created from a group of neghborhood ponts. The maxmum curvature s then found by calculatng the prncple curvatures at the centrod accordng to the approxmated quadratc surface. The maxmum curvature of the feature s derved from the maxmum curvature of the maxmum curvatures of the access ponts. The upper bound of the tool radus s the recprocal of the maxmum curvature. A free form surface usually has some hgh curvature regons. In Fg. 2 the male face NURBS model and the female face trangular mesh model s shown. Each patch can also be coded wth dfferent rad to analyze the local accessblty. Ths provdes a way to fnd all the regons of the surface that can be cut out by a gven tool. The upper bound of the mnmum tool radus for the hghest curvature regons s also calculated. Fgure 2 also shows four sphercal endmll tools of dfferent rad and the hgh curvature regons of each face model. The tool wth the smallest radus s the mnmum sze tool needed to cover the part, the other three tools are 0.25 nch, 0.50 nch and 1.00 nch. The fgure s the result of usng all four tools where we frst cover all the facets of the model possble wth the largest tool, we then cover the porton of the model not covered by the largest tool wth the next largest tool and so on.

3 21 Fg. 2: Models: NURBS, tessellated, tool mappngs, and tessellaton mappngs. 3. GLOBAL ACCESSIBILITY ANALYSIS The global accessblty analyss s easy to start as usng a pencl of rays of zero radus emanatng from a selected pont. The accessblty can be evaluated by checkng to see f any rays ntersect other portons of the part and buldng up a pont vsblty cone (PVC) or bnary sphercal map (BSM) to represent the global accessblty (Fg. 3). Kang & Suh [2] created an approach to tessellate the product model nto n patches, wth a unt sphere placed n the centrod of each patch. Each unt sphere s also tessellated nto m patches. Each patch of the unt sphere represents a normal or a drecton from that patch. All patches of the product model are then mapped to each unt sphere. If there are n patches on the surface, n proectons need to be mapped onto the bnary sphere, whch would ental the samplng of m normals or drectons wthn sphere. If n such ponts exst on the surface under evaluaton, then the order of the algorthm that can determne the surface vsblty would be m.n 2. Generatng the BSMs by patch proecton s computatonally expensve. Kang & Suh s approach s a typcal one to generate the global accessblty nformaton wthout a known tool radus. Fg. 3: Pont vsblty cone (PVC), bnary sphercal map (BSM), and a BSM embedded n a facet. Sptz & Requcha [5] presented an approach to nclude tool radus nto the global accessblty analyss. The approach can verfy that a tool radus r penetrates an obstacle X ff the nongrown half-lne penetrates X r, where X r denotes X grown by r. In ths approach, an obect s grown by the current tool radus r, ncludng all the ponts that are at a dstance no greater than r from another pont n the obect, and then the global accessblty analyzed for the grown obect wth rays. The result of the analyss ncludes the current tool radus r. Unfortunately, computng the sold model of a grown obect s an expensve and nontrval task prone to precson errors and t produces curved obects even when the nput s polyhedral. Woo et al [8] presented the concept of sphercal and vsblty maps where surface normals where enhanced wth cuttng tool geometres. Woo et al. recognze the concept of partal vsblty whch they presents as an equvalent to the global accessblty noton of Spyrd. Woo categorzes a wde range of manufacturng processes by ther pont, lne and surface vsbltes besdes consderng the varous degrees of freedom n the mechansm of the machnes that gve a computatonal structure n terms of a pont great crcle and a sphercal rectangle. Our approach s to develop an augmented surface model where each access pont on the surface s assocated wth a BSM, a reflecton of the pont accessblty of the entre model. Frst we create a set of BSMs wth rays. We then develop an approach to modfy all of the BSMs wth the tool radus. 3.1 Global Accessblty Analyss The frst step s to evaluate the global accessblty wth rays by creatng BSMs for all access ponts and generate the augmented surface model. A BSM s a unt sphere created wth ts surface decomposed nto m trangular facets accordng to the global coordnate system. The m s then calculated by the resoluton of the accessblty

4 representaton that s the grd number of the unt sphere, m= 12 grd (as an example, f grd = 8, m= 12 8 = 768 ). Each BSM s translated to each access pont by placng the center of the BSM on the access pont, whch allows the accessblty of the facets can be represented n a unfed algebrac fashon. However, the sphercal trangular facets of a BSM under, or ntersectng wth the tangent plane of the access pont, would be marked as naccessble before the patch proecton. The patch proecton only performs on the facets of the BSM above the tangent plane. Fg. 3 depcted a tessellated model of a BSM and a BSMs on a sngle facet wth ts accessble orentaton vectors. The darker shaded areas on the BSM represent naccessble facets where a proecton vector would ntersect the part model. The followng algorthm detects and marks each of these facets as beng naccessble f a ray emanatng from the center of the facet sphere ntersects any facet of the part. The procedure s as follows. Step 1. Create tessellatons on the surface, F, [1, n]. The access ponts are the centrods of the facets, P, [1, n]. Step 2. For pont P, [1, n], calculate the coordnates of P, and calculate the surface normal n, at P. Step 3. Create a unt sphere wth ts surface decomposed nto m trangular facets accordng to the global coordnate =, t [ 1, m]. a represents a sphercal trangular facet. t a represents a drecton from center of system, { } A a t the unt sphere to the centrod of the sphercal trangular facet a t. Step 4. Translate the unt sphere to each P as The center of the unt sphere s concdent wth A. A { a } t t =, [1, n], t [ 1, m] and ntalze a = 0 (accessble). P. Check the sphercal trangular facet under the tangent plane of access pont P (whch means f one of the three vertces of t a, t t [ 1, m] a s under the t. If a s t tangent plane, calculated by dot product wth the patch normal), then mark t as naccessble (set a t = 1). Step 5. Proect all the surface trangular facets F,, [1, n] that le above the tangent plane of the access pont P to the unt sphere (whch means f one of the three vertces of by dot product wth the patch normal). p F s the proecton of Step 6. Check the sphercal trangular facet a, t [ 1, m], f a = 0 and as naccessble (set a t = 1). If only one and t p F causes t P s calculated and recorded. If more than one P and dstances between t F les above the tangent plane, calculated F on the unt sphere A. a fall nto t p F,, [1, n], then mark t a to become naccessble, then the dstance between P p F causes a t to become naccessble, then all the P are calculated but only the shortest one s recorded. In ths procedure, we tessellate the surface nto n facets. A unt sphere also tessellated nto m facets s then placed on the facet such that the centrod of the sphere and the centrod of the facet are calculated. Fnally all the facets of the part surface are mapped to each of the unt spheres to create the bnary sphere map (BSM) on each facet of the surface. Durng the facet mappng, we add a dstance calculaton to Kang s approach. We record the shortest dstance of the naccessble orentaton n Step 6. The dstance data wll be used for modfyng the BSM wth the tool radus. The mappng of one facet onto a BSM d depcted f Fg. 4. Fg. 4: The mappng of one facet onto the BSM.

5 Mathematcal Model of Global Accessblty Analyss wth Tool Geometry In ths secton, we demonstrate how a BSM can be used to capture global accessblty wth a tool radus. In Kang s approach, BSMs are created wth rays (no tool sze). A BSM (tessellated unt sphere) s composed of trangles wth each trangle representng a potental tool orentaton where the tool orentaton s a proecton of the vector from the centrod of the BSM through the centrod of the facet. The process of mappng surface facets to the BSMs creates a map of all naccessble tool orentatons for each of the BSMs. The proecton of a surface facet onto the BSM s equvalent to sayng that a tool cannot be orented n that same proecton orentaton to access the part because t would have to pass through the proected surface n order to reach the BSM. When the tool geometry s ncluded n the mappng, the global accessblty wll ether reman unchanged or the accessblty map (BSM) wll decrease. That means some or all of the accessble orentatons evaluated wth rays mght become naccessble orentatons when evaluated usng the tool radus. Fgure 5 shows BSMs wth and wthout tool geometry ncluded. Fg. 5: Global accessblty changed by ncludng tool geometry. The frst step of the BSM modfcaton approach s to pck one BSM of the model that has been created usng ray ntersectons. The second step s to pck an naccessble orentaton of the upper hemsphere of the BSM (whch s above the tangent plane of the access pont). Fgure 5 shows an orentaton evaluated wth a ray that we wll consder to be naccessble (AP). Pont A s an access pont. Pont P represents a trangular surface facet of the other porton of the part (the facet s small enough to be approxmated as a pont). The ncluson of tool radus wll create a small naccessble regon for a tool radus ( r > 0 ). The unt hemsphere on the left represents the upper hemsphere of the orgnal BSM. Its center s on pont A. Pont P s on a lne passng through the centrod of a trangular facet of the surface of the BSM (sphere facets are not shown). The unt hemsphere on the rght represents the BSM after the modfcaton wth a sphercal endmll. Its center s on pont O (the center of the sphercal end of the tool). To avod a collson of the tool shaft wth the other porton of the part, pont P, an naccessble regon, was marked on the unt sphere. The boundary of the naccessble regon s formed by the orentatons of the tool when ts shaft ust touches pont P. Snce an naccessble orentaton from the ray approach becomes an naccessble regon wth the tool radus, ths change wll affect the other orentatons that are ray accessble. All naccessble orentatons of the upper hemsphere of the orgnal BSM would go through the same process to complete one BSM modfcaton wth the tool radus. And all the BSMs would be modfed by sequence. The small gray regon shown n Fg. 5 s the general case. It could approxmately be defned by four crtcal orentatons, a, b, c and d. Orentaton a s the orentaton of the tool that s closest to the normal vector of Pont A. Orentaton b s the orentaton of the tool that s furthest from the normal vector of Pont A. Orentatons c and d are two orentatons n the same plane wth the naccessble orentaton, and ths plane s perpendcular wth the plane that conssts of normal vector of pont A and orentaton a. To demonstrate the change of BSM wth tool radus, the problem can be stated as: that gven a tool radus and an naccessble orentaton wth a dstance recorded to fnd the four crtcal orentatons, a, b, c and d. After a small gray regon s defned by these four orentatons, we change the status of all the orentatons that are ray accessble wthn the small gray regon to be tool naccessble. We adopt the followng model notatons: A - An access pont, centrod of a trangle facet of the surface. O - Center of the sphere of the sphercal endmll. P - A pont representng a facet of the other porton of the part, the reason causes the orentaton to be naccessble. L - Dstance between pont A and pont P. 2 2 L - Dstance between pont O and pont P. L = L + r 2Lr cosθ

6 24 θ - Angle between the access pont s normal and the orgnal naccessble orentaton. θ - Angle between the access pont s normal and the tool s orentaton. R - Dstance between pont P and pont A s normal vector. R= L snθ H - Dstance between pont P and pont A s tangent plane. H = Lcosθ R - Radus of the sphercal endmll tool. And the ntal ranges of some notatons are gven as follows. L > 0 Dstance should be greater than zero. 0 θ < π Inaccessble orentaton s upon the tangent plane of the access pont. 2 0 θ < π Tool orentaton s upon the tangent plane of the access pont. 2 In order to create the mathematcal model of BSM modfcaton and solve t completely, the model has been consdered n many cases accordng to the condtons set byl, R, H and r. In table 1, the frst column shows the math relatonshp, the second column presents the fgure (the plane shown n each fgure s the tangent plane of pont A), and the thrd column s the unt sphere wth gray regon sgnfed as the naccessble regon caused by the tool. Math relatonshp Case 1: L <r Fgure Inaccessble regon Math relatonshp Case 4: L > r and 0< H r Fgure Inaccessble regon Case 2: L = r and H < r Case 5: L > r and r< H < 2r Case 3: L =r and H > r Case 6: > and L r H 2r Tab. 1: Sx cases for modfcaton of BSM s when consderng tool geometry. For llustraton, we show the modfcaton for case 6. Detals for the other cases can be found n [6]. Fg. 6 (Case 6) shows that when L > r & Lcosθ 2r, the naccessble regon of the unt sphere s defned by four crtcal orentatons, a, b, c and d. In Fg. 6, the thrd drawng shows how to fnd orentatons a and b. The last two drawngs show how to locate orentatons c & d. The drawng on the rght s the A-A vew of the drawng n the mddle.

7 BSM Modfcaton Procedure The procedure to modfy the BSM s follows. Step 1. Fg. 6: Case 6 of the BSM modfcaton wth tool geometry. Retreve an access pont P, [1, n] wth ts BSM A = { a }, t [ 1, m] of the global accessblty and surface normal n. a that are accessble and all Step 2. Pck all t two lsts A = { a }, A = { a }, t [ 1, m]. t t t a t that are naccessble and fallng above the tangent plane to form Step 3. By sequence take an naccessble orentaton a t n naccessble lsta, and name t the naccessble orentaton n. t n and n t. Step 4. Calculate the naccessble angle θ between Step 5. Use the formulatons to calculate the naccessble regon wth the tool radus. Step 6. Check f any a t whch s n the accessble orentaton lst A = { a } falls nto the naccessble regon. If yes, change the status of a to naccessble and take t out of the lst. If the accessble orentaton lst { } t A = a s empty (whch means the whole BSM s naccessble), stop and go to the next access pont. t Step 7. Repeat 3 through 6 untl all naccessble orentatons a t n t A have been checked. Step 8. By sequence, retreve the next access pont P and go to Step 2 untl all the BSMs on the access ponts have been modfed. To fnd a feasble tool radus for the hgh curvature regons of the surface, we use the tool radus found n the local accessblty analyss as the ntal tool radus to modfy the set of BSMs created by the global accessblty analyss wth rays. If any of BSMs become totally naccessble, we would shrnk the tool radus to redo the modfcaton untl we fnd a tool radus wth all the BSMs whch have some accessble orentatons.

8 26 4. EXPERIMENTAL RESULTS We demonstrate the accessblty approach on three models. The models nclude a male face model and a a bunny model at one facet resoluton (Tab 2). We use only one resoluton of the bunny model because of the complexty of the model. The expermental set was consdered adequate for demonstratng the valdty of the approach. We use dfferent resolutons to demonstrate accessblty computaton and mnmum tool sze for varyng granulartes of model approxmaton. A tessellated mode s, after all, an approxmaton of the NURBS model. The purpose of the experments are to show that the approach for computng tool accessblty (local and global) can be accomplshed for any sze tool and for varyng resoluton of tessellated models. We also demonstrate that the approach can be used to examne dfferent tool combnatons on a model. The approach was mplemented n C++ usng Standard Template Lbrares and the ACIS sold modelng kernel. All experments were conducted usng a Pentum IV machne wth a 2.2 GHz processng speed and 1 Gb of RAM. For each experment, three dfferent tool szes (0.25 nch, 0.50 nch, and 1.00 nch) were nvestgated to fnd the mnmum sze tool whch can ft onto the hghest curvature regons (whch means that ths tool can cut the entre part). Tab. 3-4 shows the results of the local accessblty analyses. Tab. 3 shows the results of the male face model and Tab. 4 shows the results of the bunny model. Local accessblty analyss s used to set the upper bound of the feasble tool radus (the mnmum sze tool). The expermentaton shows that there s a dfference n computng the mnmum tool sze based on the resolutons of the models. The hgher the resoluton, the more accurate the model. In practce, the resoluton of the tessellated model should be determned by the tolerance on the manufacture drawng. We found for these complex sculpture models that the tool that would cover the entre part was too small for machnng practce. From a machnng tme perspectve, t s better to use larger tools to machne parts. So n the local accessblty analyss we also look at three dfferent tool szes (0.25 nch, 0.50 nch, and 1.00 nch). The results of the experments show the percentage of area covered by each tool. Model # Model name Resoluton 1 Resoluton 2 Resoluton Male face Bunny Tab. 2: Three models used for expermentaton tessellated at dfferent resolutons (facets).

9 27 Resoluton No. (facets) Tool number Tool 1 Tool 2 Tool 3 Tool sze (nch) (Accessble area percentage) (Accessble area percentage) (Accessble area percentage) Tab. 3: Local accessblty analyss of the male face model wth three resolutons. Resoluton No. (facets) Tool number Tool 1 Tool 2 Tool 3 Tool sze (nch) (Accessble area percentage) Tab. 4: Local accessblty analyss of the bunny model (graphcs not shown). The red area on each model represents the hgh curvature regons that cannot be covered by the tool. The results n the tables are presented n groups. The pctures for each resoluton of the model form a group that occupes a row. In each group, the frst pcture s the result of usng all four tools where we frst cover all the facets of the model possble wth the largest tool, we then cover the porton of the model not covered by the largest tool wth the next largest tool and so on. The other pctures show the regon that would be covered by usng one tool sze and the hgh curvature regon uncovered s marked n red color. We also compute the percentage of accessble area covered by each tool. Tab. 5-6 shows the results of the expermentaton usng the global accessblty analyss. The mnmum tool sze calculated n the local accessblty analyss s used as the ntal feasble tool radus to fnd the mnmum tool sze n the global accessblty analyss. The results show the mnmum tool sze found n the global accessblty analyss may be smaller than that found n the local accessblty analyss. The mnmum tool sze found n the local accessblty analyss mght not have an accessble orentaton when we perform the global accessblty wth ths tool sze. In ths case, we wll shrnk the tool sze untl we fnd a tool sze that has at least one accessble orentaton when we perform the global accessblty process. In the global accessblty analyss, we looked at four tool szes. The accessble area percentage

10 28 and the machne tme were calculated. By comparng the machne tme, we demonstrate that usng a combnaton of tools s better machne plannng. Tab 7 shows the computng tmes for the BSM modfcaton approach for all model resolutons and tool szes. The results ndcate that the BSM modfcaton procedure takes consderably less processng tme than the patch proecton procedure (half lne proecton). Also, the larger the sze of the tool, the lower the processng tme. Resoluton No. (facets) Tool number Tool 1 Tool 2 Tool 3 Tool sze (nch) (Accessble area percentage (Cuttng tme n mnutes) Tab. 5: Global accessblty analyss of the bunny model (graphcs not shown) Resoluton No. (facets) Tool number Tool 1 Tool 2 Tool 3 Tool sze (nch) (Accessble area percentage) Cuttng tme (mnute) (Accessble area percentage) Cuttng tme (mnute) (Accessble area percentage) Cuttng tme (mnute) Tab. 6: Global accessblty analyss of the male face model wth three resolutons.

11 29 No. Model name Tool sze (nch) & computng tme (second) Tool sze Number of facets Mn tool sze 0* Mn Male face Bunny * half lne proecton Tab. 7: Computng tmes of the global accessblty analyss. 5. CONCLUSIONS An approach for global accessblty usng trangular tessellated sold models that consders tool sze (sphercal endmlls) was demonstrated. It ncludes usng local accessblty analyss to set an upper bound of the feasble tool radus, global accessblty analyss wth rays (no tool sze) to create a set of the BSMs, and modfyng the BSMs wth dfferent tool rad to analyze the global accessblty wth tool geometry. Kang s approach was used to create the ntal set of the BSMs by patches proecton. The approach s computatonally expensve. Three models at dfferent resolutons were used to demonstrate the approach. The experments ncluded fndng the smallest tool that would cover the part for the hgh curvature regons of the surface and also a global accessblty analyss wth dfferent tool rad. The results demonstrate that the approach can be used to analyze the global accessblty of dfferent tools and to compute the machnng tme wth the varous tools combnatons. The superor computaton effcency of the new approach was demonstrated and compared wth a prevous approach. Future work wll address other tool geometres and tool holder nteractons wth the workpece. Optmzaton of tool selecton s antoher area of future research. 6. REFERENCES [1] Balasubramanam, M.; Laxmprasad, P.; Sarma, S.; and Shakh, Z.: Generatng 5-axs NC roughng paths drectly from a tessellated representaton. Computer-Aded Desgn, 32, 2000, [2] Kang, J. K.; Suh, S. H.: Machnablty and set-up orentaton for 5-axs numercally controlled machnes of free surfaces. Internatonal Journal of Advanced Manufacturng Technology, 13, 1997, [3] Km, B. H.; Chu, C. N.: Effect of cutter mark on surface roughness and scallop heght n sculptured surface machnng. Computer-Aded Desgn, 26, 1994, [4] Rawat, R.: A Convex Hull Approach for Tool Accessblty Evaluaton. Thess, Arzona State Unversty, Tempe, AZ, [5] Sptz, S. N.; Requcha, A. A. G.: Accessblty analyss usng computer graphcs hardware. IEEE Transactons on Vsualzaton and Computer Graphcs, 6, 2000, [6] Vafaeesefa, A.; ElMaraghy, H. A.: Accessblty analyss n 5-axs machnng of sculptured surfaces. In Proceedngs of the 1998 IEEE Internatonal Conference on Robotcs and Automaton, Leuven, Belgum, 1998, (IEEE, New York). [7] Wang, J.: Local and Global Accesblty Analyss for Generatve Process Plannng. Dssertaton, Arzona State [8] Unversty, Tempe, AZ, May2006. Woo, T. C.; Gan, J. G.; and Tang, K.: Sphercal maps : Ther constructon, propertes, and approxmaton, Journal of Mechancal Desgn, 116, 1994,

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

Accessibility Analysis for the Automatic Contact and Non-contact Inspection on Coordinate Measuring Machines

Accessibility Analysis for the Automatic Contact and Non-contact Inspection on Coordinate Measuring Machines Proceedngs of the World Congress on Engneerng 008 Vol I Accessblty Analyss for the Automatc Contact and Non-contact Inspecton on Coordnate Measurng Machnes B. J. Álvarez, P. Fernández, J. C. Rco and G.

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

USING GRAPHING SKILLS

USING GRAPHING SKILLS Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

A high precision collaborative vision measurement of gear chamfering profile

A high precision collaborative vision measurement of gear chamfering profile Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) A hgh precson collaboratve vson measurement of gear chamferng profle Conglng Zhou, a, Zengpu Xu, b, Chunmng

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

PARTITIONING POSITIONAL AND NORMAL SPACE FOR FAST OCCLUSION DETECTION

PARTITIONING POSITIONAL AND NORMAL SPACE FOR FAST OCCLUSION DETECTION Proceedngs of DETC 3 ASME 23 Desgn Engneerng Techncal Conferences and Computers and Informaton n Engneerng Conference Chcago, Illnos USA, September 2-6, 23 DETC23/DAC-48779 PARTITIONING POSITIONAL AND

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm Resolvng Ambguty n Depth Extracton for Moton Capture usng Genetc Algorthm Yn Yee Wa, Ch Kn Chow, Tong Lee Computer Vson and Image Processng Laboratory Dept. of Electronc Engneerng The Chnese Unversty of

More information

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing Minimum Connected Dominating Set: Algorithmic approach Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place

More information

Analysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress

Analysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress Analyss of 3D Cracks n an Arbtrary Geometry wth Weld Resdual Stress Greg Thorwald, Ph.D. Ted L. Anderson, Ph.D. Structural Relablty Technology, Boulder, CO Abstract Materals contanng flaws lke nclusons

More information

Modeling Concave Globoidal Cam with Swinging Roller Follower: A Case Study

Modeling Concave Globoidal Cam with Swinging Roller Follower: A Case Study Modelng Concave Globodal Cam wth Swngng Roller Follower: A Case Study Nguyen Van Tuong, and Premysl Pokorny Abstract Ths paper descrbes a computer-aded desgn for desgn of the concave globodal cam wth cylndrcal

More information

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1 4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

MATHEMATICS FORM ONE SCHEME OF WORK 2004

MATHEMATICS FORM ONE SCHEME OF WORK 2004 MATHEMATICS FORM ONE SCHEME OF WORK 2004 WEEK TOPICS/SUBTOPICS LEARNING OBJECTIVES LEARNING OUTCOMES VALUES CREATIVE & CRITICAL THINKING 1 WHOLE NUMBER Students wll be able to: GENERICS 1 1.1 Concept of

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Scan Conversion & Shading

Scan Conversion & Shading Scan Converson & Shadng Thomas Funkhouser Prnceton Unversty C0S 426, Fall 1999 3D Renderng Ppelne (for drect llumnaton) 3D Prmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More information

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water. Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent

More information

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

Scan Conversion & Shading

Scan Conversion & Shading 1 3D Renderng Ppelne (for drect llumnaton) 2 Scan Converson & Shadng Adam Fnkelsten Prnceton Unversty C0S 426, Fall 2001 3DPrmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More information

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

More information

Line Clipping by Convex and Nonconvex Polyhedra in E 3

Line Clipping by Convex and Nonconvex Polyhedra in E 3 Lne Clppng by Convex and Nonconvex Polyhedra n E 3 Václav Skala 1 Department of Informatcs and Computer Scence Unversty of West Bohema Unverztní 22, Box 314, 306 14 Plzeò Czech Republc e-mal: skala@kv.zcu.cz

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

Simplification of 3D Meshes

Simplification of 3D Meshes Smplfcaton of 3D Meshes Addy Ngan /4/00 Outlne Motvaton Taxonomy of smplfcaton methods Hoppe et al, Mesh optmzaton Hoppe, Progressve meshes Smplfcaton of 3D Meshes 1 Motvaton Hgh detaled meshes becomng

More information

A Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures

A Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures A Novel Adaptve Descrptor Algorthm for Ternary Pattern Textures Fahuan Hu 1,2, Guopng Lu 1 *, Zengwen Dong 1 1.School of Mechancal & Electrcal Engneerng, Nanchang Unversty, Nanchang, 330031, Chna; 2. School

More information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

More information

VFH*: Local Obstacle Avoidance with Look-Ahead Verification

VFH*: Local Obstacle Avoidance with Look-Ahead Verification 2000 IEEE Internatonal Conference on Robotcs and Automaton, San Francsco, CA, Aprl 24-28, 2000, pp. 2505-25 VFH*: Local Obstacle Avodance wth Look-Ahead Verfcaton Iwan Ulrch and Johann Borensten The Unversty

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

Chapter 4. Non-Uniform Offsetting and Hollowing by Using Biarcs Fitting for Rapid Prototyping Processes

Chapter 4. Non-Uniform Offsetting and Hollowing by Using Biarcs Fitting for Rapid Prototyping Processes Chapter 4 Non-Unform Offsettng and Hollowng by Usng Barcs Fttng for Rapd Prototypng Processes Ths chapter presents a new method of Non-Unform offsettng and usng barc fttngs to hollow out sold objects or

More information

Multi-stable Perception. Necker Cube

Multi-stable Perception. Necker Cube Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008

More information

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

Reading. 14. Subdivision curves. Recommended:

Reading. 14. Subdivision curves. Recommended: eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton

More information

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

Interpolation of the Irregular Curve Network of Ship Hull Form Using Subdivision Surfaces

Interpolation of the Irregular Curve Network of Ship Hull Form Using Subdivision Surfaces 7 Interpolaton of the Irregular Curve Network of Shp Hull Form Usng Subdvson Surfaces Kyu-Yeul Lee, Doo-Yeoun Cho and Tae-Wan Km Seoul Natonal Unversty, kylee@snu.ac.kr,whendus@snu.ac.kr,taewan}@snu.ac.kr

More information

Multi-Resolution Geometric Fusion

Multi-Resolution Geometric Fusion Internatonal Conference on Recent Advances n 3-D Dgtal Imagng and Modellng, Ottawa, Canada May 12 15, 1997 Mult-Resoluton Geometrc Fuson Adran Hlton and John Illngworth Centre for Vson, Speech and Sgnal

More information

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay, Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay uneumann}@graphcs.usc.edu Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

Computation of a Minimum Average Distance Tree on Permutation Graphs*

Computation of a Minimum Average Distance Tree on Permutation Graphs* Annals of Pure and Appled Mathematcs Vol, No, 0, 74-85 ISSN: 79-087X (P), 79-0888(onlne) Publshed on 8 December 0 wwwresearchmathscorg Annals of Computaton of a Mnmum Average Dstance Tree on Permutaton

More information

A new segmentation algorithm for medical volume image based on K-means clustering

A new segmentation algorithm for medical volume image based on K-means clustering Avalable onlne www.jocpr.com Journal of Chemcal and harmaceutcal Research, 2013, 5(12):113-117 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCRC5 A new segmentaton algorthm for medcal volume mage based

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,

More information

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Face Recognition University at Buffalo CSE666 Lecture Slides Resources: Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

Performance Assessment and Fault Diagnosis for Hydraulic Pump Based on WPT and SOM

Performance Assessment and Fault Diagnosis for Hydraulic Pump Based on WPT and SOM Performance Assessment and Fault Dagnoss for Hydraulc Pump Based on WPT and SOM Be Jkun, Lu Chen and Wang Zl PERFORMANCE ASSESSMENT AND FAULT DIAGNOSIS FOR HYDRAULIC PUMP BASED ON WPT AND SOM. Be Jkun,

More information

The Evaluation and Correction of the Reconstructed NURBS Surface Smoothing and Accuracy

The Evaluation and Correction of the Reconstructed NURBS Surface Smoothing and Accuracy Sensors & Transducers 2013 by IFSA http://www.sensorsportal.com The Evaluaton and Correcton of the Reconstructed NURBS Surface Smoothng and Accuracy Shgang WANG, Janzhou ZHANG, Yong YAN School of Mechatroncs

More information

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama

More information

Form-factors Josef Pelikán CGG MFF UK Praha.

Form-factors Josef Pelikán CGG MFF UK Praha. Form-factors 1996-2016 Josef Pelkán CGG MFF UK Praha pepca@cgg.mff.cun.cz http://cgg.mff.cun.cz/~pepca/ FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 1 / 23 Form-factor F It ndcates the proporton

More information

ENERGY EFFICIENCY OPTIMIZATION OF MECHANICAL NUMERICAL CONTROL MACHINING PARAMETERS

ENERGY EFFICIENCY OPTIMIZATION OF MECHANICAL NUMERICAL CONTROL MACHINING PARAMETERS ENERGY EFFICIENCY OPTIMIZATION OF MECHANICAL NUMERICAL CONTROL MACHINING PARAMETERS Zpeng LI*, Ren SHENG Yellow Rver Conservancy Techncal Insttute, School of Mechancal Engneerng, Henan 475000, Chna. Correspondng

More information

Collaboratively Regularized Nearest Points for Set Based Recognition

Collaboratively Regularized Nearest Points for Set Based Recognition Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,

More information

UNIT 2 : INEQUALITIES AND CONVEX SETS

UNIT 2 : INEQUALITIES AND CONVEX SETS UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces

More information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

More information

Non-Split Restrained Dominating Set of an Interval Graph Using an Algorithm

Non-Split Restrained Dominating Set of an Interval Graph Using an Algorithm Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,

More information

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer

More information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

Dynamic wetting property investigation of AFM tips in micro/nanoscale

Dynamic wetting property investigation of AFM tips in micro/nanoscale Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Query Clustering Using a Hybrid Query Similarity Measure

Query Clustering Using a Hybrid Query Similarity Measure Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan

More information

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

A Gradient Difference based Technique for Video Text Detection

A Gradient Difference based Technique for Video Text Detection A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng, Natonal Unversty of Sngapore {shva, phanquyt, tancl }@comp.nus.edu.sg

More information