The paper proposes a rational method to derive fairness measures for surfaces. It works in cases where isophotes, reflection lines, planar intersection curves, or other curves are used to judge the fairness of the surface. The surface fairness measure is derived by demanding that all the given curves should be fair with respect to an appropriate curve fairness measure. The method is applied to the field of ship hull design where the curves are plane intersections. The method is extended to the case where one considers, not the fairness of one curve, but the fairness of a one parameter family of curves. Six basic third order invariants by which the fairing measures can be expressed are defined. Furthermore, the geometry of a plane intersection curve is studied, and the variation of the total, the normal, and the geodesic curvature and the geodesic torsion is determined. 相似文献
The title compound, [Cu8(C8H24O2Si)2(C3H7NO)8]·C4H4N2·C3H7NO, features a sandwich‐like cage enclosing a pyrazine molecule, both situated on a centre of inversion. In addition, the crystal structure contains one dimethylformamide molecule which is disordered over a centre of inversion. The copper layer, containing eight atoms, is located between two siloxanolate fragments. The whole structure of Cu atoms and siloxanolate rings is distorted by the pyrazine molecule, leading to an oval form. As a result, the angles between the Cu atoms differ at the copper layer. The difference in the angles could lead to some deviations in the Cu–Cu exchange interactions within the copper ring, which is of interest for molecular magnetism. 相似文献
We consider the following problem: given a set of points in the plane, each with a weight, and capacities of the four quadrants, assign each point to one of the quadrants such that the total weight of points assigned to a quadrant does not exceed its capacity, and the total distance is minimized.
This problem is most important in placement of VLSI circuits and is likely to have other applications. It is NP-hard, but the fractional relaxation always has an optimal solution which is “almost” integral. Hence for large instances, it suffices to solve the fractional relaxation. The main result of this paper is a linear-time algorithm for this relaxation. It is based on a structure theorem describing optimal solutions by so-called “American maps” and makes sophisticated use of binary search techniques and weighted median computations.
This algorithm is a main subroutine of a VLSI placement tool that is used for the design of many of the most complex chips. 相似文献