GEOMETRY REDUCTION IN ROOM ACOUSTICS MODELING

Size: px
Start display at page:

Download "GEOMETRY REDUCTION IN ROOM ACOUSTICS MODELING"

Transcription

1 GEMETR REDUCTIN IN RM ACUSTICS MDELING S Siltanen T Lokki L Savioja Helsinki Univ. of Tech., Telecommunications Software and Multimedia Lab., Finland Helsinki Univ. of Tech., Telecommunications Software and Multimedia Lab., Finland also with Akukon Consulting Engineers Ltd, Finland Helsinki Univ. of Tech., Telecommunications Software and Multimedia Lab., Finland INTRDUCTIN In the design of concert halls and other acoustically demanding spaces computer models form an essential part. Currently, the 3D models for room acoustics prediction are created manually, by inserting vertices and surfaces one by one to the model. Manual construction of the model guarantees that models are suitable for room acoustics prediction software and that models contain acoustically relevant information. However, the model construction process is time consuming and hard work. It would be nice if acousticians could apply the same 3D models as other designers e.g., the models created for visualization purposes. Unfortunately, such models usually are impractical for acoustics prediction since they are very complex containing too many polygons and irrelevant small details. In this paper we propose an automatic geometry reduction method that can take a complex 3D model and convert it to a reasonable acoustic model. Such automatic reduction gives acoustic consultants possibility to quickly verify the designs of architects. In addition, the reduction can be applied in games and virtual reality applications, in which real time sound rendering is essential.. Room Acoustics Modeling There are several methods for modeling room acoustics,2. Finite element method (FEM) and boundary element method (BEM) try to solve the wave equation numerically. They are at their best when modeling low frequency behavior of sound. n the other hand, geometrical room acoustics modeling methods try to model the sound propagation by representing the sound as rays. In statistical methods a large number of rays is sent from the sound sources and their directions are determined by probabilities. The rays hitting the listener are considered audible. In this approach some reflection paths might get omitted. Image source method is based on recursively mirroring the sound sources against each surface in the model thus creating image sources. This way the specular reflection paths of the sound can be modeled accurately. However, as the order of the reflections increases, the number of image sources grows exponentially 3. Thus the image source method can be applied only to simple models or the order of reflections has to be very low. To be able to model the acoustics of complex room models, the geometry of the models should be reduced. There exists several algorithms for geometry reduction, but none of them is specially tailored for the needs of geometrical room acoustics modeling. This paper represents a geometry reduction method, the goal of which is to provide simple acoustic model which retains the essential acoustical properties of the room as accurately as possible..2 Previous Work There has been extensive research in the area of model simplification. However, only a few highly relevant works from acoustics point of view exist and they are represented here. Andújar and Brunet described a framework for polyhedral simplification and mentioned its applicability to acoustics modeling 4. The framework is roughly applied in the algorithm proposed in this paper as Page 409

2 well. They also presented two simplification algorithms based on their framework. Later they have still improved the algorithms 5. He et al. introduced an algorithm in which polygonal models are sampled into a density grid and an isosurface extraction algorithm is used to create the new surface 6. Later they improved the algorithm by making the volume structure hierarchical 7. Nooruddin and Turk proposed another volume raster based algorithm which can be applied both for repairing and simplifying polygonal models 8. 2 VLUMETRIC GEMETR REDUCTIN Reducing the geometry of a room model involves removing insignificant details while preserving the overall appearance of the model. To be more specific, it is necessary to choose the properties which are the most important from the acoustics modeling point of view. Volume of the model is one of the most important properties to preserve, because changing it affects many acoustical parameters. Volume preservation also helps to keep the dimensions of the model unchanged. The absorption area of the room should also change as little as possible. In addition to the area of the surfaces in the model, the materials of the surfaces must be taken account. Therefore it might be necessary to blend the materials appropriately when several polygons are replaced with one bigger polygon. This paper presents a novel technique for geometry reduction of models used in acoustics modeling. The method, described in the following sections, consists of two phases: topology simplification and surface simplification. The reduction process is illustrated in Fig.. Figure : Geometry reduction process is divided into topology and surface simplification. 2. Topology Simplification In the topology simplification part of the method, the complex room model is decomposed into a volumetric structure and then the surface is reconstructed. The purpose of this process is to remove details which would prevent further simplification when using mere surface simplification algorithms. Such details include small holes, cracks, and spikes which are acoustically insignificant. The volumetric structure chosen for the topology simplification was an octree 9 which is a widely applied spatial data structure 0. The input model is assumed to consist of a polygon mesh. The polygons are inserted into the octree. The depth of the octree is limited, so that the smallest cells are of the desired size. The maximum distance from the reduced surface of the original surface is the diagonal of the smallest cell size. Thus the error can be bounded. The surface is reconstructed, to form an intermediate model, by using a variant of the marching cubes algorithm. The marching cubes algorithm constructs an isosurface for a threshold density. The density is used both to determine whether a corner of a cubic cell is inside the object and to locate the isosurface position along the edges of the cell. However, there are no density values in the octree containing polygons. To determine whether a corner of a cell should be inside or outside the isosurface, one could cast rays from each corner to several directions, calculate the number of surface intersections along each ray, and utilize that information as proposed by Nooruddin and Turk 8. However, this is computationally expensive and unreliable when the initial models are not composed of closed surfaces, which is the case with typical room models. Thus, a simpler and Page 40

3 more reliable approach was used in which a corner is inside the isosurface if the adjacent octree cell in the direction of positive coordinate axis is occupied. The minor inaccuracy caused by this approximation can be compensated while positioning the surface along the edges of the cell. The surface position along the edges of the cell is determined by casting a ray along the edge and finding the first and the last intersection, and then using the average of these values. This results in a good approximation in most cases, especially when there is only one intersection which is the most common case. Alternatively, the surface positions can be clamped to the octree cell boundaries to favor surfaces along the coordinate axis, which are common in typical room models. The newly reconstructed surfaces build an intermediate model, as illustrated in Fig.. However, the new surfaces may contain a large number of small coplanar polygons due to the marching cubes algorithm. Thus, to minimize the number of polygons in the final model the surface simplification step is necessary. 2.2 Surface Simplification During the surface simplification phase the geometric optimization algorithm by Hinker and Hansen 2 is applied. The algorithm merges coplanar polygons by collecting them into coplanar sets using representative trees 3, removing the edges shared by any two polygons in a set, tracing the remaining borders, and re triangulating the polygons defined by those borders. The re triangulation step is not needed if the simplified model is allowed to consist of arbitrary polygons. Surface simplification does not cause significant errors in geometry, because only nearly coplanar polygons are merged. However, coplanar polygons might have different materials and they cannot be joined together directly. Therefore the material blending is performed by weighting the material properties by the areas of the polygons, i.e., the material properties are assumed to behave linearly. 3 EVALUATIN F THE PRPSED ALGRITHM The above described geometry reduction process was done for a detailed concert hall model, created for visualization purposes. The original model, containing 7377 polygons and the reduced versions of it are illustrated in Fig. 2. It can be seen that the visual appearance of the model is conserved quite well during the reduction, but naturally the radical reduction rates violate the original model quite a lot. In this section the performance of the reduction is evaluated. The computation times of different reduction rates are presented and the quality of the reduction from acoustics point of view is assessed by computing room acoustical parameters with the reduced geometries. 3. Algorithm Performance The computation times of a non optimized version of the reduction can be seen in Table. It is apparent that the coarse reduction levels can be produced very quickly, but as the reduction rate decreases the reduction times increase rapidly. However, the computation times are still short compared to the manual construction of a model for example in a concert hall design project. Reduction % 4,2 23,0 47,4 63,3 7,6 8,4 87,3 92,9 96,3 97,2 99,8 Topology simpl. (s) Surface simpl. (s) Total (s) Table : Reduction times with different volume raster resolutions. The reduction algorithm was run on a PC with 2,8 GHz Pentium IV processor and GB of RAM. The original model consisted of 7377 polygons and it is depicted in Fig. 2. Page 4

