Parallel Space-Time Kernel Density Estimation

Total Page:16

File Type:pdf, Size:1020Kb

Parallel Space-Time Kernel Density Estimation Parallel Space-Time Kernel Density Estimation Erik Saule†, Dinesh Panchananam†, Alexander Hohl‡, Wenwu Tang‡, Eric Delmelle‡ † Dept. of Computer Science, ‡Dept. of Geography and Earth Sciences UNC Charlotte Charlotte, NC, USA Email: {esaule,dpanchan,ahohl,wtang4,eric.delmelle}@uncc.edu Abstract—The exponential growth of available data has these can be constructed, data scientists need to interactively increased the need for interactive exploratory analysis. Dataset visualize and explore the data to understand its structure. can no longer be understood through manual crawling and In this paper, we present the space-time kernel density simple statistics. In Geographical Information Systems (GIS), the dataset is often composed of events localized in space and estimation application which essentially builds a 3D density time; and visualizing such a dataset involves building a map map of events located in space and time. This problem is of where the events occurred. computationally expensive using existing algorithms. That We focus in this paper on events that are localized among is why we developed better sequential algorithms for this three dimensions (latitude, longitude, and time), and on com- problem that reduced the complexity by orders of magnitude. puting the first step of the visualization pipeline, space-time kernel density estimation (STKDE), which is most computa- And to bring the runtime in the realm of near real-time, we tionally expensive. Starting from a gold standard implementa- designed parallel strategies for shared memory machines. tion, we show how algorithm design and engineering, parallel Section II presents the STKDE application along with a decomposition, and scheduling can be applied to bring near reference implementation that uses a voxel-based algorithm real-time computing to space-time kernel density estimation. VB to compute STKDE. In Section III, we investigate the We validate our techniques on real world datasets extracted from infectious disease, social media, and ornithology. sequential problem and develop a point-based algorithm PB that significantly reduce the complexity compared to VB. Keywords-space-time kernel density; performance; spatial We also identify invariants linked to the structure of the algorithm; shared-memory parallelism; scheduling kernel density estimate function that allows to reduce the computational cost by an additional factor and build the PB- I. INTRODUCTION SYM algorithm based on that observation. We develop two The rapid propagation of infectious diseases (e.g. parallelization strategies (PB-SYM-DR and PB-SYM-DD) zika, Ebola, H1N1, dengue fever) is conducive to in Section IV that are designed to make the computation serious, epidemic outbreaks, posing a threat to vulnerable pleasingly parallel. However both strategies are not work- populations. Such diseases have complex transmission efficient and can cause significant work overhead in some cycles, and effective public health responses require the cases. That is why we introduce PB-SYM-PD in Section V ability to monitor outbreaks in a timely manner [1]. Space- that provide a work-efficient decomposition of the points. time statistics facilitate the discovery of disease dynamics However that algorithm has internal dependencies which including rate of spread, seasonal cyclic patterns, direction, can induce a long critical path and cause load imbalance; intensity (i.e. clusters), and risk of diffusion to new regions. and we develop PB-SYM-PD-SCHED to leverage alternative However, obtaining accurate results from space-time ordering of the work to reduce the critical path. To reduce statistics is computationally very demanding, which is the critical path further, we propose the PB-SYM-PD-REP problematic when public health interventions are promptly algorithm which introduces some work overhead only where needed. The issues of computational efforts are exacerbated is needed to achieve a short critical path. Section VI presents with spatiotemporal datasets of increasing size, diversity experimental results on 4 different datasets and 21 instances and availability [2]. High-performance computing reduces extracted from these datasets. The experiments highlights the effort required to identify these patterns, however that the sequential strategies are efficient. The parallel strate- heterogeneity in the data must be accounted for [3]. gies have their pros and cons and different strategies appear Epidemiology is only one of the application domains to be best in different scenarios. Section VII discusses the where it is important to understand how events occurring at applicability of related problems and techniques. different locations and different times form clusters. Political II. SPACE-TIME KERNEL DENSITY ESTIMATION analysis, social media analysis, or the study of animal migra- tion also require the understanding of spatial and temporal A. Description locality of events. The massive amount of data we see nowa- Space-time kernel density (STKDE) is used for identi- days is often analyzed using complex models. But before fying spatiotemporal patterns in datasets. It is a temporal (a) h = 2500m, h = 14days (b) h = 500m, h = 7days s t s t Figure 2. The computation of STKDE happens in a domain space of size Figure 1. Visualization of Dengue fever cases in Cali, Colombia in 2010 gx, gy, gt. Each point impacts the neighboring space at a distance hs in and 2011 for different spatial bandwidth and temporal bandwidth. space and ht in time; forming a cylinder of diameter 2hs and of height 2ht. n Number of points extension of the traditional 2D kernel density estimation [4] s = (x, y, t) A voxel and sampling coordinate which generates density surface (“heatmap”) from a set (xi, yi, ti) Coordinate of point i of n points located in a geographic space. The resulting hs, ht Spatial and temporal bandwidth gx, gy, gt Real size of the domain (in meters) density estimates are visualized within the space-time cube sres, tres Resolution (in meters) framework using two spatial (x, y) and a temporal dimension s = (X, Y, T ) A voxel in voxel space (t) [5]. STKDE creates a discretized 3D volume where (Xi,Yi,Ti) Voxel of point i each voxel (3D equivalent of a pixel) is assigned a density Gx,Gy,Gt Size of the domain (in voxels) Hs,Ht Bandwidth (in voxels) estimate based on the surrounding points. The space-time density is estimated using (following the notations of [3]): Table I NOTATIONS 1 x − xi y − yi t − ti B. Gold Standard Implementation fˆ x, y, t k , k ( ) = 2 X s( ) t( ) nhsht hs hs ht i|di<hs,ti<ht The gold standard implementation (for instance from [3]) follows the exact definition of STKDE as it is given above. It Density fˆ(x, y, t) of each voxel is determined by number is a voxel-based algorithm we call VB. For each voxel, VB and distance of events (points) (x , y , t ) within its vicinity, i i i finds the points within the temporal and spatial bandwidths which is conceptualized by a cylinder. The spatial bandwidth and calculates the contribution to the density of this voxel. h forms a circle which, due to the orthogonal relationship s The pseudo code is given in Algorithm 1. between space and time, is extended to a cylinder by temporal bandwidth h . For every event inside the cylinder, t Algorithm 1 VB the spatial (di) and temporal (ti) distances are smaller than for all voxels s = (x, y, t) do hs and ht. Therefore, the event receives a weight based on sum = 0 the kernel functions ks and kt (distance decay): for all points i at xi, yi, ti do 2 2 if (xi − x) + (yi − y) < hs and |ti − t| ≤ ht then − − − p x xi y yi t ti sum+ = ks( , )kt( ) π 2 2 hs hs ht ks(u, v) = (1 − u) (1 − v) sum stkde[X][Y ][T ] = 2 2 nhsht 3 k (w) = (1 − w)2 t 4 The algorithm performs θ(GxGyGtn) distance tests and Figure 1 illustrates how varying the bandwidths used in 2 computes θ(nHs Ht) densities. Since Hs is smaller than Gx STKDE helps focusing the graphical visualization of Dengue and Gy and since Ht is smaller than Gt, the complexity of fever cases in Cali, Colombia [6]. Figure 2 shows the impact the algorithm is θ(GxGyGtn) and it requires θ(GxGyGt) of a single point on the neighboring space. memory. Computationally, the domain of size gx, gy, gt is dis- cretized in voxels using a spatial resolution sres and a tem- III. ALGORITHM DESIGN AND ENGINEERING poral resolution tres. Therefore, the domain is represented gx gy gt A. Point-based Algorithm by a grid of size Gx = sres , Gy = sres , Gt = tres . Each point causes a density increase in the voxels that are The voxel-based algorithm suffers from a massive cost within a cylinder centered on the point, of radius equal to of computing distances. The gold implementation reduces hs the spatial bandwidth in voxels Hs = sres , and of half the number of distance computation by decomposing the ht height equal to the temporal bandwidth Ht = tres . domain, but that still incurs many distance calculations. Most All the notations are summarized in Table I. As a conven- of these calculations are unnecessary since we know where tion all uppercase notations denote quantities in voxels and each point will radiate density. The point-based algorithm all lowercase notations denote quantities in domain space. PB, given in Algorithm 2, leverages that property. Algorithm 2 PB the two invariants. (See pseudocode in Algorithm 3.) Notice for all voxels s = (x, y, t) do that leveraging the symmetries in the calculation does not stkde[X][Y ][T ] = 0 change the complexity (PB-SYM still has a complexity of for each points i at xi, yi, ti do 2 for Xi − Hs ≤ X ≤ Xi + Hs do Θ(GxGyGt + nHs Ht)) but reduces the number of flops.
Recommended publications
  • Adoption of Sparse 3D Textures for Voxel Cone Tracing in Real Time Global Illumination
    Adoption of Sparse 3D Textures for Voxel Cone Tracing in Real Time Global Illumination Igor Aherne, Richard Davison, Gary Ushaw and Graham Morgan School of Computing, Newcastle University, Newcastle upon Tyne, U.K. [email protected] Keywords: Global Illumination, Voxels, Real-time Rendering, Lighting. Abstract: The enhancement of 3D scenes using indirect illumination brings increased realism. As indirect illumination is computationally expensive, significant research effort has been made in lowering resource requirements while maintaining fidelity. State-of-the-art approaches, such as voxel cone tracing, exploit the parallel nature of the GPU to achieve real-time solutions. However, such approaches require bespoke GPU code which is not tightly aligned to the graphics pipeline in hardware. This results in a reduced ability to leverage the latest dedicated GPU hardware graphics techniques. In this paper we present a solution that utilises GPU supported sparse 3D texture maps. In doing so we provide an engineered solution that is more integrated with the latest GPU hardware than existing approaches to indirect illumination. We demonstrate that our approach not only provides a more optimal solution, but will benefit from the planned future enhancements of sparse 3D texture support expected in GPU development. 1 INTRODUCTION bounces with minimal reliance on the specifics of the original 3D mesh in the calculations (thus achieving The realism of a rendered scene is greatly enhanced desirable frame-rates almost independent of the com- by indirect illumination - i.e. the reflection of light plexity of the scene). The approach entails represent- from one surface in the scene to another.
    [Show full text]
  • Ank Register Volume Lxvix, No
    ANK REGISTER VOLUME LXVIX, NO. 11. RED BANK, N. J., THURSDAY, SEPTEMBER 5,1946. SECTION ONE—PAGES 1 TO ll Gold Wrist Watch Eisner Company To Preach His JCP & L Treasurer Present Race Prizes Gift To Rector River Plaza Roads At tbe close of last Sunday morn- Has Jobs Open j Final Sermons Ing's service at St. John's, chapel. At M.B.C. Dance Little Sliver, Rev. Robert H. An- For 160 Veterans At St. George's Resurfaced Gtatii derson received a gold wrist watch in appreciation of his tbree years of service at tbe chapel. New Program For Rev. H. Fairfield Butt, Janet Boynton Is Awarded The gift was presented by Dan- Edwin H. Brasch Pays $1,400 iel S. Weigand on behalf of the ves- G. I.'s Now In III, Will Say Farewell Good Sportsmanship Trophy try and congregation and carried To McDowell Firm For Work with it their very best wishes. A Full Operation To Rumson Sunday large bouquet of gladioli was sent Highlighting the presentation ol As the result of an Investigation jor portion of the county's roft&i to Mrs. Anderson by members of Slgmund Eisner company planta prizes won In the Monmouth Boat Rev. H. Falrfleld Butt, Jd, 'rec- by The Register, Edwin H. Brasch work, had completed a the altar guild. in Red Bank, Freehold, Keansburg club season's sailboat races, which tor of St. George's-by-the-Rlver, will of Nutswamp road, Middletown made job at River Plaza. Mr,; Highlands Asks The rector has assumed his new and South Amlboy have immediate took place Monday night at a danc hold his final service in Rumson township, Monmouth county rood Parkes knew nothing about duties at Trinity Episcopal church, openings for 160 World war 2 vet- given tbe eklppera and crews a next Sunday, September 8.
    [Show full text]
  • Re-Purposing Commercial Entertainment Software for Military Use
    Calhoun: The NPS Institutional Archive Theses and Dissertations Thesis Collection 2000-09 Re-purposing commercial entertainment software for military use DeBrine, Jeffrey D. Monterey, California. Naval Postgraduate School http://hdl.handle.net/10945/26726 HOOL NAV CA 9394o- .01 NAVAL POSTGRADUATE SCHOOL Monterey, California THESIS RE-PURPOSING COMMERCIAL ENTERTAINMENT SOFTWARE FOR MILITARY USE By Jeffrey D. DeBrine Donald E. Morrow September 2000 Thesis Advisor: Michael Capps Co-Advisor: Michael Zyda Approved for public release; distribution is unlimited REPORT DOCUMENTATION PAGE Form Approved OMB No. 0704-0188 Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington headquarters Services, Directorate for Information Operations and Reports, 1215 Jefferson Davis Highway, Suite 1204, Arlington, VA 22202-4302, and to the Office of Management and Budget, Paperwork Reduction Project (0704-0188) Washington DC 20503. 1 . AGENCY USE ONLY (Leave blank) 2. REPORT DATE REPORT TYPE AND DATES COVERED September 2000 Master's Thesis 4. TITLE AND SUBTITLE 5. FUNDING NUMBERS Re-Purposing Commercial Entertainment Software for Military Use 6. AUTHOR(S) MIPROEMANPGS00 DeBrine, Jeffrey D. and Morrow, Donald E. 8. PERFORMING 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) ORGANIZATION REPORT Naval Postgraduate School NUMBER Monterey, CA 93943-5000 9. SPONSORING / MONITORING AGENCY NAME(S) AND ADDRESS(ES) 10. SPONSORING/ Office of Economic & Manpower Analysis MONITORING AGENCY REPORT 607 Cullum Rd, Floor IB, Rm B109, West Point, NY 10996-1798 NUMBER 11.
    [Show full text]
  • Rapid Reconstruction of Tree Skeleton Based on Voxel Space
    International Conference on Electrical, Electronics and Mechatronics (ICEEM 2015) Rapid Reconstruction of Tree Skeleton Based on Voxel Space Gang Zhao, Yintao Shi, Maomei Wang and Yi Xu JiangsuProvincialHydraulic Research Institute, Nanjing, China, 210017 Abstract—Tree skeleton had great significance in constructing but rather from their position relative to other voxels to the three-dimensional model of the botanical tree and calculate location that they constituted a single volume image investigating the forestry. Based on the point clouds of the position in the data structure.A voxel space Tconsisted of a botanical tree collected via the terrestrial 3D laser scanner, we serial of voxel as a basic unit, and could be divided into three proposed a method of rapidly constructing the tree skeleton with dimensions of Plane, Column andLine.The voxel coordinates the help of the voxel space conversion. We firstly constructed a could be represented as ,,| 1, , , among specific voxel space according to the collected point clouds, and whichl,c and prespectively represented the voxel location of thenanalyzedthe connectivity components of each layer in voxel Plane, Column and Line in voxel space shown in FigureⅠ.The space and calculated the skeleton nodes contained in every voxel amounts of plane, columns and lines in a voxel space depended layer.At last, we constructed the whole skeleton of the botanical tree by means of single-source shortest path algorithm. on the resolution selected by the space division as well as the Experiments show that the method proposed in this paper can be maximum and minimum values of x, y, z coordinates in the effectively.
    [Show full text]
  • A Survey Full Text Available At
    Full text available at: http://dx.doi.org/10.1561/0600000083 Publishing and Consuming 3D Content on the Web: A Survey Full text available at: http://dx.doi.org/10.1561/0600000083 Other titles in Foundations and Trends R in Computer Graphics and Vision Crowdsourcing in Computer Vision Adriana Kovashka, Olga Russakovsky, Li Fei-Fei and Kristen Grauman ISBN: 978-1-68083-212-9 The Path to Path-Traced Movies Per H. Christensen and Wojciech Jarosz ISBN: 978-1-68083-210-5 (Hyper)-Graphs Inference through Convex Relaxations and Move Making Algorithms Nikos Komodakis, M. Pawan Kumar and Nikos Paragios ISBN: 978-1-68083-138-2 A Survey of Photometric Stereo Techniques Jens Ackermann and Michael Goesele ISBN: 978-1-68083-078-1 Multi-View Stereo: A Tutorial Yasutaka Furukawa and Carlos Hernandez ISBN: 978-1-60198-836-2 Full text available at: http://dx.doi.org/10.1561/0600000083 Publishing and Consuming 3D Content on the Web: A Survey Marco Potenziani Visual Computing Lab, ISTI CNR [email protected] Marco Callieri Visual Computing Lab, ISTI CNR [email protected] Matteo Dellepiane Visual Computing Lab, ISTI CNR [email protected] Roberto Scopigno Visual Computing Lab, ISTI CNR [email protected] Boston — Delft Full text available at: http://dx.doi.org/10.1561/0600000083 Foundations and Trends R in Computer Graphics and Vision Published, sold and distributed by: now Publishers Inc. PO Box 1024 Hanover, MA 02339 United States Tel. +1-781-985-4510 www.nowpublishers.com [email protected] Outside North America: now Publishers Inc.
    [Show full text]
  • Red Bank Register Sectio
    AIXtfeaNKWScrt 'BED BANK SECTIO: and Town Told iFeariesaly smfl Wltboot BIM RED BANK REGISTER yOLUME LXI, NO. 44. RED BANK, N. J., THURSDAY, APRIL 27,1939, PAGES X TO On Hospital Board National Bureau Local Women to Song Recital In 200 Attend Meeting of Great satisfaction Is being mani- Attend Luncheon Eisele Residence Sold fested by those closely, connected Announces New with the management of Monmcuth Mrs. Emma VanSchoIck of New- Catholic School Memorial hospital at Long Branch man Springs road and Mrs. Lewis S. State Garden Clubs over the recent selection as a mem- Insurance Plan Thompson ot Ltncroft are members Thursday, May 11 At Gooseneck Point of the committee completing arrange- ments for a luncheon In honor of Rates Reduced for Auto- four Republican women members of Pupila of Olive Wyckoff Neighborhood Group of Red Bank the assembly Monday, May 1, at the mobile Owner* in Cer- Hotel HUdebrecht in Trenton. The to Give Varied Program Property Developed by the Late Henry' luncheon la an annual affair given Hostess at Sessions Here Tuesday tain Classes by tho women members of the Re- With Guest Soloists Runyon Bought by Albert G. Morharf publican state committee and the The National Bureau ot Casualty county vice chairman. More than OHVB" Wyckoff, well known vocal Members of the Neighborhood and Surety Underwriters of New 600 women are expected to attend. teacher, will present 11 of her artist The Ray VanHora. agencyiof Garden club of Red Bank were hos- briefly the Gardens on Parade ex- Former Governor Harold G, Hoff- Haven reports; this* sale, ot ttief, hibit at the fair and stated that New Tork has announced a new rating, pupils In a program ot operatic arias, tess to member* of the New Jersey plan for private passenger automo- man "will be the guest of honor and songs in English, German, French Dies Of Burns known Elsele ' property ktjpwn State Federation of Garden clubs at Jersey's exhibit would be in the East guest speaker.
    [Show full text]
  • Computational Virtual Measurement for Trees Dissertation
    Computational Virtual Measurement For Trees Dissertation Zur Erlangung des akademischen Grades doctor rerum naturalium (Dr. rer. nat.) Vorgelegt dem Rat der Chemisch-Geowissenschaftlichen Fakultät der Friedrich-Schiller-Universität Jena von MSc. Zhichao Wang geboren am 16.03.1987 in Beijing, China Gutachter: 1. 2. 3. Tag der Verteidigung: 我们的征途是星辰大海 My Conquest Is the Sea of Stars --2019, 长征五号遥三运载火箭发射 わが征くは星の大海 --1981,田中芳樹 Wir aber besitzen im Luftreich des Traums Die Herrschaft unbestritten --1844, Heinrich Heine That I lived a full life And one that was of my own choice --1813, James Elroy Flecker Contents Contents CONTENTS ......................................................................................................................................................... VII LIST OF FIGURES................................................................................................................................................. XI LIST OF TABLES ................................................................................................................................................. XV LIST OF SYMBOLS AND ABBREVIATIONS ............................................................................................... XVII ACKNOWLEDGMENTS ................................................................................................................................... XIX ABSTRACT ........................................................................................................................................................
    [Show full text]
  • 7–5–02 Vol. 67 No. 129 Friday July 5, 2002 Pages 44757–45048
    7–5–02 Friday Vol. 67 No. 129 July 5, 2002 Pages 44757–45048 VerDate May 23 2002 19:00 Jul 03, 2002 Jkt 197001 PO 00000 Frm 00001 Fmt 4710 Sfmt 4710 E:\FR\FM\05JYWS.LOC pfrm17 PsN: 05JYWS 1 II Federal Register / Vol. 67, No. 129 / Friday, July 5, 2002 The FEDERAL REGISTER is published daily, Monday through SUBSCRIPTIONS AND COPIES Friday, except official holidays, by the Office of the Federal Register, National Archives and Records Administration, PUBLIC Washington, DC 20408, under the Federal Register Act (44 U.S.C. Subscriptions: Ch. 15) and the regulations of the Administrative Committee of Paper or fiche 202–512–1800 the Federal Register (1 CFR Ch. I). The Superintendent of Assistance with public subscriptions 202–512–1806 Documents, U.S. Government Printing Office, Washington, DC 20402 is the exclusive distributor of the official edition. General online information 202–512–1530; 1–888–293–6498 Single copies/back copies: The Federal Register provides a uniform system for making available to the public regulations and legal notices issued by Paper or fiche 202–512–1800 Federal agencies. These include Presidential proclamations and Assistance with public single copies 1–866–512–1800 Executive Orders, Federal agency documents having general (Toll-Free) applicability and legal effect, documents required to be published FEDERAL AGENCIES by act of Congress, and other Federal agency documents of public Subscriptions: interest. Paper or fiche 202–523–5243 Documents are on file for public inspection in the Office of the Federal Register the day before they are published, unless the Assistance with Federal agency subscriptions 202–523–5243 issuing agency requests earlier filing.
    [Show full text]
  • GUME Ime Preduzeća Mesto GEMAX BEOGRAD ENERGOPROJEKT- NISKOGRADN BEOGRAD JAT AIRWAYS BEOGRAD JUGOIMPORT
    GUME Ime preduzeća Mesto GEMAX BEOGRAD ENERGOPROJEKT- NISKOGRADN BEOGRAD JAT AIRWAYS BEOGRAD JUGOIMPORT - SDPR BEOGRAD LASTA BEOGRAD MULTIPARTNER SISTEM BEOGRAD AGAVA BEOGRAD KIA AUTO BEOGRAD DMMB - AGROTEHNIKA BEOGRAD ORTOPEDIJA - NOVI ZIVOT BEOGRAD JUGOTEHNA EKSPORT- IMPORT BEOGRAD CENTAR - BOBAN BEOGRAD CONING BEOGRAD INTER-HERMES TRADE BEOGRAD CONTINENTAL COOP SABAC VALHALL STARA PAZO PRINCE AVIATION BEOGRAD RIKO BEOGRAD LAGER MALI POZAR RADULOVIC BEOGRAD MILUROVIC-KOMERC EXPORT-I UGRINOVCI ELEKTRO LIMEX BEOGRAD I T N BEOGRAD TEKNOXGROUP SRBIJA VRCIN VAJDA BEOGRAD KELENA BORCA AP SPORT BEOGRAD EUROPARK BEOGRAD BEOHEMIJA BEOGRAD TRANS LASA BEOGRAD GUMIMPEX BEOGRAD YUBEL NOVI SAD BALKANCAR BEOGRAD VEKTOR BEOGRAD KEMOIMPEX BEOGRAD UNITEHNA MUDRAKOVAC BALKANPROGRES KRUSEVAC LAGUMA NOVI SAD AGROVOJVODINA EXPORT-IMPO NOVI SAD PROFESIONAL KOPUNOVIC BEOGRAD AGRO - VESTA SOMBOR TEHNOALAT Novi Sad AGROINTER NOVI SAD DELTA MC BEOGRAD AGRODIL BEOGRAD BAZIS GRUPA BEOGRAD TRAYAL KORPORACIJA KRUSEVAC MENEX Krusevac AGROMEHANIKA Leskovac OMNIA Nis CENTAR S BEOGRAD ORSIM BEOGRAD AGROSOM BAJMOK AGROMETAL - TRADE NOVI SAD MASSETEHNIC NOVI SAD SPINEL NOVI SAD AGROHIM NIS BAKI KRAGUJEVAC RTB INVEST BOR NIS EKSPRES NIS KELLER NIS PNEUTECH VRBAS DIJAMANT ZRENJANIN JUGODOM NOVI SAD RES TRADE NOVI SAD CONSUM TM BECEJ NISPRODUKT MRAMORSKO METAL Kanjiza KOSA TRADE VETERNIK GREEN CITY SREMSKA KA TIGOR - TRADE BEOGRAD INTERCOM SUBOTICA GEBI CANTAVIR MICROCER KANJIZA CAJKA - M CACAK ALMEX PANCEVO NOVI DOM-PROMET DEBELJACA BAUERFEIND BEOGRAD MAKO KRAGUJEVAC MLAZMATIK
    [Show full text]
  • Ray Tracing Gems II Next Generation Real-Time Rendering with DXR, Vulkan, and Optix
    Ray Tracing Gems II Next Generation Real-Time Rendering with DXR, Vulkan, and OptiX Edited by Adam Marrs, Peter Shirley, and Ingo Wald Section Editors Per Christensen David Hart Thomas Müller Jacob Munkberg Angelo Pesce Josef Spjut Michael Vance Cem Yuksel Ray Tracing Gems II: Next Generation Real-Time Rendering with DXR, Vulkan, and OptiX Edited by Section Editors Adam Marrs Per Christensen Angelo Pesce Peter Shirley David Hart Josef Spjut Ingo Wald Thomas Müller Michael Vance Jacob Munkberg Cem Yuksel ISBN-13 (pbk): 978-1-4842-7184-1 ISBN-13 (electronic): 978-1-4842-7185-8 https://doi.org/10.1007/978-1-4842-7185-8 Copyright © 2021 by NVIDIA Trademarked names, logos, and images may appear in this book. Rather than use a trademark symbol with every occurrence of a trademarked name, logo, or image we use the names, logos, and images only in an editorial fashion and to the beneft of the trademark owner, with no intention of infringement of the trademark. The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are not identifed as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. While the advice and information in this book are believed to be true and accurate at the date of publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein.
    [Show full text]
  • A Comparison of Optimal Scanline Voxelization Algorithms
    Master of Science Thesis in Computer Science and Software Engineering Department of Electrical Engineering, Linköping University, 2020 A Comparison of Optimal Scanline Voxelization Algorithms Tim Håkansson Master of Science Thesis in Computer Science and Software Engineering A Comparison of Optimal Scanline Voxelization Algorithms: Tim Håkansson LiTH-ISY-EX--20/5307--SE Supervisor: Harald Nautsch isy, Linköping University Åsa Detterfelt MindRoad Jens Ogniewski MindRoad Examiner: Ingemar Ragnemalm isy, Linköping University Division of Information Coding Department of Electrical Engineering Linköping University SE-581 83 Linköping, Sweden Copyright © 2020 Tim Håkansson Abstract This thesis presents a comparison between different algorithms for optimal scan- line voxelization of 3D models. As the optimal scanline relies on line voxelization, three such algorithms were evaluated. These were Real Line Voxelization (RLV), Integer Line Voxelization (ILV) and a 3D Bresenham line drawing algorithm. RLV and ILV were both based on voxel traversal by Amanatides and Woo. The al- gorithms were evaluated based on runtime and the approximation error of the integer versions, ILV and Bresenham. The result was that RLV performed bet- ter in every case, with ILV being 20-250% slower and Bresenham being 20-500% slower. The error metric used was the Jaccard distance and generally started at 20% and grew up towards 25% for higher voxel resolutions. This was true for both ILV and Bresenham. The conclusion was that there is no reason to use any of the integer versions over RLV. As they both performed and approximated the original 3D model worse. iii Acknowledgments I would like to thank my supervisors at Mindroad, Åsa Detterfelt and Jens Og- niewski, for guiding me through this thesis.
    [Show full text]
  • Game Developer
    T H E L E A D I N G G A M E I N D U S T R Y MAGAZINE vo L 1 8 N o 8 se p tem b er 2 0 1 1 I N S I D E : intelligent c ameras S w o rd & S w o R c ery p o STM o RTEM The best ideas evolve. Great ideas don’t just happen. They evolve. Your own development teams think and work fast. Don’t miss a breakthrough. Version everything with Perforce. Software and firmware. Digital assets and games. Websites and documents. More than 5,000 organizations and 350,000 users trust Perforce SCM to version work enterprise-wide. Try it now. Download the free 2-user, non-expiring Perforce Server from perforce.com Or request an evaluation license for any number of users. Perforce Video Game Game Developer page ad.indd 1 06/07/2011 19:14 THE LEADING GAME INDUSTRY MAGAZINE VOL18 NO5 CONTENTS.0911 VOLUME 18 NUMBER 08 MAYM A Y 20112 0 1 1 INSIDE: BROWSER TECH MEGA-ROUNDUP DEPARTMENTS 2 GAME PLAN By Brandon Sheffield [EDITORIAL] The Portable Future 4 HEADS UP DISPLAY [NEWS] The Difference Initiative, HALO 2600 Source Code Released, and Flashback, Recipes, and Zombies POSTMORTEM 31 TOOL BOX By Bradley Meyer [REVIEW] Soundminer HD 14 SECTION 8: PREJUDICE With SECTION 8: PREJUDICE, TimeGate took what was planned as a 35 THE INNER PRODUCT By Nick Darnell [PROGRAMMING] console game and presented it as a $15 downloadable title. Not only Automated Occluders for GPU Culling did the team have to change its way of thinking about pricing and presentation, it also had to work out how to shrink assets and scale 42 THE BUSINESS By David Edery [BUSINESS] the design appropriately to fit within the download limit.
    [Show full text]