The {PR}-star octree: a spatio-topological data structure for tetrahedral meshes

  • Weiss K
  • Fellegara R
  • De Floriani L
 et al. 
  • 18


    Mendeley users who have this article in their library.
  • 11


    Citations of this article.


We propose the PR-star octree as a combined spatial data structure for performing efficient topological queries on tetrahedral meshes. The PR-star octree augments the Point Region octree (PR Octree) with a list of tetrahedra incident to its indexed vertices, i.e. those in the star of its vertices. Thus, each leaf node encodes the min-imal amount of information necessary to locally reconstruct the topological connectivity of its indexed elements. This provides the flexibility to efficiently construct the optimal data structure to solve the task at hand using a fraction of the memory required for a cor-responding data structure on the global tetrahedral mesh. Due to the spatial locality of successive queries in typical GIS applications, the construction costs of these runtime data structures are amortized over multiple accesses while processing each node. We demonstrate the advantages of the PR-star octree representation in several typi-cal GIS applications, including detection of the domain boundaries, computation of local curvature estimates and mesh simplification.

Author-supplied keywords

  • Categories and Subject Descriptors E1 [Data]
  • Computational Geometry and Object Modeling—Curve
  • Data Structures—Graphs and networks
  • I35 [Computer Graphics]
  • I36 [Computer Graphics]
  • solid
  • surface

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Kenneth Weiss

  • Riccardo Fellegara

  • Leila De Floriani

  • Marcelo Velloso

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free