4 Proceedings of the Institute of Acoustics Figure 2: A few reduced models: the original model, containing 7377 polygons is marked with reduction rate of 0.0%. Page 42

5 3.2 Acoustical validation of the geometry reduction The performance of the proposed geometry reduction can be validated by making room acoustical simulations in different geometries and computing room acoustical attributes. The easiest way to do such a comparison is to perform calculations both in the detailed (original) and reduced models with well known commercial room acoustic prediction software. In this study we applied deon 5.0 for this purpose. Unfortunately, deon was not able to handle our original model, since it contains too many vertices and polygons. The reduced models could be simulated and in this section we show and discuss the simulation results obtained with different degrees of reduction. Six reduced models of the original concert hall model were chosen for the study. The properties of these models are collected to Table 2 and the models are depicted in Fig. 3. Name of the model hall900 hall928 hall964 hall98 hall990 hall996 Reduction % 90,0 92,8 96,4 98, 99,0 99,6 Number of surfaces Table 2: Properties of the models applied in the performance validation. Figure 3: All six reduced models in deon 5.0 software, two top rows from left hall900, hall928, and hall964. Two bottom rows from left hall98, hall990, and hall996. The blue area indicates the volume of the hall, i.e., the volume where rays propagate and reflect from surfaces. The set of acoustical parameters for comparison was chosen to include reverberation time (RT60), clarity (C80), and lateral energy fraction (LF). We assume that these parameters give good estimate Page 43

6 to verify that the acoustical and spatial properties of the models are conserved during the reduction process. Additional parameters such as early decay time, center time, strength, or definition were not considered to give more information on the quality of the reduction method, although they usually are important parameters in room acoustics design. The computation was performed in all six models with three source positions at the stage of the hall and three receiver positions in the audience area. The source and receiver positions were exactly the same in each model. Thus, with each model, nine responses in total were calculated and the presented results were averaged over nine values Simulation results The reverberation times were computed with two different ways. First, the theoretical reverberation time was computed with the well know Sabine equation RT60 = 0.6V/A, where V is the volume of the enclosure and A is the absorption area. Figure 4a shows the results at different octave bands as a function of reduction rate. The prediction results given by the deon software are represented in Fig. 4b. Simulated C80 values are plotted equally in Fig. 4c. Figures 4d 4f illustrate the average LF values in each receiver position. Since the reduction should not affect the acoustic properties of the model, all the values should be constant in relation to the reduction rate. a b c d e f Figure 4: Results of the simulations performed with six different reduction rates. 4 DISCUSSIN There are many issues to discuss related to the proposed reduction algorithm. First, the properties of the algorithm are considered and then the validation results are discussed in more detail. Page 44

7 4. Properties of the reduction algorithm The acoustical properties were prone to changes in the volume and absorption area of the room. Thus, such properties should have been preserved as accurately as possible. It is obvious that merging several small objects into a bigger one decreases the surface area. This can be compensated in materials by increasing the absorption coefficients appropriately. The volume of the objects tend to increase in merging which means that the volume of the sound transmitting medium decreases. Incidentally, these changes in volumes and absorption areas cancel each other in the reverberation time calculations at certain reduction rates. During the topology simplification phase the orientation of the original surfaces is lost, because the intermediate data structure is volume based, not surface based. nly surfaces which are axisaligned to the bounding box of the object retain their orientations well. In the surface simplification phase of the method, there is a trade off between quality and reduction rate. If the tolerance used in merging nearly coplanar regions is high, the model can be reduced more, but the directional properties of the reflecting surfaces suffer. n the other hand, strictly preserving the surface orientations prevents drastic simplifications and is not even sensible, because the topology simplification phase has already disturbed the orientations. 4.2 Validation results Since the original model could not be applied in the simulation, it is quite hard to validate how accurate results the reduced models give. However, it is interesting to compare simulation results between the different reduction rates. In optimal situation all reduced models should give exactly the same results, since source and receiver positions as well as computation parameters were kept constant. The theoretical reverberation times computed with the Sabine equations are not the same with all six models. As seen in Fig. 4a, the two coarsest reductions are too much reduced since the reverberation times differ significantly from the others. The same trend can be seen with the RT60 values predicted with deon software. The error is greatest at lower frequencies, because the absorption coefficients of the materials are small and thus the relative error caused by material blending during the reduction is high. Based on predicted RT60 values it could also be stated that the most accurate models (hall900 and hall928) seem to contain too many tiny polygons for ray based room acoustics prediction. The basic assumption for ray acoustics surface area is big compared to the wave length of sound is not true anymore. Clarity values seem to be reasonable also with hall964 and hall98 models, but without a reference it is impossible to say anything about the prediction accuracy. However, the predicted values are in the range of typical C80 values for a concert hall. Lateral energy fractions are presented in all three receiver positions separately. The LF values are most sensitive to the reduction, because the original orientations of the surfaces are lost in the topology simplification phase. Since the hall is traditional shoe box hall and it is not very wide, the LF values should be over 0.20 in the audience area. In receiver positions R2 and R3, Figs. 4e and 4f, predicted values are at good range with all models, but in position R values are quite low. nce again, it has to be concluded that without a reference it is hard to say very much about the correctness of these results. ne possible error source for all reduced geometries can be explained as follows. The volume reduction preserves the volume of the hall, but portions of the total volume are isolated as the separated boxes around the main hall, as seen in Fig. 3. Since the reduction algorithm produces always watertight volumes the rays remain inside the main volume (the hall). This problem can not easily be overcome, since the original model was not watertight and contained additional spaces such as ceiling air ducts and backstage. The consequence of the separation of total volume in Page 45

