Abstract: A computer-implemented method for generating a constrained Delaunay triangulation for a planar domain with boundaries and internal features. The boundaries and internal features of the domain are approximated with polylines. Unconstrained Delaunay triangulation is constructed for the domain. The unconstrained Delaunay triangulation is modified to conform triangle sides to the polylines. The modified triangulation is corrected to make it a constrained Delaunay triangulation. At least one of the steps of the method is implemented using a computer.

Abstract: A computer-implemented method for generating a constrained Delaunay triangulation for a planar domain with boundaries and internal features. The boundaries and internal features of the domain are approximated with polylines. Unconstrained Delaunay triangulation is constructed for the domain. The unconstrained Delaunay triangulation is modified to conform triangle sides to the polylines. The modified triangulation is corrected to make it a constrained Delaunay triangulation. At least one of the steps of the method is implemented using a computer.

Abstract: A method for generating constrained Voronoi grids in a plane with internal features and boundaries is disclosed. The disclosed method generally includes approximation of internal features and boundaries with polylines based on plane geometry. Protected polygons or points are generated around the polylines, and Delaunay triangulation of protected points or protected polygon vertices is constructed. Delaunay triangulation that honors protected polygons or points is generated in the rest of the gridding domain. The constrained Voronoi grid is then generated from the Delaunay triangulation, which resolves all of the approximated features and boundaries with the edges of Voronoi cells. Constrained Voronoi grids may be generated with adaptive cell sizes based on specified density criterion.

Abstract: A method for generating constrained Voronoi grids in a plane with internal features and boundaries is disclosed. The disclosed method generally includes approximation of internal features and boundaries with polylines based on plane geometry. Protected polygons or points are generated around the polylines, and Delaunay triangulation of protected points or protected polygon vertices is constructed. Delaunay triangulation that honors protected polygons or points is generated in the rest of the gridding domain. The constrained Voronoi grid is then generated from the Delaunay triangulation, which resolves all of the approximated features and boundaries with the edges of Voronoi cells. Constrained Voronoi grids may be generated with adaptive cell sizes based on specified density criterion.

Abstract: A process for producing a targeted gene and/or drug delivery system for liver cells comprising the steps of: i. chemical reduction of Sendai virus for reduction of HN protein; ii. subjecting the reduced virus to the step of dialysis for removal of the reducing agent; iii. solubilizing the reduced virus with a detergent to obtain a solution; iv. centrifuging the solution to separate the insolubles consisting of reduced HN protein and core of said virus; v. adding histidylated lipid to the supernatant; vi. adding the drug or gene after addition of the lipid; vii. removing the detergent from the envelope and then subjecting it to the step of centrifugation to obtain His lipid F-virosomes with entrapped drug or DNA.