LATEST TRENDS on APPLIED MATHEMATICS, SIMULATION, MODELLING
|
|
- Bennett Conley
- 5 years ago
- Views:
Transcription
1 3D surface reconstruction of objects by using stereoscopic viewing Baki Koyuncu, Kurtuluş Küllü Computer Engineering Department, Ankara University, Ankara, Turkey Abstract 3D object scanning techniques were used to generate virtual images of objects. 2 cameras were employed to receive stereoscopic object surface information from an object on a rotating platform. The data received from both cameras were processed by using image processing techniques. Two point clouds, acquired from two cameras, were combined to obtain the 3D image of the object. Ball-Pivoting algorithm was used to reconstruct the object surface from these point clouds. Keywords: stereoscopic information, point clouds, Ball-Pivoting algorithm 1. Introduction 3D scanning is often used to create virtual 3-D models of real objects. There are various 3D scanning techniques each with its advantages and disadvantages. A common point for all these techniques is the resulting geometric information in the form of a set of 3D points for a scanned object. This set of points, representing the object surface geometry, is referred as point cloud. However, in most applications, object surfaces are modelled by polygon mesh models or Nonuniform rational B-spline (NURBS) models. Thus, a point cloud is often transformed to a surface model and this process is called surface reconstruction. Common techniques for producing polygon meshes from point clouds are Marching cubes, Marching triangles and Ball-Pivoting algorithm (BPA) all of which are based on the mathematical concept of Delaunay triangulation. In this study, BPA was implemented together with an additional preliminary statistical routine. This implementation was applied to a stereoscopic union of two point clouds acquired by two cameras for the same object. Finally these two point clouds generated the reconstructed 3D image of the test object. 2. Summary of Reconstruction Techniques Delaunay triangulation is the mathematical base for most of the reconstruction algorithms. Theoretically, a Delaunay Triangulation for point set in xy plane is such that no point in is inside the circumscribed circle (circumcircle) of any triangle in (See Figure 1). In 3D Delaunay Triangulation, the only difference was the consideration of circumscribed spheres (circumspheres) instead of circumcircles. Figure 1: A Delaunay triangulation in 2D plane with circumcircles Delaunay Triangulations, while constructing surface models, maximize the minimum angle among all angles of the triangles during triangulation. Hence, the generated triangle net eliminates the narrow angle triangles as much as possible. Marching cubes algorithm, which was developed by Lorensen and Cline [8] iterated through the 3D world by considering a cubic volume element (voxel) at every iteration. This algorithm determined the polygons which represented the part of the surface passing through a voxel cube. When symmetry and reflection was taken into account, there were 15 ISSN: ISBN:
2 unique polygon possibilities inside a single cube (See Figure 2). The generated polygons were later combined to produce a complete object surface. Figure 2: Fifteen unique cube configurations Marching triangles and BPA methods overcame some of the limitations of marching cubes [2] [4]. They are both iterative in the sense that they grow a triangulation across an implicit surface based on the same local 3D Delaunay surface constraint [6]. This local surface constraint is explained in Section Ball-Pivoting Algorithm Given a partial surface mesh, a triangle,, can only be added to the mesh boundary at edge,, if no edge in the existing mesh is inside the sphere passing through the triangle vertices,,. touches a new point in point cloud. This new point together with the pivot edge forms a new triangle to be added to the mesh. Selection of a seed triangle consists of finding three vertices such that the ball touching them contains no other vertex point in point cloud. 4. Experiments An optical 3D scanner based on structured light was employed in this study [7]. Two digital cameras, simulating a pair of stereoscopic eyes, were integrated into the 3D scanner and each camera was calibrated with respect to their object distances (See Figure 4). Two cameras were placed on either side of a laser line source. The test object was stationary on a rotating platform in front of these cameras and the laser line source. Figure 3: M, T triangle and sphere representation BPA imposes the above constraint to ensure that the surface is locally a Delaunay surface. The application of BPA by using software techniques results in a final triangulated surface mesh, M, which is globally a Delaunay surface [3] [6]. BPA starts with a seed triangle and pivots a sphere (ball) of user defined radius around each edge of the current mesh boundary until the ball Figure 4: Layout of 3D scanner with two cameras, line laser and rotating platform Observation of a scanned object at different times or from different viewpoints produces independent multiple images. It is a common practice to align separate, partially overlapping images by using image transformation techniques into a single image. This process is referred as registration. Origin of the world coordinate-axes for 3D scanner was considered as the centre point of the rotating platform. Platform surface represented the xz plane and the yz plane was represented by the vertical plane which contained the laser light. Both cameras were calibrated with respect to these coordinates. They simultaneously captured images of the laser line on the object surface as the platform rotated at a constant speed for a full ISSN: ISBN:
3 360 scan. See Figure 5 for image samples from 2 cameras. Figure 5: Image samples from camera #1 (left) and camera #2 (right) Ideally, two fully identical point clouds would be obtained from the scanning of the object since the conditions for both cameras were the same. Incident laser light was sometimes not seen by the camera. It was caused by the laser light being occluded by some of the object parts (See Figure 6). This was identified as occlusion problem and the final point cloud acquired from such an image contained holes (See Figure 7). Figure 6: Occlusion problem: there is an occluded section of incident laser line The problem was overcome by fitting the point clouds from two cameras on top of each other. The fitting, identified as registration, was simplified by the fact that both cameras produced point clouds with the same virtual world coordinates. Hence there was no image transformation involved due to coordinate differences. The small mismatches between the point clouds were the result of environmental effects in determining the 3D point locations during acquisition process. In order to reduce these mismatches, a preliminary statistical averaging routine was applied to the combined point clouds before using BPA. Figure 7: Part of point cloud acquired by camera #1 is missing due to occlusion (back half of the point cloud is clipped in this image for display purposes) 5. Averaging Routine Let be the set of points acquired from camera #1 and from camera #2. One should always keep in mind that numbers of 3D points in the two clouds were not equal ( ). Each 3D point, where represents the number of point cloud and represents the point number in the cloud P i, has a corresponding error vector x, y, z which represents the distance to the ideal 3D object image. Then each can be considered together with an error set whose elements are all for. When two point clouds are simply fitted on top of each other without any rotation or translation, a union was obtained where which needs to be considered together with (See Figure 8). A point in the new combined point cloud would ideally fall into two categories: (i) (ii) It may be obtained from 2 points one from each point cloud at the same location. It may be obtained from 1 point of a single point cloud. ISSN: ISBN:
4 mean of minimum distances in the particular point cloud. Consider a small point cloud shown by Figure 9 and defined by: 0,0,0, 1,0,0, 1,1,0, 1,0,1, 1,1,1 Figure 9: Simple example 3D point cloud Figure 8: Point cloud P1 from camera #1 (top left) and point cloud P2 from camera #2 (top right) placed on top of each other to produce P (bottom) In practice, a point in (i) has several points in close proximity, whereas for a point in (ii) the closest points are those sampled from distinct surface locations. If a statistical averaging operation was applied to 3D regions in small enough not to include two points from the same cloud, one would expect a reduced identified as with a reduced resulting from the averaging effect. In this study, the primary concern was to determine the 3D region size where 3D region is defined as a cube with a side length identified as region size ( ). Various region sizes related to characteristics of the separate point clouds as well as their union were tested. Since a region would be small enough not to include two points from the same cloud, an indication of the distances between the points would be required. This indication was identified as average minimum distance shown with symbol. For each point cloud,a corresponding average minimum distance ( for, for, for, and for ) was calculated by the arithmetic To calculate the average minimum distance for, distance between the considered point and the point closest to it was calculated for each point in. Hence the minimum distances are: 1, 1, 1, 1, 2 Then, the average minimum distance would be In this study, average minimum distances and for the point clouds and were calculated similarly by using software techniques. Smaller of and was selected to determine the which was later used to calculate from. BPA would be applied on and with respect to various ball radii to reconstruct the object surface. In this context, the relationship between and values was analysed in two sets of experiments: (a) was determined by using and using equation. (b) was determined by using and equation. where was a constant arbitrarily changed in the experiments. ISSN: ISBN:
5 6. Results The test object, a pencil holder (See Figure 10), was scanned during the experiments. The two point clouds, and were generated and presented in Figure 8. LATEST TRENDS on APPLIED MATHEMATICS, SIMULATION, MODELLING Figure 10: The test object scanned The number of 3D points in, and were 34447, and respectively. Corresponding average minimum distances for, and were then computed as: x10 The for reduced point cloud was defined as: 2 min, Finally, was calculated for different values in Table 1 in order to be used with BPA x x x x x x x x x x x x x x10-1 Table 1: Values of r for each test case The following Figures 11 and 12 show resulting surfaces for each experiment group respectively. It is seen in Figure 11 that a ball radius of 2.5 produces best results. Figure 11: Resulting surfaces for increasing c values in Table 1 from left to right (top to bottom) in experiment set (a) The results given in Figure 12 show very little reconstructed surface area. This is due to average minimum distance for which is a poor indication of point distances. It is caused by 3D points which are not reduced from the same surface location in and. Figure 12: Resulting surfaces for increasing c values in Table 1 from left to right (top to bottom) in experiment set (b) In conclusion, choosing the ball radius according to the average minimum distance in a point cloud is found to be a good approach for surface reconstruction. ISSN: ISBN:
6 Bibliography [1] de Berg, M; van Kreveld, M; Overmars, M; Schwarzkopf, O. Computational Geometry: Algorithms and Applications. Springer- Verlag. ISBN: [2] Bernardini, F; Mittleman, J; Rushmeier, H; Silva, C; Taubin G. The Ball-Pivoting Algorithm for surface reconstruction. IEEE Transactions of Visualization & Graphics [3] Fortune, S. Voronoi diagrams and Delaunay triangulations. In Computing in Euclidian Geometry, pages , [4] Fournier, M; Dischler, J.M; Bechmann, D. Marching Triangle polygonization for efficient surface reconstruction from its distance transform. Discrete Geometry for Computer Imagery, pages , Springer Berlin, [6] Hilton, A; Stoddart, A.J; Illingworth, J; Windeatt, T. Marching triangles: range image fusion for complex object modeling. Proc. of the International Conference on Image Processing, Vol. 1, September [7] Koyuncu, B; Kullu, K. Development of an optical 3D scanner based on structured light. Proc. of the 9 th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases (AIKED 10). Cambridge, UK, February [8] Lorensen, W.E; Cline, H.E. Marching Cubes: A high resolution 3D surface construction algorithm. Computer Graphics, Vol. 21 (4), July [9] Okabe, A; Boots, B; and Sugihara, K. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. New York: Wiley, [5] Guibas, L; Stolfi, J. Primitves for the manipulation of general subdivisions and the computation of Voronoi. ACM transactions on Graphics, Vol. 4 (2), April ISSN: ISBN:
Outline of the presentation
Surface Reconstruction Petra Surynková Charles University in Prague Faculty of Mathematics and Physics petra.surynkova@mff.cuni.cz Outline of the presentation My work up to now Surfaces of Building Practice
More informationx1_nearest x2_nearest Implicit Surface:[ f(x)=0,b(x)= false ]
Marching Triangles: Delaunay Implicit Surface Triangulation A.Hilton 1 and J.Illingworth Vision, Speech and Signal Processing Group, Department of Electronic and Electrical Engineering University of Surrey,
More informationA Constrained Delaunay Triangle Mesh Method for Three-Dimensional Unstructured Boundary Point Cloud
International Journal of Computer Systems (ISSN: 2394-1065), Volume 03 Issue 02, February, 2016 Available at http://www.ijcsonline.com/ A Constrained Delaunay Triangle Mesh Method for Three-Dimensional
More informationGenerating 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 informationSurface 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 informationRobot Motion Planning Using Generalised Voronoi Diagrams
Robot Motion Planning Using Generalised Voronoi Diagrams MILOŠ ŠEDA, VÁCLAV PICH Institute of Automation and Computer Science Brno University of Technology Technická 2, 616 69 Brno CZECH REPUBLIC Abstract:
More informationShape and Appearance from Images and Range Data
SIGGRAPH 2000 Course on 3D Photography Shape and Appearance from Images and Range Data Brian Curless University of Washington Overview Range images vs. point clouds Registration Reconstruction from point
More informationSpace Subdivision for the Adaptive Edge Spinning Polygonization
Space Subdivision for the Adaptive Edge Spinning Polygonization MARTIN CERMAK 1, VACLAV SKALA Department of Computer Science and Engineering University of West Bohemia in Pilsen Univerzitni 8, 306 14 Plzen
More information3D-2D Laser Range Finder calibration using a conic based geometry shape
3D-2D Laser Range Finder calibration using a conic based geometry shape Miguel Almeida 1, Paulo Dias 1, Miguel Oliveira 2, Vítor Santos 2 1 Dept. of Electronics, Telecom. and Informatics, IEETA, University
More informationIsosurface 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 informationPreferred directions for resolving the non-uniqueness of Delaunay triangulations
Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation
More informationMulti-Scale Free-Form Surface Description
Multi-Scale Free-Form Surface Description Farzin Mokhtarian, Nasser Khalili and Peter Yuen Centre for Vision Speech and Signal Processing Dept. of Electronic and Electrical Engineering University of Surrey,
More informationProcessing 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 informationCOMPUTING CONSTRAINED DELAUNAY
COMPUTING CONSTRAINED DELAUNAY TRIANGULATIONS IN THE PLANE By Samuel Peterson, University of Minnesota Undergraduate The Goal The Problem The Algorithms The Implementation Applications Acknowledgments
More informationFree-form 3D object reconstruction from range images. C. Schütz, T. Jost, H. Hügli
Free-form 3D object reconstruction from range images C. Schütz, T. Jost, H. Hügli Institute for Microtechnology University of Neuchatel, rue Breguet 2 CH-2000 Neuchatel, Switzerland email: christian.schutz@imt.unine.ch
More informationHow Do Computers Solve Geometric Problems? Sorelle Friedler, University of Maryland - College Park
How Do Computers Solve Geometric Problems? Sorelle Friedler, University of Maryland - College Park http://www.cs.umd.edu/~sorelle Outline Introduction Algorithms Computational Geometry Art Museum Problem
More informationIJREAT International Journal of Research in Engineering & Advanced Technology, Volume 1, Issue 2, April-May, 2013 ISSN:
Optimization of Mesh Reconstruction using Delaunay and Ball Pivoting Algorithm Bharti Sood 1, Kamaldeep Kaur 2 1, 2 Department of Electronics & Communication Engineering, BBSBEC, Fatehgarh Sahib, India
More informationProcessing 3D Surface Data
Processing 3D Surface Data Computer Animation and Visualisation Lecture 17 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing
More informationDifferential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder]
Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder] Preliminaries Recall: Given a smooth function f:r R, the function
More informationFreehand Voxel Carving Scanning on a Mobile Device
Technion Institute of Technology Project in Image Processing and Analysis 234329 Freehand Voxel Carving Scanning on a Mobile Device Author: Student Number: 305950099 Supervisors: Aaron Wetzler, Yaron Honen,
More informationSurvey of Surface Reconstruction Algorithms
Journal of Signal and Information Processing, 2014, 5, 63-79 Published Online August 2014 in SciRes. http://www.scirp.org/journal/jsip http://dx.doi.org/10.4236/jsip.2014.53009 Survey of Surface Reconstruction
More informationLecture Tessellations, fractals, projection. Amit Zoran. Advanced Topics in Digital Design
Lecture Tessellations, fractals, projection Amit Zoran Advanced Topics in Digital Design 67682 The Rachel and Selim Benin School of Computer Science and Engineering The Hebrew University of Jerusalem,
More information3D Modeling of Objects Using Laser Scanning
1 3D Modeling of Objects Using Laser Scanning D. Jaya Deepu, LPU University, Punjab, India Email: Jaideepudadi@gmail.com Abstract: In the last few decades, constructing accurate three-dimensional models
More informationSurface Curvature Estimation for Edge Spinning Algorithm *
Surface Curvature Estimation for Edge Spinning Algorithm * Martin Cermak and Vaclav Skala University of West Bohemia in Pilsen Department of Computer Science and Engineering Czech Republic {cermakm skala}@kiv.zcu.cz
More informationComparative Study of Combinatorial 3D Reconstruction Algorithms
Comparative Study of Combinatorial 3D Reconstruction Algorithms Abdelaaziz MAHDAOUI #1, Aziz BOUAZI *2, Abdallah. MARHRAOUI HSAINI *2, El Hassan SBAI *2 # Department of Physics, Faculty of Science, University
More informationAn Algorithm for Computing the Convex Hull of a Set of Imprecise Line Segment Intersection
Int. J. Open Problems Compt. Math., Vol. 7, No. 3, September, 2014 ISSN 1998-6262; Copyright @ICSRS Publication, 2014 www.i-csrs.org An Algorithm for Computing the Convex Hull of a Set of Imprecise Line
More informationProcessing 3D Surface Data
Processing 3D Surface Data Computer Animation and Visualisation Lecture 15 Institute for Perception, Action & Behaviour School of Informatics 3D Surfaces 1 3D surface data... where from? Iso-surfacing
More informationTHE USE OF OPTICAL METHODS FOR LEAK TESTING DAMPERS
DAAAM INTERNATIONAL SCIENTIFIC BOOK 2013 pp. 787-794 CHAPTER 47 THE USE OF OPTICAL METHODS FOR LEAK TESTING DAMPERS TOMASIAK, J. Abstract: The present paper presents the possible use of a portable structural
More informationAbstract. Introduction
The efficient calculation of the Cartesian geometry of non-cartesian structures J.M. Freeman and D.G. Ford Engineering Control and Metrology Research Group, The School of Engineering, University of Huddersfield.
More informationContours & Implicit Modelling 1
Contouring & Implicit Modelling Visualisation Lecture 8 Institute for Perception, Action & Behaviour School of Informatics Contours & Implicit Modelling 1 Brief Recap Contouring Implicit Functions lecture
More informationStructured light 3D reconstruction
Structured light 3D reconstruction Reconstruction pipeline and industrial applications rodola@dsi.unive.it 11/05/2010 3D Reconstruction 3D reconstruction is the process of capturing the shape and appearance
More informationScienceDirect. The use of Optical Methods for Leak Testing Dampers
Available online at www.sciencedirect.com ScienceDirect Procedia Engineering 69 ( 2014 ) 788 794 24th DAAAM International Symposium on Intelligent Manufacturing and Automation, 2013 The use of Optical
More informationComparison of Two Mathematical Models for the Surface Reconstruction for Deformation Analysis by Using FARO Focus 3D
Ke-Wei Li Comparison of Two Mathematical Models for the Surface Reconstruction for Deformation Analysis by Using FARO Focus 3D Duration of the Thesis: 6 months Completion: October 2012 Tutor: Dipl.-Ing.
More informationCollision Detection. Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering
RBE 550 MOTION PLANNING BASED ON DR. DMITRY BERENSON S RBE 550 Collision Detection Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering http://users.wpi.edu/~zli11 Euler Angle RBE
More informationRoadmap Methods vs. Cell Decomposition in Robot Motion Planning
Proceedings of the 6th WSEAS International Conference on Signal Processing, Robotics and Automation, Corfu Island, Greece, February 16-19, 007 17 Roadmap Methods vs. Cell Decomposition in Robot Motion
More informationacute angle An angle with a measure less than that of a right angle. Houghton Mifflin Co. 2 Grade 5 Unit 6
acute angle An angle with a measure less than that of a right angle. Houghton Mifflin Co. 2 Grade 5 Unit 6 angle An angle is formed by two rays with a common end point. Houghton Mifflin Co. 3 Grade 5 Unit
More informationREPRESENTING EXTRATED EDGES FROM IMAGES BY USING CONSTRAINED DELAUNAY TRIANGULATION
REPRESENTING EXTRATED EDGES FROM IMAGES BY USING CONSTRAINED DELAUNAY TRIANGULATION Simena Dinas Escuela de Ingeniería de Sistemas y Computación, Universidad del Valle simena.dinas@correounivalle.edu.co
More informationComputational Geometry. Definition, Application Areas, and Course Overview
Computational Geometry Definition, Application Areas, and Course Overview Computational Geometry is a subfield of the Design and Analysis of Algorithms Computational Geometry is a subfield of the Design
More informationON THE WAY TO WATER-TIGHT MESH
ON THE WAY TO WATER-TIGHT MESH Rui Liu, Darius Burschka, Gerd Hirzinger Institute of Robotics and Mechatronics, German Aerospace Center (DLR) Oberpfaffenhofen, 82234 Wessling, Germany. Rui.Liu@dlr.de KEY
More informationComputational Geometry
Computational Geometry 600.658 Convexity A set S is convex if for any two points p, q S the line segment pq S. S p S q Not convex Convex? Convexity A set S is convex if it is the intersection of (possibly
More information3D SPATIAL DATA ACQUISITION AND MODELING OF ANGHEL SALIGNY MONUMENT USING TERRESTRIAL LASER SCANNING
JOURNAL OF APPLIED ENGINEERING SCIENCES VOL. 2(15), issue 2_2012 ISSN 2247-3769 ISSN-L 2247-3769 (Print) / e-issn:2284-7197 3D SPATIAL DATA ACQUISITION AND MODELING OF ANGHEL SALIGNY MONUMENT USING TERRESTRIAL
More informationA Study of Medical Image Analysis System
Indian Journal of Science and Technology, Vol 8(25), DOI: 10.17485/ijst/2015/v8i25/80492, October 2015 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 A Study of Medical Image Analysis System Kim Tae-Eun
More informationModeling 3D Objects: Part 2
Modeling 3D Objects: Part 2 Patches, NURBS, Solids Modeling, Spatial Subdivisioning, and Implicit Functions 3D Computer Graphics by Alan Watt Third Edition, Pearson Education Limited, 2000 General Modeling
More informationIntroduction 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 informationDelaunay Triangulation
Delaunay Triangulation Steve Oudot slides courtesy of O. Devillers MST MST MST use Kruskal s algorithm with Del as input O(n log n) Last: lower bound for Delaunay Let x 1, x 2,..., x n R, to be sorted
More informationTutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass
Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass University of California, Davis, USA http://www.cs.ucdavis.edu/~koehl/ims2017/ What is a shape? A shape is a 2-manifold with a Riemannian
More informationCurve and Surface Basics
Curve and Surface Basics Implicit and parametric forms Power basis form Bezier curves Rational Bezier Curves Tensor Product Surfaces ME525x NURBS Curve and Surface Modeling Page 1 Implicit and Parametric
More informationRectangular Coordinates in Space
Rectangular Coordinates in Space Philippe B. Laval KSU Today Philippe B. Laval (KSU) Rectangular Coordinates in Space Today 1 / 11 Introduction We quickly review one and two-dimensional spaces and then
More informationVoronoi Diagrams and Delaunay Triangulation slides by Andy Mirzaian (a subset of the original slides are used here)
Voronoi Diagrams and Delaunay Triangulation slides by Andy Mirzaian (a subset of the original slides are used here) Voronoi Diagram & Delaunay Triangualtion Algorithms Divide-&-Conquer Plane Sweep Lifting
More informationScalar 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 informationSmallest Intersecting Circle for a Set of Polygons
Smallest Intersecting Circle for a Set of Polygons Peter Otfried Joachim Christian Marc Esther René Michiel Antoine Alexander 31st August 2005 1 Introduction Motivated by automated label placement of groups
More informationProf. Gill Barequet. Center for Graphics and Geometric Computing, Technion. Dept. of Computer Science The Technion Haifa, Israel
Computational Geometry (CS 236719) http://www.cs.tufts.edu/~barequet/teaching/cg Chapter 1 Introduction 1 Copyright 2002-2009 2009 Prof. Gill Barequet Center for Graphics and Geometric Computing Dept.
More informationProceedings 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 informationAccurate 3D Face and Body Modeling from a Single Fixed Kinect
Accurate 3D Face and Body Modeling from a Single Fixed Kinect Ruizhe Wang*, Matthias Hernandez*, Jongmoo Choi, Gérard Medioni Computer Vision Lab, IRIS University of Southern California Abstract In this
More informationINTERACTIVE ENVIRONMENT FOR INTUITIVE UNDERSTANDING OF 4D DATA. M. Murata and S. Hashimoto Humanoid Robotics Institute, Waseda University, Japan
1 INTRODUCTION INTERACTIVE ENVIRONMENT FOR INTUITIVE UNDERSTANDING OF 4D DATA M. Murata and S. Hashimoto Humanoid Robotics Institute, Waseda University, Japan Abstract: We present a new virtual reality
More information3D Object Representations. COS 526, Fall 2016 Princeton University
3D Object Representations COS 526, Fall 2016 Princeton University 3D Object Representations How do we... Represent 3D objects in a computer? Acquire computer representations of 3D objects? Manipulate computer
More information3D Models from Range Sensors. Gianpaolo Palma
3D Models from Range Sensors Gianpaolo Palma Who Gianpaolo Palma Researcher at Visual Computing Laboratory (ISTI-CNR) Expertise: 3D scanning, Mesh Processing, Computer Graphics E-mail: gianpaolo.palma@isti.cnr.it
More informationPose estimation of two-pose 3D models using the base tangent plane and stability constraints
Pose estimation of two-pose 3D models using the base tangent plane and stability constraints Soon-Yong Park and Murali Subbarao Department of Electrical and Computer Engineering State University of New
More informationXVIII. AMC 8 Practice Questions
XVIII. AMC 8 Practice Questions - A circle and two distinct lines are drawn on a sheet of paper. What is the largest possible number of points of intersection of these figures? (A) (B) 3 (C) 4 (D) 5 (E)
More informationRegistration of Dynamic Range Images
Registration of Dynamic Range Images Tan-Chi Ho 1,2 Jung-Hong Chuang 1 Wen-Wei Lin 2 Song-Sun Lin 2 1 Department of Computer Science National Chiao-Tung University 2 Department of Applied Mathematics National
More informationComputing 3D Geometry Directly From Range Images
Computing 3D Geometry Directly From Range Images Sarah F. Frisken and Ronald N. Perry Mitsubishi Electric Research Laboratories Geometry from Range Data A Classic Approach Subject Range images Range surfaces
More informationTERRESTRIAL LASER SCANNER DATA PROCESSING
TERRESTRIAL LASER SCANNER DATA PROCESSING L. Bornaz (*), F. Rinaudo (*) (*) Politecnico di Torino - Dipartimento di Georisorse e Territorio C.so Duca degli Abruzzi, 24 10129 Torino Tel. +39.011.564.7687
More informationDigital Geometry Processing
Digital Geometry Processing Spring 2011 physical model acquired point cloud reconstructed model 2 Digital Michelangelo Project Range Scanning Systems Passive: Stereo Matching Find and match features in
More informationENGN D Photography / Spring 2018 / SYLLABUS
ENGN 2502 3D Photography / Spring 2018 / SYLLABUS Description of the proposed course Over the last decade digital photography has entered the mainstream with inexpensive, miniaturized cameras routinely
More informationShape Representation Basic problem We make pictures of things How do we describe those things? Many of those things are shapes Other things include
Shape Representation Basic problem We make pictures of things How do we describe those things? Many of those things are shapes Other things include motion, behavior Graphics is a form of simulation and
More informationGeometric Computation: Introduction. Piotr Indyk
Geometric Computation: Introduction Piotr Indyk Welcome to 6.850! Overview and goals Course Information Closest pair Signup sheet Geometric Computation Geometric computation occurs everywhere: Robotics:
More informationComputational Geometry. Algorithm Design (10) Computational Geometry. Convex Hull. Areas in Computational Geometry
Computational Geometry Algorithm Design (10) Computational Geometry Graduate School of Engineering Takashi Chikayama Algorithms formulated as geometry problems Broad application areas Computer Graphics,
More informationCoarse-to-Fine Search Technique to Detect Circles in Images
Int J Adv Manuf Technol (1999) 15:96 102 1999 Springer-Verlag London Limited Coarse-to-Fine Search Technique to Detect Circles in Images M. Atiquzzaman Department of Electrical and Computer Engineering,
More informationSimple Mesh Examples to Illustrate Specific Finite Element Mesh Requirements
Simple Mesh Examples to Illustrate Specific Finite Element Mesh Requirements Peter Fleischmann, Robert Kosik, Bernhard Haindl, and Siegfried Selberherr Institute for Microelectronics, TU Vienna, Gu6hausstrafie
More informationMULTIPLE-SENSOR INTEGRATION FOR EFFICIENT REVERSE ENGINEERING OF GEOMETRY
Proceedings of the 11 th International Conference on Manufacturing Research (ICMR2013) MULTIPLE-SENSOR INTEGRATION FOR EFFICIENT REVERSE ENGINEERING OF GEOMETRY Feng Li, Andrew Longstaff, Simon Fletcher,
More information3-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 informationAdvanced Algorithms Computational Geometry Prof. Karen Daniels. Fall, 2012
UMass Lowell Computer Science 91.504 Advanced Algorithms Computational Geometry Prof. Karen Daniels Fall, 2012 Voronoi Diagrams & Delaunay Triangulations O Rourke: Chapter 5 de Berg et al.: Chapters 7,
More informationCourse Number: Course Title: Geometry
Course Number: 1206310 Course Title: Geometry RELATED GLOSSARY TERM DEFINITIONS (89) Altitude The perpendicular distance from the top of a geometric figure to its opposite side. Angle Two rays or two line
More informationConstruction of Voronoi Diagrams
Construction of Voronoi Diagrams David Pritchard April 9, 2002 1 Introduction Voronoi diagrams have been extensively studied in a number of domains. Recent advances in graphics hardware have made construction
More informationINTRODUCTION TO MEDICAL IMAGING- 3D LOCALIZATION LAB MANUAL 1. Modifications for P551 Fall 2013 Medical Physics Laboratory
INTRODUCTION TO MEDICAL IMAGING- 3D LOCALIZATION LAB MANUAL 1 Modifications for P551 Fall 2013 Medical Physics Laboratory Introduction Following the introductory lab 0, this lab exercise the student through
More informationarxiv:cs/ v1 [cs.cg] 26 Feb 2002
The efficient generation of unstructured control volumes in 2D and 3D Jacek Leszczynski, Sebastian Pluta arxiv:cs/0202038v1 [cs.cg] 26 Feb 2002 Technical University of Czestochowa, Institute of Mathematics
More informationCurvature Estimation on Smoothed 3-D Meshes
Curvature Estimation on Smoothed 3-D Meshes Peter Yuen, Nasser Khalili and Farzin Mokhtarian Centre for Vision, Speech and Signal Processing School of Electronic Engineering, Information Technology and
More informationAcute Triangulations of Polygons
Europ. J. Combinatorics (2002) 23, 45 55 doi:10.1006/eujc.2001.0531 Available online at http://www.idealibrary.com on Acute Triangulations of Polygons H. MAEHARA We prove that every n-gon can be triangulated
More informationVoronoi diagrams Delaunay Triangulations. Pierre Alliez Inria
Voronoi diagrams Delaunay Triangulations Pierre Alliez Inria Voronoi Diagram Voronoi Diagram Voronoi Diagram The collection of the non-empty Voronoi regions and their faces, together with their incidence
More informationVolume Illumination and Segmentation
Volume Illumination and Segmentation Computer Animation and Visualisation Lecture 13 Institute for Perception, Action & Behaviour School of Informatics Overview Volume illumination Segmentation Volume
More informationSegmentation of point clouds
Segmentation of point clouds George Vosselman INTERNATIONAL INSTITUTE FOR GEO-INFORMATION SCIENCE AND EARTH OBSERVATION Extraction of information from point clouds 1 Segmentation algorithms Extraction
More informationChapter 7 Spatial Operation
7.1 Introduction Chapter 7 Spatial Operation Q: What is spatial operation? A: Spatial operation is computational manipulation of spatial objects that deepen our understanding of spatial phenomena. In spatial
More informationFARO Scanning Plugin
FARO Scanning Plugin for Geomagic Studio 6 service release 4, Geomagic Qualify 6 service release 2, and Geomagic Qualify 7 Document version B Copyright 2004, Raindrop Geomagic, Inc. The FARO scanner is
More informationDIGITAL TERRAIN MODELLING. Endre Katona University of Szeged Department of Informatics
DIGITAL TERRAIN MODELLING Endre Katona University of Szeged Department of Informatics katona@inf.u-szeged.hu The problem: data sources data structures algorithms DTM = Digital Terrain Model Terrain function:
More informationCS 532: 3D Computer Vision 14 th Set of Notes
1 CS 532: 3D Computer Vision 14 th Set of Notes Instructor: Philippos Mordohai Webpage: www.cs.stevens.edu/~mordohai E-mail: Philippos.Mordohai@stevens.edu Office: Lieb 215 Lecture Outline Triangulating
More informationCollision Detection with Bounding Volume Hierarchies
Simulation in Computer Graphics Collision Detection with Bounding Volume Hierarchies Matthias Teschner Computer Science Department University of Freiburg Outline introduction bounding volumes BV hierarchies
More informationMET71 COMPUTER AIDED DESIGN
UNIT - II BRESENHAM S ALGORITHM BRESENHAM S LINE ALGORITHM Bresenham s algorithm enables the selection of optimum raster locations to represent a straight line. In this algorithm either pixels along X
More informationLecture 2 Unstructured Mesh Generation
Lecture 2 Unstructured Mesh Generation MIT 16.930 Advanced Topics in Numerical Methods for Partial Differential Equations Per-Olof Persson (persson@mit.edu) February 13, 2006 1 Mesh Generation Given a
More informationDRC A Multi-Camera System on PC-Cluster for Real-time 3-D Tracking. Viboon Sangveraphunsiri*, Kritsana Uttamang, and Pongsakon Pedpunsri
The 23 rd Conference of the Mechanical Engineering Network of Thailand November 4 7, 2009, Chiang Mai A Multi-Camera System on PC-Cluster for Real-time 3-D Tracking Viboon Sangveraphunsiri*, Kritsana Uttamang,
More informationScanning Real World Objects without Worries 3D Reconstruction
Scanning Real World Objects without Worries 3D Reconstruction 1. Overview Feng Li 308262 Kuan Tian 308263 This document is written for the 3D reconstruction part in the course Scanning real world objects
More informationVoronoi diagram and Delaunay triangulation
Voronoi diagram and Delaunay triangulation Ioannis Emiris & Vissarion Fisikopoulos Dept. of Informatics & Telecommunications, University of Athens Computational Geometry, spring 2015 Outline 1 Voronoi
More informationAcquisition and Visualization of Colored 3D Objects
Acquisition and Visualization of Colored 3D Objects Kari Pulli Stanford University Stanford, CA, U.S.A kapu@cs.stanford.edu Habib Abi-Rached, Tom Duchamp, Linda G. Shapiro and Werner Stuetzle University
More informationOverview of 3D Object Representations
Overview of 3D Object Representations Thomas Funkhouser Princeton University C0S 597D, Fall 2003 3D Object Representations What makes a good 3D object representation? Stanford and Hearn & Baker 1 3D Object
More informationAspect-Ratio Voronoi Diagram with Applications
Aspect-Ratio Voronoi Diagram with Applications Tetsuo Asano School of Information Science, JAIST (Japan Advanced Institute of Science and Technology), Japan 1-1 Asahidai, Nomi, Ishikawa, 923-1292, Japan
More informationDesign 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 informationAutomatic 3D wig Generation Method using FFD and Robotic Arm
International Journal of Applied Engineering Research ISSN 0973-4562 Volume 12, Number 9 (2017) pp. 2104-2108 Automatic 3D wig Generation Method using FFD and Robotic Arm Md Saifur Rahman 1, Chulhyung
More informationVoronoi Diagrams. Voronoi Diagrams. Swami Sarvottamananda. Ramakrishna Mission Vivekananda University NIT-IGGA, 2010
Voronoi Diagrams Swami Sarvottamananda Ramakrishna Mission Vivekananda University NIT-IGGA, 2010 Outline I 1 Introduction Motivation for Voronoi Diagram Historical Notes and Web References 2 Voronoi Diagrams
More informationPipeline Operations. CS 4620 Lecture 10
Pipeline Operations CS 4620 Lecture 10 2008 Steve Marschner 1 Hidden surface elimination Goal is to figure out which color to make the pixels based on what s in front of what. Hidden surface elimination
More information2 Michael E. Leventon and Sarah F. F. Gibson a b c d Fig. 1. (a, b) Two MR scans of a person's knee. Both images have high resolution in-plane, but ha
Model Generation from Multiple Volumes using Constrained Elastic SurfaceNets Michael E. Leventon and Sarah F. F. Gibson 1 MIT Artificial Intelligence Laboratory, Cambridge, MA 02139, USA leventon@ai.mit.edu
More informationRobot Motion Planning in Eight Directions
Robot Motion Planning in Eight Directions Miloš Šeda and Tomáš Březina Abstract In this paper, we investigate the problem of 8-directional robot motion planning where the goal is to find a collision-free
More information