8 smaller volumes is that the volume of the main space becomes too small. Since the absorption area does not change significantly, the computed reverberation times seem to be too small compared to the Sabine values. 5 CNCLUSINS The proposed algorithm for geometry reduction is based on the volumetric reconstruction. It preserves the volume of the modeled space while reducing the acoustically irrelevant small details from the complex model. Therefore, the acoustical properties of the space should be conserved well. The automatic geometry reduction is not yet reliable enough for concert hall design purposes. As a conclusion it must be said that the best acoustical model can still be obtained manually. When an experienced acoustician makes a model, the result is a simple and well parameterized model with which reliable predictions can be made. However, automatic geometry reduction could be applied in projects when designs of the architects need to be quickly evaluated. Already constructed computer models, e.g. for visualization purposes, could be applied also in acoustics prediction. Without geometry reduction, visualization models are too complex for current room acoustic prediction software. Although the presented geometry reduction method is already applicable in some cases, it could be made to be more robust. ne improvement would be to detect surfaces which are outside the main space, which contains the sound sources and receivers, and remove them from the model. The absorption coefficients of the materials could be adjusted to compensate the diminishing surface areas in some cases. Also surface orientations saved in the volumetric structure could be utilized in the surface reconstruction phase, which would not only help to preserve the orientations but also to position the reconstructed surface more accurately thus preventing significant errors in volumes. 6 REFERENCES. L. Savioja, J. Huopaniemi, T. Lokki, and R. Väänänen, Creating interactive virtual acoustics environments, Journal of the Audio Engineering Society, 47(9) , (999). 2. U. Svensson and U. Kristiansen, Computational modeling and simulation of acoustic spaces, Proc. AES 22nd Int. Conf. on Virtual, Synthetic and Entertainment Audio, 30, Espoo, Finland (2002). 3. H. Kuttruff, Room Acoustics, 4th ed. Spon Press (2000). 4. C. Andújar and P. Brunet, The discretized polyhedra simplification (dps): A framework for polyhedra simplification based on decomposition schemes, Universitat Politecnica de Catalunya, Tech. Rep. LSI 99 3 R, also available as 3.ps.gz (999). 5. C. Andújar, P. Brunet, and D. Ayala, Tolopogy reducing surface simplification using a discrete solid representation, ACM Transactions on Graphics (TG) 2(2) (2002). 6. T. He, L. Hong, A. Varshney, and S. W. Wang, Voxel based object simplification, in Proc. of Visualization'95, , (995). 7. T. He, L. Hong, and A. Varshney, Controlled topology simplification, IEEE Trans. Vis. Comput. Graph. 2(2) 7 84, (996). 8. F. S. Nooruddin and G. Turk, Simplification and repair of polygonal models using volumetric techniques, GVU Center, Georgia Institute of Technology, Tech. Rep. GIT GVU 99 37, (999). 9. A. S. Glassner, Space subdivision for fast ray tracing, IEEE Computer Graphics & Applications, 4(0) 5 22, (984). 0. H. Samet, The design and analysis of spatial data structures. AddisonWesley, (990).. W. E. Lorensen and H. E. Cline, Marching cubes: A high resolution 3D surface construction algorithm, ACM SIGGRAPH Computer Graphics, 2(4) 63 69, (987). 2. P. Hinker and C. Hansen, Geometric optimization, in Proc. of Visualization 93, 89 95, (993). 3. D. Salesin and F. Tampieri, Grouping nearly coplanar polygons into coplanar sets, in Graphics Gems III, Academic Press, (992). Page 46

Visualizing diffraction of a loudspeaker enclosure

Visualizing diffraction of a loudspeaker enclosure Visualizing diffraction of a loudspeaker enclosure V. Pulkki T. Lokki Laboratory of Acoustics and Audio Signal Processing Telecommunications Software and Multimedia Laboratory Helsinki University of Technology,

More information

THE EFFECT OF EARLY REFLECTIONS ON PERCEIVED TIMBRE ANALYZED WITH AN AUDITORY MODEL. Tapio Lokki, Ville Pulkki, and Lauri Savioja

THE EFFECT OF EARLY REFLECTIONS ON PERCEIVED TIMBRE ANALYZED WITH AN AUDITORY MODEL. Tapio Lokki, Ville Pulkki, and Lauri Savioja Proceedings of the 22 International Conference on Auditory Display, Kyoto, Japan, July 2-, 22 THE EFFECT OF EARLY REFLECTIONS ON PERCEIVED TIMBRE ANALYZED WITH AN AUDITORY MODEL Tapio Lokki, Ville Pulkki,

More information

Room Acoustics. CMSC 828D / Spring 2006 Lecture 20

Room Acoustics. CMSC 828D / Spring 2006 Lecture 20 Room Acoustics CMSC 828D / Spring 2006 Lecture 20 Lecture Plan Room acoustics basics Structure of room impulse response Characterization of room acoustics Modeling of reverberant response Basics All our

More information

Acoustic Simulation. COMP 768 Presentation Lakulish Antani April 9, 2009

Acoustic Simulation. COMP 768 Presentation Lakulish Antani April 9, 2009 Acoustic Simulation COMP 768 Presentation Lakulish Antani April 9, 2009 Acoustic Simulation Sound Synthesis Sound Propagation Sound Rendering 2 Goal Simulate the propagation of sound in an environment

More information

Topology Preserving Tetrahedral Decomposition of Trilinear Cell

Topology Preserving Tetrahedral Decomposition of Trilinear Cell Topology Preserving Tetrahedral Decomposition of Trilinear Cell Bong-Soo Sohn Department of Computer Engineering, Kyungpook National University Daegu 702-701, South Korea bongbong@knu.ac.kr http://bh.knu.ac.kr/

More information

Scalar Algorithms: Contouring

Scalar Algorithms: Contouring Scalar Algorithms: Contouring Computer Animation and Visualisation Lecture tkomura@inf.ed.ac.uk Institute for Perception, Action & Behaviour School of Informatics Contouring Scaler Data Last Lecture...

More information

Open Topology: A Toolkit for Brain Isosurface Correction

Open Topology: A Toolkit for Brain Isosurface Correction Open Topology: A Toolkit for Brain Isosurface Correction Sylvain Jaume 1, Patrice Rondao 2, and Benoît Macq 2 1 National Institute of Research in Computer Science and Control, INRIA, France, sylvain@mit.edu,

More information

Level Set Extraction from Gridded 2D and 3D Data

Level Set Extraction from Gridded 2D and 3D Data Level Set Extraction from Gridded 2D and 3D Data David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International

More information

Lecture notes: Object modeling

Lecture notes: Object modeling Lecture notes: Object modeling One of the classic problems in computer vision is to construct a model of an object from an image of the object. An object model has the following general principles: Compact

More information

Efficient Representation and Extraction of 2-Manifold Isosurfaces Using kd-trees

