A Simple Method for Correcting Facet Orientations in Polygon Meshes Based on Ray Casting Kenshi Takayama Alec Jacobson Ladislav Kavan Olga Sorkine-Hornung.

Slides:



Advertisements
Similar presentations
Parallel Lines & Transversals
Advertisements

Filling Algorithms Pixelwise MRFsChaos Mosaics Patch segments are pasted, overlapping, across the image. Then either: Ambiguities are removed by smoothing.
Area and perimeter calculation using super resolution algorithms M. P. Cipolletti – C. A. Delrieux – M. C. Piccolo – G. M. E. Perillo IADO – UNS – CONICET.
CSC418 Computer Graphics n Polygon normals n Back Faces n Visibility Algorithms.
Ray Tracing CMSC 635. Basic idea How many intersections?  Pixels  ~10 3 to ~10 7  Rays per Pixel  1 to ~10  Primitives  ~10 to ~10 7  Every ray.
Pattern-Based Quadrangulation for N-sided Patches
Chapter 10 Constructions.
Fast and Extensible Building Modeling from Airborne LiDAR Data Qian-Yi Zhou Ulrich Neumann University of Southern California.
A Low-cost Attack on a Microsoft CAPTCHA Yan Qiang,
Introduction to 3D Graphics Lecture 5: From Realism to Real-Time Anthony Steed University College London.
Atomic Volumes for Mesh Completion Joshua Podolak Szymon Rusinkiewicz Princeton University.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
1 Dr. Scott Schaefer Hidden Surfaces. 2/62 Hidden Surfaces.
GATE D Object Representations (GATE-540) Dr.Çağatay ÜNDEĞER Instructor Middle East Technical University, GameTechnologies & General Manager SimBT.
Tomas Mőller © 2000 Speeding up your game The scene graph Culling techniques Level-of-detail rendering (LODs) Collision detection Resources and pointers.
Computer Graphics 14: Surface Detection Methods
Graphics Programming: Polygon Filling
Introduction to Volume Rendering Presented by Zvi Devir.
Implicit Surfaces Tom Ouyang January 29, Outline Properties of Implicit Surfaces Polygonization Ways of generating implicit surfaces Applications.
1 CSCE 441: Computer Graphics Hidden Surface Removal (Cont.) Jinxiang Chai.
Optimized Subdivisions for Preprocessed Visibility Oliver Mattausch, Jiří Bittner, Peter Wonka, Michael Wimmer Institute of Computer Graphics and Algorithms.
Complex Model Construction Mortenson Chapter 11 Geometric Modeling
University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2005 Tamara Munzner Visibility Week 7, Wed.
Importance Driven Volume Rendering Authors: I. Viola, A. Kanitsar, M. Gröler Visualization II Instructor: Jessica Crouch.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Direct Illumination with Lazy Visibility Evaluation David Hart Philip Dutré Donald P. Greenberg Cornell University SIGGRAPH 99.
CS 450: Computer Graphics REVIEW: OVERVIEW OF POLYGONS
CGMB 314 Intro to Computer Graphics Fill Area Primitives.
Mesh Representation, part I
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
© Manfred Huber Autonomous Robots Robot Path Planning.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
CSC418 Computer Graphics n BSP tree n Z-Buffer n A-buffer n Scanline.
Bug Localization with Machine Learning Techniques Wujie Zheng
Schloss Dagstuhl, September 2014 Shape Representation Carlo H. Séquin University of California, Berkeley Slicing Less than Perfect B-Reps and the Winding-Number.
Reusing physical assets through reverse engineering in NX
Visible-Surface Detection Jehee Lee Seoul National University.
B.Sc. Matej Gomboši Determining differences between two sets of polygons Laboratory for Geometric Modelling and Multimedia Algorithms Faculty of Electrical.
Multitouch and Collision Detection MOBILE SOFTWARE DEVELOPMENT.
Mathematics and Implementation of Computer Graphics Techniques 2015 Boundary Aligned Smooth 3D Cross-Frame Field Jin Huang, Yiying Tong, Hongyu Wei, Hujun.
Greedy is not Enough: An Efficient Batch Mode Active Learning Algorithm Chen, Yi-wen( 陳憶文 ) Graduate Institute of Computer Science & Information Engineering.
Digital Media Dr. Jim Rowan ITEC 2110 Vector Graphics II.
3/23/04© University of Wisconsin, CS559 Spring 2004 Last Time Antialiasing –Area-weighted sampling Visibility –Painters algorithm –Depth buffer (Z-buffer)
1Computer Graphics Implementation II Lecture 16 John Shearer Culture Lab – space 2
Binary Space Partitioning Trees Ray Casting Depth Buffering
Mathematics and Implementation of Computer Graphics Techniques 2015 Boundary Aligned Smooth 3D Cross-Frame Field Jin Huang, Yiying Tong, Hongyu Wei, Hujun.
1 Visiblity: Culling and Clipping Computer Graphics COMP 770 (236) Spring 2009 January 21 & 26: 2009.
Computer Graphics Zhen Jiang West Chester University.
Image-Based Segmentation of Indoor Corridor Floors for a Mobile Robot Yinxiao Li and Stanley T. Birchfield The Holcombe Department of Electrical and Computer.
A New Voronoi-based Reconstruction Algorithm
I go on and on in both directions What am I?. A line.
Yizhou Yu Texture-Mapping Real Scenes from Photographs Yizhou Yu Computer Science Division University of California at Berkeley Yizhou Yu Computer Science.
October 16, 2014Computer Vision Lecture 12: Image Segmentation II 1 Hough Transform The Hough transform is a very general technique for feature detection.
Computer Graphics I, Fall 2010 Implementation II.
1 CSCE 441: Computer Graphics Hidden Surface Removal Jinxiang Chai.
Computer Graphics CC416 Week 14 Filling Algorithms.
Computer Graphics Lecture 08 Taqdees A. Siddiqi Computer Graphics Filled Area Primitives I Lecture 08 Taqdees A. Siddiqi
3D Object Representations. Introduction Line and circle and polygon algorithms- represented simple and smooth object. Some Natural object are neither.
Modeling Perspective Effects in Photographic Composition Zihan Zhou, Siqiong He, Jia Li, and James Z. Wang The Pennsylvania State University.
CSC418 Computer Graphics Back Faces Visibility Algorithms.
Decimation Of Triangle Meshes
Hidden Surfaces Dr. Scott Schaefer.
Real-time Wall Outline Extraction for Redirected Walking
Polygon Filling Algorithms
CSCE 441: Computer Graphics Hidden Surface Removal
R F Z D W X C E Y M S V N G T I A L H Q P J O U
Dimensioning Guidelines
Clipping Polygons Dr. Scott Schaefer.
Dr. Jim Rowan ITEC 2110 Vector Graphics II
Presentation transcript:

