Class / Patent application number | Description | Number of patent applications / Date published |
345442000 | Curve | 86 |
20080198162 | A METHOD OF GENERATING CURVED BASELINE FOR MAP LABELING - Apparatus and methods of generating a curved baseline for a map labeling include receiving a polyline P={p | 08-21-2008 |
20080252645 | IN-CONTEXT PAINT STROKE CHARACTERISTIC ADJUSTMENT - In-context paint stroke characteristic adjustment, in which a first user input selecting a path of a paint stroke rendered on a display is received, an anchor point on the path is defined based on the first user input, and a characteristic adjustment control is rendered adjacent to the anchor point. A second user input is received via the characteristic adjustment control, and a characteristic of the paint stroke is adjusted at the anchor point based on the second user input. | 10-16-2008 |
20080297514 | Interactive labyrinth curve generation and applications thereof - Complex labyrinth curves are interactively generated by an iterative process that spatially modulates curve evolution by an image or other function defined on the evolution space. After curves and evolution parameters are initialized [ | 12-04-2008 |
20090027396 | METHOD FOR FITTING A PARAMETRIC REPRESENTATION TO A SET OF OBJECTS - Described is a method for fitting a parametric representation to digital data. A vector distance field is generated to represent a set of objects and a parametric representation for the set of objects is initialized. A fitting error is determined from the vector distance field representation. The fitting error indicates the accuracy of the fit of the parametric representation to the set of objects. The parametric representation is adjusted and the fitting error is again determined in an iterative manner until an acceptable fitting error is achieved. The method has numerous technical advantages such as robustness, speed, simplicity relative to standard approaches, and the ability to manage constraints such as maintaining corners and enforcing continuity. | 01-29-2009 |
20090027397 | METHOD FOR FITTING A PARAMETRIC REPRESENTATION TO A SET OF OBJECTS GENERATED BY A DIGITAL SKETCHING DEVICE - Described is a method for sketching with a digitizing device. A set of digitized points along a path of the digitizing device are acquired and a parametric representation is fit to the path. Fitting includes generating a vector distance field representation of a set of objects corresponding to the set of digitized points and initializing a parametric representation for the set of objects. A fitting error indicating an accuracy of the fit of the parametric representation to the set of objects is determined from the vector distance field representation. The parametric representation is adjusted and the fitting error is again determined in an iterative manner until an acceptable fitting error is achieved. The method has numerous technical advantages such as robustness, speed, simplicity relative to standard approaches, and the ability to manage constraints such as maintaining corners and enforcing continuity. | 01-29-2009 |
20090027398 | METHOD FOR RECOGNIZING A SHAPE FROM A PATH OF A DIGITIZING DEVICE - Described is a method for recognizing a shape from a path of a digitizing device. A set of points along a path of the digitizing device is acquired and a parametric representation is fit to the path. The parametric representation is compared to a set of known shapes to determine that the path of the digitizing device represents a particular shape. Fitting the parametric representation to the path includes generating a vector distance field representation of a set of objects corresponding to the set of digitized points, initializing a parametric representation to fit the set of objects, determining a fitting error from the vector distance field representation and adjusting the parametric representation to reduce the fitting error. The fitting error indicates an accuracy of the fit of the parametric representation to the set of objects. | 01-29-2009 |
20090033665 | CURVE DRAWING APPARATUS, CURVE DRAWING METHOD, PARKING SUPPORT SYSTEM AND VEHICLE - To enable the drawing of a curve which is made to have an appropriate width to display scanning through a simple calculation process without using a frame buffer. | 02-05-2009 |
20090073174 | USER INTERFACE FOR EXPRESSING FORECASTING ESTIMATES - A user interface allows a user to freehand draw a probability density curve, or to select from predetermined probability densities, such as a normal distribution. The probability density represents the user's opinion regarding the probability of occurrence for different outcomes of a future event. The user can easily manipulate the shape of the probability density by dragging portions of the curve using an input device, such as to change the mean or standard deviation. Further, a scoring rule is applied to the probability density so that an updated score is displayed as the probability density is manipulated. The probability density can be input to an estimate contest or a prediction market, for instance. The user interface can also allow the user to freehand draw a scoring curve from which a probability density can be computed based on a scoring rule. | 03-19-2009 |
20090135186 | WIPE PATTERN GENERATION APPARATUS - A wipe pattern generation apparatus that can generate wipe patterns of various shapes at high speed and moreover can be miniaturized. is provided. | 05-28-2009 |
20090184966 | USER-DIRECTED PATH-BASED REGION FILLING - A method for filling closed regions in a drawing using a region filling tool. Rather than selecting individual regions to fill, or filling based on style-by-layer techniques, the user creates a path or an area boundary to identify the regions to be filled. A graphics application may then fill each region that intersects the path or area boundary with a selected color or graphical style. In this manner, multiple regions in the drawing may be identified using one interaction with the region filling tool, allowing the user to more efficiently and intuitively fill regions in the drawing with the selected color or graphical style. | 07-23-2009 |
20090201295 | ASSOCIATIVE FILLET - A method, apparatus, and article of manufacture provide the ability to update a filleted curve in a computer graphics application. A drawing having a first input curve and a second input curve is displayed. The first and second input curves are selected. A fillet curve is calculated, created, and displayed between the two input curves. A property of the first input curve is modified. Automatically, without additional user input, the fillet curve is recalculated based on the modified property. The recalculated fillet curve is displayed. | 08-13-2009 |
20090207174 | Computer Graphic Method and Modular Thereof - Computer graphic method is used to transform a irregular hand drawing into a regular shape, such as a circuit, a rectangle, or a curve. First step of the computer graphic method is inputting the hand drawing to a computer. Then, identify at least one characteristic of the hand drawing, and creating a regular shape based on the characteristic. Finally, replacing the hand drawing with the regular shape. | 08-20-2009 |
20090237409 | SYSTEM AND METHOD FOR A FULLY EDITABLE OPERATION IN THE CONTEXT OF A SOLVER CONTROLLED ENVIRONMENT - A system, method, and computer program for editing offsets, comprising connecting one or more input curves to a constraint system by constraints; offsetting output curves from said input curves by an operation; and creating a plurality of constraints among said input curves and said output curves; whereby editing said operation transforms said input curves and said output curves in a bidirectional manner, and appropriate means and computer-readable instructions. | 09-24-2009 |
20090237410 | SYSTEM AND METHOD FOR OFFSET CURVES WITH BIDIRECTIONAL CONSTRAINTS - A system, method, and computer program for editing curves having bidirectional offset constraints, comprising selecting a collection of curves having a set of curve end points to perform an operation; and constraining a set of offset end points to said set of curve end points; whereby end constraints for offset curves are known, and appropriate means and computer-readable instructions. | 09-24-2009 |
20090278850 | Image Creating Device, Image Creating Method, Information Recording Medium, and Program - In an image creating device ( | 11-12-2009 |
20090284532 | CURSOR MOTION BLURRING - An electronic device for displaying a cursor with a trail is provided. The user may control electronic device operations by navigating the cursor on a display. To assist the user in identifying the current location of the cursor, the electronic device may define and display a trail indicating the prior positions of the cursor. For example, the electronic device may identify previous cursor positions and draw a curve, for example a spline, connecting the previous cursor positions and the current cursor position. The curve may have a varying width, thus forming a trail for which the wider portion is adjacent the cursor, and for which the narrower portion is adjacent the tip of the curve. The electronic device may instead or in addition modify the opacity of the curve, for example based on the instantaneous speed of the cursor. In some embodiments, other trail characteristics (e.g., size, color, opacity, path) may be modified based on prior cursor movements or cursor speed. | 11-19-2009 |
20100045679 | METHOD AND APPARATUS FOR APPROXIMATING HAIR AND SIMILAR OBJECTS DURING ANIMATION - Simulating dynamics (e.g., physical effects of inertia, forces, wind) on strands (e.g., hair) during computer based animation requires quick and accurate approximations of mathematical curves. Each strand is initially represented as a B-spline curve. Line segments approximating the curve are created by using affine combinations based on the curve's control vertices. Dynamics simulation is performed on the line segment approximation. Once an approximated strand is simulated, it is converted back into a B-spine curve representation for downstream processes, such as rendering. The rendering process displays the simulated strand to the animator. | 02-25-2010 |
20100097382 | Graphics processing systems - When rendering a stroked curve for display in a graphics processing system, an input stroked curve | 04-22-2010 |
20100097383 | Graphics processing systems - An input stroked curve | 04-22-2010 |
20100141659 | DISCARDING OF VERTEX POINTS DURING TWO-DIMENSIONAL GRAPHICS RENDERING USING THREE-DIMENSIONAL GRAPHICS HARDWARE - This disclosure describes techniques for removing vertex points during two-dimensional (2D) graphics rendering using three-dimensional (3D) graphics hardware. In accordance with the described techniques one or more vertex points may be removed during 2D graphics rendering using 3D graphics hardware. For example, the techniques may remove redundant vertex points in the display coordinate space by discarding vertex points that have the substantially same positional coordinates in the display coordinate space as a previous vertex point. Alternatively or additionally, the techniques may remove excess vertex points that lie in a straight line. Removing the redundant vertex points or vertex points that lie in a straight line allow for more efficient utilization of the hardware resources of the GPU and increase the speed at which the GPU renders the image for display. | 06-10-2010 |
20100149188 | EVENT BASED INTERACTIVE ANIMATION - A client device receives a user interface event corresponding to a spline curve associated with an object displayed on a mobile device. The user interface triggers creation of a new spline curve based on computation of a new spline tangent associated with the spline curve and phase space-based dynamics of a new state. A scene graph having state information associated with the new state is maintained. A rendering event triggers repainting of the object associated with the spline curve suing the scene graph. | 06-17-2010 |
20100149189 | Media Action Script Acceleration Apparatus - Exemplary apparatus, method, and system embodiments provide for accelerated hardware processing of an action script for a graphical image for visual display. An exemplary apparatus comprises: a first memory to store corresponding data; a first processor to separate the action script from other data; and a second processor to convert a plurality of descriptive elements of the action script into a plurality of operational codes, and to perform an operation corresponding to an operational code of the plurality of operational codes using the corresponding data to generate pixel data for the graphical image. In exemplary embodiments the second processor further is to parse the action script into the plurality of descriptive elements and the corresponding data, and to extract data from the action script and to store the extracted data in the first memory as a plurality of control words having the corresponding data in predetermined fields. | 06-17-2010 |
20100177103 | Constructing Computer Aided Design Models From Procedurally Defined Curve and Surface Lofts - The advantageous embodiments provide a computer implemented method, apparatus, and computer program product for constructing a computer aided design model. User input is received that contains a callback function and a required accuracy. The callback function prescribes a procedurally defined geometry and the required accuracy specifies the degree of accuracy needed for the computer aided design model. The callback function is sampled at a number of points to form sampled points and a candidate curve is constructed that approaches the sampled points. A determination is made as to whether the candidate curve meets the required accuracy. | 07-15-2010 |
20100201689 | METHOD, APPARATUS AND COMPUTER PROGRAM PRODUCT FOR INTERACTIVE SKETCH TEMPLATE CREATION, ALTERATION, AND USE - A method is provided for converting a template creation input corresponding to an image into a sketch template. This method may include minimizing stroke data cost and converting the resulting contour into a curve approximation based around landmark points. After the sketch template is created, it may be personalized using various styles which alter the parameters of the curve approximation and/or the landmark points. The sketch template may be used to practice drawing skills. A tracing algorithm may provide feedback as to how far a tracing line deviates from the sketch template, and may also provide overall feedback for all the tracing lines combined, relating to factors such as closeness to the sketch template, speed, and completion percentage. | 08-12-2010 |
20100207948 | Tessellating Elements - The tessellating elements are in sets and comprise (a) at least one curve element comprising a semi-circle of diameter x; (b) at least one wave element having a perimeter which is three-sided, including a first side which is straight and of length x, a second side which comprises a concave curve forming a semi-circle of diameter x, and a third side which comprises a convex curve forming a quarter circle of radius x; (c) at least one corner element having a perimeter which is three-sided, including two sides of length x at right angles to one another and a third side which is concave and comprises a quarter circle of radius x; and, optionally, (d) one or more lozenge elements having at least one shaped face with a perimeter comprising two arcuate edges, each said arcuate edge having a radius of curvature x. The elements have a wide range of applications, from building tiles and children's toys, to screen-filling of computer screens or the like. In use, the elements are laid on a surface in a space-filling manner with straight edges abutting straight edges of adjacent elements, and convex curved edges abutting concave curved edges of adjacent elements. | 08-19-2010 |
20100225652 | Tile Based Rendering Of Smooth Points Using Polygons - An apparatus and method for rendering a smooth circular point using polygons on a computer graphics display. The circular point is approximated by a polygon and the selection of the polygon depends on the diameter of the point. The polygon is enclosed in a bounding area that is divided into a plurality of tiles. The tiles are classified into different sections depending on their location relative to the center of the point. The tiles in each section are processed according to an algorithm to generate a mask that is used to render the circular point. | 09-09-2010 |
20100265255 | GENERATION OF CUBIC BEZIER CONTROL POINTS IN COMPUTER GRAPHICS SYSTEMS - A system for interactive computer graphics enables generation of Bezier curves from a series of points based on the relative position of successive points in the series. For example, for successive points in a series, point A, point B, and point C are successive points in the series of points, and wherein a control point corresponding to point B and associated with the segment AB is determined by the equation B+R | 10-21-2010 |
20100289802 | SYSTEM AND METHOD FOR ADAPTIVE TESSELLATION OF A CURVE - A graphic module wherein, given a curve P(x,y)=P(x(t), y(t)) between two points P | 11-18-2010 |
20100295858 | METHOD AND SYSTEM FOR APPROXIMATING CURVE, AND GRAPHIC DISPLAY CONTROL METHOD AND APPARATUS - A method and system for approximating a curve, and a graphic display control method and apparatus are disclosed. The method for approximating a curve comprises the steps of acquiring number information of subdividing points for subdividing a curve needed to be approximated based on coordinate information of control points of the curve, acquiring coordinate information of the subdividing points based on the number information of the subdividing points and the coordinate information of the control points, and connecting the subdividing points with straight lines based on the coordinate information of the subdividing points. The invention could achieve efficient curve approximation and in turn achieve efficient graphic-display control. | 11-25-2010 |
20110025693 | Graphics processing systems - A method of rendering a stroked curve for display in a graphics processing system in which an input stroked curve | 02-03-2011 |
20110084968 | IMAGE DRAWING APPARATUS, IMAGE DRAWING METHOD, AND STORAGE MEDIUM - A division number that defines the number of divided straight lines representing a circular graphic pattern is registered beforehand in a division number table in relation to a radius r of the circular graphic pattern. Further, data usable to calculate X-coordinate and Y-coordinate values of endpoints of respective divided straight lines are registered beforehand in an endpoint table in relation to a straight line division number N. Accordingly, if a graphic pattern to be drawn is a circular graphic pattern, it is unnecessary to approximate an outline (curve) with Bezier curves and each division point (endpoint) of divided straight lines can be directly and quickly obtained using the trigonometric function. | 04-14-2011 |
20110164041 | GRAPHIC INFORMATION PROCESSING DEVICE FOR FORMING AESTHETIC CURVES, GRAPHIC INFORMATION PROCESSING METHOD, AND GRAPHIC INFORMATION PROCESSING PROGRAM - To easily form curves preferable for design (beautiful curves or aesthetic curves). A CAD system includes: a receiving unit that receives input of graphic information representing a line figure that includes a curve; a dividing unit that divides the line figure into a plurality of segments and generating a plurality of pieces of segment information corresponding to the plurality of segments; a first shaping unit that shapes a curve in each segment by converting each of the plurality of pieces of segment information through a function defined in terms of a curvature; a second shaping unit that further shapes the plurality of segments by converting each of the converted plurality of pieces of segment information so that a difference between a curvature at an endpoint of one segment represented by the piece of segment information and a curvature at an endpoint of another segment connected to the endpoint of the one segment becomes equal to or smaller than a predetermined threshold; and a display unit that outputs the graphic information representing the line figure that consists of the plurality of shaped segments. | 07-07-2011 |
20110169839 | CURVED SURFACE IMPORTING DEVICE AND METHOD - A curved surface importing device and method imports character strings of graphic parameters and graphic attributes of graphs from an initial graphic exchange specification (IGES) document, and analyzes the character strings of each of the graphs to generate a graphic model. The curved surface importing device converts the graphic model to a plurality of free-form curves and a free-form curved surface, connects each of the free-form curves to generate a closed boundary curve, and cuts out a contour surface from the free-form curved surface according to the closed boundary curve. The curved surface importing device further meshes the contour surface using a plurality of triangles, and determines an approximate poly-line of a boundary of the contour surface. The plurality of triangles and the approximate poly-line of a boundary of the contour surface are displayed on a display screen. | 07-14-2011 |
20110187720 | Interactive Labyrinth Curve Generation and Applications Thereof - Complex labyrinth curves are interactively generated by an iterative process that spatially modulates curve evolution by an image or other function defined on the evolution space. After curves and evolution parameters are initialized [ | 08-04-2011 |
20110199381 | BEZIER CURVE DRAWING DEVICE, BEZIER CURVE DRAWING METHOD, AND RECORDING MEDIUM - A Bezier curve drawing device is configured as follows. A control point coordinate acquiring unit ( | 08-18-2011 |
20110216070 | SCALE SEPARATION IN HAIR DYNAMICS - Techniques are disclosed for accounting for features of computer-generated dynamic or simulation models being at different scales. Some examples of dynamic or simulation models may include models representing hair, fur, strings, vines, tails, or the like. In various embodiments, features at different scales in a complex dynamic or simulation model can be treated differently when rendered and/or simulated. | 09-08-2011 |
20110234600 | Client/Server Waveform Viewer Using Bitmaps - Improving on the waveform viewing technology can advantageously address the industry's need for speedup and capacity of existing solution. As described herein, making data manipulation local and bounded can facilitate tremendous speedup. The waveform viewer can process data on-demand where the user explicitly specifies signals and a desired window (i.e. range). Operations including, but not limited to, zoom, pan, scan, etc. on the waveform viewer can be sent to the waveform servers in the form of a query containing the visualization parameters (e.g. number of pixels), which in turn compute bitmaps (or other waveform images) that are sent back to be displayed. | 09-29-2011 |
20110242109 | METHOD AND DEVICE FOR SIMPLIFYING A COMPLEX PATH - The invention relates to a technical field of graphic image processing, especially to a technology for simplifying a complex path. The invention provides a method and a device for simplifying a complex path, to accomplish simplification of any complex path into a simple path of a region described by the complex path. The method for simplifying a complex path comprises: parsing the complex path into a vector linked-list consisted of linked monotonic vectors; dividing each vector in the vector linked-list into vector segments according to intersection points of the vector with other vectors in the vector linked-list; and extracting from all vector segments the vector segments located on a boundary of a region defined by the complex path, and connecting the extracted vector segments according to their location to obtain a simple path. According the method of the present application, a complex path can be simplified to a simplest path defining a region by utilizing node scanning process, such that operations on a vector level for a complex path can be realized. | 10-06-2011 |
20110261059 | Method And System For Decomposing Complex Shapes Into Curvy RHTS For Rasterization - A complex curved primitive is decomposed into curvy RHTs comprising a curved portion and horizontal and vertical lines. Pixel rows covered by curvy RHTs are determined. RHT pixels covered by the curved primitive are determined with counters. Tile based color rendering is performed for covered pixels. The primitive path is decomposed into Bezier curves. Curvy RHTs may overlap and may cover pixels that are not covered by the curved primitive. Pixel rows are located by traversing an RHT path and the direction of traversing may determine pixel counts. Pixel coverage and tile coverage information is stored in memory. Pixels may be rendered in parallel. The curved primitive is rendered in a tile binning phase and a tile rendering phase. Tile rendering comprises a pixel coverage first pass which determines pixels covered by said curved primitive and a color rendering second pass. | 10-27-2011 |
20110285718 | POINT CONTAINMENT FOR QUADRATIC B ZIER STROKES - One embodiment of the present invention sets forth a technique for stroking rendered paths. Path rendering may be accelerated when a graphics processing unit or other processor is configured to identify pixels that are within half of the stroke width of any point along a path to be stroked. The path is represented by quadratic Bèzier segments and a cubic equation is evaluated to determine whether or not each point in a conservative hull that bounds the quadratic Bèzier segment is within the stroke width. | 11-24-2011 |
20110285719 | APPROXIMATION OF STROKED HIGHER-ORDER CURVED SEGMENTS BY QUADRATIC B ZIER CURVE SEGMENTS - One embodiment of the present invention sets forth a technique for subdividing stroked higher-order curved segments into quadratic Bèzier curve segments. Path stroking may be accelerated when a GPU or other processor is configured to perform the subdivision operations. Cubic Bèzier path segments are subdivided into quadratic Bèzier curve segments and other lower-order segments at key features. The quadratic Bèzier curve segments approximate the cubic Bèzier path segments. A variance metric is computed for each quadratic Bèzier curve segment, and when the variance metric indicates that the quadratic Bèzier curve segment deviates by more than a threshold from the corresponding portion of the cubic Bèzier path segment, the quadratic Bèzier curve segment is further subdivided. The path composed of the quadratic Bèzier curve segments is then stroked by rendering hull geometry that encloses the path. | 11-24-2011 |
20110285720 | DECOMPOSING CUBIC BEZIER SEGMENTS FOR TESSELLATION-FREE STENCIL FILLING - One embodiment of the present invention sets forth a technique for decomposing and filling cubic Bèzier segments of paths without tessellating the paths. Path rendering may be accelerated when a GPU or other processor is configured to perform the decomposition operations. Cubic Bèzier paths are classified and decomposed into simple cubic Bèzier path segments based on the classification. A stencil buffer is then generated that indicates pixels that are inside of the decomposed cubic Bèzier segments. The paths are then filled according to the stencil buffer to produce a filled path. | 11-24-2011 |
20110285721 | POINT CONTAINMENT FOR QUADRATIC B ZIER STROKES - One embodiment of the present invention sets forth a technique for stroking rendered paths. Path rendering may be accelerated when a graphics processing unit or other processor is configured to identify pixels that are within half of the stroke width of any point along a path to be stroked. The path is represented by quadratic Bèzier segments and a cubic equation is evaluated to determine whether or not each point in a conservative hull that bounds the quadratic Bèzier segment is within the stroke width. | 11-24-2011 |
20110285722 | APPROXIMATION OF STROKED HIGHER-ORDER CURVED SEGMENTS BY QUADRATIC B ZIER CURVE SEGMENTS - One embodiment of the present invention sets forth a technique for subdividing stroked higher-order curved segments into quadratic Bèzier curve segments. Path stroking may be accelerated when a GPU or other processor is configured to perform the subdivision operations. Cubic Bèzier path segments are subdivided into quadratic Bèzier curve segments and other lower-order segments at key features. The quadratic Bèzier curve segments approximate the cubic Bèzier path segments. A variance metric is computed for each quadratic Bèzier curve segment, and when the variance metric indicates that the quadratic Bèzier curve segment deviates by more than a threshold from the corresponding portion of the cubic Bèzier path segment, the quadratic Bèzier curve segment is further subdivided. The path composed of the quadratic Bèzier curve segments is then stroked by rendering hull geometry that encloses the path. | 11-24-2011 |
20110285723 | CONVERSION OF DASHED STROKES INTO QUADRATIC B ZIER SEGMENT SEQUENCES - One embodiment of the present invention sets forth a technique for converting dashed strokes into quadratic Bèzier segment sequences. Path rendering with stroking and dashing may be accelerated when a graphics processing unit or other processor is configured to subdivide quadratic Bèzier segments based on the remaining distance for a current dash pattern element and the arc length of the current quadratic Bèzier path segment to generate “on” dash pattern segments. Each “on” dash pattern segment is then bounded by a conservative geometric hull. A point containment technique is then used to identify pixels within each conservative geometric hull that are within half of the stroke width of any point along a path to be stroked. | 11-24-2011 |
20110298807 | Touch screen and display method - A touch screen to smooth a moving trajectory of a touch unit input as a curved line and to display the moving trajectory, and a display method of the touch screen are provided. The display method of the touch screen may include sampling coordinates at touch points when a touch unit moves on a touch screen, determining whether a moving trajectory of the touch unit is a curved line according to inclination between the coordinates, and fitting the sampled coordinates to a curve and displaying the fitted curve on the touch screen upon determining that the moving trajectory of the touch unit is the curved line. | 12-08-2011 |
20120069026 | Segmentation of Free-Form Shapes into Chains of Circular Elements in Computer Graphics Applications - A solution for representing a free-form shape in a data-processing system is proposed. An illustrative method comprises associating sample points defining the free-form shape with a set of circular elements, and storing an indication of the circular elements. Associating includes determining a set of pivot points among the sample points in correspondence of maximum and minimum curvatures of the free-form shape, partitioning the sample points into a set of first groups of sample points each spanning around a corresponding pivot point and a set of second groups of sample points each extending according to a predefined minimum extent between a corresponding pair of adjacent first groups of sample points. Each first group is associated with a first circular element fitting the first group of sample points, and each second group is associated with at least one second circular element providing a predefined continuity with each adjacent first circular element. | 03-22-2012 |
20120075310 | ARC SPLINE GPU RASTERIZATION FOR CUBIC BEZIER DRAWING - A curve drawing system is described herein that rasterizes arc splines in the GPU of a computer for cubic Bezier drawing of strokes and thin features. The curve drawing system first converts a cubic Bezier representation into an arc spline representation. Then the curve drawing system uses a similar approach to Loop/Blinn modified to cause the pixel shader to perform a point-in-circular-arc test instead of a point-in-Bezier test. Calculating arc radius is a much simpler operation than the alternatives and can be easily and efficiently performed by the pixel shader. Since the stroke of an arc spline is also an arc spline, the drawing system provides a resolution-independent representation of strokes. Thus, the curve drawing system allows several previously difficult graphical features to be efficiently drawn by readily available legacy hardware and used in software programs that are designed to run on a wide variety of hardware. | 03-29-2012 |
20120113124 | ADAPTIVE GRAND TOUR - A system and method of generating a dynamic visualization of a multi-dimensional dataset of data-points are disclosed. The method is an adaptation of the Grand Tour approach, but instead of using all possible projections comprising at least one data point, some of which may not be useful, the method includes generating a set of candidate projections from the space of all possible projections. The set of candidate projections is approximated with a one dimensional smoothed curve and the dynamic visualization is generated, based on a sequence of projections taken along the smoothed curve. | 05-10-2012 |
20120154406 | CURVE-DIVIDING DEVICE, CURVE-DIVIDING METHOD, CURVE-DIVIDING PROGRAM AND INTEGRATED CIRCUIT - A curve division device is provided enabling a multiprocessor system to perform effective curve division on Bézier curves. | 06-21-2012 |
20120200572 | TARGET SELECTION APPARATUS THAT DETECTS TARGET, CONTROL METHOD THEREFOR, AND STORAGE MEDIUM - A target selection apparatus capable of quickly carrying out selection processing when selecting a desired target according to a target detection result and carrying out image processing on the target. An image corresponding to image data is displayed on a display unit. A drawing line is drawn on the image displayed on the display unit. A target included in the image data is selected based on the drawing line. In response to the drawing line becoming a closed curve, the selected target is determined. | 08-09-2012 |
20120206460 | GRAPHIC PROCESSING DEVICE, GRAPHIC PROCESSING METHOD, MEDIUM FOR STORING GRAPHIC PROCESSING PROGRAM - A device includes a processor which executes a process including generating data of a second graphic identified by shifting each of first sides of a first graphic by a length in a direction toward an inside of the first graphic and by tracing, in a direction, the first sides after the shifting and intersection points between the first sides after the shifting, generating data of a third graphic by shifting each of second sides of the second graphic to both sides of each of the second side by the length and by linking end points of the second sides after the shifting using a circular arc which is centered on an end point of the second side before the shifting and which has a radius of the length, and generating data of a fourth graphic by performing a logical addition operation between the second graphic and the third graphic. | 08-16-2012 |
20120223949 | SYSTEMS AND METHODS FOR INTERACTIVE VECTORIZATION - Embodiments facilitate the production of a B-spline curve that approximates a set of N-dimensional (position, pressures, tilt, etc.) discrete input samples recorded by a digital input device. Iterative noise filtering and B-spline subdivision processes are performed within a dynamic window of recent samples. A vector representation is produced at interactive rates after each new sample is captured, thus producing results that are comparable to what the same artist would expect if drawing on paper. | 09-06-2012 |
20120287135 | METHOD AND DEVICE FOR RENDERING AREAS BOUNDED BY CURVES USING A GPU - A method is provided for rendering pixels based on a certain type of Bézier curve, called a simple Bézier arch. The method uses an implicit function to determine whether each pixel in a domain triangle containing the arch is on the arch, on one side of the arch, or on the other side. The function's parameters can be linearly interpolated to allow efficient rendering of the triangle by a GPU. A method is also provided for applying the aforementioned method to render pixels, based on a non-linear Bézier curve having at most four control points, by subdividing the curve into simple Bézier arches as necessary. A computing device for performing these methods is also provided. | 11-15-2012 |
20120299932 | METHOD FOR THE CALCULATION OF THE BOUNDING BOX OF VECTORIAL GRAPHIC SHAPES - Method for determining the bounding box of a computerized graphic shape comprising one or more primitives described in vectorial mode, wherein the bounding box is calculated by applying analytical mathematical formulas to the vectorial description of the primitives constituting the shape without preliminarily performing a phase of drawing and displaying of the shape through resolution of the vectorial primitives that compose it. | 11-29-2012 |
20120320063 | Vector graphics with controlled thin-plate splines - This patent relates to thin plate spline (TPS)-based interpolation techniques for representing free-flowing vector graphics (VG) images based on user-specified features, such as points and curves. One or more features can be identified in a pixel grid. A higher-order least squares interpolating function with a TPS smoothness objective can then be utilized to interpolate individual color values to individual pixels of the pixel grid. Smoothness terms of the function that impose smoothness penalties can be interrupted in certain regions of the pixel grid based on attributes of the user-specified features. For example, a curve attribute can specify a particular color value(s), add or remove a smoothness penalty, or anisotropically impose a first derivative constraint in a particular direction. | 12-20-2012 |
20130044114 | Visual Representation of Data According to an Abstraction Hierarchy - Visual representations having visual nodes that can each show up to two levels of an abstraction hierarchy of data, extracted elements of the data, and/or categories thereof, with the optional ability to explode the data, the extracted elements, and/or the categories into additional visual nodes provide capability for deeper composition exploration. Relationships among the data, the extracted elements, and/or the categories can be represented via lines within and across visual nodes. The visual representation can provide an user with awareness of different attributes of the data, the extracted elements, and/or the categories in context even for large, complex corpora of data. The representations of the data, the extracted elements, and/or the categories in the visual representation can be sorted, can depict relative size or quantity across various attributes, and can provide insight into relationships based on metadata and/or content. | 02-21-2013 |
20130100138 | CURVE RENDERING DEVICE, CURVE RENDERING METHOD, CURVE RENDERING PROGRAM, AND INTEGRATED CIRCUIT - A curve rendering device is provided which is capable of judging whether a further approximation process is necessary for an approximation curve obtained by an immediately previous approximation process, and includes: a path dividing unit for calculating segmentation points on a center line; an outline point calculating unit for calculating, for each of the segmentation points, two offset points; a judging unit for calculating a distance between offset points, and judging a ratio of the longer distance to the shorter distance is greater than a predetermined value; and a curve forming unit for approximating, between two partial outlines, the longer one of the two partial outlines by using a greater number of line segments than line segments used to approximate the shorter one of the two partial outlines when the ratio is judged to be greater than the predetermined value. | 04-25-2013 |
20130241934 | Smart Scribbles for Sketch Segmentation - A method is provided for sketch segmentation via smart scribbles, the results of which are especially suitable for interactive real-time graphics editing applications. A vector-based drawing may be segmented into labels based on input scribbles provided by a user. By organizing the labeling as an energy minimization problem, an approximate solution can be found using a sequence of binary graph cuts for an equivalent graph, providing an optimized implementation in a polynomial time suitable for real-time drawing applications. The energy function may include time, proximity, direction, and curvature between strokes as smoothness terms, and proximity, direction, and oriented curvature between strokes and scribbles as data terms. Additionally, the energy function may be modified to provide for user control over locality control, allowing the selection of appropriately sized labeling regions by scribble input speed or scribble input pressure. Once the drawing is labeled, a wide range of drawing applications are enabled. | 09-19-2013 |
20130293554 | A METHOD FOR STROKING PATHS - A method of stroking a curved path with a fill of pre-determined thickness, said path having line segments defined by a plurality of points, said method comprising the steps of: forming a plurality of projection lines normal to the curved path at the plurality of points, each of the projection lines having a length based on the pre-determined fill thickness; determining an intersection between a set of the plurality of projection lines, said intersection indicating an occurrence of a void in stroking the curved path; and in response to detecting said intersection of the set of projection lines, constructing at least one polygon filling in the void in the stroked path. | 11-07-2013 |
20130321428 | METHOD AND APPARATUS FOR INTERACTIVE CURVE GENERATION - A system of curve generation takes a sequence of control points and constraint codes for each control point, and outputs a curve in which each of the constraints is satisfied. The set of constraints is chosen from the tangent angle, curvature, first derivative of curvature, and second derivative of curvature. The interactive curve design uses as its primitive, a curve whose curvature is a polynomial function of arclength (whose intrinsic equation is a polynomial). At each control point, a choice of G | 12-05-2013 |
20130321429 | STRING ARRANGEMENT DEVICE - A string arrangement device includes: a character string arrangement data acquisition unit for acquiring character string arrangement data for arranging a character string along a road; a control point sequence creation unit for creating a control point sequence from a road node sequence included in the character string arrangement data acquired by the character string arrangement data acquisition unit; a curve approximation unit for creating a node sequence obtained by approximating with a straight line a curve from the control point sequence created by the control point sequence creation unit; a curve approximation node sequence storage unit for storing the node sequence created by the curve approximation unit as a curve approximation node sequence; and a character string arrangement processing unit for performing arrangement processing of the character string based on the curve approximation node sequence stored in the curve approximation node sequence storage unit. | 12-05-2013 |
20130328885 | DEPTH HIGHLIGHT, DEPTH HIGHLIGHT RANGE, AND WATER LEVEL OFFSET HIGHLIGHT DISPLAY AND SYSTEMS - A digital mapping display and related system for fishing, and other applications | 12-12-2013 |
20140015838 | APPARATUS AND METHOD OF PERFORMING TILE BINNING OF BEZIER CURVE - An apparatus and method for tile binning with respect to a Bezier curve. The apparatus may include a curve identification unit to identify a Bezier curve included in input data, a bounding box generation unit to generate a plurality of bounding boxes corresponding to the Bezier curve, and a tile binning unit to perform tile binning with respect to the Bezier curve based on the plurality of bounding boxes. | 01-16-2014 |
20140139529 | INFORMATION PROCESSING APPARATUS, CONTROL METHOD, AND RECORDING MEDIUM - An information processing apparatus selects a plurality of interval width sequences of internal knots of a nonuniform B-spline that approximates waveform data, based on a multivariate normal distribution, and then determines a knot vector based on each of the selected interval width sequences and an optimal control point sequence for each knot vector. Also, the apparatus repeats, for a nonuniform B-spline that is defined for each combination of a knot vector and an optimal control point sequence corresponding to the knot vector, the selection of interval width sequences, the determination of knot vectors and optimal control point sequences and the evaluation thereof, until an evaluation whose objective function is minimized is obtained. | 05-22-2014 |
20140160133 | TILE BASED RENDERING OF SMOOTH POINTS USING POLYGONS - An apparatus and method for rendering a smooth circular point using polygons on a computer graphics display. The circular point is approximated by a polygon and the selection of the polygon depends on the diameter of the point. The polygon is enclosed in a bounding area that is divided into a plurality of tiles. The tiles are classified into different sections depending on their location relative to the center of the point. The tiles in each section are processed according to an algorithm to generate a mask that is used to render the circular point. | 06-12-2014 |
20140176560 | SYSTEMS AND METHODS FOR PRESENTING A FREE-FORM DRAWING - Systems and method for presenting a free-form drawing are described. In some aspects, a first point, a second point, and a third point from an input curve in the free-form drawing are received. A first quadratic Bezier curve is determined, where a control point of the first quadratic Bezier curve includes the second point and endpoints of the first quadratic Bezier curve include the first point and the third point. A first portion of the first quadratic Bezier curve is provided for display, where endpoints of the first portion of the first quadratic Bezier curve include the first point and a second terminal point, and where the first portion of the first quadratic Bezier curve does not include the third point. | 06-26-2014 |
20140176561 | ULTRASOUND DATA PROCESSING DEVICE - A trace guide (TG) that has been set within a manual trace reference cross-section ( | 06-26-2014 |
20140192058 | IMAGE PROCESSING APPARATUS, IMAGE PROCESSING METHOD, AND RECORDING MEDIUM STORING AN IMAGE PROCESSING PROGRAM - An image processing apparatus measures duration of the drawing operation by using coordinate information that indicates coordinate instructed to draw and time information that indicates time when the coordinates are detected, determines predicted time in accordance with the duration of the drawing operation, and generates an drawn image by calculating the predicted coordinates after the predicted time passes. The image processing apparatus calculates a characteristic value of the drawing operation by using the coordinate information and the time information and measures the duration of the drawing operation in case the characteristic value of the drawing operation is less than predetermined threshold value. | 07-10-2014 |
20140240322 | Redrawing Recent Curve Sections For Real-Time Smoothing - A recently rendered section of a curve is redrawn to smooth the curve on-the-fly while a user moves a stylus or other input device. On receiving data points for the curve, an old rendered section for prior data points is deleted by curve redrawing code, and a new spline that's visually smooth through the new data points and at least one prior data point is added. “Visually smooth” is defined using tangents. The rendered spline is a cardinal or other cubic Hermite spline. The curve is redrawn for display by overwriting frame buffer data. A single instruction multiple data processing architecture simultaneously calculates multiple data points for the new section of the curve rendering. A digital ink rendering uses a pen-tip shape or an arc shape, based on data point locations. The pen-tip shape simulates a square-tip pen, highlighter, pencil, charcoal, paintbrush, or liquid ink pen. | 08-28-2014 |
20140285492 | AUTOMATIC CORNER GENERATION - A system is disclosed. The system includes a processor configured to: receive a path in an artwork, the path having at least one corner; receive a selection of a patterned tile to apply to the path; and automatically generate a patterned corner tile corresponding to the selected patterned tile at least in part by mapping a side patterned tile to a corner patterned tile; and a memory coupled to the processor and configured to provide the processor with instructions. | 09-25-2014 |
20140300608 | SYSTEM AND METHOD FOR GENERATING HIGH DYNAMIC RANGE IMAGES - A method for generating a high dynamic range (HDR) image from images of a scene obtained at one or more exposure values is disclosed. In this embodiment, one of the obtained images is selected as a reference image. Further, mapped images are obtained by mapping pixel intensity values to corresponding irradiance values in each image. Furthermore, a pixel intensity value dependent weighting factor is determined. Moreover, a set of images is identified from the mapped images for pixels in the reference image. Also, a set of corresponding mapped pixels is established for the mapped pixels in reference image in the set of images. Further, a similarity measure is computed for the mapped pixels of reference image and corresponding mapped pixels in the set of images. Furthermore, each mapped pixel of the reference image is combined with a subset of its established corresponding mapped pixels in the set of images. | 10-09-2014 |
20140362089 | Rendering Borders of Elements of a Graphical User Interface - Systems and methods are described to render borders of controls and indicators in a graphical user interface (GUI), such that the rendered borders have continuous curvatures. In one aspect, a method includes generating a border of a GUI element to be represented in a GUI. The border includes a first straight side, a second straight side, and a corner portion that joins together the first straight side and the second straight side, such that a portion of the border that includes the first straight side, the corner portion and the second straight side is continuous and has continuous curvature. Additionally, the method includes representing the GUI element in the GUI. | 12-11-2014 |
20140375655 | GRAVITY POINT DRAWING METHOD - A system and method of a gravity point drawing that simulate a physical model to draw or modify vector curves. A node is identified in a drawing of a graphical application. A size of a predefined space around the node and an intensity value associated with the node are determined. The intensity value affects the curvature of a vector curve in the predefined space. The vector curve is generated in the predefined space. The curvature of the vector curve is based on the size of the predefined space and the intensity value associated with the node in the drawing. | 12-25-2014 |
20150035837 | METHOD AND APPARATUS FOR INTERACTIVE CURVE GENERATION - A system of curve generation takes a sequence of control points and constraint codes for each control point, and outputs a curve in which each of the constraints is satisfied. The set of constraints is chosen from the tangent angle, curvature, first derivative of curvature, and second derivative of curvature. The interactive curve design uses as its primitive, a curve whose curvature is a polynomial function of arclength (whose intrinsic equation is a polynomial). At each control point, a choice of G2 curvature continuity (tangent angle and curvature) or G4 curvature continuity (tangent angle and curvature plus first and second derivatives of curvature are continuous) is input. The desired curve is expressed as the solution to the chosen set of constraints. | 02-05-2015 |
20150049090 | DISPLAY DEVICE AND METHOD FOR CONTROLLING THE SAME - A display device and a method for controlling the same are disclosed. Herein, the method for controlling a display device is designed to include the steps of outputting a first Graphical User Interface (GUI), receiving a curvature change signal of a display screen outputting the first GUI, changing a curvature of the display screen based upon the received signal, generating a second GUI based upon GUI change data corresponding to the changed curvature of the display screen, and outputting the generated second GUI on the display screen. | 02-19-2015 |
20150062129 | Fitting a Parametric Curve using Maximum Curvature - Parametric curve fitting using maximum curvature techniques are described. In one or more implementations, a parametric curve is fit to a segment of a plurality of data points that includes a first data point disposed between second and third data points by setting a point of maximum curvature for the segment of the curve at the first data point. A result of the fitting is output by the computing device. | 03-05-2015 |
20150077420 | EFFICIENT SETUP AND EVALUATION OF FILLED CUBIC BEZIER PATHS - A graphics processing system includes a central processing unit that processes a cubic Bezier curve corresponding to a filled cubic Bezier path. Additionally, the graphics processing system includes a cubic preprocessor coupled to the central processing unit that formats the cubic Bezier curve to provide a formatted cubic Bezier curve having quadrilateral control points corresponding to a mathematically simple cubic curve. The graphics processing system further includes a graphics processing unit coupled to the cubic preprocessor that employs the formatted cubic Bezier curve in rendering the filled cubic Bezier path. A rendering unit and a display cubic Bezier path filling method are also provided. | 03-19-2015 |
20150302618 | SYSTEM, METHOD, AND COMPUTER READABLE STORAGE MEDIUM STORING A PROGRAM FOR GENERATING GEOMETRIC PATTERNS - A method and apparatus which allow for the creation of patterns that simultaneously combine units based on any number of spaced points without the restriction of repetition, strict geometrical order, and regularity. Patterns can be created without repetition using dissimilar units over an underlying grid with any level of regularity or irregularity. The units are also not limited by strict geometric order and can encompass any level of regularity or irregularity. The method and system further allow for customization of the overall geometric pattern without being limited by the confinements exhibited by the traditional convention. Within regular shapes, the centers can also be shifted to create an infinite field of geometric patterns. | 10-22-2015 |
20150325016 | Blending Techniques for Curve Fitting - Blending techniques for curve fitting are described. In one or more implementations, an indication is received of three or more data points. A blending factor is computed based on a spatial relationship of the three or more data points to each other. A curve is fit to the three or more data points by blending a plurality or curve fitting techniques using the computed blending factor. | 11-12-2015 |
20150371417 | METHOD AND SYSTEM FOR INK DATA GENERATOR, INK DATA RENDERING, INK DATA MANIPULATION AND INK DATA COMMUNICATION - Methods and systems are provided for generating, rendering, manipulating (e.g., slicing), and communicating stroke objects that form ink data. In a method of generating a stroke object, pen event data indicative of pen down, pen movement, and pen up events are sequentially received to generate point objects that collectively form a stroke object. The point objects serve as control points for interpolating curve segments. Further, a start parameter indicative of a start point within a starting curve segment of the curve segments at which display of the stroke object starts, and an end parameter indicative of an end point within an ending curve segment of the curve segments at which display of the stroke object ends, are generated for the stroke object. When rendering the stroke object, a system limits display of the stroke object to a range bound by the start and end parameters, as opposed to displaying the entire stroke object. | 12-24-2015 |
20150378450 | METHOD AND SYSTEM FOR INK DATA GENERATION, INK DATA RENDERING, INK DATA MANIPULATION AND INK DATA COMMUNICATION - A method is provided for generating ink data including stroke objects. The method includes generally four steps. The first step receives device-dependent user-input data including either one of pen event data of Type 1, which includes indicator position data and indicator pressure data, or pen event data of Type 2, which includes indicator position data but does not include indicator pressure data. The second step determines whether the pen event data is Type 1 or Type 2. The third step derives one or both of radius data for defining a width of the stroke object and transparency data for defining a transparency of the stroke object, based on the pen event data of Type 1 or Type 2. The fourth step outputs the stroke object including said one or both of radius data and transparency data as device-independent common attribute value(s) of each of multiple points of the stroke object in a predetermined format. | 12-31-2015 |
20160012618 | LINE STYLIZATION THROUGH GRAPHICS PROCESSOR UNIT (GPU) TEXTURES | 01-14-2016 |
20160019703 | METHOD FOR PROCESSING INFORMATION AND ELECTRONIC DEVICE - A method for processing information and an electronic device are disclosed according to the disclosure, and a display unit of the electronic device is capable of being bended with certain curvature. The method includes: once notification signal for notifying the electronic device that a first plane image needs to be displayed is received, detecting and obtaining current bending state parameters for characterizing a current bending state of the display unit based on the notification signal; acquiring the first plane image from memory; performing image processing on the first plane image according to the current bending state parameters; and transmitting the second image to video memory of the display unit, to make a projected image of the second image on a preset plane is the same as the first plane image when the second image is displayed on the display unit of the curved shape. | 01-21-2016 |
20160042538 | POINT RELOCATION FOR DIGITAL INK CURVE MODERATION - With some splines, such as cardinal splines, irregularly spaced data points may cause undesired bumps. Bump moderation makes a spline curve more visually appealing by reducing bumps, and by doing so even if the curve happens to be already smooth in a mathematical sense. Data points P1, P2, and P3 are not suitably spaced an outlier is present in a set of linear distances between the points. The bump is moderated by moving a point of the spline along a pathway to a position for which the data points P1, P2, and P3 are suitably spaced. The pathway may be a Bezier segment or a line segment. A point is moved on the pathway to its midpoint, or to a particular portion of the pathway such as its central third or central fifth. | 02-11-2016 |
20160078649 | SMOOTHING AND GPU-ENABLED RENDERING OF DIGITAL INK - Systems, methods, and computer-readable storage media are provided for efficient real-time ink stroke smoothing, trajectory prediction, and GPU-leveraged rendering of ink stroke input. First and second ink points are received and an active Bézier approximation is computed based thereupon. Sequentially later in time that the first and second ink points, a third ink point is received. It is determined whether the third ink point adequately fits the active Bézier approximation. Where it is determined that the third ink point adequately fits, an updated active Bézier approximation is computed that includes the first, second and third ink points. Where it is determined that the third ink point fails to adequately fit, a different new Bézier approximation is computed that includes the third ink point but not the first and second ink points. Leveraging a GPU, a smoothed ink stroke based upon the Bézier approximation(s) is rendered. | 03-17-2016 |