Efficient Representation and Extraction of 2-Manifold Isosurfaces Using kd-trees Efficient Representation and Extraction of 2-Manifold Isosurfaces Using kd-trees Alexander Greß gress@cs.uni-bonn.de Reinhard Klein rk@cs.uni-bonn.de University of Bonn Institute of Computer Science II

More information

A Developer s Survey of Polygonal Simplification algorithms. CS 563 Advanced Topics in Computer Graphics Fan Wu Mar. 31, 2005

A Developer s Survey of Polygonal Simplification algorithms. CS 563 Advanced Topics in Computer Graphics Fan Wu Mar. 31, 2005 A Developer s Survey of Polygonal Simplification algorithms CS 563 Advanced Topics in Computer Graphics Fan Wu Mar. 31, 2005 Some questions to ask Why simplification? What are my models like? What matters

More information

Volume Illumination, Contouring

Volume Illumination, Contouring Volume Illumination, Contouring Computer Animation and Visualisation Lecture 0 tkomura@inf.ed.ac.uk Institute for Perception, Action & Behaviour School of Informatics Contouring Scaler Data Overview -

More information

MODELLING OF ROOM ACOUSTIC PARAMETERS USING MLS TECHNIQUE AND NUMERICAL SIMULATION

MODELLING OF ROOM ACOUSTIC PARAMETERS USING MLS TECHNIQUE AND NUMERICAL SIMULATION MODELLING OF ROOM ACOUSTIC PARAMETERS USING MLS TECHNIQUE AND NUMERICAL SIMULATION Marcio A. Gomes and Samir N. Y. Gerges Federal University of Santa Catarina - Mechanical Engineering Department Acoustics

More information

coding of various parts showing different features, the possibility of rotation or of hiding covering parts of the object's surface to gain an insight

coding of various parts showing different features, the possibility of rotation or of hiding covering parts of the object's surface to gain an insight Three-Dimensional Object Reconstruction from Layered Spatial Data Michael Dangl and Robert Sablatnig Vienna University of Technology, Institute of Computer Aided Automation, Pattern Recognition and Image

More information

Efficient View-Dependent Sampling of Visual Hulls

Efficient View-Dependent Sampling of Visual Hulls Efficient View-Dependent Sampling of Visual Hulls Wojciech Matusik Chris Buehler Leonard McMillan Computer Graphics Group MIT Laboratory for Computer Science Cambridge, MA 02141 Abstract In this paper

More information

DAAD: A New Software for Architectural Acoustic Design

DAAD: A New Software for Architectural Acoustic Design The 33 rd International Congress and Exposition on Noise Control Engineering DAAD: A New Software for Architectural Acoustic Design Enis Ozgur a, Feridun Ozis b, Adil Alpkocak a a Dokuz Eylul University,

More information

An Efficient Visual Hull Computation Algorithm

An Efficient Visual Hull Computation Algorithm An Efficient Visual Hull Computation Algorithm Wojciech Matusik Chris Buehler Leonard McMillan Laboratory for Computer Science Massachusetts institute of Technology (wojciech, cbuehler, mcmillan)@graphics.lcs.mit.edu

More information

Homework 1: Implicit Surfaces, Collision Detection, & Volumetric Data Structures. Loop Subdivision. Loop Subdivision. Questions/Comments?

Homework 1: Implicit Surfaces, Collision Detection, & Volumetric Data Structures. Loop Subdivision. Loop Subdivision. Questions/Comments? Homework 1: Questions/Comments? Implicit Surfaces,, & Volumetric Data Structures Loop Subdivision Shirley, Fundamentals of Computer Graphics Loop Subdivision SIGGRAPH 2000 course notes Subdivision for

More information

Fast Interactive Region of Interest Selection for Volume Visualization

Fast Interactive Region of Interest Selection for Volume Visualization Fast Interactive Region of Interest Selection for Volume Visualization Dominik Sibbing and Leif Kobbelt Lehrstuhl für Informatik 8, RWTH Aachen, 20 Aachen Email: {sibbing,kobbelt}@informatik.rwth-aachen.de

More information

Isosurface Rendering. CSC 7443: Scientific Information Visualization

Isosurface Rendering. CSC 7443: Scientific Information Visualization Isosurface Rendering What is Isosurfacing? An isosurface is the 3D surface representing the locations of a constant scalar value within a volume A surface with the same scalar field value Isosurfaces form

More information

SURFACE CONSTRUCTION USING TRICOLOR MARCHING CUBES

SURFACE CONSTRUCTION USING TRICOLOR MARCHING CUBES SURFACE CONSTRUCTION USING TRICOLOR MARCHING CUBES Shaojun Liu, Jia Li Oakland University Rochester, MI 4839, USA Email: sliu2@oakland.edu, li4@oakland.edu Xiaojun Jing Beijing University of Posts and

More information

Efficient Representation and Extraction of 2-Manifold Isosurfaces Using kd-trees

Efficient Representation and Extraction of 2-Manifold Isosurfaces Using kd-trees Efficient Representation and Extraction of 2-Manifold Isosurfaces Using kd-trees Alexander Greß and Reinhard Klein University of Bonn Institute of Computer Science II Römerstraße 164, 53117 Bonn, Germany

More information

RT 3D FDTD Simulation of LF and MF Room Acoustics

RT 3D FDTD Simulation of LF and MF Room Acoustics RT 3D FDTD Simulation of LF and MF Room Acoustics ANDREA EMANUELE GRECO Id. 749612 andreaemanuele.greco@mail.polimi.it ADVANCED COMPUTER ARCHITECTURES (A.A. 2010/11) Prof.Ing. Cristina Silvano Dr.Ing.

More information

Lecture 17: Solid Modeling.... a cubit on the one side, and a cubit on the other side Exodus 26:13

Lecture 17: Solid Modeling.... a cubit on the one side, and a cubit on the other side Exodus 26:13 Lecture 17: Solid Modeling... a cubit on the one side, and a cubit on the other side Exodus 26:13 Who is on the LORD's side? Exodus 32:26 1. Solid Representations A solid is a 3-dimensional shape with

More information

Ray Tracing Acceleration Data Structures

Ray Tracing Acceleration Data Structures Ray Tracing Acceleration Data Structures Sumair Ahmed October 29, 2009 Ray Tracing is very time-consuming because of the ray-object intersection calculations. With the brute force method, each ray has

More information

CSG obj. oper3. obj1 obj2 obj3. obj5. obj4

CSG obj. oper3. obj1 obj2 obj3. obj5. obj4 Solid Modeling Solid: Boundary + Interior Volume occupied by geometry Solid representation schemes Constructive Solid Geometry (CSG) Boundary representations (B-reps) Space-partition representations Operations

More information

Topics. Ray Tracing II. Intersecting transformed objects. Transforming objects

Topics. Ray Tracing II. Intersecting transformed objects. Transforming objects Topics Ray Tracing II CS 4620 Lecture 16 Transformations in ray tracing Transforming objects Transformation hierarchies Ray tracing acceleration structures Bounding volumes Bounding volume hierarchies

