arijitlaik

from scipy.spatial import Delaunay, ConvexHull
import networkx as nx
 
points = [ [0,0],[0,50],[50,50],[50,0],[0,400],[0,450],[50,400],[50,450],[700,300],[700,350],[750,300],[750,350],
          [900,600],[950,650],[950,600],[900,650]
]
def concave(points,alpha_x=150,alpha_y=250):
    points = [(i[0],i[1]) if type(i) <> tuple else i for i in points]
    de = Delaunay(points)

arijitlaik

MPICH

time mpirun -np 1 python solver_1.py

Global element size: 32x32
Local offset of rank 0: 0x0
Local range of rank 0: 32x32

Linear solver (AMBUSAN8__system-execute)

BSSCR -- Block Stokes Schur Compliment Reduction Solver AUGMENTED LAGRANGIAN K2 METHOD - Penalty = 0.000000

arijitlaik

<link rel="import" href="../core-icon-button/core-icon-button.html">
<link rel="import" href="../core-toolbar/core-toolbar.html">
<link rel="import" href="../core-header-panel/core-header-panel.html">

<polymer-element name="my-element">

  <template>
    <style>    
      :host {
        position: relative;

arijitlaik

<link rel="import" href="../core-input/core-input.html">

<polymer-element name="my-element">

  <template>
    <style>    
      :host {
        position: absolute;
        width: 100%;
        height: 100%;

arijitlaik

Basic Example of SVG Line Drawing, Backward and Forward

Forked from Chris Coyier's Pen Basic Example of SVG Line Drawing, Backward and Forward.

A Pen by Captain Anonymous on CodePen.

License.