1,519 research outputs found

    Liftings and stresses for planar periodic frameworks

    Get PDF
    We formulate and prove a periodic analog of Maxwell's theorem relating stressed planar frameworks and their liftings to polyhedral surfaces with spherical topology. We use our lifting theorem to prove deformation and rigidity-theoretic properties for planar periodic pseudo-triangulations, generalizing features known for their finite counterparts. These properties are then applied to questions originating in mathematical crystallography and materials science, concerning planar periodic auxetic structures and ultrarigid periodic frameworks.Comment: An extended abstract of this paper has appeared in Proc. 30th annual Symposium on Computational Geometry (SOCG'14), Kyoto, Japan, June 201

    Geometric auxetics

    Get PDF
    We formulate a mathematical theory of auxetic behavior based on one-parameter deformations of periodic frameworks. Our approach is purely geometric, relies on the evolution of the periodicity lattice and works in any dimension. We demonstrate its usefulness by predicting or recognizing, without experiment, computer simulations or numerical approximations, the auxetic capabilities of several well-known structures available in the literature. We propose new principles of auxetic design and rely on the stronger notion of expansive behavior to provide an infinite supply of planar auxetic mechanisms and several new three-dimensional structures

    Gap Processing for Adaptive Maximal Poisson-Disk Sampling

    Full text link
    In this paper, we study the generation of maximal Poisson-disk sets with varying radii. First, we present a geometric analysis of gaps in such disk sets. This analysis is the basis for maximal and adaptive sampling in Euclidean space and on manifolds. Second, we propose efficient algorithms and data structures to detect gaps and update gaps when disks are inserted, deleted, moved, or have their radius changed. We build on the concepts of the regular triangulation and the power diagram. Third, we will show how our analysis can make a contribution to the state-of-the-art in surface remeshing.Comment: 16 pages. ACM Transactions on Graphics, 201

    Canonical ordering for graphs on the cylinder, with applications to periodic straight-line drawings on the flat cylinder and torus

    Get PDF
    We extend the notion of canonical ordering (initially developed for planar triangulations and 3-connected planar maps) to cylindric (essentially simple) triangulations and more generally to cylindric (essentially internally) 33-connected maps. This allows us to extend the incremental straight-line drawing algorithm of de Fraysseix, Pach and Pollack (in the triangulated case) and of Kant (in the 33-connected case) to this setting. Precisely, for any cylindric essentially internally 33-connected map GG with nn vertices, we can obtain in linear time a periodic (in xx) straight-line drawing of GG that is crossing-free and internally (weakly) convex, on a regular grid Z/wZ×[0..h]\mathbb{Z}/w\mathbb{Z}\times[0..h], with w≤2nw\leq 2n and h≤n(2d+1)h\leq n(2d+1), where dd is the face-distance between the two boundaries. This also yields an efficient periodic drawing algorithm for graphs on the torus. Precisely, for any essentially 33-connected map GG on the torus (i.e., 33-connected in the periodic representation) with nn vertices, we can compute in linear time a periodic straight-line drawing of GG that is crossing-free and (weakly) convex, on a periodic regular grid Z/wZ×Z/hZ\mathbb{Z}/w\mathbb{Z}\times\mathbb{Z}/h\mathbb{Z}, with w≤2nw\leq 2n and h≤1+2n(c+1)h\leq 1+2n(c+1), where cc is the face-width of GG. Since c≤2nc\leq\sqrt{2n}, the grid area is O(n5/2)O(n^{5/2}).Comment: 37 page

    Rigorous Simulation of 3D Masks

    Get PDF
    We perform 3D lithography simulations by using a finite-element solver. To proof applicability to real 3D problems we investigate DUV light propagation through a structure of size 9 microns times 4 microns times 65 nm. On this relatively large computational domain we perform rigorous computations (No Hopkins) taking into account a grid of 11 times 21 source points with two polarization directions each. We obtain well converged results with an accuracy of the diffraction orders of about one percent. The results compare well to experimental aerial imaging results. We further investigate the convergence of 3D solutions towards quasi-exact results obtained with different methods.Comment: 8 pages, 5 figures (see original publication for images with a better resolution
    • …
    corecore