46 results about "Complex polygon" patented technology

Geospatial compatibility between consumers and providers of goods or services is identified. The system allows consumers to find service providers with service areas encompassing their location or merchants within a desired shopping area, and allow consumers to query about consumers within a specified area, for example to identify a potential customer base or consider regional advertising. A digital map interface allows users to enter one or more locations or areas of interest and later performs location or area additions, modifications or removals. The system provides the geospatially matched consumers and vendors with information on how to contact one another, but is kept simple by leaving actual contact between the matched parties to separate outside communication channels independent of the system. Processing requirements are reduced by pre-calculating an inner rectangle for complex polygon geographical areas so that simple point-rectangle calculations can confirm locations within the area as being within the polygon.

The invention discloses a concave convex mixed complex polygon farmland unmanned aerial vehicle spraying operation flight path planning method. Starting from any feature point on the boundary of the polygon farmland, all feature points of the boundary of the polygon farmland are acquired sequentially, adjacent two points are connected by using a straight line sequentially according to the point acquisition sequence of the feature points, and an operation region of the boundary of the polygon farmland is generated; the longest edge of the boundary of the operation region is found out; a feature point farthest from the longest edge is found out; N flight path lines are drawn between the longest edge and the feature point farthest from the longest edge; coordinates of all boundary line segments crossed with the flight path lines and flight path line crossed points are obtained; the number of the crossed points between the flight path lines and the boundary line segments is judged, and when the number of the crossed points is larger than 2, flight path lines outside the operation region range are deleted; and starting from a flight path line nearest to the longest edge, the flight path lines and side flight lines are connected in sequence, and an S-shaped flight path planning line is obtained. The flight path of the concave convex mixed complex polygon farmland unmanned aerial vehicle spraying operation can be planned.

The invention is a three dimensional virtual articulator used for but not limited to diagnosing and treatment planning for dental and medical specialties, including orthodontics, prosthodontics, endodontics, periodontics, orthognathic surgery, implant positioning, crown and bridge and prosthesis design.The operator enters patient-specific anatomical measurements for condylar angles, Bennett angle and shift, lateral excursive and protrusive movements, and maximum mandibular opening, and a selection of preset or customizable intercondylar distances to simulate the unique mandibular range of motion.The patient-specific measurements create a customized complex polygon that illustrates the maximum limits of the mandibular range of motion. The operator is able to use onscreen controls to move the virtual mandible in relation to the virtual maxilla within the parameters described by the patient-specific measurements input by the operator.The first point of contact as well as surface interferences can be marked on the dynamic surfaces of the two virtual arches.

The present invention relates to a high-accuracy automatic 3D modeling method for complex buildings, comprising the steps of: transforming the complex building to a complex polygon by using the topological structure of polygons firstly, transforming complex polygons to a set of triangles which are seamlessly spliced by programming an algorithm and accomplishing high-accuracy automatic 3D modeling of buildings.

The invention discloses a building three-dimensional modeling and virtual scene generation method and system based on a depth image. The method comprises the steps of calculating and reconstructing accurate three-dimensional depth data; Optimizing and converting the three-dimensional data of multiple types of sources to obtain a corresponding high-speed streaming point cloud format model, and carrying out point cloud registration; carrying out Projection deformation of the image, and establishing a corresponding relation between adjacent picture pixels; Connecting triangular patches formed bypoint cloud triangularization to generate a building object surface; performing Modeling by using a quadric surface and a complex polygon tool, changing the state of the quadric surface, and processing the irregular polygon to obtain a building three-dimensional model; using Three-dimensional rendering interface software to import the three-dimensional model of the building, and redrawing and displaying the model every preset time, so that the construction of the virtual environment of the building and the generation of the scene under different scenes are realized, and the good sense of reality is achieved.

The invention discloses a vectorization method for raster data of remote sensing images in the technical field of remote sensing image processing. The method includes the following steps: marking an identification number for each quad-connected region of a remote sensing image; storing the number of the boundary points of each quad-connected region of the remote sensing image into a first memory structure; extracting one unvectorized point, and if the point is not a boundary point, then adding the point into a second memory structure; when points formed into a closed polygon exist in the second memory structure, building the closed polygon with the points formed into the closed polygon and writing the closed polygon into a vectorized file, and then deleting the points formed into the closed polygon from the second memory structure; and finishing the vectorization of the remote sensing image, so that a final vectorized file can be obtained. The vectorization method overcomes the defects of the conventional remote sensing image vectorization method, and can quickly carry out the vectorization of a large-scale remote sensing image with complex polygons.

