zippered polygon meshes from range images
play

Zippered Polygon Meshes From Range Images Greg Turk and Mark Levoy - PowerPoint PPT Presentation

Mar 06, 2023 •428 likes •559 views

Zippered Polygon Meshes From Range Images Greg Turk and Mark Levoy Stanford University SIGGRAPH 94 Presented by John Novatnack How Do We Construct 3D Meshes? Range Images Acquiring Range Images Image courtesy of

  1. Zippered Polygon Meshes From Range Images Greg Turk and Mark Levoy Stanford University SIGGRAPH 94 Presented by John Novatnack

  2. How Do We Construct 3D Meshes?

  3. Range Images

  4. Acquiring Range Images Image courtesy of http://www.chromecow.com/MadScience/3DScanner/Sketch_2.jpg

  5. Range Scanner Image coursey of http://www1.cs.columbia.edu/~atanas/research/scara/setup.jpg

  6. Paper Approach 1. Registration: Align range images 2. Integration: Zipper adjacent range images 3. Smoothing: Compute local weight averages

  7. Registration: ICP ICP - iterative closet point 1. User crudely aligns range images 2. Algorithm “snaps” range images together • Minimizes weighted least squares metric Extremely effective!

  8. Integration: Zippering 1. Remove overlap between meshes 2. Clip the meshes 3. Remove small triangles

  9. Results

  10. Results

  11. Results

  12. Overview • A method of constructing meshes from range images • Keys: – Incremental – Suspect data ignored

Recommend

Polygon Meshes and in Computer Graphics? Graded: Implicit Surfaces Programming

Polygon Meshes and in Computer Graphics? Graded: Implicit Surfaces Programming

Announcements What do we need from shapes Polygon Meshes and in Computer Graphics? Graded: Implicit Surfaces Programming Assignment 1 Ian or Michael Local control of shape for modeling Grades in file in your turnin

581 views • 5 slides
4.1 Polygon Meshes and Implicit Surfaces Hao Li http://cs420.hao-li.com 1 Geometric

4.1 Polygon Meshes and Implicit Surfaces Hao Li http://cs420.hao-li.com 1 Geometric

Fall 2018 CSCI 420: Computer Graphics 4.1 Polygon Meshes and Implicit Surfaces Hao Li http://cs420.hao-li.com 1 Geometric Representations point based quad mesh triangle mesh implicit surfaces / particles volumetric tetrahedrons 2

1.11k views • 54 slides
4.1 Polygon Meshes and Implicit Surfaces Hao Li http://cs420.hao-li.com 1 Geometric

4.1 Polygon Meshes and Implicit Surfaces Hao Li http://cs420.hao-li.com 1 Geometric

Fall 2014 CSCI 420: Computer Graphics 4.1 Polygon Meshes and Implicit Surfaces Hao Li http://cs420.hao-li.com 1 Geometric Representations point based quad mesh triangle mesh implicit surfaces / particles volumetric tetrahedrons 2

701 views • 54 slides
Best Practices Workshop: Overset Meshing Overview Introduction to Overset Meshes Range of

Best Practices Workshop: Overset Meshing Overview Introduction to Overset Meshes Range of

Best Practices Workshop: Overset Meshing Overview Introduction to Overset Meshes Range of Application Workflow Demonstrations and Best Practices What are Overset Meshes? Overset meshes are also known as Chimera or overlapping meshes An

437 views • 21 slides
Subdivision Surfaces 1 Geometric Modeling Sometimes need more than polygon meshes Smooth

Subdivision Surfaces 1 Geometric Modeling Sometimes need more than polygon meshes Smooth

Subdivision Surfaces 1 Geometric Modeling Sometimes need more than polygon meshes Smooth surfaces Traditional geometric modeling used NURBS Non uniform rational B-Spline 2 Problems with NURBS A single NURBS patch is either a

917 views • 62 slides
Subdivision Surfaces 1 Geometric Modeling Geometric Modeling Sometimes need more than

Subdivision Surfaces 1 Geometric Modeling Geometric Modeling Sometimes need more than

