5,089 research outputs found
Discrete curvature approximations and segmentation of polyhedral surfaces
The segmentation of digitized data to divide a free form surface into patches is one of the key steps required to perform a reverse engineering process of an object. To this end, discrete curvature approximations are introduced as the basis of a segmentation process that lead to a decomposition of digitized data into areas that will help the construction of parametric surface patches. The approach proposed relies on the use of a polyhedral representation of the object built from the digitized data input. Then, it is shown how noise reduction, edge swapping techniques and adapted remeshing schemes can participate to different preparation phases to provide a geometry that highlights useful characteristics for the segmentation process. The segmentation process is performed with various approximations of discrete curvatures evaluated on the polyhedron produced during the preparation phases. The segmentation process proposed involves two phases: the identification of characteristic polygonal lines and the identification of polyhedral areas useful for a patch construction process. Discrete curvature criteria are adapted to each phase and the concept of invariant evaluation of curvatures is introduced to generate criteria that are constant over equivalent meshes. A description of the segmentation procedure is provided together with examples of results for free form object surfaces
The web of Calabi-Yau hypersurfaces in toric varieties
Recent results on duality between string theories and connectedness of their
moduli spaces seem to go a long way toward establishing the uniqueness of an
underlying theory. For the large class of Calabi-Yau 3-folds that can be
embedded as hypersurfaces in toric varieties the proof of mathematical
connectedness via singular limits is greatly simplified by using polytopes that
are maximal with respect to certain single or multiple weight systems. We
identify the multiple weight systems occurring in this approach. We show that
all of the corresponding Calabi-Yau manifolds are connected among themselves
and to the web of CICY's. This almost completes the proof of connectedness for
toric Calabi-Yau hypersurfaces.Comment: TeX, epsf.tex; 24 page
Rolling of Coxeter polyhedra along mirrors
The topic of the paper are developments of -dimensional Coxeter polyhedra.
We show that the surface of such polyhedron admits a canonical cutting such
that each piece can be covered by a Coxeter -dimensional domain.Comment: 20pages, 15 figure
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
Using polyhedral models to automatically sketch idealized geometry for structural analysis
Simplification of polyhedral models, which may incorporate large numbers of faces and nodes, is often required to reduce their amount of data, to allow their efficient manipulation, and to speed up computation. Such a simplification process must be adapted to the use of the resulting polyhedral model. Several applications require simplified shapes which have the same topology as the original model (e.g. reverse engineering, medical applications, etc.). Nevertheless, in the fields of structural analysis and computer visualization, for example, several adaptations and idealizations of the initial geometry are often necessary. To this end, within this paper a new approach is proposed to simplify an initial manifold or non-manifold polyhedral model with respect to bounded errors specified by the user, or set up, for example, from a preliminary F.E. analysis. The topological changes which may occur during a simplification because of the bounded error (or tolerance) values specified are performed using specific curvature and topological criteria and operators. Moreover, topological changes, whether or not they kept the manifold of the object, are managed simultaneously with the geometric operations of the simplification process
Hyperbolic semi-adequate links
We provide a diagrammatic criterion for semi-adequate links to be hyperbolic.
We also give a conjectural description of the satellite structures of
semi-adequate links. One application of our result is that the closures of
sufficiently complicated positive braids are hyperbolic links.Comment: 25 pages, 9 figure
- …