The invention discloses a multi-rotor drone mapping air route planning method under complex polygon survey areas. The method is mainly divided into two parts, namely planning of a single flight zone and updating of remaining uncovered survey areas. According to the method, firstly, planning of the single flight zone is carried out according to the position of a drone and a to-be-covered survey area, a pair of longest navigation zone points of a navigation zone in the current state are obtained, then effective covered areas of the navigation zone are taken into account, the remaining uncoveredareas are updated and regarded as one new survey area or a group of new survey areas, the position of the drone is updated as the last navigation point of the navigation zone at the same time in orderto plane a next navigation zone until coverage of the whole survey areas is completed. By means of the method, an air route with a smaller redundant coverage rate and a lower turning frequency underthe complex polygon measuring areas can be planned.

Virtual shapes are defined that are referenced to one or more actual, printable sheets for printing. The virtual shapes are referenced to the actual sheet using a rotation and x-axis (left-to-right) and y-axis (top-down) coordinates. The coordinates are typically specified with respect to the top-left corner of the sheet. In one example, an end-user views a shape on a display, such as a computer monitor, a kiosk screen, the screen of a personal data assistant or other digital device. The shape may correspond, for example, to a complex label shape. After the user has input customized and / or personalized text, graphics or other information to be printed, the software may apply a rotation to the virtual shape as it is referenced onto the actual page to be printed. A product identification table may be provided in order to correlate proper rotations and / or coordinates to particular types of commercial sheets. A single virtual shape may be referenced multiple times onto a single sheet. The virtual shape may be complex, such as a complex polygon and / or ellipse, and may include such features as cut-outs, blank areas to be kept free of text and / or graphics, multiple areas for printing text and / or graphics, as well as other complex features.

The invention discloses a point cloud clipping-based generation method for a spatial curved surface. A curved surface can be reconstructed under a complex reverse fault condition, a data blocking concept is used for dividing data on the curved surface into data under a constraint condition and data beyond the constraint condition, and triangularly meshing the data respectively, so that the problem of large data volume is well solved, and triangular meshing speed is increased. The method has the advantages that various faults comprising normal faults and reverse faults are supported, so that the method has high adaptability; various kinds of application taking complex polygons as constraint conditions are supported, so that the method is highly universal; and the clipping problems of the complex polygons are solved.

The invention discloses an arbitrary polygon intersection area calculation method based on probability statistics. The arbitrary polygon intersection area calculation method comprises steps that with help of a GPU, rasterization of arbitrary polygons is realized, and the polygons expressed by vertex coordinates are converted into polygon raster images expressed by rasters; the valuation and the correction of the position identifiers of the rasters are carried out according to the intersection condition of the raster images; the arbitrary rasters are selected from a raster field to simulate the whole raster area to improve time performance; the number of the intersection rasters in the arbitrary rasters is counted, and then the intersection area is calculated. The above mentioned calculation method is not restricted by the concavity and the convexity of the polygons, and the parallelism feature of the GPU is adopted, and by comparing with the calculation methods with the help of the GPU, a processing speed is greatly improved, a principle is simple, and realization is convenient. According to an experimental result, the calculation method is suitable for the arbitrary complicated polygons, and the singularity problems of the conventional calculation methods are prevented, and therefore good robustness is provided.

The invention discloses a method of fusing polygon mesh models of arbitrary topology, which includes the following steps: 1) intercepting parts of interest from an existed model;2)setting the parts at a suitable position with the aid of transition primitives;3)drawing lines with a mouse on the screen so as to specify the general outline of a transitional objects used to connect the existed model;4)defining a smooth interpolation border and a transition curved surface in line with the specified outline with a variational implicit surface;5)carrying out polygonization for the transition curved surface and carrying out seamless connection between the transition curved surface and the existed model. The invention obtains a new complex polygon mesh model through fusing existed polygon mesh models in a natural and smooth way, thus provides a simple and visualized modeling method for non-professionals.

