3DConvexHulls

# 3DConvexHulls - A brief and sketchy intro to 3D Convex...

This preview shows pages 1–9. Sign up to view the full content.

Haga clic para modificar el estilo de subtítulo del patrón 4/2/11 A brief and sketchy intro to Rodrigo Silveira GEOC 2010/11 - Q2

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

View Full Document
4/2/11 Convex hulls in 3D CH of set of points in 3D: (convex) polytope 2D: CH of n points…. at most n vertices at most n edges 22
4/2/11 Representation 2D: CH is a polygon Easy to store and maintain: vertex array/list 3D: Polytope More than a list of vertices! Graph of facets, edges, and vertices 33

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

View Full Document
4/2/11 Representation Example Incidence graphs 44
4/2/11 Incremental algorithm Same principle than in 2D Initialize CH to CH of the first (3+1)=4 points Incremental step Take next point, p , and insert it Trick: treat points in order by x-coordinate Then the next point is always outside previous CH Also works in 2D! 55

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

View Full Document
4/2/11 Computing CH(Pi U {p})

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 04/01/2011 for the course MA GEOC taught by Professor Julianpleife during the Spring '11 term at Universitat Politècnica de Catalunya.

### Page1 / 9

3DConvexHulls - A brief and sketchy intro to 3D Convex...

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

View Full Document
Ask a homework question - tutors are online