1 / 22

Visibility in Point Clouds

Visibility in Point Clouds. Philip Dutré - Parag Tole Program of Computer Graphics Cornell University. Motivation. points as modeling and rendering primitives finding new ways to evaluate (and approximate) the visibility function. General Idea.

nardo
Download Presentation

Visibility in Point Clouds

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Visibility in Point Clouds Philip Dutré - Parag Tole Program of Computer Graphics Cornell University

  2. Motivation • points as modeling and rendering primitives • finding new ways to evaluate (and approximate) the visibility function

  3. General Idea • Sample original surfaces (polygons) to construct set of oriented points • Evaluate visibility between any two points in the scene using only this point cloud

  4. eye General Idea • Use it for shading only, NOT for primary visibility visibility = 0 or 1?

  5. General Idea • Exact visibility: 0 or 1 • Approximate visibility: numerical value between 0 and 1 • “confidence” that 2 points are mutually visible • use as numerical value in shading calculations

  6. Generate oriented surface points Scene geometry Surface sampling Oriented points

  7. Intersection heuristic • Find closest point x to query line pq • Approximate original surface by surface element Sx • position Sx : probability density dns(Sx) • Check whether Sx intersects pq

  8. Intersection heuristic q Pq Px Sx y x Pp p

  9. Intersection heuristic • Probability y belongs to Sx : • Visibility value:

  10. Intersection heuristic • Use C closest points to query line pq

  11. Use only ‘valid’ points x3 q x2 > threshold distance Pq x1 Pp p

  12. Validation • Sx = square with length L • dns(Sx):

  13. Validation • Use vis(pq) as probability to determine whether pq is visible • compare to exact visibility of pq

  14. Validation

  15. Validation • size of Sx doesn’t really matter • Power d indicates a stepping function? • true for this validation • not true for shading

  16. Direct Illumination • use continuous value of vis(pq) reference - 97min. 10,000 points - 50m. 20,000 points - 59m.

  17. Global Illumination • Bidirectional path tracing • Generate & store light paths • Rendering: generate eye path & connect to selected light paths • Use continuous visibility value with separate point cloud

  18. Global Illumination reference - 37m. 20,000 points - 229m. 100,000 points - 334m.

  19. Some trivial extensions • Use point cloud for primary visibility (reprojection) • Light paths + point cloud = same set • Separate clouds for each object (e.g. LDIs, points as modeling primitives) TR: http://www.graphics.cornell.edu/pubs/2000/DTG00.html

  20. Open Questions • “Polygons are so 10 days ago, but points are hot!!!” • Is exact visibility always necessary? • Do we need the same model representations for display & shading?

  21. Conclusion • TR: http://www.graphics.cornell.edu/pubs/ 2000/DTG00.html

More Related