Subdivision Surfaces 1 Geometric Modeling Geometric Modeling Sometimes need more than polygon meshes Sometimes need more than polygon meshes Smooth surfaces Traditional geometric modeling used NURBS Non uniform rational

1.04k views • 89 slides
Subdivision Surfaces 1 Geometric Modeling Geometric Modeling Sometimes need more than

Subdivision Surfaces 1 Geometric Modeling Geometric Modeling Sometimes need more than

Subdivision Surfaces 1 Geometric Modeling Geometric Modeling Sometimes need more than polygon meshes Sometimes need more than polygon meshes Smooth surfaces Traditional geometric modeling used NURBS Non uniform rational

1.06k views • 58 slides
15 E ffi cient mesh models Steve Marschner CS5625 Spring 2020 Follows chapter 16 in RTR 4e Basics

15 E ffi cient mesh models Steve Marschner CS5625 Spring 2020 Follows chapter 16 in RTR 4e Basics

15 E ffi cient mesh models Steve Marschner CS5625 Spring 2020 Follows chapter 16 in RTR 4e Basics of e ffi ciency for meshes Use triangle or quad meshes general polygon meshes lead to too much complexity quad meshes are great for some

207 views • 17 slides
Polygon Filling (Rasterization) 1 Point-in-polygon test How do we tell if a point is inside

Polygon Filling (Rasterization) 1 Point-in-polygon test How do we tell if a point is inside

Computer Graphics Course 2005 Polygon Filling (Rasterization) 1 Point-in-polygon test How do we tell if a point is inside or outside a polygon? 2 Point-in-polygon test Odd-even rule: count the number of times a line from the point

336 views • 11 slides
Polygon Filling (Rasterization) 1 2 Point- -in in- -polygon test polygon test Point

Polygon Filling (Rasterization) 1 2 Point- -in in- -polygon test polygon test Point

Computer Graphics Course Point-in-polygon test 2005 How do we tell if a point is inside or outside a polygon? Polygon Filling (Rasterization) 1 2 Point- -in in- -polygon test polygon test Point Point-in-polygon test Non Non-

563 views • 4 slides
Shape and Appearance from Images and Range Data Brian Curless University of Washington Overview

Shape and Appearance from Images and Range Data Brian Curless University of Washington Overview

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 clouds Reconstruction from range

511 views • 29 slides
SE3250 Intro to 3D Computer Graphics Jay Urbain Credits: OpenGL, Jason Leigh University of

SE3250 Intro to 3D Computer Graphics Jay Urbain Credits: OpenGL, Jason Leigh University of

SE3250 Intro to 3D Computer Graphics Jay Urbain Credits: OpenGL, Jason Leigh University of Illinois at Chicago Geometry - Polygon, Mesh, Vertex Most visible objects in a 3D scene are made up of polygon meshes A mesh is a grid-like

640 views • 36 slides
Shape and Appearance from Images and Range Data Brian Curless University of Washington Overview

Shape and Appearance from Images and Range Data Brian Curless University of Washington Overview

SIGGRAPH 99 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 clouds Reconstruction from range

302 views • 26 slides
Polygon Filling Goal intensify the pixels that belong to the polygon Issues which pixels belong

Polygon Filling Goal intensify the pixels that belong to the polygon Issues which pixels belong

