31 results about "Simple polygon" patented technology

One embodiment of the present invention provides a system that determines an assist feature placement. During operation, the system receives an initial assist feature placement for a layout. Next, the system determines assist feature perturbations using the initial assist feature placement. An assist feature perturbation typically comprises a few simple polygons. The system then determines perturbation values at evaluation points in the layout using the assist feature perturbations and an analytical model. If a process-sensitivity model is used, the perturbation value at an evaluation point is associated with the change in the through-process window at that point in the layout. Next, the system determines a change in the value of an objective function using the perturbation values. The objective function can be indicative of the overall manufacturability of the layout. The system then determines an assist feature placement using the change in the value of the objective function. For example, the system can determine an assist feature placement using an assist feature perturbation which minimizes the objective function value.

A hardware-accelerated method for the rasterization of non-simple polygons is used to generate a trim-texture that is dynamically adapted to the required resolution. This method is combined with a GPU-based tessellation of parametric surfaces and a method to generate non-simple polygons with the required resolution from the parametric trimming curves on the GPU. This way trimming and tessellation of parametric surfaces like rational Bézier and Spline surfaces can be performed on the GPU. The method can also be used for the visualization of 2D boundary data on arbitrary parametric surfaces.

In various embodiments, a phacoemulsification tip may be configured with a proximal end configured to be secured to a phacoemulsification hand piece and a distal end shaped as a five-sided polygon with five corners. In some embodiments, at least two of the five corners of the five-sided polygon may form a right angle and one of the five corners may form a dominant point spaced further from an axis of rotation of the five-sided polygon than any of the other four corners. For example, the distal end may be shaped in a home base configuration. The displacement of the dominant point from the axis of rotation may improve cutting and / or improve the removal of lens material. In some embodiments, the dominant point may form a sharper edge than at least one of the other four corners (e.g., the other four corners may be rounded).

This invention concerns automatically generating embroidery stitch patterns in a computer aided design system where areas defined by vector outline shapes are filled with stitches which follow curved lines rather than straight lines. This is done in a way to maintain consistent densities and consistent needle penetration patterns inside the areas. The shapes of the areas may be simple polygons which can be filled in one contiguous segment of curved stitching, or they may be complex or multi-boundary shapes which must be stitched in more than one distinct segments of curved line stitching. The areas are transformed into another coordinate space where known calculation methods for straight line stitching are used to calculate straight line fills of the transformed area. The resulting area and stitches are then transformed back to the original coordinates, resulting in even stitching along smooth curves which fills the original area such that the intermediate stitch penetration points along the curves form a smooth continuous visual pattern throughout the area.

The present invention provides top-bedding that has a head-end delimited by a head-end edge; a foot-end opposite the head-end, the foot-end delimited by a foot-end edge substantially parallel to the head-end edge; at least one pair of opposing sides delimited by side-edges; a first head-end corner and a second head-end corner; and a reversible expansion means for reversibly converting the top-bedding from a closed configuration to an open configuration, the closed configuration being approximately rectangular, and the open configuration having the shape of an irregular, simple polygon, whereby the distance between the first head-end corner and the second head-end corner is greater when the top-bedding is in the open configuration than when it is in the closed configuration.

A dome structure constructed of interlocking pieces constructed of plastic with a hollow or insulated interior. The pieces interlock via their alternating male and female edges and are secured at their vertices with wishbone locking connectors. The pieces are generally in the shape of simple polygons and overhang at their edges to prevent water leakage. In constructing a dome, the floor is first constructed from interlocking floor pieces and a perimeter track is constructed from special interlocking track pieces that can be filled with water or sand. A first row of pieces that will form the wall interlock with the perimeter track, and the dome is constructed by interlocking additional pieces after the initial row is in place. The last piece to be secured in place is modified so that it can be placed in the space remaining at the top of the dome.