A Simple Method for Correcting Facet Orientations in Polygon Meshes Based on Ray Casting Kenshi Takayama Alec Jacobson Ladislav Kavan Olga Sorkine-Hornung JCGT paper presentation at I3D 2015 ETH Zurich / National Institute of Informatics Columbia University University of Pennsylvania ETH Zurich 28 February 2015

Goal: automatically correct facet orientations in polygon meshes before after Kenshi Takayama

Consistent orientations needed for: Kenshi Takayama back-face culling two-sided materialinside-outside segmentation [Jacobson13] collision response

Inconsistent orientations still not uncommon Caused by: Orientation-unaware modeling tools (e.g. Google SketchUp) Compositing meshes from different sources Practical correction tool not readily available (apart from those based on manifoldness) Kenshi Takayama Teaser of EG14 paper ShapeSynth [Averkiou 2014] using Google 3D Warehouse

Previous work Kenshi Takayama

Solidity-based method [Murali97] Scalar field f(p) indicating solidity at point p ∈ ℝ 3 f(p) > 0  p is inside the solid f(p) < 0  p is outside the solid Sought as harmonic with boundary conditions: f(p) = −1 for p → ∞ f(p front ) = −f(p back ) for points on facets Orient each facet based on integration of f(p) over it Kenshi Takayama p back p front

Solidity-based method [Murali97] Assumes each facet to be boundary between inside & outside Doesn’t work when facets overlap Becomes unreliable at self-intersections & open boundaries f(p) vanishes Kenshi Takayama binary coloringresulting orientations inside-out!

Visibility-based methods [Borodin04; Zhou08] Step 1: visibility sampling Step 2: (Borodin04) greedy propagation (Zhou08) labeling by graphcut Step 2 complicated, hard to reproduce  Our claim: Step 1 suffices, Step 2 unnecessary! Kenshi Takayama [Borodin 2004] [Zhou 2008]

Algorithm Kenshi Takayama

Visibility sampling by ray casting Kenshi Takayama +1 counter front back (basic idea) Front side is more visible from outside

Heuristic to handle interior facets Kenshi Takayama accumulated distance front back (basic idea) Front side has more “free” space

Failure mode of the heuristic Kenshi Takayama accumulated distance front back

Failure mode of the heuristic Kenshi Takayama

Ray intersection parity sampling Kenshi Takayama 1 mod 2  +1 1 mod 2  +1 1 mod 2  +1 1 mod 2  +1 2 mod 2  +0 4 mod 2  +0 3 mod 2  +1 2 mod 2  +0 counter back front

Ray intersection parity sampling Essentially the same effect as [Murali97] Assumes each facet to be boundary between inside & outside Kenshi Takayama

Challenging case: When overlaps and cavities coexist Never found during our evaluation, mostly of theoretical interest Parity-based method never used Kenshi Takayama generalized winding number [Jacobson13] facets with visibilitywith parity

Evaluation Kenshi Takayama

Dataset SHREC (SHape REtrieval Contest) 2010 [Vanamali10] meshes from Google 3D Warehouse Most meshes far from being clean and watertight Kenshi Takayama

Backfacingness measure Irrelevant if mesh contains: Cannot define “ground truth” Kenshi Takayama = 0.28 #∎pixels + #∎pixels #∎pixels Single-faceted geometry representing thin parts Interior facets representing internal structures

Option: patch-wise vs. facet-wise Patch: set of facets connected by manifold edges Weird mesh connectivity might result in weird patches Facet-wise decision can be sometimes problematic Kenshi Takayama manifoldnon-manifold patch-wisefacet-wise same patch!

Results On average: 0.19 (±0.26)  (±0.0063) Kenshi Takayama 0.55      

Larger backfacingness remaining All belong to single-faceted geometries Kenshi Takayama

Meshes with interior objects Kenshi Takayama

Thank you! Demo executable and C++ code available at: Acknowledgements: Advice and feedback Peter Kaufmann, Wenzel Jakob, Nobuyuki Umetani, Melina Skouras, Ilya Baran, Ryan Schmidt Funding and gift ERC grant iModel (StG ), SNF award _137879, NSF grant IIS , Adobe Research Fellowships Kenshi Takayama: JSPS Postdoctoral Fellowships for Research Abroad Alec Jacobson: Intel Doctoral Fellowship Kenshi Takayama