More information

Rays or Waves? Understanding the Strengths and Weaknesses of Computational Room Acoustics Modeling Techniques

Rays or Waves? Understanding the Strengths and Weaknesses of Computational Room Acoustics Modeling Techniques Proceedings of the International Symposium on Room Acoustics, ISRA 2010 29 31 August 2010, Melbourne, Australia Rays or Waves? Understanding the Strengths and Weaknesses of Computational Room Acoustics

More information

Correctness. The Powercrust Algorithm for Surface Reconstruction. Correctness. Correctness. Delaunay Triangulation. Tools - Voronoi Diagram

Correctness. The Powercrust Algorithm for Surface Reconstruction. Correctness. Correctness. Delaunay Triangulation. Tools - Voronoi Diagram Correctness The Powercrust Algorithm for Surface Reconstruction Nina Amenta Sunghee Choi Ravi Kolluri University of Texas at Austin Boundary of a solid Close to original surface Homeomorphic to original

More information

Introduction to Computer Graphics. Modeling (3) April 27, 2017 Kenshi Takayama

Introduction to Computer Graphics. Modeling (3) April 27, 2017 Kenshi Takayama Introduction to Computer Graphics Modeling (3) April 27, 2017 Kenshi Takayama Solid modeling 2 Solid models Thin shapes represented by single polygons Unorientable Clear definition of inside & outside

More information

Physically-Based Modeling and Animation. University of Missouri at Columbia

Physically-Based Modeling and Animation. University of Missouri at Columbia Overview of Geometric Modeling Overview 3D Shape Primitives: Points Vertices. Curves Lines, polylines, curves. Surfaces Triangle meshes, splines, subdivision surfaces, implicit surfaces, particles. Solids

More information

Occluder Simplification using Planar Sections

Occluder Simplification using Planar Sections Occluder Simplification using Planar Sections Ari Silvennoinen Hannu Saransaari Samuli Laine Jaakko Lehtinen Remedy Entertainment Aalto University Umbra Software NVIDIA NVIDIA Aalto University Coping with

More information

L1 - Introduction. Contents. Introduction of CAD/CAM system Components of CAD/CAM systems Basic concepts of graphics programming

L1 - Introduction. Contents. Introduction of CAD/CAM system Components of CAD/CAM systems Basic concepts of graphics programming L1 - Introduction Contents Introduction of CAD/CAM system Components of CAD/CAM systems Basic concepts of graphics programming 1 Definitions Computer-Aided Design (CAD) The technology concerned with the

More information

Comparison of Spatial Audio Simulation Systems

Comparison of Spatial Audio Simulation Systems Comparison of Spatial Audio Simulation Systems Vladimír Arnošt arnost@fit.vutbr.cz Filip Orság orsag@fit.vutbr.cz Abstract: Modelling and simulation of spatial (3D) sound propagation in real-time applications

More information

Topics. Ray Tracing II. Transforming objects. Intersecting transformed objects

Topics. Ray Tracing II. Transforming objects. Intersecting transformed objects Topics Ray Tracing II CS 4620 ations in ray tracing ing objects ation hierarchies Ray tracing acceleration structures Bounding volumes Bounding volume hierarchies Uniform spatial subdivision Adaptive spatial

More information

EXPLOITING DATA COHERENCY IN MULTIPLE DATASET VISUALIZATION

EXPLOITING DATA COHERENCY IN MULTIPLE DATASET VISUALIZATION EXPLOITING DATA COHERENCY IN MULTIPLE DATASET VISUALIZATION Gaurav Khanduja and Bijaya B. Karki Department of Computer Science, Louisiana State University Baton Rouge, LA USA gkhand1@lsu.edu and karki@csc.lsu.edu

More information

Research Collection. Localisation of Acoustic Emission in Reinforced Concrete using Heterogeneous Velocity Models. Conference Paper.

Research Collection. Localisation of Acoustic Emission in Reinforced Concrete using Heterogeneous Velocity Models. Conference Paper. Research Collection Conference Paper Localisation of Acoustic Emission in Reinforced Concrete using Heterogeneous Velocity Models Author(s): Gollob, Stephan; Vogel, Thomas Publication Date: 2014 Permanent

More information

Optimizing the Topological and Combinatorial Complexity of Isosurfaces

Optimizing the Topological and Combinatorial Complexity of Isosurfaces Optimizing the Topological and Combinatorial Complexity of Isosurfaces Carlos Andújar Pere Brunet Antoni Chica Isabel Navazo Jarek Rossignac Àlvar Vinacua July 7, 2004 Abstract Since the publication of

More information

Auralization and Geometric acoustics ERIK MOLIN, HANNA AUTIO

Auralization and Geometric acoustics ERIK MOLIN, HANNA AUTIO Auralization and Geometric acoustics ERIK MOLIN, HANNA AUTIO Auralization what and why? For a given acoustic situation (space, sound source(s), listener position ), what sound does the listener hear? Auralization

More information

Accelerated Ambient Occlusion Using Spatial Subdivision Structures

Accelerated Ambient Occlusion Using Spatial Subdivision Structures Abstract Ambient Occlusion is a relatively new method that gives global illumination like results. This paper presents a method to accelerate ambient occlusion using the form factor method in Bunnel [2005]

More information

New Reliable Algorithm of Ray Tracing. through Hexahedral Mesh

New Reliable Algorithm of Ray Tracing. through Hexahedral Mesh Applied Mathematical Sciences, Vol. 8, 2014, no. 24, 1171-1176 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.4159 New Reliable Algorithm of Ray Tracing through Hexahedral Mesh R. P.

More information

Solid Modeling. Thomas Funkhouser Princeton University C0S 426, Fall Represent solid interiors of objects

Solid Modeling. Thomas Funkhouser Princeton University C0S 426, Fall Represent solid interiors of objects Solid Modeling Thomas Funkhouser Princeton University C0S 426, Fall 2000 Solid Modeling Represent solid interiors of objects Surface may not be described explicitly Visible Human (National Library of Medicine)

More information

3-Dimensional Object Modeling with Mesh Simplification Based Resolution Adjustment

3-Dimensional Object Modeling with Mesh Simplification Based Resolution Adjustment 3-Dimensional Object Modeling with Mesh Simplification Based Resolution Adjustment Özgür ULUCAY Sarp ERTÜRK University of Kocaeli Electronics & Communication Engineering Department 41040 Izmit, Kocaeli

More information

Visualizer An implicit surface rendering application

Visualizer An implicit surface rendering application June 01, 2004 Visualizer An implicit surface rendering application Derek Gerstmann - C1405511 MSc Computer Animation NCCA Bournemouth University OVERVIEW OF APPLICATION Visualizer is an interactive application

More information

Ray casting for incremental voxel colouring