The invention discloses a symbol configuration system of a zonal statistical map and a method thereof. The symbol configuration system comprises a simple polygon set construction module for constructing a simple polygon set, a simple polygon inner point evaluating module for evaluating inner points of a simple polygon, an area domination set evaluating module for evaluating an area dominated simple polygon set, a positioning polygon obtaining module for evaluating a positioning polygon, wherein the simple polygon inner point evaluating module is used for evaluating inner points of the positioning polygon, a point set convex hull evaluating module for evaluating a point set convex hull, a positioning point evaluating module used for using the gravity center of the point set convex hull as a positioning point and a map symbol positioning point evaluating module for using the inner points of the simple polygon, the inner points of the positioning polygon, the gravity center of the point set convex hull and primary positioning points as map symbol positioning points. The symbol configuration system supports statistical map symbol positioning of a composite polygon and a plurality of elements with the same name.

The embodiment of the invention provides a lossless compression storage method and a device for a polygon with a hole in an electronic map, wherein the method comprises the steps: S1, extracting an inner ring graph and an outer ring graph of the polygon with the hole in the electronic map, filling the outer ring graph, and obtaining a plurality of simple polygons; and step S2, marking gland relationships of the plurality of simple polygons, and storing the plurality of simple polygons based on the gland relationships. Through improving a processing mode of polygons with holes, the polygon withthe hole is converted into a simple polygon for processing; according to the method, the hole effect is restored visually through gland drawing, the polygons filled with the grids after combination are subjected to further refined expression according to the characteristics of grid division storage of the electronic map, the data volume is obviously reduced, and compared with a traditional mode,the hole cutting process is simplified, the processing time is saved, and the data volume and the user experience are optimized.

A light scanning apparatus, including: a light source configured to emit a light beam; and a rotary polygon mirror configured to deflect the light beam emitted from the light source so that the light beam scans a surface of a photosensitive member, wherein the rotary polygon mirror is formed in a four-sided polygon, and wherein a difference between a pair of diametrically opposed interior angles of the rotary polygon mirror is larger than 0.03°, and a difference between another pair of diametrically opposed interior angles of the rotary polygon mirror is 0.03° or less.

The invention discloses a construction method of barycentric coordinates. The construction method of the barycentric coordinates comprises the steps that a plane polygonal mesh or a three-dimensional triangular mesh is input; for the plane polygonal mesh, triangularization is carried out on the internal area of a plane polygon to generate a plane triangular mesh inside the polygon; for the three-dimensional triangular mesh, the internal area of the three-dimensional triangular mesh is made to be tetrahedral, so that a three-dimensional tetrahedral mesh inside the triangular mesh is generated; a weighted value of each sampling point to each control point in an area Omega is calculated; according to the input plane polygonal mesh or the three-dimensional triangular mesh and the generated plane triangular mesh or the three-dimensional tetrahedral mesh, an optimization model based on a total variation model is solved, and therefore the barycentric coordinates with local characteristics are obtained. By means of the construction method of the barycentric coordinates, under the restraint of the barycentric coordinates, the weighting total variation of the barycentric coordinates is optimized while serving as an objective function, smooth and local barycentric coordinate values are obtained, memory space for storing the barycentric coordinates is smaller, and the interpolation algorithm of the barycentric coordinates based on the construction method is accelerated.

According to the map area processing method, firstly, an elevation segmentation method or a grid segmentation method or a midpoint segmentation coding method is adopted to divide a non-planar area into planarized areas, then, an Ear-clipping algorithm is adopted to cut required triangles, and finally, merging processing is performed to obtain a 0, 1 digital map. Compared with the prior art, the method has the following advantages: an elevation segmentation method, a grid segmentation method and a midpoint segmentation coding method are adopted to convert a non-planar area graph into a planar area; then, an Ear clipping algorithm is used for carrying out region cutting; and finally, whether the moving point performs 0, 1 digital map making in the map area is judged by utilizing the reference point, and finally converting into 0, 1 binary image storage. Compared with a simple method for cutting a simple polygon by using an earlipping algorithm, the method solves the problem that a non-plane cannot be cut, enlarges the use scene, and brings convenience to the production of an actual digital map.