The invention discloses a variable spraying method for a plane polygon. According to the variable spraying method for the plane polygon, geometric analysis is carried out on an irregular polygon, theirregular polygon is divided into the combination of a triangle and n trapezoids or the combination of n trapezoids, a quantitative spraying area and a variable spraying area are planned, and an optimal spraying track is generated; a quantitative spraying method is adopted for most of the trapezoid regions, a trapezoid scroll number required by variable spraying is obtained according to the widthof the triangle, and the triangular part is digested by adopting the variable spraying method; and the diameter of the spraying pattern is calculated in real time in the variable spraying process, andthe electrostatic voltage of a spinning cup, the rotating speed of the spinning cup, the distance between the spinning cup and the workpiece, the moving speed of the spinning cup and other variable spraying parameters are reversely pushed out through the diameter of the spraying pattern and the expected beat number. According to the variable spraying method for the plane polygon, the trajectory planning time of early-stage spraying can be shortened, the trajectory planning problem of the complex polygon can be simplified, thus the waste of the coating can be reduced, and the economic benefitis improved; and meanwhile, the discharge amount of the paint to the spraying room can be reduced, and the pollution degree of the workshop can be reduced.

The invention discloses a GPU-based method for calculating a random polygon intersection area. According to the method disclosed by the invention, rasterization is carried out on a random polygon by using a GPU and thus the polygon expressed by a vertex coordinate is converted into polygon raster images expressed by rasters; according to the intersection situation of the raster images, assignment and correction are carried out on location identifiers of all rasters; and then statistics of the number of intersected rasters is carried out by using a CPU or GPU and an intersection area is calculated. The method is not limited by concavity and convexity of the polygon; and on the basis of the parallel characteristic of the GPU, the method enables the processing speed to increase substantially by being compared with the CPU-based computing method. Moreover, the principle is simple and the method is convenient to implement. The experiment result demonstrates that the method disclosed by the invention is suitable for any complex polygon; and a problem of singularity in the traditional calculation method can be solved, so that the robustness is high.

The embodiment of the invention discloses a polygon epitaxy boundary processing method and device, and the method comprises the steps: obtaining a polygon, and judging and obtaining all intersection points between all line segments of the original boundary epitaxy of the polygon; if it is judged that the position of the current intersection point is in the original boundary, abandoning the currentintersection point, and otherwise, reserving the current intersection point; calculating the limit distance between each reserved intersection point and the original boundary, if the actual shortestdistance between the current intersection point and the original boundary is judged to be smaller than the limit distance, abandoning the current intersection point, otherwise, reserving the current intersection point; and performing line segment adjustment on the reserved intersection points to obtain polygons with normal epitaxial boundaries. According to the embodiment of the invention, variousintersection point processing conditions are considered, and the limit distance is calculated, so that the problem of complex polygon epitaxial boundary errors is solved, and the method and devic canbe applied to calculation of various epitaxial boundaries and has very high practical value.

The invention provides a boundary unicursal method for processing the polygon multiplex inclusion relation. A boundary unicursal method based on a shortest connecting wire is introduced; the goal of reasonable boundary connection and organization on the premise of maintaining the topological relation consistency of a complex polygon is effectively achieved; the complexity and the redundancy of data are avoided; and the map hierarchical display correctness is effectively ensured.

The invention provides a method for generating vector slices on demand in real time for GDB data, and belongs to the technical field of map data format conversion. The method generates efficient, lossless, low-redundancy and small-size vector slice data through the steps of analyzing data in a database, projecting and converting the data, encoding by adopting Google encoding rules and the like. According to the method, the problem of slow data updating is solved by adopting a dynamic request and real-time slice acquisition mode. By designing a thinning scheme, the problem of rendering deformation of a rendering engine on complex polygons is solved. An attribute matching mode is adopted to reduce data redundancy. And a Google encoding rule is adopted for encoding, so that the data volume isreduced.

The invention discloses a method for rapidly constructing a complex polygon plane based on Unity 3D, and the method comprises the steps: S0, selecting any vertex of the vertexes of the polygon plane,numbering all the vertexes in sequence, and entering the step S1; S1, judging the convexity and convexity of a polygon plane, classifying polygons, and then entering the step S2; S2, performing triangulation on the polygonal plane to generate a triangular plane (including position coordinates and vertex serial numbers), and then entering the step S3; and S3, carrying out plane filling according tothe generated triangle position coordinates and the vertex serial numbers, and finally a complex polygon plane is obtained. According to the method provided by the invention, the construction of a complex polygon plane can be simplified, manual triangle division is not needed, and the efficiency of Unity 3D modeling is improved.

