lec39 - BSP Trees Binary space partitioning trees. Used to...

Info iconThis preview shows pages 1–20. Sign up to view the full content.

View Full Document Right Arrow Icon
BSP Trees Binary space partitioning trees. Used to store a collection of objects in n- dimensional space. Tree recursively divides n-dimensional space using (n-1)-dimensional hyperplanes.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Space Partitioning n-dimensional space splitting hyperplane (n-1)-dimensional a 1 x 1 + a 2 x 2 + … a n x n + a n+1 = 0 ax + by + c = 0 (2D) ax+by+cz+d = 0 (3D)
Background image of page 2
Space Partitioning n-dimensional space +ve half space ax + by + c > 0 ax+by+cz+d > 0 -ve half space ax + by + c < 0 ax+by+cz+d < 0 coincident ax + by + c = 0 ax+by+cz+d = 0
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Classifying Object z In 2D, ph is the line ax + by + c = 0. Compute ax + by + c for all vertices of z . If all values are = 0; z is coincident to ph . If all values are <= 0; z is left of ph . If all values are >= 0; z is right of ph . Otherwise, z spans ph and is to be split by finding intersection points with ph .
Background image of page 4
2D a b c d g e f h Equation of ph is x – 6 = 0 6
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2D a b c d g e f h Equation of ph is y –x – 2 = 0 2
Background image of page 6
3D x z y Equation of ph is z – 2 = 0 General: ax + by + cz + d = 0
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Space Partitioning n-dimensional space -ve +ve -ve +ve coincident list
Background image of page 8
Objects in 2D a b c d g e f h
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Objects in 2D a b c d g e f h
Background image of page 10
Objects in 2D a b c d g e f h a-d e-h
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Objects in 2D a b c d g e f h a-d e-h
Background image of page 12
Objects in 2D a b c d g e f h a-b e-f c-d g-h
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Objects in 2D a b c d g e f h a bc d e f g h
Background image of page 14
Collision Detection a c g a bc d e f g h
Background image of page 15

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Visibility Ordering a g e f h a bc d e f g h
Background image of page 16
BSP Tree Construction Select partitioning hyperplanes. Partition objects. Repeat on partitions.
Background image of page 17

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Partitioning Hyperplane Selection Face of an object. a b c d g e f h
Background image of page 18
Partitioning Hyperplane Selection Face of an object.
Background image of page 19

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 20
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 47

lec39 - BSP Trees Binary space partitioning trees. Used to...

This preview shows document pages 1 - 20. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online