Ray casting for incremental voxel colouring Ray casting for incremental voxel colouring O.W. Batchelor, R. Mukundan, R. Green University of Canterbury, Dept. Computer Science& Software Engineering. Email: {owb13, mukund@cosc.canterbury.ac.nz, richard.green@canterbury.ac.nz

More information

Implicit Surfaces & Solid Representations COS 426

Implicit Surfaces & Solid Representations COS 426 Implicit Surfaces & Solid Representations COS 426 3D Object Representations Desirable properties of an object representation Easy to acquire Accurate Concise Intuitive editing Efficient editing Efficient

More information

Generating 3D Meshes from Range Data

Generating 3D Meshes from Range Data Princeton University COS598B Lectures on 3D Modeling Generating 3D Meshes from Range Data Robert Kalnins Robert Osada Overview Range Images Optical Scanners Error sources and solutions Range Surfaces Mesh

More information

Lecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10

Lecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 Lecture 25: Bezier Subdivision And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 1. Divide and Conquer If we are going to build useful

More information

Optimal Iso-Surfaces

Optimal Iso-Surfaces 503 Optimal Iso-Surfaces Carlos Andújar 1, Pere Brunet 2, Antoni Chica 3, Isabel Navazo 4, Jarek Rossignac 5 and Àlvar Vinacua 6 1 Universitat Politècnica de Catalunya, andujar@lsi.upc.es 2 Universitat

More information

Multi-View Image Coding in 3-D Space Based on 3-D Reconstruction

Multi-View Image Coding in 3-D Space Based on 3-D Reconstruction Multi-View Image Coding in 3-D Space Based on 3-D Reconstruction Yongying Gao and Hayder Radha Department of Electrical and Computer Engineering, Michigan State University, East Lansing, MI 48823 email:

More information

3D Modeling: Solid Models

3D Modeling: Solid Models CS 430/536 Computer Graphics I 3D Modeling: Solid Models Week 9, Lecture 18 David Breen, William Regli and Maxim Peysakhov Geometric and Intelligent Computing Laboratory Department of Computer Science

More information

Polygonization of Implicit Surfaces

Polygonization of Implicit Surfaces Polygonization of Implicit Surfaces Hongxin Zhang and Jieqing Feng 2007-01-11 State Key Lab of CAD&CG Zhejiang University Contents Polygonization of Implicit Surfaces Other Methods for Displaying Implicit

More information

Hybrid Beam/Ray Tracing Simulation Method

Hybrid Beam/Ray Tracing Simulation Method Hybrid Beam/Ray Tracing Simulation Method Marjan Sikora Mladen Russo Ivo Mateljan Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, University of Split, Croatia Summary

More information

Aalto Universtiy, Department of Computer Sciences, Espoo, Finland Federal University of Santa Maria, Laboratory of Acoustics, Santa Maria, Brazil

Aalto Universtiy, Department of Computer Sciences, Espoo, Finland Federal University of Santa Maria, Laboratory of Acoustics, Santa Maria, Brazil J Saarelma G Greco Aalto Universtiy, Department of Computer Sciences, Espoo, Finland Federal University of Santa Maria, Laboratory of Acoustics, Santa Maria, Brazil Visualization is an intuitive way to

More information

Who has worked on a voxel engine before? Who wants to? My goal is to give the talk I wish I would have had before I started on our procedural engine.

Who has worked on a voxel engine before? Who wants to? My goal is to give the talk I wish I would have had before I started on our procedural engine. 1 Who has worked on a voxel engine before? Who wants to? My goal is to give the talk I wish I would have had before I started on our procedural engine. Three parts to this talk. A lot of content, so I

More information

Technical Section. Tribox bounds for three-dimensional objects

Technical Section. Tribox bounds for three-dimensional objects PERGAMON Computers & Graphics 23 (1999) 429-437 Technical Section Tribox bounds for three-dimensional objects A. Crosnier a, *, J.R. Rossignac b a LIMM, 161 rue Ada, 34392 Montpellier Cedex 5, France b

More information

Ray Tracing. Cornell CS4620/5620 Fall 2012 Lecture Kavita Bala 1 (with previous instructors James/Marschner)

Ray Tracing. Cornell CS4620/5620 Fall 2012 Lecture Kavita Bala 1 (with previous instructors James/Marschner) CS4620/5620: Lecture 37 Ray Tracing 1 Announcements Review session Tuesday 7-9, Phillips 101 Posted notes on slerp and perspective-correct texturing Prelim on Thu in B17 at 7:30pm 2 Basic ray tracing Basic

More information

Loading Geometry into NetLogo3D

Loading Geometry into NetLogo3D Loading Geometry into NetLogo3D Gabriel Wurzer, Vienna UT (gabriel.wurzer@tuwien.ac.at) Abstract. NetLogo3D is an Agent-Based Simulation which uses a three-dimensional raster as environment its agents.

More information

Mesh Repairing and Simplification. Gianpaolo Palma

Mesh Repairing and Simplification. Gianpaolo Palma Mesh Repairing and Simplification Gianpaolo Palma Mesh Repairing Removal of artifacts from geometric model such that it becomes suitable for further processing Input: a generic 3D model Output: (hopefully)a

More information

Modelling, Auralization and Acoustic Virtual Reality ERIK MOLIN

Modelling, Auralization and Acoustic Virtual Reality ERIK MOLIN Modelling, Auralization and Acoustic Virtual Reality ERIK MOLIN Overview Auralization Overview & motivation Audio sources Room models Receiver modelling Auralization what and why? For a given space, sound

More information

Chapter 11 Global Illumination. Part 1 Ray Tracing. Reading: Angel s Interactive Computer Graphics (6 th ed.) Sections 11.1, 11.2, 11.

Chapter 11 Global Illumination. Part 1 Ray Tracing. Reading: Angel s Interactive Computer Graphics (6 th ed.) Sections 11.1, 11.2, 11. Chapter 11 Global Illumination Part 1 Ray Tracing Reading: Angel s Interactive Computer Graphics (6 th ed.) Sections 11.1, 11.2, 11.3 CG(U), Chap.11 Part 1:Ray Tracing 1 Can pipeline graphics renders images

More information

ALGORITHMS FOR SIMULATION OF SOUND AND ULTRASOUND PROPAGATION IN COMPLEX DISPERSIVE ENVIRONMENTS

ALGORITHMS FOR SIMULATION OF SOUND AND ULTRASOUND PROPAGATION IN COMPLEX DISPERSIVE ENVIRONMENTS ALGORITHMS FOR SIMULATION OF SOUND AND ULTRASOUND PROPAGATION IN COMPLEX DISPERSIVE ENVIRONMENTS Marjan Sikora Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, R. Boškovića

More information

Parallel Physically Based Path-tracing and Shading Part 3 of 2. CIS565 Fall 2012 University of Pennsylvania by Yining Karl Li

Parallel Physically Based Path-tracing and Shading Part 3 of 2. CIS565 Fall 2012 University of Pennsylvania by Yining Karl Li Parallel Physically Based Path-tracing and Shading Part 3 of 2 CIS565 Fall 202 University of Pennsylvania by Yining Karl Li Jim Scott 2009 Spatial cceleration Structures: KD-Trees *Some portions of these

More information

Computer Graphics. Lecture 13. Global Illumination 1: Ray Tracing and Radiosity. Taku Komura

Computer Graphics. Lecture 13. Global Illumination 1: Ray Tracing and Radiosity. Taku Komura Computer Graphics Lecture 13 Global Illumination 1: Ray Tracing and Radiosity Taku Komura 1 Rendering techniques Can be classified as Local Illumination techniques Global Illumination techniques Local

More information

Spatial Data Structures

Spatial Data Structures 15-462 Computer Graphics I Lecture 17 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) March 28, 2002 [Angel 8.9] Frank Pfenning Carnegie

