Efficient self-collision detection on smoothly discretized surface animations using geometrical shape regularity

We present a new algorithm for detecting self-collisionson highly discretized moving polygonal surfaces. If is based on geometrical shape regularity properties that permit avoiding many useless collision tests. We use an improved hierarchical representation of our surface that, besides the optimizations inherent to hierarchisation, allows us to fake adjacency information to our advantage for applying efficiently our geometrical optimizations. We reduce the computation time between each frame by building automatically the hierarchical structure once as a preprocessing task. We describe the main principles of our algorithm, followed by some performance tests.     

GEOMETRICAL SCALING EFFECTS IN HIGH PERMITTIVITY CAPACITORS

ABSTRACT

In integrated circuit designs, smaller is better; high permittivity films allow circuit designers to save substrate space, but the small geometries of such devices introduce parasitic effects. In this work we investigate the relationship between device geometry and capacitance density, quality factor, and leakage current density. The devices in this study have electrode areas ranging from 12 × 12 μm² to 45 × 45 μm². For each electrode area we have structures with 5 μm, 7.5 μm, 10 μm, 12.5 μm and 15 μm mesa ledges.