129 results about "Vertex point" patented technology

An antenna comprises: a main reflector being a body of revolution of arbitrary curve which axis diverges from axis of the revolution; a sub-reflector being a body of the revolution of arbitrary curve along the axis of revolution, having a circle and a vertex pointing to the main reflector and being placed between the circle and the main reflector; a radiator being located along the axis of revolution and being placed between the main reflector and the sub-reflector; and wherein the main reflector and the sub-reflector are: $z_m\left(r,D\right)=\sum _{n=0}^4\sum _{m=0}^6{\mathrm{qm}}_{n,m}{D}^{m-n+1}{r}^n,z_s\left(r,D\right)=\sum _{n=0}^4\sum _{m=0}^6{\mathrm{qs}}_{n,m}{D}^{m-n+1}{r}^n,$

z, r are coordinates of the main reflector and the sub-reflector measured in millimeters, Index m corresponds to the main reflector, index s to the sub-reflector D is the main reflector diameter measured in millimeters.

One embodiment of the present invention sets forth a technique for computing plane equations for primitive shading after non-visible pixels are removed by z culling operations and pixel coverage has been determined. The z plane equations are computed before the plane equations for non-z primitive attributes are computed. The z plane equations are then used to perform screen-space z culling of primitives during and following rasterization. Culling of primitives is also performed based on pixel sample coverage. Consequently, primitives that have visible pixels after z culling operations reach the primitive shading unit. The non-z plane equations are only computed for geometry that is visible after the z culling operations. The primitive shading unit does not need to fetch vertex attributes from memory and does not need to compute non-z plane equations for the culled primitives.

A three dimensional image of the colon like surface is processed to determine at least its ring structure. The image is composed of vertex points, each vertex point having a discrete point identifier and three dimensional position information. The three dimensional position information is averaged in a shrinking procedure to contract the three dimensional image proximate to a major axis of the colon-like surface. Evenly spaced points are taken through the shrunken colon like surface and connected to form a curve. Planes are generated at intervals normal to the curve to split the shrunken colon like surface into image segments. By mapping these image segments back to the original image through their discrete point identifiers, an accurate ring profile of the colon like surface can be generated.

The invention discloses a method for extracting and quantizing pore boundary of porous materia, comprising the following steps: a microscopic pore structure image of a plurality of parallel sections of a porous material to be detected is taken; a plurality of the pore structure images are respectively transmitted to a computer to be pretreated; the boundary of a black image area and a white image area, namely the pore boundary, in a black and white pore structure image is extracted and marked; the marked pore boundary is a polygon consisting of a plurality of pixels as vertex points; the two-dimension coordinate value of the vertex points is determined and the vertex points are numbered continuously, thus obtaining the two-dimensional pore boundary; and all the vertex points of all plane polygons in two adjacent two-dimensional pore boundary images are connected in sequence according to the number sequence, thus forming a spatial polygon which is the three-dimensional pore boundary. The invention has the advantages of simple operation and low cost, can quantize the performance parameters of the porous material such as pore appearance, degree of cook of a pore channel, and the like; and can analyze accurately.

A method in a computer system for generating a presentation of a region-of-interest in an original image for display on a display screen, the original image being a collection of polygons having polygons defined by three or more shared edges joined at vertex points, the method comprising: establishing a lens for the region-of-interest, the lens having a magnified focal region for the region-of-interest at least partially surrounded by a shoulder region across which the magnification decreases, the focal and shoulder regions having respective perimeters; subdividing polygons in the collection of polygons proximate to at least one of the perimeters, as projected with the polygons onto a base plane, by inserting one or more additional vertex points and additional edges into the polygons to be subdivided; and, applying the lens to the original image to produce the presentation by displacing the vertex points onto the lens and perspectively projecting the displacing onto a view plane in a direction aligned with a viewpoint for the region-of-interest.

The invention discloses a polygon clipping method based on intersection point sorting. The polygon clipping method comprises steps including that 1, whether segments are intersected or not is judged according to opposite clipping positions of four intersection points of a clipped side, and in and out properties of the intersection points are analyzed, 2, a solid polygon is subjected to intersection by means of taking sides of a clipped polygon sequentially, whether final points of the clipped sides can form a result polygon or not is judged according to sequence and the in and out properties of the intersection points on each clipped side, vertexes of the clipped polygon forming the result polygon are inserted into an intersection point linked list, and accordingly a point pair consisting of an in point and an out point is formed, 3, pointer directions of all intersection points are set according to the in and out properties of the intersection points and a sequence number of a final point of the recorded solid polygon, vertexes of the solid polygon forming the result polygon are inserted into the intersection point linked list, and secondary sorting of the intersection points is completed, and 4, a result vortex linked list is traversed, and the result polygon is outputted according to the pointer directions. The polygon clipping method has important actual application values in the field of computer graphics.

The invention discloses a method and a device for implementing a mobile terminal 3D (three dimensional) model. The method includes: allowing a terminal parser to acquire and parse a 3D description file, wherein the 3D description file comprises maximum and minimum values, total number of vertex coordinates, the vertex coordinates, texture coordinates and texture image information of an x-axis, a y-axis and a z-axis of material information; reading the maximum and minimum values of the x-axis, the y-axis and the z-axis; reading the total numbers of the vertex coordinates, distributing cache spaces according to the total number of the vertexes and storing the specific vertex coordinates and the texture coordinates information into the cache spaces; based on the maximum and minimum values of the x-axis, the y-axis and the z-axis, initializing a renderer; querying the 3D description file and judging whether a triangular drawing mode exists or not, and if yes, drawing the corresponding 3D model based on the triangular drawing mode and the total number of the vertex coordinates, the vertex coordinates, the texture coordinates and texture image information.