Polygon Filling Goal intensify the pixels that belong to the polygon Issues which pixels belong to the polygon Approach use a (horizontal) scan line that traverses the polygon intensify the pixels along the spans (the segments of

895 views • 50 slides
Meshes/no meshes, radiation and tasks Numerical algorithms for the future of astrophysical

Meshes/no meshes, radiation and tasks Numerical algorithms for the future of astrophysical

Meshes/no meshes, radiation and tasks Numerical algorithms for the future of astrophysical simulations Bert Vandenbroucke bv7@st-andrews.ac.uk Pedro Gonnet (Google), Matthieu Schaller (Leiden), Josh Borrow (Durham) Slide 2 of 51 Why do we

774 views • 51 slides
Progressive Meshes (96) Hugues Hoppe and Efficient Implementation of P-Meshes (98) Hugues Hoppe

Progressive Meshes (96) Hugues Hoppe and Efficient Implementation of P-Meshes (98) Hugues Hoppe

Progressive Meshes (96) Hugues Hoppe and Efficient Implementation of P-Meshes (98) Hugues Hoppe TongKe Xue Problems with Large Meshes Expensive to store Expensive to transmit Exprensive to renders --> Motivates new

456 views • 31 slides
Classifying Laser Range Data Images Supervisor: Elin Anna Topp Fredrik Paulsson Shan

Classifying Laser Range Data Images Supervisor: Elin Anna Topp Fredrik Paulsson Shan

Classifying Laser Range Data Images Supervisor: Elin Anna Topp Fredrik Paulsson Shan Senanayake Lund University Faculty of Engineering May 25, 2015 F. Paulsson, S. Senanayake (LTH) Classifying Laser Range Data Images May 25,

751 views • 45 slides
Polygon Triangulation Computational Geometry The Art Gallery Problem Guarding and

Polygon Triangulation Computational Geometry The Art Gallery Problem Guarding and

Yazd Univ. Polygon Triangulation Computational Geometry The Art Gallery Problem Guarding and Triangulations Computing triangulation 1392-1 Partitioning a Polygon into Monotone Pieces Triangulating a Monotone Polygon 1 / 37

1.23k views • 90 slides
Surfaces/Meshes Well stick to triangles Working with Meshes CS 176 Winter 2011 CS 176 Winter

Surfaces/Meshes Well stick to triangles Working with Meshes CS 176 Winter 2011 CS 176 Winter

Surfaces/Meshes Well stick to triangles Working with Meshes CS 176 Winter 2011 CS 176 Winter 2011 1 2 Discrete Surfaces Whats a Mesh? Setup Formally pointers floats topology & geometry abstract simplicial

532 views • 4 slides
Polygon Leak Detection Trace & Access Services Jamie Nash LD Director Polygon Trace &

Polygon Leak Detection Trace & Access Services Jamie Nash LD Director Polygon Trace &

Polygon Leak Detection Trace & Access Services Jamie Nash LD Director Polygon Trace & Access Agenda Introduction to LD How we find leaks Case study IOT Preventative Technology Questions Flaws in traditional

623 views • 18 slides
Surface Registration Gianpaolo Palma The problem 3D scanning generates multiple range images

Surface Registration Gianpaolo Palma The problem 3D scanning generates multiple range images

Surface Registration Gianpaolo Palma The problem 3D scanning generates multiple range images Each contain 3D points for different parts of the model in the local coordinates of the scanner Find a rigid transformation (rotation +

1.02k views • 55 slides
On 48 and Quasi 48 Meshes Luiz Velho Jonas Gomes Visgraf Laboratory IMPA Instituto de

On 48 and Quasi 48 Meshes Luiz Velho Jonas Gomes Visgraf Laboratory IMPA Instituto de

On 48 and Quasi 48 Meshes Luiz Velho Jonas Gomes Visgraf Laboratory IMPA Instituto de Matem atica Pura e Aplicada Rio de Janeiro, Brasil 1 Outline Background on 4-8 Meshes Hierarchical Quasi 4-8 Meshes Representation

772 views • 22 slides
Integrable and chaotic mappings of the plane with polygon invariants. Tim Zolkin 1 Sergei

Integrable and chaotic mappings of the plane with polygon invariants. Tim Zolkin 1 Sergei

1. Definitions, historical remarks and tools we need 2. Periodic integer maps with polygon invariants 3. Maps with polygon invariants Integrable and chaotic mappings of the plane with polygon invariants. Tim Zolkin 1 Sergei Nagaitsev 1 , 2 1

691 views • 65 slides
Meshes CS418 Computer Graphics John C. Hart Simple Meshes Cylinder ( x , y , z ) = (cos q

Meshes CS418 Computer Graphics John C. Hart Simple Meshes Cylinder ( x , y , z ) = (cos q

Meshes CS418 Computer Graphics John C. Hart Simple Meshes Cylinder ( x , y , z ) = (cos q , sin q , z ) Cone ( x , y , z ) = (| z| cos q , | z| sin q , z ) Sphere ( x , y , z ) = (cos f cos q , cos f sin q , sin f ) Torus

344 views • 15 slides

More recommend