More information

Design Intent of Geometric Models

Design Intent of Geometric Models School of Computer Science Cardiff University Design Intent of Geometric Models Frank C. Langbein GR/M78267 GR/S69085/01 NUF-NAL 00638/G Massey University 22nd September 2004; Version 1.0 Design Intent

More information

OVERLAY GRID BASED GEOMETRY CLEANUP

OVERLAY GRID BASED GEOMETRY CLEANUP OVERLAY GRID BASED GEOMETRY CLEANUP Jiangtao Hu, Y. K. Lee, Ted Blacker and Jin Zhu FLUENT INC, 500 Davis St., Suite 600, Evanston, Illinois 60201 ABSTRACT A newly developed system for defining watertight

More information

Color Dithering with n-best Algorithm

Color Dithering with n-best Algorithm Color Dithering with n-best Algorithm Kjell Lemström, Jorma Tarhio University of Helsinki Department of Computer Science P.O. Box 26 (Teollisuuskatu 23) FIN-00014 University of Helsinki Finland {klemstro,tarhio}@cs.helsinki.fi

More information

Volume Illumination & Vector Field Visualisation

Volume Illumination & Vector Field Visualisation Volume Illumination & Vector Field Visualisation Visualisation Lecture 11 Institute for Perception, Action & Behaviour School of Informatics Volume Illumination & Vector Vis. 1 Previously : Volume Rendering

More information

Ray Tracing Acceleration. CS 4620 Lecture 20

Ray Tracing Acceleration. CS 4620 Lecture 20 Ray Tracing Acceleration CS 4620 Lecture 20 2013 Steve Marschner 1 Will this be on the exam? or, Prelim 2 syllabus You can expect emphasis on topics related to the assignment (Shaders 1&2) and homework

More information

Constructive Solid Geometry and Procedural Modeling. Stelian Coros

Constructive Solid Geometry and Procedural Modeling. Stelian Coros Constructive Solid Geometry and Procedural Modeling Stelian Coros Somewhat unrelated Schedule for presentations February 3 5 10 12 17 19 24 26 March 3 5 10 12 17 19 24 26 30 April 2 7 9 14 16 21 23 28

More information

SOUND SPATIALIZATION BASED ON FAST BEAM TRACING IN THE DUAL SPACE. Marco Foco, Pietro Polotti, Augusto Sarti, Stefano Tubaro

SOUND SPATIALIZATION BASED ON FAST BEAM TRACING IN THE DUAL SPACE. Marco Foco, Pietro Polotti, Augusto Sarti, Stefano Tubaro SOUND SPATIALIZATION BASED ON FAST BEAM TRACING IN THE DUAL SPACE Marco Foco, Pietro Polotti, Augusto Sarti, Stefano Tubaro Dipartimento di Elettronica e Informazione Politecnico di Milano Piazza L. Da

More information

Proceedings of the 5th WSEAS International Conference on Telecommunications and Informatics, Istanbul, Turkey, May 27-29, 2006 (pp )

Proceedings of the 5th WSEAS International Conference on Telecommunications and Informatics, Istanbul, Turkey, May 27-29, 2006 (pp ) A Rapid Algorithm for Topology Construction from a Set of Line Segments SEBASTIAN KRIVOGRAD, MLADEN TRLEP, BORUT ŽALIK Faculty of Electrical Engineering and Computer Science University of Maribor Smetanova

More information

Contouring and Isosurfaces. Ronald Peikert SciVis Contouring 2-1

Contouring and Isosurfaces. Ronald Peikert SciVis Contouring 2-1 Contouring and Isosurfaces Ronald Peikert SciVis 2007 - Contouring 2-1 What are contours? Set of points where the scalar field s has a given value c: Examples in 2D: height contours on maps isobars on

More information

SPECIALIZING VISUALIZATION ALGORITHMS

SPECIALIZING VISUALIZATION ALGORITHMS SPECIALIZING VISUALIZATION ALGORITHMS Stephan Diehl FR Informatik Universität des Saarlandes diehl@cs.uni-sb.de Abstract In this paper we look at the potential of program specialization techniques in the

More information

Point Cloud Filtering using Ray Casting by Eric Jensen 2012 The Basic Methodology

Point Cloud Filtering using Ray Casting by Eric Jensen 2012 The Basic Methodology Point Cloud Filtering using Ray Casting by Eric Jensen 01 The Basic Methodology Ray tracing in standard graphics study is a method of following the path of a photon from the light source to the camera,

More information

Watertight Planar Surface Reconstruction of Voxel Data

Watertight Planar Surface Reconstruction of Voxel Data Watertight Planar Surface Reconstruction of Voxel Data Eric Turner CS 284 Final Project Report December 13, 2012 1. Introduction There are many scenarios where a 3D shape is represented by a voxel occupancy

More information

Direct Extraction of Normal Mapped Meshes from Volume Data

Direct Extraction of Normal Mapped Meshes from Volume Data Direct Extraction of Normal Mapped Meshes from Volume Data Mark Barry and Zoë Wood California Polytechnic State University Abstract. We describe a method of directly extracting a simplified contour surface

More information

2) For any triangle edge not on the boundary, there is exactly one neighboring

2) For any triangle edge not on the boundary, there is exactly one neighboring Triangulating Trimmed NURBS Surfaces Chang Shu and Pierre Boulanger Abstract. This paper describes techniques for the piecewise linear approximation of trimmed NURBS surfaces. The problem, called surface

More information

Processing 3D Surface Data

Processing 3D Surface Data Processing 3D Surface Data Computer Animation and Visualisation Lecture 12 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing

More information

Design Intent of Geometric Models

Design Intent of Geometric Models School of Computer Science Cardiff University Design Intent of Geometric Models Frank C. Langbein GR/M78267 GR/S69085/01 NUF-NAL 00638/G Auckland University 15th September 2004; Version 1.1 Design Intent

More information

Spatial Data Structures

Spatial Data Structures 15-462 Computer Graphics I Lecture 17 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) April 1, 2003 [Angel 9.10] Frank Pfenning Carnegie