In a method of decomposing a layout of a semiconductor device, a polygon, which includes a plurality of intersections at each of which at least two lines are crossed, among polygons included in the layout of the semiconductor device may be determined as a complex polygon. A first stitch may be inserted between the plurality of intersections on the complex polygon. A plurality of decomposed patterns may be generated by performing a pattern dividing operation on the layout.

The invention discloses a method and a system for detecting whether a current pixel is located in a polygon, wherein, the method for detecting whether the current pixel is located in a polygon comprises the following steps: the intersection edges of the scanning line where the current pixel is located and the polygon is obtained; the intersection edges are arranged a plurality of 2-2 matched pairs of intersection edges; the matched pairs of intersection edges between which the current pixel is located are calculated; if the current pixel is located between the odd matched pairs of intersection edges, the current pixel is judged to be located in the polygon, otherwise, the current pixel is judged to be located outside the polygon. The invention is suitable for the convex polygon, the concave polygon and the complex polygon with polygon holes; the invention has simple method, and the modularization of the procedure is strong, and the hardware implementation is easy.

The invention discloses a quadtree construction method for storing polygon inclusion relations and an indexing method. The construction method comprises the following steps: constructing a quadtree for storing the inclusion relation of polygons, establishing a rule for judging the inclusion relation between polygon objects, and identifying the parent-child inclusion relation between complex polygons and polygons surrounded by inner rings of the complex polygons; meanwhile, the polygons corresponding to the nodes in the quadtree are stored in barrels; indexing is carried out based on the constructed quadtree; the invention provides an implementation process of polygonal object query, deletion and insertion processes. Based on the constructed inclusion relation and the bucket storage characteristics, the query, deletion and insertion efficiency of the polygon object is greatly improved. Meanwhile, a technical support is provided for quickly determining an inner ring where the incrementalpolygon and the ground state polygon intersect in the incremental updating application process.

The invention provides a polygon compressing method and device. When a polygon is determined as a complex polygon, the complex polygon is cut into a simple polygon, and the simple polygon obtained by cutting is subjected to triangle dissection to obtain triangles which form the simple polygon, and thus triangle cutting of the complex polygon is achieved. After the triangles which form the simple polygon are obtained, the triangles are subjected to triangular belt compression, and at least one triangular belt is obtained, wherein one triangular belt is used for storing N-2 vertexes of triangles, namely, more than three vertexes, and more than one triangle is obtained. For example, when the number of the vertexes stored by one triangular belt is four, two triangles can be obtained by decompression through stored four vertexes while six vertexes need to be stored for storing two triangles in the prior art. Therefore, the technical scheme provided by the invention can reduce the vertex data storage content and the storage space occupied by polygons.

The invention discloses a synthetic aperture radar image Voronoi polygon mosaic method considering multiple dimensions, and the method comprises the steps: carrying out the quick mosaic of a preprocessed SAR digital orthoimage, and generating a mosaic base map image; utilizing an eight-neighborhood search algorithm to extract a boundary vector range of each preprocessed SAR digital orthoimage; on the basis of the extracted vector range, determining an overlapping region between the preprocessed SAR digital orthoimages; performing Voronoi complex polygon detection on each overlapping region, simplifying the detected complex polygon, and decomposing the complex polygon into a simplified SAR digital orthoimage; and embedding the simplified SAR digital orthoimage. According to the method, the mosaic base map image is firstly generated, and then the Voronoi seam line considering the multi-dimensional expansion overlapping surface and the linear weighted smooth mosaic processing are adopted, so that the mosaic efficiency and the mosaic effect can be greatly improved.

The invention discloses a complex polygon cutting method for solving an intersection degradation problem. The method comprises steps of a polygon formed by the outer ring boundary of a solid polygon intersects with a cut polygon; if the solid polygon has a hole, the resulting polygon and a polygon formed by the hole are subjected to differencing; an obtained cutting result and a next hole polygon are subjected to differencing until all the hole polygons are processed; and finally, the whole cutting process is ended, and the cutting result of the general polygon is obtained. The method is applicable to any convex, concave or perforated polygon cutting, and can realize the intersection, differencing and union of the solid polygon and the cut polygon, and obtain the correct cutting result in the case of intersection degradation. The frequency of polygon intersection and the summit traversal frequency of cutting result generation are reduced, and the cutting algorithm operation speed is accelerated. The method is better than the Greiner-Hormann algorithm in terms of space consumption and time consumption.