A ball is used for engaging in a downhole seat and can be milled out after use. The ball has a spherical body with an outer surface. An interior of the spherical body is composed of a metallic material, such as aluminum. The spherical body has a plurality of holes formed therein. The holes extend from at least one common vertex point on the outer surface of the spherical body and extend at angles partially into the interior of the spherical body.

A lenticular sheet includes an array of lenticules and a back surface located opposite to the lenticules. In a printer, a printhead prints plural interlaced images on the back surface, the interlaced images being formed by interlacing two original images having disparity. A line sensor has plural sensor elements arranged in an array direction of the lenticules, and receives detection light condensed by a cylindrical lens, to output a detection signal for representing a vertex point of the lenticules. A transport device transports the lenticular sheet in the array direction, and adjusts an orientation of the lenticular sheet during transport to remove offset of the lenticular sheet from the array direction. A controller controls the transport device according to the detection signal, sets a longitudinal direction of the lenticules perpendicular to the array direction by adjusting the orientation, and drives the printhead for printing.

A multi-primary conversion (5) of input drive values (RGB) defines a color of a pixel (PI) of a multi-primary display(DP) in an M dimensional color space (XYZ) into N>M output drive values (di) in an N dimensional drive space. The N output drive values (di) drive N sub-pixels (SPi) of the pixel (PI). The color of the pixel (PI) in the color space (XYZ) is defined by linear combinations of N color primaries of the respective N sub-pixels (SPi). The multi-primary conversion(5) comprises: defining a constraint in the color space (XYZ) thereby causing in the color space (XYZ) a convex polytope (U0; L0; V50) defined by vertex points (V10, V11, V12; V20, V21; V50), wherein only colors in the color space (XYZ) belonging to the convex polytope fulfill the constraint, determining exemplary solutions of the output drive values (di) for at least a subset of the vertex points (V10, V11, V12; V20, V21; V50), and constructing the output drive values (di) fulfilling the constraint as a convex combination of the exemplary solutions.

A multi-polarized forward feed and dish configuration for transmitting and/or receiving radio frequency (RF) signals is disclosed. The configuration comprises a conductive reflector dish, having a focal point and a vertex point, and a multi-polarized forward feed element positioned substantially at the focal point. The forward feed element comprises at least two radiative members each having a first end and a second end. The second ends of the radiative members are electrically connected at an apex point and are each disposed outwardly away from the apex point toward the vertex point at an acute angle relative to an imaginary plane intersecting the apex point.

A computer-implemented method includes a principal process including performing a computational procedure in which the or each vertex preceding a particular vertex receives a notification that a computational procedure has been completed for the preceding vertex; and calculates new path lengths for the particular vertex by adding the length value attributed to the edge from the preceding vertex to the particular vertex to each of the recorded k shortest path lengths from the first vertex to the preceding vertex. A record of the k shortest path lengths calculated for the particular vertex is maintained. After the new path lengths have been calculated for the or each of the preceding vertices, a notification that the computational procedure has been completed for the particular vertex is issued. The computational procedure is performed with the source vertex as the first vertex and each vertex on a path from the source vertex to the destination vertex as the particular vertex.

The invention provides a creating device of a petroleum seismic structural map. The device creates isolines of the petroleum seismic structural map according to the profile data of seismic information, a triangulated irregular network is established according to the discrete data of the isolines, the position relation between adjacent isolines of the isolines is acquired and a point to be inserted is positioned in a triangle of the triangulated irregular network according to the topological structure of the triangulated irregular network; any two of three peaks beside the common point of three adjacent triangles of the triangle in which the point to be inserted is positioned are selected to be combined with the common point, and a quadric surface passing by the common point is acquired by the following formula: f (x, y) = a + bx + cy + dx2 + ey2, wherein a, b, c, d and e are natural numbers, and (x, y) is the coordinate of the common point; then accumulation average operation is carried out on the plurality of acquired quadric surfaces so as to obtain a quadric surface trend surface passing by the common point; and then the change of the area between adjacent isolines is restrained according to the quadric surface trend surface and the empty circumcircle property and the maximum and minimum angle properties of the triangulated irregular network.

A method of determining the position of a mobile device using a model. The model comprises a graph comprising a set of vertices and a set of edges between the vertices, and one or more feature functions that take as input one or more vertices of the graph and a set of observations for the device, and return a feature value. The model is constructed by obtaining a map of the geographical area, constructing the graph using the map, wherein the vertices of the graph correspond to areas of the map, and two vertices are joined by an edge when the areas corresponding to the vertices are adjacent and can be travelled between by a device, and building the one or more feature functions using the graph, wherein the feature value of the one or more feature functions indicates the extent to which the observations support the device being positioned in the areas corresponding to the one or more vertices of the graph. The method then comprises the steps of: obtaining a set of observations from the sensors of the device; determining the trajectory for the device that optimises the values given by the feature functions given for the set of observations; and determining the position of the device to be the end point of the trajectory.

The invention relates to a method for solving a mirror surface parameter of a conical mirror surface refraction and reflection camera by utilizing a straight line. The method comprises the steps of firstly, extracting pixel coordinates of image points from an image by utilizing a function in Matlab; secondly, calculating a coefficient and a cone apex angle 2 theta of a line image according to the pixel coordinates of the image points, wherein theta is an included angle between any generatrix of a conical mirror surface and a rotational symmetric axis of the conical mirror surface; and finally, calculating Plucker coordinates of the spatial straight line and a distance from a vertex of the conical mirror surface to an optical center of the camera, namely, the mirror surface parameter xi. The method does not have a requirement on the physical size of the spatial straight line, so that coordinates of the spatial straight line in a world coordinate system do not need to be known.