More information

CATT-A. Predicting Acoustical Performance with. by Pat Brown

CATT-A. Predicting Acoustical Performance with. by Pat Brown Predicting Acoustical Performance with CATT-A by Pat Brown It has been our custom to provide software overviews to acquaint our readers with some of the engineering tools that serve our industry. While

More information

THE APPLICABILITY OF RAY-TRACING BASED SIMULATION TOOLS TO PREDICT SOUND PRESSURE LEVELS AND REVERBERATION TIMES IN COUPLED SPACES

THE APPLICABILITY OF RAY-TRACING BASED SIMULATION TOOLS TO PREDICT SOUND PRESSURE LEVELS AND REVERBERATION TIMES IN COUPLED SPACES THE APPLICABILITY OF RAY-TRACING BASED SIMULATION TOOLS TO PREDICT SOUND PRESSURE LEVELS AND REVERBERATION TIMES IN COUPLED SPACES Marinus van der Voorden 1, Lau Nijs 1, Gerrit Vermeir 2 and Gert Jansens

More information

Using Semi-Regular 4 8 Meshes for Subdivision Surfaces

Using Semi-Regular 4 8 Meshes for Subdivision Surfaces Using Semi-Regular 8 Meshes for Subdivision Surfaces Luiz Velho IMPA Instituto de Matemática Pura e Aplicada Abstract. Semi-regular 8 meshes are refinable triangulated quadrangulations. They provide a

More information

Geometric Representations. Stelian Coros

Geometric Representations. Stelian Coros Geometric Representations Stelian Coros Geometric Representations Languages for describing shape Boundary representations Polygonal meshes Subdivision surfaces Implicit surfaces Volumetric models Parametric

More information

Physically-Based Laser Simulation

Physically-Based Laser Simulation Physically-Based Laser Simulation Greg Reshko Carnegie Mellon University reshko@cs.cmu.edu Dave Mowatt Carnegie Mellon University dmowatt@andrew.cmu.edu Abstract In this paper, we describe our work on

More information

Project Updates Short lecture Volumetric Modeling +2 papers

Project Updates Short lecture Volumetric Modeling +2 papers Volumetric Modeling Schedule (tentative) Feb 20 Feb 27 Mar 5 Introduction Lecture: Geometry, Camera Model, Calibration Lecture: Features, Tracking/Matching Mar 12 Mar 19 Mar 26 Apr 2 Apr 9 Apr 16 Apr 23

More information

Solid Modeling. Ron Goldman Department of Computer Science Rice University

Solid Modeling. Ron Goldman Department of Computer Science Rice University Solid Modeling Ron Goldman Department of Computer Science Rice University Solids Definition 1. A model which has a well defined inside and outside. 2. For each point, we can in principle determine whether

More information

Topology Correction for Brain Atlas Segmentation using a Multiscale Algorithm

Topology Correction for Brain Atlas Segmentation using a Multiscale Algorithm Topology Correction for Brain Atlas Segmentation using a Multiscale Algorithm Lin Chen and Gudrun Wagenknecht Central Institute for Electronics, Research Center Jülich, Jülich, Germany Email: l.chen@fz-juelich.de

More information

Concert hall geometry optimization with parametric modeling tools and wave-based acoustic simulations

Concert hall geometry optimization with parametric modeling tools and wave-based acoustic simulations Toronto, Canada International Symposium on Room Acoustics 2013 June 9--11 Concert hall geometry optimization with parametric modeling tools and wave-based acoustic simulations Philip W. Robinson (philip.robinson@aalto.fi)

More information

Surface Reconstruction. Gianpaolo Palma

Surface Reconstruction. Gianpaolo Palma Surface Reconstruction Gianpaolo Palma Surface reconstruction Input Point cloud With or without normals Examples: multi-view stereo, union of range scan vertices Range scans Each scan is a triangular mesh

More information

Special Topics in Visualization

Special Topics in Visualization Special Topics in Visualization Final Project Report Dual contouring of Hermite Data Submitted By S M Shahed Nejhum 8589-1199 May 19, 2008 Introduction Iso-surface extraction from 3D volumetric data is

More information

Battles with Overhang in 3D Printing

Battles with Overhang in 3D Printing Battles with Overhang in 3D Printing by Deformation, Orientation & Decomposition Charlie C. L. Wang Delft University of Technology June 11, 2018 Example of 3D Printed Products Boeing Air-Ducting Parts

More information

G 2 Interpolation for Polar Surfaces

G 2 Interpolation for Polar Surfaces 1 G 2 Interpolation for Polar Surfaces Jianzhong Wang 1, Fuhua Cheng 2,3 1 University of Kentucky, jwangf@uky.edu 2 University of Kentucky, cheng@cs.uky.edu 3 National Tsinhua University ABSTRACT In this

More information

Solid Modelling. Graphics Systems / Computer Graphics and Interfaces COLLEGE OF ENGINEERING UNIVERSITY OF PORTO

Solid Modelling. Graphics Systems / Computer Graphics and Interfaces COLLEGE OF ENGINEERING UNIVERSITY OF PORTO Solid Modelling Graphics Systems / Computer Graphics and Interfaces 1 Solid Modelling In 2D, one set 2D line segments or curves does not necessarily form a closed area. In 3D, a collection of surfaces

More information

Shrinkwrap developments for computational electromagnetics in ICE NITe

Shrinkwrap developments for computational electromagnetics in ICE NITe Shrinkwrap developments for computational electromagnetics in ICE NITe Preparing CAD models for electromagnetic analysis remains a complex, time consuming process. Typically, the CAD model will contain

More information

A Point in Non-Convex Polygon Location Problem Using the Polar Space Subdivision in E 2

A Point in Non-Convex Polygon Location Problem Using the Polar Space Subdivision in E 2 A Point in Non-Convex Polygon Location Problem Using the Polar Space Subdivision in E 2 Vaclav Skala 1, Michal Smolik 1 1 Faculty of Applied Sciences, University of West Bohemia, Univerzitni 8, CZ 30614

More information

3D Volume Mesh Generation of Human Organs Using Surface Geometries Created from the Visible Human Data Set

3D Volume Mesh Generation of Human Organs Using Surface Geometries Created from the Visible Human Data Set 3D Volume Mesh Generation of Human Organs Using Surface Geometries Created from the Visible Human Data Set John M. Sullivan, Jr., Ziji Wu, and Anand Kulkarni Worcester Polytechnic Institute Worcester,

More information

Influence of a volume scale factor on the scattering coefficient effects on the prediction of room acoustic parameters

Influence of a volume scale factor on the scattering coefficient effects on the prediction of room acoustic parameters Toronto, Canada International Symposium on Room Acoustics 2013 June 9-11 ISRA 2013 Influence of a volume scale factor on the scattering coefficient effects on the prediction of room acoustic parameters

More information