Virtual shapes are defined that are referenced to one or more actual, printable sheets for printing. The virtual shapes are referenced to the actual sheet using a rotation and x-axis (left-to-right) and y-axis (top-down) coordinates. The coordinates are typically specified with respect to the top-left corner of the sheet. In one example, an end-user views a shape on a display, such as a computer monitor, a kiosk screen, the screen of a personal data assistant or other digital device. The shape may correspond, for example, to a complex label shape. After the user has input customized and / or personalized text, graphics or other information to be printed, the software may apply a rotation to the virtual shape as it is referenced onto the actual page to be printed. A product identification table may be provided in order to correlate proper rotations and / or coordinates to particular types of commercial sheets. A single virtual shape may be referenced multiple times onto a single sheet. The virtual shape may be complex, such as a complex polygon and / or ellipse, and may include such features as cut-outs, blank areas to be kept free of text and / or graphics, multiple areas for printing text and / or graphics, as well as other complex features.

The invention discloses a complex polygon cutting method for solving an intersection degradation problem. The method comprises steps of a polygon formed by the outer ring boundary of a solid polygon intersects with a cut polygon; if the solid polygon has a hole, the resulting polygon and a polygon formed by the hole are subjected to differencing; an obtained cutting result and a next hole polygon are subjected to differencing until all the hole polygons are processed; and finally, the whole cutting process is ended, and the cutting result of the general polygon is obtained. The method is applicable to any convex, concave or perforated polygon cutting, and can realize the intersection, differencing and union of the solid polygon and the cut polygon, and obtain the correct cutting result in the case of intersection degradation. The frequency of polygon intersection and the summit traversal frequency of cutting result generation are reduced, and the cutting algorithm operation speed is accelerated. The method is better than the Greiner-Hormann algorithm in terms of space consumption and time consumption.

The invention provides a method and system for generating a 3D scene through two-dimensional GIS vector data. The method specifically comprises the following steps: enabling a client to upload the two-dimensional GIS vector data of a building surface to a server; enabling the server to receive the data and performs format standardization operation on the data; performing topological processing on the standardized building surface data, and converting complex polygons in the building surface into simple polygons; reading a vertex array of the simple polygon, and constructing the building surface into a three-dimensional geometry; if the attribute value of the map type exists in the building surface data, acquiring a corresponding map to execute a tiling operation, otherwise, reading a default map to execute the tiling operation; and forming a grid object by combining the three-dimensional geometry and the material after the paving operation, and adding the grid object into the 3D scene. The two-dimensional GIS vector data of the building surfaces are obtained, and the two-dimensional GIS vector data are automatically pulled up and mapped according to the height information of the data of each building surface and then added into the three-dimensional scene, so that the problem of low efficiency caused by manual contrast of CAD drawing data or manual modeling is solved.

The invention discloses a multi-rotor drone mapping air route planning method under complex polygon survey areas. The method is mainly divided into two parts, namely planning of a single flight zone and updating of remaining uncovered survey areas. According to the method, firstly, planning of the single flight zone is carried out according to the position of a drone and a to-be-covered survey area, a pair of longest navigation zone points of a navigation zone in the current state are obtained, then effective covered areas of the navigation zone are taken into account, the remaining uncoveredareas are updated and regarded as one new survey area or a group of new survey areas, the position of the drone is updated as the last navigation point of the navigation zone at the same time in orderto plane a next navigation zone until coverage of the whole survey areas is completed. By means of the method, an air route with a smaller redundant coverage rate and a lower turning frequency underthe complex polygon measuring areas can be planned.

The present invention proposes a one-stroke border method for dealing with multiple inclusion relationships of polygons. The present invention introduces a one-stroke border method based on the shortest connection line, which effectively solves the problem of reasonable border connections and complex polygons under the premise of maintaining the consistency of topology. The problem of organization avoids the complexity and redundancy of data, and effectively ensures the correctness of map layered display.