The invention relates to the technical field of development of large mobile games, in particular to a super-large map movement optimization method, which comprises the following steps of: (1) voxelization: constructing a solid height field from a source geometry for representing a non-walking space; (2) generating a region: merging continuous intervals in the upper surface of the solid height field into the region; (3) generating a contour: detecting the contour of the region, and constructing a simple polygon; (4) generating a polygonal grid: dividing the contour into convex polygons; And (5)generating height details: triangularizing the polygonal grid to obtain the height details. According to the method, a brand-new map data generation algorithm is adopted, a polygon mode is used for organizing a map data structure, blocking and areas are distinguished, the expenditure of large-range path finding is reduced, and multi-unit automatic movement of a large game becomes possible.

The invention discloses a convex polygon interpolation method and system for graphic raster scanning, wherein a traversal method comprises the following steps of: constructing two boundary frames applied to a process of carrying out raster scanning on a convex n-sided polygon according to coordinate values of n peaks of the convex n-sided polygon, wherein n is an integer larger than 2; configuring a traversal starting position for each of the two boundary frames; and respectively starting trasversing the convex n-sided polygon part of each of the two boundary frames from the traversal starting position of each of the two boundary frames. By utilizing the convex polygon interpolation method and system for the graphic raster scanning, disclosed by the invention, the calculation amount in the graphic raster scanning process can be reduced, thus the processing speed of a graphic raster scanning device can be increased and the processing time can be saved.

An object of the present invention is to accomplish the automatic preparation of road data in which roads and intersections are expressed by polygons that show accurate agreement with the complicated road shapes on city maps. In simple polygon preparation processing 3, the respective line segments of road network data 2 in which roads are expressed as line segments are expanded in the direction of the width dimension, thus producing simple road polygon data 4 which has a width that is slightly greater than the width of the roads in the city map data 5. Next, in scissors data preparation processing 6, scissors data 7 which defines the outlines of roads is prepared from the city map data 5 by connecting shape lines in the vicinity of roads. Next, in road polygon preparation processing 9, road polygon data 9 which shows good agreement with the shapes of roads in the city map data is prepared by trimming the simple road polygons along the road outlines defined by the scissors data.

The invention discloses a method for calculating the central axis of simple polygons based on LR sequences. The present invention first initializes a sequence composed of sides, including the angle bisector of each internal angle in the simple polygon P in the initialization state, and then utilizes the intersecting situation and endPoint of each side and its adjacent sides in the forward and reverse directions to determine its L and R mark; group all edges, and use the growth algorithm for the edges inside each group; if the growth algorithm is executed for all groups and each group stops growing, when the remaining edges are found to intersect at the same point , the algorithm ends, if they do not intersect at the same point, go back to step 3. The present invention utilizes the tree structure of the central axis itself, utilizes the characteristics that two sides grow into one side each time, and each time it grows, one side will be reduced. The calculation time is proportional to the number of sides, and the present invention can calculate in linear time The central axis of the polygon improves the efficiency of calculating the central axis of the polygon.

The invention relates to a generation method of a spliced planar spiral inductor. The method comprises the following steps that a set of similar polygons are segmented through a segmentation straight line, the central points of the similar polygons coincide, and the distance P between any two adjacent polygons is equal to that between other two adjacent polygons; the similar polygons are numbered from inside to outside, segments of the polygons with the odd numbers on one side of the segmentation straight line are obtained, and segments of the polygons with the even numbers on the other side of the segmentation straight line are obtained; in the direction of the segmentation straight line, the segments of the polygons with the odd numbers on one side of the segmentation straight line and the segments of the polygons with the even numbers on the other side of the segmentation straight line are horizontally moved and spliced, wherein the horizontal moving distance is d, and a planar spiral line with the coil separation distance being 2P is generated; the planar spiral line serves as the central line, the segments are respectively perpendicularly and horizontally moved towards two sides by the distance of W / 2, and the horizontally-moved segments intersect to generate the planar spiral inductor with the line width being W and the coil separation distance being S. According to the generation method of the spliced planar spiral inductor, parameters are easy to set, the structure is clear, the generation method is rapid to implement and effective, and the planar spiral inductor with the same coil separation distance can be generated.