n If S is in convex position, then thee ae exactly k convex k-gons detemined by subsets of S. In geneal, howeve, S may detemine fa fewe convex k-gons.
|
|
- Clare James
- 5 years ago
- Views:
Transcription
1 Counting Convex Polygons in Plana Point Sets Joseph S. B. Mitchell a;1, Günte Rote b, Gopalakishnan Sundaam c, and Gehad Woeginge b a Applied Mathematics and Statistics, SUNY Stony Book, NY jsbm@ams.sunysb.edu b Technische Univesität Gaz, Institut fü Mathematik, Steyegasse 30, A-8010 Gaz, Austia. ote@ftug.dnet.tu-gaz.ac.at, woeginge@fmatbds01.tu-gaz.ac.at c Envionmental Systems Reseach Institute, 380 New Yok St., Redlands, CA gsundaam@esi.com Abstact Given a set S of n points in the plane, we compute in time O(n 3 ) the total numbe of convex polygons whose vetices ae a subset of S. We give ano(m n 3 ) algoithm fo computing the numbe of convex k-gons with vetices in S, fo all values k = 3;:::;m; peviously known bounds wee exponential (O(n dk=2e )). We also compute the numbe of empty convex polygons (esp., k-gons, k» m) with vetices in S in time O(n 3 ) (esp., O(m n 3 )). Key wods: Computational geomety, convexity, combinatoics, dynamic pogamming 1 Intoduction Let S denote a set of n points in the plane. A subset T S is said to be in convex position if T is the vetex set of a convex polygon, and we then say that T detemines a convex k-gon, whee k = jt j. We say that a polygon is empty if it contains no point of Sin its inteio. 1 Patially suppoted by gants fom Boeing Compute Sevices, Hughes Reseach Laboatoies, Ai Foce Office of Scientific Reseach contact AFOSR , and by NSF Gants ECSE and CCR Pepint submitted to Elsevie Pepint 27 Apil 1999
2 n If S is in convex position, then thee ae exactly k convex k-gons detemined by subsets of S. In geneal, howeve, S may detemine fa fewe convex k-gons. Conside, fo example, a set S of n =3Kpoints, with K points along each of thee ays emanating fom the oigin, such that the thee ays positively span the plane. Then thee is no convex k-gon detemined by a subset of S fo any value of k 5. In this note we show that the total numbe of convex polygons detemined by S can be computed in time O(n 3 ). Futhe, we show that the numbe of convex k-gons detemined by S can be tabulated, fo all values of k = 3;:::;m, in total time O(m n 3 ). Within these same time bounds, we can compute the total numbe of empty convex polygons detemined by S (in time O(n 3 )) o tabulate, fo k = 3;:::;m, the numbe of empty convex k-gons detemined by S (in time O(m n 3 )). Finally, we can compute fo a given point u (not necessaily fom the set S) the numbe of convex k-gons detemined by S that contain u in total time O(m n 3 ), fo all k» m. In geneal, the numbes that we compute can be lage e.g., n points in convex position detemine oughly 2 n convex polygons. We assume a eal RAM model of computation in which aithmetic opeations on lage integes can be done in constant time. Relation to pevious wok. Khulle and Mitchell [6] showed how to compute the numbe of tiangles detemined by S containing each point p 2 S in total time O(n 2 ). Rote et al. [8] showed how to count the total numbe of convex k-gons detemined by S in time O(n k 2 ), impoving ove the tivial bound of O(n k ). This esult has ecently been impoved to O(n dk=2e )byrote and Woeginge [9]. Unfotunately, these bounds ae exponential in k. Ou bounds ae polynomial in n and k. Counting poblems ae closely elated to optimization poblems fo convex polygons, because both types of poblems show diffeent aspects of thei natual common genealization: the enumeation of convex polygons. Futhemoe, both types of poblems can be solved by dynamic pogamming. This is also the appoach that we will take hee. The details of ou ecusions ae simila to some ecusions applied by Akin, Khulle, and Mitchell [1] in the context of vaious optimization poblems associated with selecting subsets of S to enclose with a fence", o simila ecusions of Eppstein et al. [5] fo computing polygons of smallest aea. Chvátal and Klincsek [2] also apply simila ecusions to the poblem of seaching fo maximum weight convex point sets (see also the book of Kote, Lovász, and Schade [7], pp ). An oveview of vaious optimization poblems associated with polygons detemined by a given point set can be found in Eppstein [4]. 2
3 2 Counting all convex polygons Conside fist the poblem of computing the total numbe of convex polygons detemined by S. Fo simplicity of pesentation, we assume that no thee points of S ae colinea and that no two points of S have the same y-coodinate; ou methods easily extend to the degeneate cases. Fix attention on one point s 2 S; we will compute in time O(n 2 ) the numbe of convex polygons detemined by S such that s is the lowest vetex of the polygon. Let U s denote the open halfspace of all points whose y-coodinate is geate than that of s. Following the sweep-line" algoithm of [1] fo computing maximum value enclosues, we devise a set of ecusions based on imagining a sweep-ay" otating clockwise about s, stating with a leftwad ay and ending with a ightwad ay out of s. Let H p;q denote the open halfspace to the left of the oiented line pq. Let p and q be points of S U s, such that q 2 H s;p (i.e., q is counteclockwise fom p with espect to s, and p 6= q 6= s). Then, we define f(p; q; s) tobe the numbe of convex polygons which (a) have vetices among the points S; (b) lie in the closue of the cone U s H s;p ; and (c) have qp and ps as two edges. Refe to Figue 1. Then, the numbe f(p; q; s) isobtained as follows: We test p q s Fig. 1. Notation used in fomulating the ecusions. each point 2 U s ; if 2 H p;q H s;q, then we add up the numbes f(q; ; s), obtaining f(p; q; s) =1+ 2Us Hp;q Hs;q f(q; ; s): (1) 3
4 This ecusion can be evaluated systematically, if we tabulate the values of f(p; q; s), fo all q 2 S U s H s;p, fo p in clockwise angula ode about s. The justification of the expession fo f(p; q; s) is simple: A convex polygon satisfying (a) (c) is eithe a tiangle (with thid edge qs) o is obtained by attaching the tiangle pqs to a convex polygon counted in f(q; ; s), fo some 2 S in the cone U s H s;q that lies left of the oiented line pq. As witten, these ecusions can be evaluated in O(n) time fo each choice of p; q; s, and oveall O(n 4 ) time. But this can be impoved by noting that, fo fixed values of q and s, we can evaluate f(p; q; s) incementally fo points p 2 U s H q;s in clockwise ode about q. Specifically, if the points of S in H q;s ae labelled p 1 ;p 2 ;:::, in clockwise ode about q, then we can compute f(p i ;q;s) fom f(p i 1 ;q;s) accoding to f(p i ;q;s)=f(p i 1 ;q;s)+ 2H pi ;q H q;pi 1 f(q; ; s): (2) Refe to Figue 2. Fist, f(p 1 ;q;s) is evaluated diectly, using (1), and then all othe values ae obtained using (2). We can chage off the wok involved in the summation to the points, each of which is consideed at most once duing the angula sweep about q. The esult is that, fo the fixed choice of s, the values f(p; q; s) can be tabulated in total time O(n 2 ). (The O(n) angula sots of points about each choice of q can be done, using the standad method of computing the aangement of dual lines, in total time O(n 2 ); see [3].) p p 2 1 p i 1 q p i s Fig. 2. Notation used in ecusion (2). The total numbe of convex polygons detemined by S is obtained simply by 4
5 summing: s2s p2u s q2u s H s;p f(p; q; s): 3 Counting convex k-gons Now conside the poblem in which we count only convex k-gons, fo a given intege k. (In the pocess of counting k-gons, we will in fact also count convex j-gons, fo j» k.) Let p and q be points of U s, such that q 2 H s;p. We define g(p; q; j; s) to be the numbe of convex polygons which fulfill the conditions (a) (c), as in the pevious section, and have exactly j edges. Then the numbe g(p; q; j; s) is obtained as follows: g(p; q; j; s) = 8>< >: 1; if j =3; 2Us Hp;q Hs;q g(q; ;j 1; s); othewise; (3) and the total numbe of convex k-gons is given by summing: s2s p2us q2us Hs;p g(p; q; k 1; s): As in (2), we can impove the efficiency of evaluating the ecusion in (3) incementally, obtaining g(p i ;q;j;s) fom g(p i 1 ;q;j;s), plus a sum (ove ) of g(q; ;j 1; s), fo points p 1 ;p 2 ;::: soted in clockwise ode about q. 4 Counting empty convex polygons If we estict attention to empty convex polygons we only have to ewite the ecusions (1) and (3), adding the estiction that tiangle pqs have no points of S in its inteio. Fo example, the numbe of j-edge convex polygons (with lowest point s) whose convex hull encloses no points of S is given by the following ecusion: G(p; q; j; s) = 8>< >: 2Us Hp;q Hs;q 0; if pqs S 6= ;; 1; if pqs S = ; and j =3; G(q; ;j 1; s); othewise. 5
6 Note that the test to see if pqs is empty can be done in constant time: As shown in Theoem 2.1 of [5] o in Theoem 1 of [1], we can pepocess the set S in time O(n 2 )into a data stuctue of size O(n 2 ), so that fo any quey consisting of thee points of S, we can check in constant time if the tiangle detemined by the thee points is empty o not. (Actually, the theoem allows us to sum the weights" of the contained points; but we do not need this geneality.) 5 Counting convex polygons containing a given point Anothe vaiation is the poblem of computing the numbe of convex k-gons containing a given point u (not necessaily fom the set S) in the inteio. The case k =3was consideed in [6], whee an O(n 2 ) algoithm was given fo computing, fo each u 2 S, the numbe of tiangles containing u. Fo each of the fou vesions of ou poblem given above (all convex polygons vs. convex k-gons; abitay convex polygons vs. empty convex polygons), we can solve the vaiant in which we equie point u to be inside the polygons that ae counted. We again fix attention on counting those polygons that have point s 2 S as thei lowest vetex. If u =2 U s the answe is 0. Othewise, we can compute, fo example, the numbe g 0 (p; q; j; s) ofj-edge convex polygons which fulfill the conditions (a) (c), as befoe, and contain point u, by solving the following ecusion: g 0 (p; q; j; s) = 8>< >: 2Us Hp;q Hs;q 0; if u 62 H s;p U s ; 1; if u 2 pqs and j =3; 2Us Hp;q Hs;q g 0 (q; ;j 1; s); g(q; ;j 1; s); if u 62 pqs; if u 2 pqs; whee g(p; q; j; s) has been aleady computed by equations (3). 6 Summay Fo the space complexity, note that we neve have need to stoe moe than O(n 2 )oo(kn 2 )numbes (fo the cases of counting all polygons, o all k-gons, espectively). The time complexity is obtained simply by multiplying O(n) 6
7 (the numbe of choices fo s) by the numbe of enties (O(n 2 )oo(kn 2 )) that we need to stoe fo each choice of s. Theoem 1 Given a set S of n points in the plane, in time O(n 3 ) (esp., O(mn 3 )) and space O(n 2 ) (esp., O(mn 2 )), the total numbe of convex polygons (esp., convex k-gons, fo all k» m) whose vetices ae a subset of S can be computed. Also, in the same time and space complexities, the total numbe of empty convex polygons (empty convex k-gons) can be computed, o the total numbe of convex polygons (convex k-gons) containing a given point can be computed. Note: We can extend the above ecusions to compute the numbe of t- subsets T S whose convex hull is a k-gon, in time O(k(t k +1) n 4 ). (This numbe is denoted by #(t; k) in [8,9].) Fo t = k this educes to the pat of the above theoem. It is staightfowad to decease the stoage equiement to O(n), at the expense of a facto of n in the unning time. Acknowledgement We thank the efeees fo obseving the impovement by a facto of n in the unning time fo the evaluation of the ecusions. Refeences [1] E.M. Akin, S. Khulle, and J.S.B. Mitchell, Geometic knapsack poblems, Algoithmica 10 (1993), [2] V. Chvátal and G. Klincsek, Finding lagest convex subsets, in: Poc. 11th Southeasten Conf. Combinatoics, Gaph Theoy, and Computing, (Boca Raton, Floida, 1980), Vol. II; Congessus Numeantium 29 (1980), [3] H. Edelsbunne and L. Guibas, Topologically sweeping an aangement, Jounal of Compute and System Sciences 38 (1989), [4] D. Eppstein, New algoithms fo minimum aea k-gons, in: Poc. 3d ACM-SIAM Sympos. Discete Algoithms (SODA), 1992, pp [5] D. Eppstein, M. Ovemas, G. Rote, and G. Woeginge, Finding minimum aea k-gons, Discete & Computational Geomety 7 (1992), [6] S. Khulle and J.S.B. Mitchell, On a tiangle counting poblem, Infomation Pocessing Lettes 33 (1990),
8 [7] B. Kote, L. Lovász, and R. Schade, Geedoids, in the seies Algoithms and Combinatoics, Vol. 4, Spinge-Velag, [8] G. Rote, Z. Wang, G. Woeginge, and B. Zhu, Counting k-subsets and convex k-gons in the plane, Infomation Pocessing Lettes 38 (1991), [9] G. Rote and G. Woeginge, Counting convex k-gons in plana point sets, Infomation Pocessing Lettes 41 (1992),
Shortest Paths for a Two-Robot Rendez-Vous
Shotest Paths fo a Two-Robot Rendez-Vous Eik L Wyntes Joseph S B Mitchell y Abstact In this pape, we conside an optimal motion planning poblem fo a pai of point obots in a plana envionment with polygonal
More informationART GALLERIES WITH INTERIOR WALLS. March 1998
ART GALLERIES WITH INTERIOR WALLS Andé Kündgen Mach 1998 Abstact. Conside an at galley fomed by a polygon on n vetices with m pais of vetices joined by inteio diagonals, the inteio walls. Each inteio wall
More informationFACE VECTORS OF FLAG COMPLEXES
FACE VECTORS OF FLAG COMPLEXES ANDY FROHMADER Abstact. A conjectue of Kalai and Eckhoff that the face vecto of an abitay flag complex is also the face vecto of some paticula balanced complex is veified.
More informationLecture 27: Voronoi Diagrams
We say that two points u, v Y ae in the same connected component of Y if thee is a path in R N fom u to v such that all the points along the path ae in the set Y. (Thee ae two connected components in the
More informationA New and Efficient 2D Collision Detection Method Based on Contact Theory Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai MIAO, Jian XUE
5th Intenational Confeence on Advanced Mateials and Compute Science (ICAMCS 2016) A New and Efficient 2D Collision Detection Method Based on Contact Theoy Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai
More information= dv 3V (r + a 1) 3 r 3 f(r) = 1. = ( (r + r 2
Random Waypoint Model in n-dimensional Space Esa Hyytiä and Joma Vitamo Netwoking Laboatoy, Helsinki Univesity of Technology, Finland Abstact The andom waypoint model (RWP) is one of the most widely used
More informationIP Network Design by Modified Branch Exchange Method
Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management
More informationTowards Adaptive Information Merging Using Selected XML Fragments
Towads Adaptive Infomation Meging Using Selected XML Fagments Ho-Lam Lau and Wilfed Ng Depatment of Compute Science and Engineeing, The Hong Kong Univesity of Science and Technology, Hong Kong {lauhl,
More information(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number.
Illustative G-C Simila cicles Alignments to Content Standads: G-C.A. Task (a, b) x y Fo this poblem, is a point in the - coodinate plane and is a positive numbe. a. Using a tanslation and a dilation, show
More information4.2. Co-terminal and Related Angles. Investigate
.2 Co-teminal and Related Angles Tigonometic atios can be used to model quantities such as
More informationSegmentation of Casting Defects in X-Ray Images Based on Fractal Dimension
17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach
More informationJournal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012
2011, Scienceline Publication www.science-line.com Jounal of Wold s Electical Engineeing and Technology J. Wold. Elect. Eng. Tech. 1(1): 12-16, 2012 JWEET An Efficient Algoithm fo Lip Segmentation in Colo
More informationAn Unsupervised Segmentation Framework For Texture Image Queries
An Unsupevised Segmentation Famewok Fo Textue Image Queies Shu-Ching Chen Distibuted Multimedia Infomation System Laboatoy School of Compute Science Floida Intenational Univesity Miami, FL 33199, USA chens@cs.fiu.edu
More informationzeo, i.e., each watchman emains stationay, and we have the at galley poblem. At the othe limit, if m = 1, we have the watchman oute poblem. Anothe con
Optimum Guad Coves and m-watchmen Routes fo Resticted Polygons Svante Calsson y Bengt J. Nilsson yz Simeon Ntafos x Abstact A watchman, in the teminology of at galleies, is a mobile guad. We conside seveal
More informationSYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH
I J C A 7(), 202 pp. 49-53 SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH Sushil Goel and 2 Rajesh Vema Associate Pofesso, Depatment of Compute Science, Dyal Singh College,
More informationRANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES
RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES Svetlana Avetisyan Mikayel Samvelyan* Matun Kaapetyan Yeevan State Univesity Abstact In this pape, the class
More informationMapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma
apreduce Optimizations and Algoithms 2015 Pofesso Sasu Takoma www.cs.helsinki.fi Optimizations Reduce tasks cannot stat befoe the whole map phase is complete Thus single slow machine can slow down the
More informationTESSELLATIONS. This is a sample (draft) chapter from: MATHEMATICAL OUTPOURINGS. Newsletters and Musings from the St. Mark s Institute of Mathematics
TESSELLATIONS This is a sample (daft) chapte fom: MATHEMATICAL OUTPOURINGS Newslettes and Musings fom the St. Mak s Institute of Mathematics James Tanton www.jamestanton.com This mateial was and can still
More informationImage Enhancement in the Spatial Domain. Spatial Domain
8-- Spatial Domain Image Enhancement in the Spatial Domain What is spatial domain The space whee all pixels fom an image In spatial domain we can epesent an image by f( whee x and y ae coodinates along
More informationDEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson
DEADLOCK AVOIDANCE IN BATCH PROCESSES M. Tittus K. Åkesson Univesity College Boås, Sweden, e-mail: Michael.Tittus@hb.se Chalmes Univesity of Technology, Gothenbug, Sweden, e-mail: ka@s2.chalmes.se Abstact:
More informationarxiv: v4 [cs.ds] 7 Feb 2018
Dynamic DFS in Undiected Gaphs: beaking the O(m) baie Suende Baswana Sheejit Ray Chaudhuy Keeti Choudhay Shahbaz Khan axiv:1502.02481v4 [cs.ds] 7 Feb 2018 Depth fist seach (DFS) tee is a fundamental data
More informationProf. Feng Liu. Fall /17/2016
Pof. Feng Liu Fall 26 http://www.cs.pdx.edu/~fliu/couses/cs447/ /7/26 Last time Compositing NPR 3D Gaphics Toolkits Tansfomations 2 Today 3D Tansfomations The Viewing Pipeline Mid-tem: in class, Nov. 2
More informationGravitational Shift for Beginners
Gavitational Shift fo Beginnes This pape, which I wote in 26, fomulates the equations fo gavitational shifts fom the elativistic famewok of special elativity. Fist I deive the fomulas fo the gavitational
More informationProperties of Tilings by Convex Pentagons
eview Foma, 1, 113 18, 006 Popeties of Tilings by Convex Pentagons Teuhisa SUGIMOTO 1 * and Tohu OGAWA,3 1 The Institute of Statistical Mathematics, 4-6-7 Minami-Azabu, Minato-ku, Tokyo 106-8569, Japan
More informationControlled Information Maximization for SOM Knowledge Induced Learning
3 Int'l Conf. Atificial Intelligence ICAI'5 Contolled Infomation Maximization fo SOM Knowledge Induced Leaning Ryotao Kamimua IT Education Cente and Gaduate School of Science and Technology, Tokai Univeisity
More informationDYNAMIC STORAGE ALLOCATION. Hanan Samet
ds0 DYNAMIC STORAGE ALLOCATION Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 07 e-mail: hjs@umiacs.umd.edu
More informationOn the Conversion between Binary Code and Binary-Reflected Gray Code on Boolean Cubes
On the Convesion between Binay Code and BinayReflected Gay Code on Boolean Cubes The Havad community has made this aticle openly available. Please shae how this access benefits you. You stoy mattes Citation
More informationConservation Law of Centrifugal Force and Mechanism of Energy Transfer Caused in Turbomachinery
Poceedings of the 4th WSEAS Intenational Confeence on luid Mechanics and Aeodynamics, Elounda, Geece, August 1-3, 006 (pp337-34) Consevation Law of Centifugal oce and Mechanism of Enegy Tansfe Caused in
More informationCardiac C-Arm CT. SNR Enhancement by Combining Multiple Retrospectively Motion Corrected FDK-Like Reconstructions
Cadiac C-Am CT SNR Enhancement by Combining Multiple Retospectively Motion Coected FDK-Like Reconstuctions M. Pümme 1, L. Wigstöm 2,3, R. Fahig 2, G. Lauitsch 4, J. Honegge 1 1 Institute of Patten Recognition,
More informationAll lengths in meters. E = = 7800 kg/m 3
Poblem desciption In this poblem, we apply the component mode synthesis (CMS) technique to a simple beam model. 2 0.02 0.02 All lengths in metes. E = 2.07 10 11 N/m 2 = 7800 kg/m 3 The beam is a fee-fee
More informationDetection and Recognition of Alert Traffic Signs
Detection and Recognition of Alet Taffic Signs Chia-Hsiung Chen, Macus Chen, and Tianshi Gao 1 Stanfod Univesity Stanfod, CA 9305 {echchen, macuscc, tianshig}@stanfod.edu Abstact Taffic signs povide dives
More informationOn Error Estimation in Runge-Kutta Methods
Leonado Jounal of Sciences ISSN 1583-0233 Issue 18, Januay-June 2011 p. 1-10 On Eo Estimation in Runge-Kutta Methods Ochoche ABRAHAM 1,*, Gbolahan BOLARIN 2 1 Depatment of Infomation Technology, 2 Depatment
More informationMassachusetts Institute of Technology Department of Mechanical Engineering
cm cm Poblem Massachusetts Institute of echnolog Depatment of Mechanical Engineeing. Intoduction to obotics Sample Poblems and Solutions fo the Mid-em Exam Figue shows a obotic vehicle having two poweed
More informationANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS
ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS Daniel A Menascé Mohamed N Bennani Dept of Compute Science Oacle, Inc Geoge Mason Univesity 1211 SW Fifth
More informationLayered Animation using Displacement Maps
Layeed Animation using Displacement Maps Raymond Smith, Wei Sun, Adian Hilton and John Illingwoth Cente fo Vision, Speech and Signal Pocessing Univesity of Suey, Guildfod GU25XH, UK a.hilton@suey.ac.uk
More informationAssessment of Track Sequence Optimization based on Recorded Field Operations
Assessment of Tack Sequence Optimization based on Recoded Field Opeations Matin A. F. Jensen 1,2,*, Claus G. Søensen 1, Dionysis Bochtis 1 1 Aahus Univesity, Faculty of Science and Technology, Depatment
More informationPoint-Biserial Correlation Analysis of Fuzzy Attributes
Appl Math Inf Sci 6 No S pp 439S-444S (0 Applied Mathematics & Infomation Sciences An Intenational Jounal @ 0 NSP Natual Sciences Publishing o Point-iseial oelation Analysis of Fuzzy Attibutes Hao-En hueh
More informationObstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor
Obstacle Avoidance of Autonomous Mobile Robot using Steeo Vision Senso Masako Kumano Akihisa Ohya Shin ichi Yuta Intelligent Robot Laboatoy Univesity of Tsukuba, Ibaaki, 35-8573 Japan E-mail: {masako,
More informationIntroduction to Medical Imaging. Cone-Beam CT. Introduction. Available cone-beam reconstruction methods: Our discussion:
Intoduction Intoduction to Medical Imaging Cone-Beam CT Klaus Muelle Available cone-beam econstuction methods: exact appoximate Ou discussion: exact (now) appoximate (next) The Radon tansfom and its invese
More informationDYNAMIC STORAGE ALLOCATION. Hanan Samet
ds0 DYNAMIC STORAGE ALLOCATION Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 074 e-mail: hjs@umiacs.umd.edu
More informationdc - Linux Command Dc may be invoked with the following command-line options: -V --version Print out the version of dc
- CentOS 5.2 - Linux Uses Guide - Linux Command SYNOPSIS [-V] [--vesion] [-h] [--help] [-e sciptexpession] [--expession=sciptexpession] [-f sciptfile] [--file=sciptfile] [file...] DESCRIPTION is a evese-polish
More informationClass 21. N -body Techniques, Part 4
Class. N -body Techniques, Pat Tee Codes Efficiency can be inceased by gouping paticles togethe: Neaest paticles exet geatest foces diect summation. Distant paticles exet smallest foces teat in goups.
More informationA VECTOR PERTURBATION APPROACH TO THE GENERALIZED AIRCRAFT SPARE PARTS GROUPING PROBLEM
Accepted fo publication Intenational Jounal of Flexible Automation and Integated Manufactuing. A VECTOR PERTURBATION APPROACH TO THE GENERALIZED AIRCRAFT SPARE PARTS GROUPING PROBLEM Nagiza F. Samatova,
More informationA Shape-preserving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonuniform Fuzzification Transform
A Shape-peseving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonunifom Fuzzification Tansfom Felipe Fenández, Julio Gutiéez, Juan Calos Cespo and Gacián Tiviño Dep. Tecnología Fotónica, Facultad
More informationLecture # 04. Image Enhancement in Spatial Domain
Digital Image Pocessing CP-7008 Lectue # 04 Image Enhancement in Spatial Domain Fall 2011 2 domains Spatial Domain : (image plane) Techniques ae based on diect manipulation of pixels in an image Fequency
More informationFrequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters
Optics and Photonics Jounal, 016, 6, 94-100 Published Online August 016 in SciRes. http://www.scip.og/jounal/opj http://dx.doi.og/10.436/opj.016.68b016 Fequency Domain Appoach fo Face Recognition Using
More informationa Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives
SPARK: Soot Reseach Kit Ondřej Lhoták Objectives Spak is a modula toolkit fo flow-insensitive may points-to analyses fo Java, which enables expeimentation with: vaious paametes of pointe analyses which
More informationAlso available at ISSN (printed edn.), ISSN (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010)
Also available at http://amc.imfm.si ISSN 1855-3966 (pinted edn.), ISSN 1855-3974 (electonic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010) 109 120 Fulleene patches I Jack E. Gave Syacuse Univesity, Depatment
More informationTiling groups for Wang tiles
Tiling goups fo Wang tiles Cistophe Mooe Ivan apapot Eic émila Abstact We apply tiling goups and height functions to tilings of egions in the plane by Wang tiles, which ae squaes with coloed boundaies
More informationOptimal Peer Selection for P2P Downloading and Streaming
Univesity of Massachusetts Amhest ScholaWoks@UMass Amhest Compute Science Depatment Faculty Publication Seies Compute Science 2005 Optimal Pee Selection fo P2P Downloading and Steaming Micah Adle Univesity
More informationThe Java Virtual Machine. Compiler construction The structure of a frame. JVM stacks. Lecture 2
Compile constuction 2009 Lectue 2 Code geneation 1: Geneating code The Java Vitual Machine Data types Pimitive types, including intege and floating-point types of vaious sizes and the boolean type. The
More informationHigh performance CUDA based CNN image processor
High pefomance UDA based NN image pocesso GEORGE VALENTIN STOIA, RADU DOGARU, ELENA RISTINA STOIA Depatment of Applied Electonics and Infomation Engineeing Univesity Politehnica of Buchaest -3, Iuliu Maniu
More informationOptical Flow for Large Motion Using Gradient Technique
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 3, No. 1, June 2006, 103-113 Optical Flow fo Lage Motion Using Gadient Technique Md. Moshaof Hossain Sake 1, Kamal Bechkoum 2, K.K. Islam 1 Abstact: In this
More informationA New Finite Word-length Optimization Method Design for LDPC Decoder
A New Finite Wod-length Optimization Method Design fo LDPC Decode Jinlei Chen, Yan Zhang and Xu Wang Key Laboatoy of Netwok Oiented Intelligent Computation Shenzhen Gaduate School, Habin Institute of Technology
More informationSeparability and Topology Control of Quasi Unit Disk Graphs
Sepaability and Topology Contol of Quasi Unit Disk Gaphs Jiane Chen, Anxiao(Andew) Jiang, Iyad A. Kanj, Ge Xia, and Fenghui Zhang Dept. of Compute Science, Texas A&M Univ. College Station, TX 7784. {chen,
More informationXFVHDL: A Tool for the Synthesis of Fuzzy Logic Controllers
XFVHDL: A Tool fo the Synthesis of Fuzzy Logic Contolles E. Lago, C. J. Jiménez, D. R. López, S. Sánchez-Solano and A. Baiga Instituto de Micoelectónica de Sevilla. Cento Nacional de Micoelectónica, Edificio
More informationThe International Conference in Knowledge Management (CIKM'94), Gaithersburg, MD, November 1994.
The Intenational Confeence in Knowledge Management (CIKM'94), Gaithesbug, MD, Novembe 994. Hashing by Poximity to Pocess Duplicates in Spatial Databases Walid G. Aef Matsushita Infomation Technology Laboatoy
More informationAutomatically Testing Interacting Software Components
Automatically Testing Inteacting Softwae Components Leonad Gallaghe Infomation Technology Laboatoy National Institute of Standads and Technology Gaithesbug, MD 20899, USA lgallaghe@nist.gov Jeff Offutt
More informationDirectional Stiffness of Electronic Component Lead
Diectional Stiffness of Electonic Component Lead Chang H. Kim Califonia State Univesit, Long Beach Depatment of Mechanical and Aeospace Engineeing 150 Bellflowe Boulevad Long Beach, CA 90840-830, USA Abstact
More informationTitle. Author(s)NOMURA, K.; MOROOKA, S. Issue Date Doc URL. Type. Note. File Information
Title CALCULATION FORMULA FOR A MAXIMUM BENDING MOMENT AND THE TRIANGULAR SLAB WITH CONSIDERING EFFECT OF SUPPO UNIFORM LOAD Autho(s)NOMURA, K.; MOROOKA, S. Issue Date 2013-09-11 Doc URL http://hdl.handle.net/2115/54220
More informationModelling, simulation, and performance analysis of a CAN FD system with SAE benchmark based message set
Modelling, simulation, and pefomance analysis of a CAN FD system with SAE benchmak based message set Mahmut Tenuh, Panagiotis Oikonomidis, Peiklis Chachalakis, Elias Stipidis Mugla S. K. Univesity, TR;
More informationInformation Retrieval. CS630 Representing and Accessing Digital Information. IR Basics. User Task. Basic IR Processes
CS630 Repesenting and Accessing Digital Infomation Infomation Retieval: Basics Thosten Joachims Conell Univesity Infomation Retieval Basics Retieval Models Indexing and Pepocessing Data Stuctues ~ 4 lectues
More informationUser Specified non-bonded potentials in gromacs
Use Specified non-bonded potentials in gomacs Apil 8, 2010 1 Intoduction On fist appeaances gomacs, unlike MD codes like LAMMPS o DL POLY, appeas to have vey little flexibility with egads to the fom of
More informationPositioning of a robot based on binocular vision for hand / foot fusion Long Han
2nd Intenational Confeence on Advances in Mechanical Engineeing and Industial Infomatics (AMEII 26) Positioning of a obot based on binocula vision fo hand / foot fusion Long Han Compute Science and Technology,
More informationReachable State Spaces of Distributed Deadlock Avoidance Protocols
Reachable State Spaces of Distibuted Deadlock Avoidance Potocols CÉSAR SÁNCHEZ and HENNY B. SIPMA Stanfod Univesity We pesent a family of efficient distibuted deadlock avoidance algoithms with applications
More informationOPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO
OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO Zeeshan A. Shaikh 1 and T.Y. Badguja 2 1,2 Depatment of Mechanical Engineeing, Late G. N. Sapkal
More informationAn Extension to the Local Binary Patterns for Image Retrieval
, pp.81-85 http://x.oi.og/10.14257/astl.2014.45.16 An Extension to the Local Binay Pattens fo Image Retieval Zhize Wu, Yu Xia, Shouhong Wan School of Compute Science an Technology, Univesity of Science
More informationHaptic Glove. Chan-Su Lee. Abstract. This is a final report for the DIMACS grant of student-initiated project. I implemented Boundary
Physically Accuate Haptic Rendeing of Elastic Object fo a Haptic Glove Chan-Su Lee Abstact This is a final epot fo the DIMACS gant of student-initiated poject. I implemented Bounday Element Method(BEM)
More informationThis document contains the draft version of the following paper:
This document contains the daft vesion of the following pape: R. Sinha, S.K. Gupta, C.J. Paedis, P.K. Khosla. Extacting aticulation models fom CAD models of pats with cuved sufaces. ASME Jounal of Mechanical
More informationA modal estimation based multitype sensor placement method
A modal estimation based multitype senso placement method *Xue-Yang Pei 1), Ting-Hua Yi 2) and Hong-Nan Li 3) 1),)2),3) School of Civil Engineeing, Dalian Univesity of Technology, Dalian 116023, China;
More informationComparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters
Compaisons of Tansient Analytical Methods fo Detemining Hydaulic Conductivity Using Disc Pemeametes 1,,3 Cook, F.J. 1 CSRO Land and Wate, ndoooopilly, Queensland The Univesity of Queensland, St Lucia,
More informationSpiral Recognition Methodology and Its Application for Recognition of Chinese Bank Checks
Spial Recognition Methodology and Its Application fo Recognition of Chinese Bank Checks Hanshen Tang 1, Emmanuel Augustin 2, Ching Y. Suen 1, Olivie Baet 2, Mohamed Cheiet 3 1 Cente fo Patten Recognition
More informationA Minutiae-based Fingerprint Matching Algorithm Using Phase Correlation
A Minutiae-based Fingepint Matching Algoithm Using Phase Coelation Autho Chen, Weiping, Gao, Yongsheng Published 2007 Confeence Title Digital Image Computing: Techniques and Applications DOI https://doi.og/10.1109/dicta.2007.4426801
More informationHISTOGRAMS are an important statistic reflecting the
JOURNAL OF L A T E X CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 D 2 HistoSketch: Disciminative and Dynamic Similaity-Peseving Sketching of Steaming Histogams Dingqi Yang, Bin Li, Laua Rettig, and Philippe
More informationGARBAGE COLLECTION METHODS. Hanan Samet
gc0 GARBAGE COLLECTION METHODS Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 07 e-mail: hjs@umiacs.umd.edu
More informationDesired Attitude Angles Design Based on Optimization for Side Window Detection of Kinetic Interceptor *
Poceedings of the 7 th Chinese Contol Confeence July 6-8, 008, Kunming,Yunnan, China Desied Attitude Angles Design Based on Optimization fo Side Window Detection of Kinetic Intecepto * Zhu Bo, Quan Quan,
More informationConversion Functions for Symmetric Key Ciphers
Jounal of Infomation Assuance and Secuity 2 (2006) 41 50 Convesion Functions fo Symmetic Key Ciphes Deba L. Cook and Angelos D. Keomytis Depatment of Compute Science Columbia Univesity, mail code 0401
More informationGeneralized Grey Target Decision Method Based on Decision Makers Indifference Attribute Value Preferences
Ameican Jounal of ata ining and Knowledge iscovey 27; 2(4): 2-8 http://www.sciencepublishinggoup.com//admkd doi:.648/.admkd.2724.2 Genealized Gey Taget ecision ethod Based on ecision akes Indiffeence Attibute
More informationA General Characterization of Representing and Determining Fuzzy Spatial Relations
7 The Intenational Aab Jounal of Infomation Technolog A Geneal Chaacteization of Repesenting and Detemining Fuzz Spatial Relations Lui Bai and Li Yan 2 College of Infomation Science and Engineeing, Notheasten
More informationA Memory Efficient Array Architecture for Real-Time Motion Estimation
A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN
More informationEfficient Maximal Poisson-Disk Sampling
Efficient Maximal Poisson-Disk Sampling Mohamed S. Ebeida Sandia National Laboatoies Andew A. Davidson Univesity of Califonia, Davis Anjul Patney Univesity of Califonia, Davis Patick M. Knupp Sandia National
More informationImproved Fourier-transform profilometry
Impoved Fouie-tansfom pofilomety Xianfu Mao, Wenjing Chen, and Xianyu Su An impoved optical geomety of the pojected-finge pofilomety technique, in which the exit pupil of the pojecting lens and the entance
More informationEmbeddings into Crossed Cubes
Embeddings into Cossed Cubes Emad Abuelub *, Membe, IAENG Abstact- The hypecube paallel achitectue is one of the most popula inteconnection netwoks due to many of its attactive popeties and its suitability
More informationColor Correction Using 3D Multiview Geometry
Colo Coection Using 3D Multiview Geomety Dong-Won Shin and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 13 Cheomdan-gwagio, Buk-ku, Gwangju 500-71, Republic of Koea ABSTRACT Recently,
More informationVehicle Chassis Control Using Adaptive Semi-Active Suspension
Poceedings of the 17th Wold Congess The Intenational Fedeation of Automatic Contol Vehicle Chassis Contol Using Adaptive Semi-Active Suspension V. Sankaanaayanan, Sinan Oncu, Dince Ocan, and Levent Güvenç
More informationScaling Location-based Services with Dynamically Composed Location Index
Scaling Location-based Sevices with Dynamically Composed Location Index Bhuvan Bamba, Sangeetha Seshadi and Ling Liu Distibuted Data Intensive Systems Laboatoy (DiSL) College of Computing, Geogia Institute
More informationarxiv: v1 [cs.lo] 3 Dec 2018
A high-level opeational semantics fo hadwae weak memoy models axiv:1812.00996v1 [cs.lo] 3 Dec 2018 Abstact Robet J. Colvin School of Electical Engineeing and Infomation Technology The Univesity of Queensland
More informationImprovement of First-order Takagi-Sugeno Models Using Local Uniform B-splines 1
Impovement of Fist-ode Takagi-Sugeno Models Using Local Unifom B-splines Felipe Fenández, Julio Gutiéez, Gacián Tiviño and Juan Calos Cespo Dep. Tecnología Fotónica, Facultad de Infomática Univesidad Politécnica
More informationA Consistent, User Friendly Interface for Running a Variety of Underwater Acoustic Propagation Codes
Poceedings of ACOUSTICS 6 - Novembe 6, Chistchuch, New Zealand A Consistent, Use Fiendly Inteface fo Running a Vaiety of Undewate Acoustic Popagation Codes Alec J Duncan, Amos L Maggi Cente fo Maine Science
More informationEvaluation of Partial Path Queries on XML data
Evaluation of Patial Path Queies on XML data Stefanos Souldatos Dept of EE & CE, NTUA stef@dblab.ntua.g Theodoe Dalamagas Dept of EE & CE, NTUA dalamag@dblab.ntua.g Xiaoying Wu Dept. of CS, NJIT xw43@njit.edu
More informationA ROI Focusing Mechanism for Digital Cameras
A ROI Focusing Mechanism fo Digital Cameas Chu-Hui Lee, Meng-Feng Lin, Chun-Ming Huang, and Chun-Wei Hsu Abstact With the development and application of digital technologies, the digital camea is moe popula
More informationBinary Dissection: Variants & Applications
Binay Dissection: Vaiants & Applications Shahid H. Bokhai Depatment of Electical Engineeing Univesity of Engineeing & Technology Lahoe, Pakistan Thomas W. Cockett ICASE NASA Langley Reseach Cente Hampton,
More informationEvaluation of Partial Path Queries on XML Data
Evaluation of Patial Path Queies on XML Data Stefanos Souldatos Dept of EE & CE NTUA, Geece stef@dblab.ntua.g Theodoe Dalamagas Dept of EE & CE NTUA, Geece dalamag@dblab.ntua.g Xiaoying Wu Dept. of CS
More informationPledge: Signature:
S/PM 0 Final Exam 7 May 005 Name: KEY E-mail ID: @viginia.edu Pledge: Signatue: Thee ae 80 minutes 3 hous fo this exam and 80 oints on the test; don t send too long on any one uestion! Thee is an exam
More informationElliptic Generation Systems
4 Elliptic Geneation Systems Stefan P. Spekeijse 4.1 Intoduction 4.1 Intoduction 4.2 Two-Dimensional Gid Geneation Hamonic Maps, Gid Contol Maps, and Poisson Systems Discetization and Solution Method Constuction
More informationTopic -3 Image Enhancement
Topic -3 Image Enhancement (Pat 1) DIP: Details Digital Image Pocessing Digital Image Chaacteistics Spatial Spectal Gay-level Histogam DFT DCT Pe-Pocessing Enhancement Restoation Point Pocessing Masking
More informationAnd Ph.D. Candidate of Computer Science, University of Putra Malaysia 2 Faculty of Computer Science and Information Technology,
(IJCSIS) Intenational Jounal of Compute Science and Infomation Secuity, Efficient Candidacy Reduction Fo Fequent Patten Mining M.H Nadimi-Shahaki 1, Nowati Mustapha 2, Md Nasi B Sulaiman 2, Ali B Mamat
More informationEfficient Execution Path Exploration for Detecting Races in Concurrent Programs
IAENG Intenational Jounal of Compute Science, 403, IJCS_40_3_02 Efficient Execution Path Exploation fo Detecting Races in Concuent Pogams Theodous E. Setiadi, Akihiko Ohsuga, and Mamou Maekaa Abstact Concuent
More informationKeith Dalbey, PhD. Sandia National Labs, Dept 1441 Optimization & Uncertainty Quantification
SAND 0-50 C Effective & Efficient Handling of Ill - Conditioned Coelation atices in Kiging & adient Enhanced Kiging Emulatos hough Pivoted Cholesky Factoization Keith Dalbey, PhD Sandia National Labs,
More informationMulti-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples
Multi-azimuth Pestack Time Migation fo Geneal Anisotopic, Weakly Heteogeneous Media - Field Data Examples S. Beaumont* (EOST/PGS) & W. Söllne (PGS) SUMMARY Multi-azimuth data acquisition has shown benefits
More information