We've updated our privacy policy. Click here to review the details. Tap here to review the details.

Successfully reported this slideshow.

Your SlideShare is downloading.
×

Activate your 30 day free trial to unlock unlimited reading.

Activate your 30 day free trial to continue reading.

Upcoming SlideShare

Spatial correlation based clustering algorithm for random and uniform topolog...

Loading in …3

×

Top clipped slide

1 of 16
Ad

Download to read offline

Learn more about new mesh body type introduced in version 1.3 of LSS Arch extension for SketchUp.

Architect

Learn more about new mesh body type introduced in version 1.3 of LSS Arch extension for SketchUp.

- 1. BLOB BODY TYPE
- 2. BASIC IDEA When mesh body type is set to 'blob', extension treats nodal points as a spherical data set.
- 3. Extension estimates position of an average point from given nodal points and places center of a spherical data set at it. BASIC IDEA
- 4. During interpolation length of radius vectors to unknown points are calculated according to selected interpolation algorithm. BASIC IDEA
- 5. Inverse Distance Weighting IDW ALGORITHM
- 6. IDW ALGORITHM Inverse Angle Weighting (IAW) would be a more accurate name because algorithm actually uses angle to measure 'amount of proximity'
- 7. 'Average' and 'minimize' algorithms ITERATIVE ALGORITHMS
- 8. First stage is a preliminary calculation, which sets the same length to a radius vector to a point being calculated as a length of a vector to a closest* known nodal point. ITERATIVE ALGORITHMS * - «closest» in terms of spherical coordinate system here
- 9. The second stage is an iterative smoothing itself: points within a cell size angle from known points stay where they are, others gradually move along their radius vectors. ITERATIVE ALGORITHMS
- 10. So the process is similar to the one that takes place during conventional 'terrain-like' mesh processing. It is just adapted a bit for spherical coordinate system. ITERATIVE ALGORITHMS
- 11. TREND AND PREDICT Mapped surface
- 12. Adaptation of these algorithms for spherical coordinate system is a bit more tricky. Extension maps given points to Cartesian coordinate system at first... TREND AND PREDICT
- 13. TREND AND PREDICT ...then processes mapped set as usual.
- 14. IDW VS PREDICT Radius vector to each given nodal point is normal to a surface tangent plane at this point, when algorithm is set to IDW. So known points are local extrema. IDW
- 15. IDW VS PREDICT The idea of 'predict' algorithm is to estimate surface tangent planes at given nodal points. 'Predict'
- 16. IDW VS PREDICT Known points are not necessarily local extrema in case when 'predict' algorithm is chosen so result of interpolation can be more convincing.

No public clipboards found for this slide

You just clipped your first slide!

Clipping is a handy way to collect important slides you want to go back to later. Now customize the name of a clipboard to store your clips.Hate ads?

Enjoy access to millions of presentations, documents, ebooks, audiobooks, magazines, and more **ad-free.**

The SlideShare family just got bigger. Enjoy access to millions of ebooks, audiobooks, magazines, and more from Scribd.

Cancel anytime.
Be the first to like this

Total views

3,910

On SlideShare

0

From Embeds

0

Number of Embeds

2,907

Unlimited Reading

Learn faster and smarter from top experts

Unlimited Downloading

Download to take your learnings offline and on the go

You also get free access to Scribd!

Instant access to millions of ebooks, audiobooks, magazines, podcasts and more.

Read and listen offline with any device.

Free access to premium services like Tuneln, Mubi and more.

We’ve updated our privacy policy so that we are compliant with changing global privacy regulations and to provide you with insight into the limited ways in which we use your data.

You can read the details below. By accepting, you agree to the updated privacy policy.

Thank you!

We've encountered a problem, please try again.