439 research outputs found
Mixed honeycomb pushing refinement
We generalize the honeycomb scheme, dualize it and combine both the primal and the dual scheme into self-dual subdivision schemes for convex polyhedra which generate surfaces without line segments different from the honeycomb scheme, which generates surfaces having line and even planar segments
QuickCSG: Fast Arbitrary Boolean Combinations of N Solids
QuickCSG computes the result for general N-polyhedron boolean expressions
without an intermediate tree of solids. We propose a vertex-centric view of the
problem, which simplifies the identification of final geometric contributions,
and facilitates its spatial decomposition. The problem is then cast in a single
KD-tree exploration, geared toward the result by early pruning of any region of
space not contributing to the final surface. We assume strong regularity
properties on the input meshes and that they are in general position. This
simplifying assumption, in combination with our vertex-centric approach,
improves the speed of the approach. Complemented with a task-stealing
parallelization, the algorithm achieves breakthrough performance, one to two
orders of magnitude speedups with respect to state-of-the-art CPU algorithms,
on boolean operations over two to dozens of polyhedra. The algorithm also
outperforms GPU implementations with approximate discretizations, while
producing an output without redundant facets. Despite the restrictive
assumptions on the input, we show the usefulness of QuickCSG for applications
with large CSG problems and strong temporal constraints, e.g. modeling for 3D
printers, reconstruction from visual hulls and collision detection
Doctor of Philosophy
dissertationMany algorithms have been developed for synthesizing shaded images of three dimensional objects modeled by computer. In spite of widely differing approaches the current state of the art algorithms are surprisingly similar with respect to the richness of the scenes they can process. One attribute these algorithms have in common is the use of a conventional passive data base to represent the objects being modeled. This paper postulates and explores the use of an alternative modeling technique which uses procedures to represent the objects being modeled. The properties and structure of such "procedure models" are investigated and an algorithm based on them is presented
QuickCSG: Fast Arbitrary Boolean Combinations of N Solids
QuickCSG computes the result for general N-polyhedron boolean expressions
without an intermediate tree of solids. We propose a vertex-centric view of the
problem, which simplifies the identification of final geometric contributions,
and facilitates its spatial decomposition. The problem is then cast in a single
KD-tree exploration, geared toward the result by early pruning of any region of
space not contributing to the final surface. We assume strong regularity
properties on the input meshes and that they are in general position. This
simplifying assumption, in combination with our vertex-centric approach,
improves the speed of the approach. Complemented with a task-stealing
parallelization, the algorithm achieves breakthrough performance, one to two
orders of magnitude speedups with respect to state-of-the-art CPU algorithms,
on boolean operations over two to dozens of polyhedra. The algorithm also
outperforms GPU implementations with approximate discretizations, while
producing an output without redundant facets. Despite the restrictive
assumptions on the input, we show the usefulness of QuickCSG for applications
with large CSG problems and strong temporal constraints, e.g. modeling for 3D
printers, reconstruction from visual hulls and collision detection
Shapes of polyhedra, mixed volumes and hyperbolic geometry
We generalize to higher dimensions the Bavard–Ghys construction of the hyperbolic metric on the space of polygons with fixed directions of edges. The space of convex d -dimensional polyhedra with fixed directions of facet normals has a decomposition into type cones that correspond to different combinatorial types of polyhedra. This decomposition is a subfan of the secondary fan of a vector configuration and can be analyzed with the help of Gale diagrams. We construct a family of quadratic forms on each of the type cones using the theory of mixed volumes. The Alexandrov–Fenchel inequalities ensure that these forms have exactly one positive eigenvalue. This introduces a piecewise hyperbolic structure on the space of similarity classes of polyhedra with fixed directions of facet normals. We show that some of the dihedral angles on the boundary of the resulting cone-manifold are equal to π/2
PARABOLIC BLENDING SURFACES ALONG POLYHEDRON EDGES
In this paper parabolic blending surfaces are defined along a chain of polyhedron edges.
The profile curve of each sweep surface generated for a given edge is a conic section, and
every point of it moves on a conic section around a vertex. According to this, the patches
at the corners are given in rational biquadratic form and they join to the cylindrical
surfaces replacing the edges with 1st order continuity
Polyhedra in loop quantum gravity
Interwiners are the building blocks of spin-network states. The space of
intertwiners is the quantization of a classical symplectic manifold introduced
by Kapovich and Millson. Here we show that a theorem by Minkowski allows us to
interpret generic configurations in this space as bounded convex polyhedra in
Euclidean space: a polyhedron is uniquely described by the areas and normals to
its faces. We provide a reconstruction of the geometry of the polyhedron: we
give formulas for the edge lengths, the volume and the adjacency of its faces.
At the quantum level, this correspondence allows us to identify an intertwiner
with the state of a quantum polyhedron, thus generalizing the notion of quantum
tetrahedron familiar in the loop quantum gravity literature. Moreover, coherent
intertwiners result to be peaked on the classical geometry of polyhedra. We
discuss the relevance of this result for loop quantum gravity. In particular,
coherent spin-network states with nodes of arbitrary valence represent a
collection of semiclassical polyhedra. Furthermore, we introduce an operator
that measures the volume of a quantum polyhedron and examine its relation with
the standard volume operator of loop quantum gravity. We also comment on the
semiclassical limit of spinfoams with non-simplicial graphs.Comment: 32 pages, many figures. v2 minor correction
Introductory lectures to loop quantum gravity
We give a standard introduction to loop quantum gravity, from the ADM
variables to spin network states. We include a discussion on quantum geometry
on a fixed graph and its relation to a discrete approximation of general
relativity.Comment: Based on lectures given at the 3eme Ecole de Physique Theorique de
Jijel, Algeria, 26 Sep -- 3 Oct, 2009. 52 pages, many figures. v2 minor
corrections. To be published in the proceeding
Efficient contact determination between geometric models
http://archive.org/details/efficientcontact00linmN
- …