Sciweavers

Share
CCCG
2010

I/O efficient path traversal in well-shaped tetrahedral meshes

10 years 1 months ago
I/O efficient path traversal in well-shaped tetrahedral meshes
We present a data structure which represents a wellshaped convex tetrahedral mesh, M, in linear space such that path traversals visiting a sequence of K tetrahedra require O (K/ lg B) I/O operations in the external memory model. As applications of our structure we show how to efficiently perform axis parallel box queries and how to report the intersection of M with an arbitrarily oriented plane.
Craig Dillabaugh
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2010
Where CCCG
Authors Craig Dillabaugh
Comments (0)
books