Results 1  10
of
339
Quantum Gravity
, 2004
"... We describe the basic assumptions and key results of loop quantum gravity, which is a background independent approach to quantum gravity. The emphasis is on the basic physical principles and how one deduces predictions from them, at a level suitable for physicists in other areas such as string theor ..."
Abstract

Cited by 566 (11 self)
 Add to MetaCart
theory, cosmology, particle physics, astrophysics and condensed matter physics. No details are given, but references are provided to guide the interested reader to the literature. The present state of knowledge is summarized in a list of 35 key results on topics including the hamiltonian and path
Z2HOMOLOGY OF WEAK (n − 2)FACELESS nPSEUDOMANIFOLDS MAY BE COMPUTED IN O(n) TIME
"... Abstract. We consider the class of weak (n−2)faceless npseudomanifolds with bounded boundaries and coboundaries. We show that in this class the Betti numbers with Z2 coefficients may be computed in time O(n) and the Z2 homology generators in time O(nm) where n denotes the cardinality of the npseu ..."
Abstract
 Add to MetaCart
Abstract. We consider the class of weak (n−2)faceless npseudomanifolds with bounded boundaries and coboundaries. We show that in this class the Betti numbers with Z2 coefficients may be computed in time O(n) and the Z2 homology generators in time O(nm) where n denotes the cardinality of the npseudomanifold
Compact representations of simplicial meshes in two and three dimensions
 International Journal of Computational Geometry and Applications
, 2003
"... We describe data structures for representing simplicial meshes compactly while supporting online queries and updates efficiently. Our data structure requires about a factor of five less memory than the most efficient standard data structures for triangular or tetrahedral meshes, while efficiently su ..."
Abstract

Cited by 24 (6 self)
 Add to MetaCart
supporting traversal among simplices, storing data on simplices, and insertion and deletion of simplices. Our implementation of the data structures uses about 5 bytes/triangle in two dimensions (2D) and 7.5 bytes/tetrahedron in three dimensions (3D). We use the data structures to implement 2D and 3D
Matchmaker: Manifold BReps for nonmanifold rsets
 Proceedings of the ACM Symposium on Solid Modeling
, 1999
"... Many solid modeling construction techniques produce nonmanifold rsets (solids). With each nonmanifold model N we can associate a family of manifold solid models that are infinitely close to N in the geometric sense. For polyhedral solids, each nonmanifold edge of N with 2k incident faces will be ..."
Abstract

Cited by 41 (19 self)
 Add to MetaCart
Many solid modeling construction techniques produce nonmanifold rsets (solids). With each nonmanifold model N we can associate a family of manifold solid models that are infinitely close to N in the geometric sense. For polyhedral solids, each nonmanifold edge of N with 2k incident faces
Geometric Algorithms and Data Representation for Solid Freeform Fabrication
, 2000
"... Solid freeform fabrication (SFF) refers to a class of technologies used for making rapid prototypes of 3D parts. With these processes, a triangulated boundary representation of the CAD model of the part is "sliced" into horizontal 2.5D layers of uniform thickness that are successively ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Solid freeform fabrication (SFF) refers to a class of technologies used for making rapid prototypes of 3D parts. With these processes, a triangulated boundary representation of the CAD model of the part is "sliced" into horizontal 2.5D layers of uniform thickness that are successively
A Dualizable Representation for Imbedded Graphs
, 1991
"... A new representation is described for graphs imbedded in pseudomanifolds. The graphs may have loops and parallel edges, and they may be disconnected. It is shown that our representation has a welldefined dual that naturally extends the definition of surface duality. This representation is easily tr ..."
Abstract
 Add to MetaCart
A new representation is described for graphs imbedded in pseudomanifolds. The graphs may have loops and parallel edges, and they may be disconnected. It is shown that our representation has a welldefined dual that naturally extends the definition of surface duality. This representation is easily
Results 1  10
of
339