Dual Marching Squares: Implementation

Total Page:16

File Type:pdf, Size:1020Kb

Dual Marching Squares: Implementation DUAL MARCHING SQUARES: IMPLEMENTATION AND ANALYSIS USING VTK by MANU GARG A thesis submitted to the Graduate Faculty of the University of Colorado Colorado Springs in partial fulfillment of the requirements for the degree of Master of Science Department of Computer Science 2017 © 2017 MANU GARG ALL RIGHTS RESERVED As is a common practice in Computer Science, journal and conference articles are published based on the MS/Ph.D. thesis work, which means that wording, tables, figures, and sentence structure are sometimes identical in the dissertation document, and journal and conference articles co-authored by the student and their advisor. This thesis for the Master of Science degree by Manu Garg has been approved for the Department of Computer Science by Sudhanshu K. Semwal, Chair T. S. Kalkur Al. Glock Date October 3, 2017 ii Garg, Manu (M.S., Computer Science) Dual Marching Squares: Implementation and Analysis Using VTK Thesis directed by Professor Sudhanshu K. Semwal ABSTRACT In the past few decades’ volume rendering is perhaps one of the most visited research topics in the field of scientific visualization. Since volume datasets are large and require considerable computing power to process, the issue of supporting real time interaction has received much attention. Extracting a polygonal mesh from an existing scalar field identified in the volume data has been the focus since nineteen-eighties. Many algorithms, like Marching Cube, and Marching Square, have been developed to extract the polygonal mesh from the scalar interpretation of the volume data. However, only a few of these techniques claim to solve all known existing problems due to concave nature of the surfaces embedded inside the volume data. Some extract meshes with too many polygons. Many such polygons, with same orientation, could be combined. Sharp features or small detail in the underlying surface could be lost due to polygonal approximation. Other techniques suffer from topological inconsistencies, self- intersections, inter-cell dependencies, and other similar issues. Recently published Dual Marching Squares (DMS) produce smother results in comparison to the Marching Square algorithm. According to best of our knowledge, there has been no other implementations, except the original theoretical research paper on DMS which was published in Feb. 2016. In this thesis, we implement DMS using the VTK pipeline. A comparison of MS and DMS is provided. Keywords: Isosurface, Extraction, Implicit Surfaces, Scalar Field Polygonization, Meshing, Marching Cube, Marching Square, Dual Marching Cube, Dual Marching Square, Volume visualization, Volume Rendering, Computer Graphics. iii TABLE OF CONTENTS CHAPTER I. INTRODUCTION. ……………………..1 II. BACKGROUND. ……………………...6 III. TECHNICAL BACKGROUND. ………………......9 IV. ANALYSIS AND IMPLEMENTATION. ……………... .15 V. RESULTS AND DISCUSSION. …………………30 VI. CONCLUSION AND FUTURE WORK. …………….... ... 34 REFERENCES . ……………………..35 APPENDICES A. Steps to install VTK-Python on Mac…………………………………..38 B. Codes. ………………………...39 C. Code for getting attributes for DICOM file . .……………….. ....42 iv LIST OF TABLES TABLE 5.1 Time taken to run the algorithm to generate the 3D dataset……………..32 v LIST OF FIGURES FIGURE 3.1. A marching square. The points at the corners denote the sample points. In this example, red points are outside the isoline (or isoband) and yellow points inside the isoline. The dotted line, marks the isoline, and the blue color defining the 'inside (Drawn using draw.io)'………………………… 9 3.2 The 16 configurations of the Marching Squares algorithm (Drawn using draw.io…………………………………………………………………………. 10 3.3 The 4 unique configurations of the Marching Squares algorithm, which are necessary to reproduce all others (Drawn using draw.io). 11 ………………………………..…………………………………………… 3.4 The 15 configurations into which the 256 variations of straddling cubes, decompose, in the MC algorithm (Drawn using draw.io). …………………… 11 3.5 The curve achieved by Dual Marching Square (a) compared to Marching Square (b) (Drawn using draw.io). 14 ………………………………..…………………………………………… 4.1 Testing shape for the algorithm………………………………..……………… 15 4.2 First five quad tree level for test data “h” ………………………………..…… 17 4.3 Merging of cells to form larger leaf (green color) after ADFs.…………… 18 4.4 Quad tree created for test shape “h” after ADFs. Leaf cells (Green Color), Empty cells (Grey Color), and Full cells (Back Color). …………………… 19 4.5 Dual grid (Black color) over a primary quadtree (Grey color)…………….. 20 4.6 Vertices (Red color) of the test shape “h” for Dual Marching Square. Leaf cells (Green Color), Empty cells (Grey Color), and Full cells (Back 21 Color). ………………………………..……………………………………………………. 4.7 Left “h” generated using Marching Square. Right “h” generated using Dual Marching Square …………………………………………………………………….. 22 4.8 DICOM file attributes………………………………..…………………………………. 25 vi 5.1 Left Female head_Front Marching Square (duration 0:00:00.246355) Right Female head_Front Dual Marching Square (duration 30 0:00:00.247965) ………………………………..…………………………………… 5.2 Left Female Head_side Marching Square (duration 0:00:00.246355) Right Female Head_side Dual Marching Square (duration 30 0:00:00.247965) ………………………………..……………………………………… 5.3 Left Female Head_back Marching Square (duration 0:00:00.246355), Right Female Head_back Dual Marching Square (duration 31 0:00:00.247965)……………………………..…………………………………………… 5.4 Left Female Eye_ Front Marching Square (duration 0:00:00. 213779), Right Female Eye_Front Dual Marching Square (duration 0:00:00. 31 223355) ………………………………..…………………………………………… 5.5 Left Female Right_Eye_WireFrame Marching Square Square (duration 0:00:00. 213779), Right Female Right_Eye_WireFrame Dual Marching 31 Square (duration 0:00:00. 223355)………………………………..……………… 5.6 Left Female_Ear_Front Marching Square(duration 0:00:00.244979), Right Female_Ear_Front Dual Marching Square(duration 0:00:00. 31 253785) ………………………………..…………………………………………… 5.7 Left Female_Ear_Front Marching Square Wireframe (duration 0:00:00.244979), Right Female_Ear_Front Dual Marching Square WireFrame (duration 0:00:00. 253785) Does not include rendering time, only the mesh generation time is specified in the above table………………… 32 vii LIST OF ABBREVIATIONS • CAD Computer Aided Design • CT Computed Tomography • DC Dual Contouring • DICOM Digital Imaging in Communications and Medicine • DMC Dual Marching Cube • DMS Dual Marching Square • MC Marching Cubes • MRI Magnetic Resonance Imaging • MS Marching Squares • VTK Visualization Toolkit • CSG Constructive Solid Geometry viii CHAPTER I INTRODUCTION “Imagination or visualization, and in particular the use of diagrams, has a crucial part to play in scientific investigation.” - Rene Descartes, 1637. The term visualization, as Ware [1] describes, means the construction of a visual image in the mind (Oxford English Dictionary, 1973). But it has also come to mean something more tangible: the graphical representation of data or concepts in multi- participant virtual environments. Earliest visualizations can be found in Chinese cartography in the year 1137 [2]. For example, Volume 86 of the historical text Records of the Grand Historian (Shi Ji) dated 227 BC has earliest mention of a map. Visualization once was a manually intensive task, involving ink and paper. Sometimes, models were created using stick-and-balls in classrooms and texts. The advent of the computing era has brought in an ability to process, and subsequently visualize, large amounts of data. Real-time interaction provides an ability to concentrate on interpreting and understanding the data. Some believe that human beings will always have vital a role in visualization. This is because ultimately human beings are the one who can perceive the best way of visually representing the volumetric data. Computational Scientific Visualization process works as a tool to aid in this process. Computational Scientific visualization is a framework that enables scientists to computationally analyze, understand, and communicate the numerical data generated by scientific research. In recent years, volume data is being collected at a rate beyond what can be possibly studied and comprehended by a person. Scientific visualization uses computer graphics and Human Computer Interaction (HCI) techniques to process numerical data into two- and three-dimensional visual images. This visualization process includes gathering, processing, displaying, analyzing, and interpreting data. Volume visualization is a set of techniques used to extract meaningful 1 information from volumetric data using image processing and interactive graphics techniques. It helps with the representation of the volume data, modeling, manipulation, and rendering. Volume datasets can be collected by sampling, simulation, or modeling techniques. For example, Computed Tomography (CT) can be used to get a sequence of 2D slices or Magnetic Resonance Imaging (MRI) data set. MRI is a diagnostic tool which can be used to produce detailed 3D model of the inside of the human-body. This technology has also been used for non-destructive inspection of composite materials or mechanical parts. Likewise, the data obtained from confocal microscopes can be visualized to study the morphology of biological structures. Volume visualization can also be used in many computational fields, e.g. computational fluid dynamics (CFD), where results/outcome of simulation generated on a supercomputer can be used to analyze and verify the aspects of fluid flow, including compressible, non-isothermal, non-Newtonian, multiphase, and porous
Recommended publications
  • Pyvista: Managing & Visualizing Geospatial Data Using an Open
    PYVISTA: MANAGING & VISUALIZING GEOSPATIAL DATA USING AN OPEN-SOURCE FRAMEWORK by C. Bane Sullivan c Copyright by C. Bane Sullivan, 2020 All Rights Reserved A thesis submitted to the Faculty and the Board of Trustees of the Colorado School of Mines in partial fulfillment of the requirements for the degree of Master of Science (Hydrol- ogy). Golden, Colorado Date Signed: C. Bane Sullivan Signed: Dr. Whitney J. Trainor-Guitton Thesis Advisor Golden, Colorado Date Signed: Dr. Josh Sharp Professor and Director Hydrologic Science & Engineering Program ii ABSTRACT There is a wide range of data types present in typical hydrogeophysical studies; being able to gather all data types for a given project into a single framework is challenging and often unachievable at an affordable cost for hydrological researchers. Steep licensing fees for commercial software and complex user interfaces in existing open software have limited the accessibility of tools to build, integrate, and make decisions with diverse types of 3D geospa- tial data and models. In earth science research, particularly in hydrology, restricted budgets exacerbate these limitations, creating barriers for using software to manage, visualize, and exchange 3D data in reproducible workflows. In response to these challenges, I have created the PyVista software as an open-source framework for 3D geospatial data management, fu- sion, and visualization. The PyVista Python package provides an accessible and intuitive interface back to a robust and established visualization library, the Visualization Toolkit (VTK), to facilitate rapid analysis and visual integration of spatially referenced datasets. This interface implements spatial data structures encompassing a majority of subsurface applications to make creating, managing, and analyzing spatial data more streamlined for domain scientists.
    [Show full text]
  • Introduction to Medical Image Computing
    1 MEDICAL IMAGE COMPUTING (CAP 5937)- SPRING 2017 LECTURE 1: Introduction Dr. Ulas Bagci HEC 221, Center for Research in Computer Vision (CRCV), University of Central Florida (UCF), Orlando, FL 32814. [email protected] or [email protected] 2 • This is a special topics course, offered for the second time in UCF. Lorem Ipsum Dolor Sit Amet CAP5937: Medical Image Computing 3 • This is a special topics course, offered for the second time in UCF. • Lectures: Mon/Wed, 10.30am- 11.45am Lorem Ipsum Dolor Sit Amet CAP5937: Medical Image Computing 4 • This is a special topics course, offered for the second time in UCF. • Lectures: Mon/Wed, 10.30am- 11.45am • Office hours: Lorem Ipsum Dolor Sit Amet Mon/Wed, 1pm- 2.30pm CAP5937: Medical Image Computing 5 • This is a special topics course, offered for the second time in UCF. • Lectures: Mon/Wed, 10.30am-11.45am • Office hours: Mon/Wed, 1pm- 2.30pm • No textbook is Lorem Ipsum Dolor Sit Amet required, materials will be provided. • Avg. grade was A- last CAP5937: Medical Image Computing spring. 6 Image Processing Computer Vision Medical Image Imaging Computing Sciences (Radiology, Biomedical) Machine Learning 7 Motivation • Imaging sciences is experiencing a tremendous growth in the U.S. The NYT recently ranked biomedical jobs as the number one fastest growing career field in the nation and listed bio-medical imaging as the primary reason for the growth. 8 Motivation • Imaging sciences is experiencing a tremendous growth in the U.S. The NYT recently ranked biomedical jobs as the number one fastest growing career field in the nation and listed bio-medical imaging as the primary reason for the growth.
    [Show full text]
  • An Open-Source, Cross-Platform Multi-Modal Neuroimaging Data Visualization Tool
    ORIGINAL RESEARCH ARTICLE published: 27 March 2009 NEUROINFORMATICS doi: 10.3389/neuro.11.009.2009 DataViewer3D: an open-source, cross-platform multi-modal neuroimaging data visualization tool André Gouws*, Will Woods, Rebecca Millman, Antony Morland and Gary Green Department of Psychology, York NeuroImaging Centre, University of York, UK Edited by: Integration and display of results from multiple neuroimaging modalities [e.g. magnetic resonance Rolf Kötter, Radboud University imaging (MRI), magnetoencephalography, EEG] relies on display of a diverse range of data Nijmegen, The Netherlands within a common, defi ned coordinate frame. DataViewer3D (DV3D) is a multi-modal imaging Reviewed by: Stephen C. Strother, Baycrest, Canada; data visualization tool offering a cross-platform, open-source solution to simultaneous data University of Toronto, Canada overlay visualization requirements of imaging studies. While DV3D is primarily a visualization David Kennedy, Harvard Medical tool, the package allows an analysis approach where results from one imaging modality can School, USA guide comparative analysis of another modality in a single coordinate space. DV3D is built on *Correspondence: Python, a dynamic object-oriented programming language with support for integration of modular André Gouws, York NeuroImaging Centre, University of York, York Science toolkits, and development of cross-platform software for neuroimaging. DV3D harnesses the Park, York YO10 5DG, UK. power of the Visualization Toolkit (VTK) for two-dimensional (2D) and 3D rendering, calling e-mail: [email protected] VTK’s low level C++ functions from Python. Users interact with data via an intuitive interface that uses Python to bind wxWidgets, which in turn calls the user’s operating system dialogs and graphical user interface tools.
    [Show full text]
  • Performing Maximum Intensity Projection with the Visualization Toolkit
    Performing Maximum Intensity Projection with the Visualization Toolkit Stefan Bruckner∗ Seminar Paper The Institute of Computer Graphics and Algorithms Vienna University of Technology, Austria Abstract intensity and the maximum intensity seen through a pixel is pro- jected onto that pixel. It looks more like a search algorithm than a Maximum Intensity Projection (MIP) is a volume rendering tech- traditional volume color/opacity accumulation algorithm. nique commonly used to depict vascular structures. The Visual- MIP is often employed in clinical practice for depicting vascular ization Toolkit (VTK) is an open source, freely available software structures. The data is a set of slices where most areas are dark, but system for 3D computer graphics, image processing, and visual- vessels tend to be brighter. This set is collapsed into a single image ization. In this paper, MIP and related methods are presented and by performing a projection through the set that assigns the bright- VTK's capabilities to use these methods are examined. est voxel over all slices to each pixel in the projection. In contrast Keywords: Visualization Toolkit, VTK, Maximum Intensity Pro- to DVR, MIP does not require the tedious generation of color and jection, MIP opacity transfer functions, but unlike SR it does still display den- sity information. In addition, since datasets usually contain a lot of noise, threshold values for SR, which allow extraction of vascular 1 Introduction structures are difficult to find. This paper gives an overview over MIP and related methods and For many scientific applications three-dimensional arrays of data shows how VTK can be used to perform these techniques efficiently.
    [Show full text]
  • Parallel Ray Tracing in Scientific Visualization
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by The University of Utah: J. Willard Marriott Digital Library PARALLEL RAY TRACING IN SCIENTIFIC VISUALIZATION by Carson Brownlee A dissertation submitted to the faculty of The University of Utah in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science School of Computing The University of Utah December 2012 Copyright © Carson Brownlee 2012 All Rights Reserved The University of Utah Graduate School STATEMENT OF DISSERTATION APPROVAL Carson Brownlee The dissertation of has been approved by the following supervisory committee members: Charles D. Hansen 9/14/12 Chair Date Approved Steven G. Parker 9/14/12 Member Date Approved Peter Shirley 9/14/12 Member Date Approved Claudio T. Silva 9/19/12 Member Date Approved James Ahrens 9/14/12 Member Date Approved Alan Davis and by Chair of the Department of School of Computing and by Charles A. Wight, Dean of The Graduate School. ABSTRACT Ray tracing presents an efficient rendering algorithm for scientific visualization using common visualization tools and scales with increasingly large geometry counts while allowing for accurate physically-based visualization and analysis, which enables enhanced rendering and new visualization techniques. Interactivity is of great importance for data exploration and analysis in order to gain insight into large-scale data. Increasingly large data sizes are pushing the limits of brute-force rasterization algorithms present in the most widely-used visualization software. Interactive ray tracing presents an alternative rendering solution which scales well on multicore shared memory machines and multinode distributed systems while scaling with increasing geometry counts through logarithmic acceleration structure traversals.
    [Show full text]
  • VTK and Adobe Flash
    Visualization of Plasma Edges using VTK and Adobe Flash By LAVESH KUMAR GUPTA A thesis submitted to the Graduate School-New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the degree of Master of Science Graduate Program in Electrical and Computer Engineering written under the direction of Prof Deborah Silver and approved by ________________________ ________________________ ________________________ ________________________ New Brunswick, New Jersey May, 2011 2011 LAVESH KUMAR GUPTA ALL RIGHTS RESERVED Abstract of the Thesis Visualization of Plasma Edges using VTK and Adobe Flash By Lavesh Kumar Gupta Thesis Director: Professor Deborah Silver Visualization is a very useful tool in the study and analysis of huge experimental or simulation datasets. It converts vast amount of numerical data into graphical images, extracts important hidden information and aids scientists in hypothesis building. This thesis focuses on migrating visualization module of Plasma Edge from commercial visualization software AVS to open source visualization library VTK. The VTK visualization module will be integrated in new plasma edge simulation code package at the Center for Plasma Edge Simulation for the study of plasma edge region relevant to both existing magnetic fusion facilities and next generation burning plasma experiments. VTK visualization module generates two set of images: 2D images representing cross- sectional view of 3D torroidal plane, and 3D images representing whole torroidal plane. Two Adobe Flash modules were also developed using open source Adobe Flex to integrate the VTK visualization module with eSimMon dashboard, a front-end tool for simulation monitoring. Using these modules, virtual 3D visualization capability was provided in the dashboard for viewing generated plasma images.
    [Show full text]
  • UC Davis IDAV Publications
    UC Davis IDAV Publications Title Extraction of Crack-free Isosurfaces from Adaptive Mesh Refinement Data Permalink https://escholarship.org/uc/item/4k23g9q1 Authors Weber, Gunther H. Kreylos, Oliver Ligocki, Terry J. et al. Publication Date 2001 Peer reviewed eScholarship.org Powered by the California Digital Library University of California Extraction of Crack-free Isosurfaces from Adaptive Mesh Refinement Data Gunther H. Weber1;2;3, Oliver Kreylos1;3, Terry J. Ligocki3, John M. Shalf 3;4, Hans Hagen2, Bernd Hamann1;3, and Kenneth I. Joy1 1 Center for Image Processing and Integrated Computing (CIPIC), Department of Computer Science, University of California, Davis 2 Department of Computer Science, University of Kaiserslautern, Germany 3 National Energy Research Scientific Computing Center (NERSC), Lawrence Berkeley National Laboratory, Berkeley 4 National Center for Supercomputing Applications (NCSA), University of Illinois, Urbana-Champaign Abstract. Adaptive mesh refinement (AMR) is a numerical simulation technique used in computational fluid dynamics (CFD). It permits the efficient simulation of phenomena characterized by substantially varying scales in complexity of local behavior of certain variables. By using a set of nested grids at different resolu- tions, AMR combines the simplicity of structured rectilinear grids with the possi- bility to adapt to local changes in complexity and spatial resolution. Hierarchical representations of scientific data pose challenges when isosurfaces are extracted. Cracks can arise at the boundaries between regions represented at different res- olutions. We present a method for the extraction of isosurfaces from AMR data that avoids cracks at the boundaries between levels of different resolution. 1 Introduction AMR was introduced to computational physics by Berger and Oliger [3] in 1984.
    [Show full text]
  • Using Visualization to Understand the Behavior of Computer Systems
    USING VISUALIZATION TO UNDERSTAND THE BEHAVIOR OF COMPUTER SYSTEMS A DISSERTATION SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE AND THE COMMITTEE ON GRADUATE STUDIES OF STANFORD UNIVERSITY IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY Robert P. Bosch Jr. August 2001 c Copyright by Robert P. Bosch Jr. 2001 All Rights Reserved ii I certify that I have read this dissertation and that in my opinion it is fully adequate, in scope and quality, as a dissertation for the degree of Doctor of Philosophy. Dr. Mendel Rosenblum (Principal Advisor) I certify that I have read this dissertation and that in my opinion it is fully adequate, in scope and quality, as a dissertation for the degree of Doctor of Philosophy. Dr. Pat Hanrahan I certify that I have read this dissertation and that in my opinion it is fully adequate, in scope and quality, as a dissertation for the degree of Doctor of Philosophy. Dr. Mark Horowitz Approved for the University Committee on Graduate Studies: iii Abstract As computer systems continue to grow rapidly in both complexity and scale, developers need tools to help them understand the behavior and performance of these systems. While information visu- alization is a promising technique, most existing computer systems visualizations have focused on very specific problems and data sources, limiting their applicability. This dissertation introduces Rivet, a general-purpose environment for the development of com- puter systems visualizations. Rivet can be used for both real-time and post-mortem analyses of data from a wide variety of sources. The modular architecture of Rivet enables sophisticated visualiza- tions to be assembled using simple building blocks representing the data, the visual representations, and the mappings between them.
    [Show full text]
  • Visualization of Calendar Data
    FAKULTÄT FÜR !NFORMATIK Visualization of Calendar Data DIPLOMARBEIT zur Erlangung des akademischen Grades Diplom-Ingenieur im Rahmen des Studiums Informatik eingereicht von Philipp Rudolf Hartl Matrikelnummer 0025681 an der Fakultät für Informatik der Technischen Universität Wien Betreuung Betreuer: Ao.Univ.Prof. Dipl.-Ing. Dr.techn. Eduard Gröller Mitwirkung: Dipl.-Ing. Dr.techn. Matej Mlejnek Wien, 27.10.2008 (Unterschrift Verfasser) (Unterschrift Betreuer) Technischen Universität Wien A-1040 Wien Karlsplatz 13 Tel. +43/(0)1/58801-0 http://www.tuwien.ac.at Philipp Hartl Visualization of Calendar Data Diploma Thesis supervised by Ao.Univ.Prof. Dipl.-Ing. Dr.techn. Eduard Gröller Dipl.-Ing. Dr.techn. Matej Mlejnek Institute of Computer Graphics and Algorithms Vienna University of Technology Abstract Since many centuries, calendars are used to organize appointments, events and tasks. In this thesis interaction and visualization techniques for calendar data are presented, which do not only support the organization and analysis, but also facilitate and im- prove them. The basis of the solution is a 3D heightfield visualization, which displays the workloads of time slots over periods of time in a compact manner. Thereon, inter- action and visualization techniques are used to investigate the data set for regularities and irregularities. The comparison of data sets while planning events is just as im- portant as the integration of fuzzy tasks into one’s schedule and their manipulation. The visualization and exploration process is completed by statistical representations showing trends and patterns. The use of these techniques and the combination of them are presented with the help of real examples. Kurzfassung Seit Anbeginn der Zeit werden Kalender benutzt, um Aufgaben und Termine zu or- ganisieren.
    [Show full text]
  • Generic Caching Library and Its Use for VTK-Based Real-Time Simulation and Visualization Systems
    Generic Caching Library and Its Use for VTK-based Real-time Simulation and Visualization Systems Luka´sˇ Hruda1 and Josef Kohout2 1Department of Computer Science and Engineering, Faculty of Applied Sciences, University of West Bohemia, Univerzitn´ı 8, Pilsen, Czech Republic 2NTIS - New Technologies for the Information Society, Faculty of Applied Sciences, University of West Bohemia, Univerzitn´ı 8, Pilsen, Czech Republic Keywords: Cache, Memoization, VTK, Visualization. Abstract: In many visualization applications, physics-based simulations are so time consuming that desired real-time manipulation with the visual content is not possible. Very often this time consumption can be prevented by using some kind of caching since many of the processes in these simulations repeat with the same inputs pro- ducing the same output. Creating a simple caching mechanism for cases where the order of the data repetition is known in advance is not a very difficult task. But in reality, the data repetition is often unpredictable and in such cases some more sophisticated caching mechanism has to be used. This paper presents a novel generic caching library for C++ language that is suitable for such situations. It also presents a wrapper that simplifies the usage of this library in the applications based on the popular VTK visualization tool. Our experiments show that the developed library can speed up VTK based visualizations significantly with a minimal effort. 1 INTRODUCTION sary repetition occurs, some form of caching can be used to prevent it, at least partially. The VTK (Visualization Toolkit) (Schroeder et al., Although the VTK has been under development 2004) is a very popular tool for visualizing various for many years, its caching possibilities still seem to types of data and information, usually scientific.
    [Show full text]
  • Bioimagesuite Manual 95522 2
    v2.6 c Copyright 2008 X. Papademetris, M. Jackowski, N. Rajeevan, R.T. Constable, and L.H Staib. Section of Bioimaging Sciences, Dept. of Diagnostic Radiology, Yale School of Medicine. All Rights Reserved ii Draft July 18, 2008 v2.6 Contents I A. Overview 1 1. Introduction 2 1.1. BioImage Suite Functionality . 3 1.2. BioImage Suite Software Infrastructure . 4 1.3. A Brief History . 4 2. Background 6 2.1. Applications of Medical Imaging Analysis: A Brief Overview . 6 2.2. Medical Image Processing & Analysis . 8 2.3. Software Development Related to Medical Image Analysis . 9 2.4. 3D Graphics and Volume Rendering . 11 3. Starting and Running BioImage Suite 18 3.1. Installation Overview . 18 3.2. Installation Instructions . 19 3.3. The Main BioImage Suite Menu . 22 3.4. Preferences Editor . 23 4. Application Structure 26 4.1. Application Structure Overview . 26 4.2. The File Menu . 27 4.3. The Display Menu . 31 5. Looking At Images 32 5.1. Image Formats . 32 5.2. The Viewers . 33 5.3. The Colormap Editor . 37 5.4. Coordinates for NeuroImaging . 39 5.5. Atlas Tools . 44 6. Advanced Image Visualization 47 6.1. 4D Images . 47 6.2. 3D Rendering Controls . 48 6.3. Volume Rendering . 48 6.4. Oblique Slices . 53 6.5. The Animation Tool . 54 iii Draft July 18, 2008 CONTENTS v2.6 II B. Anatomical Image Analysis 59 7. The Image Processing and Histogram Tools 60 7.1. Introduction . 60 7.2. “Image” and “Results” . 61 7.3. Histogram Control . 62 7.4.
    [Show full text]
  • Improved Visualization of Rock Carvings
    IT 16 089 Examensarbete 15 hp November 2016 Improved Visualization of Rock Carvings Filip Hedman Institutionen för informationsteknologi Department of Information Technology Abstract Improved Visualization of Rock Carvings Filip Hedman Teknisk- naturvetenskaplig fakultet UTH-enheten Digitizing rock carvings is a way to archive historically important sites and to make the data available for interpretation all around the world. Laser scanning has become Besöksadress: a very useful tool to capture the details of the rocks, and this thesis aim to answer Ångströmlaboratoriet Lägerhyddsvägen 1 how we can use different filters on the captured 3D data to visualize patterns from Hus 4, Plan 0 the rock carvings, while minimizing the noise from the surrounding geometry. Different coloring methods are evaluated to accentuate the rock carvings, while a Postadress: median filter is implemented to reduce the noise of the renderings. The results show Box 536 751 21 Uppsala that it is indeed possible to perform this kind of visualization, and that some methods are more suitable for the task than others. The results of this thesis will hopefully Telefon: make the choice of method easier for other researchers in forthcoming projects. 018 – 471 30 03 Telefax: 018 – 471 30 00 Hemsida: http://www.teknat.uu.se/student Handledare: Filip Malmberg Ämnesgranskare: Anders Hast Examinator: Olle Gällmo IT 16 089 Tryckt av: Reprocentralen ITC Contents 1 Introduction 8 2 Background 10 2.1 Galician rock carvings . 10 2.2 Traditional methods used in archeology . 11 2.3 Laser scanning . 11 2.4 Surface reconstruction from point clouds . 12 2.5 Visualization Toolkit . 13 2.6 PLY 3D format .
    [Show full text]