Abstract: 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.

Abstract: An exemplary method includes generating a graphic configured to represent a strength of communication between a user and another user and modifying the graphic based on at least one factor associated with one or more communications between the users. An exemplary system includes a storage facility configured to maintain data associated with a strength of communication between a user and another user and a strength of communication facility configured to generate a graphic configured to graphically represent the strength of communication in accordance with the data. The strength of communication facility is further configured to modify the graphic based on a change in at least one factor associated with one or more communications between the users.

Abstract: Processes, machines, and computer-readable media are provided for expanding and simplifying a polygon or reducing and simplifying a polygon. Polygon expanding or reducing logic receives information that represents a polygon having a set of vertices. The polygon expanding or reducing logic determines another polygon having another set of vertices, such that the other polygon encompasses or is encompassed by the polygon, by determining, for each vertex of the set of vertices, a new set of vertices that are derived from the vertex and are at least a particular distance outside or inside the polygon. The vertex reducing logic determines whether an intermediate vertex is within the particular distance of a proposed segment between two other vertices of the other set of vertices, even though the intermediate vertex is not on the proposed segment, and, if so, removing the intermediate vertex from the other set of vertices.

Abstract: An electrocardiogram (ECG) chart device and method capable of easily assisting with the diagnosis of heart disease. Hexagonal radar charts displayed on a screen act as indicators of feature values corresponding to data obtained from each of 12 electrode leads and correlated with the related portions of the heart. For example, a (V1, V2) lead is an indicator of a right ventricle. Each of the radar charts is schematically arranged to correspond with the related portion of the heart. Each vertex of the hexagonal radar charts acts as an indicator of the recognized value. More specifically, each vertex of the radar chart is based on a value obtained by extracting a waveform critical point, a waveform start point, a waveform end point, or the like, of constituent elements of the ECG waveform as the P wave, the Q wave, the R wave, the S wave, the ST segment, the T wave, or the like. Therefore, a user of the ECG radar chart device can intuitively and easily carry out interpretation of ECG data.

Abstract: Processes, machines, and computer-readable media are provided for expanding and simplifying a polygon or reducing and simplifying a polygon. Polygon expanding or reducing logic receives information that represents a polygon having a set of vertices. The polygon expanding or reducing logic determines another polygon having another set of vertices, such that the other polygon encompasses or is encompassed by the polygon, by determining, for each vertex of the set of vertices, a new set of vertices that are derived from the vertex and are at least a particular distance outside or inside the polygon. The vertex reducing logic determines whether an intermediate vertex is within the particular distance of a proposed segment between two other vertices of the other set of vertices, even though the intermediate vertex is not on the proposed segment, and, if so, removing the intermediate vertex from the other set of vertices.

Abstract: Profile data collected through sampling is transformed and visually and interactively manipulated and displayed. In one scenario, the profile data is collected through statistical profiling of a program for a video game. The game program profile data is visually and interactively manipulated and displayed to visually present a dynamic behavior of the video game that shows correlation of impacts that the functions of the program have on the video game's performance. This allows the developer to identify inefficient sections of the program for optimization.

Abstract: There is provided a technique for smoothly performing position (movement) adjustment of a waveform marker by making switching between rough adjustment and fine adjustment in a series of marker operations possible with a single means and continuously. A display control section displays a measured waveform on the two-dimensional coordinates, which have a first axis and a second axis perpendicular to the first axis, on the display section. A waveform marker is movable by a marker operation corresponding to a direction parallel to the first axis. The display control section has a detecting section, which detects the marker operation corresponding to a direction parallel to the second axis, and changes either setting of the waveform marker or the display range of the measured waveform according to the detection result of the detecting section.

Abstract: Methods, program products and systems for accepting user input selecting a parameter for a parametric curve, the parametric curve being displayed in a graph. A range of curves for the parametric curve is determined based on a range of values for the parameter. And the range of curves for the parameter is displayed in the graph of the curve.

Abstract: A CAD system, method, and computer readable medium. A method includes receiving a graphic model and a selection of a symmetric constraint. The method includes receiving a selection of first and second curves of the graphic model, the selections indicating respective points on the first and second curves. The method includes determining a user's intent and applying a symmetric constraint between the first and second curves according to the user's intent. The method includes storing and displaying graphic model.

Abstract: Graphics-rendering operation is performed by a procedure including: inputting a vector data group representing the shape of a graphic object to a vector data group management unit; inputting, to a rendering attribute data management unit, rendering attribute data representing information pertains to internal attributes of the graphic object; inputting resource information indicating a usage status into a resource information management unit; reading the managed vector data group from the vector data group management unit; computing a feature indicating the geometrical feature of the input graphic object by means of the feature computing unit; reading the computed graphic feature level and the resource information managed by the resource information management unit; effecting switching to generation of optimum rendering data; reading the vector data group managed by the vector data group management unit and the rendering attribute data managed by the rendering attribute data management unit; generating renderi

Abstract: A pair of main-view and sub-view video streams and a graphics stream are recorded on a BD-ROM disc. Metadata is provided in each GOP in the sub-view video stream. The metadata includes offset information. The offset information specifies offset control for a plurality of pictures constituting a GOP. Offset control is to provide a left offset and right offset for the horizontal coordinates in a graphics plane to generate a pair of graphics planes, and to combine them separately with main-view and sub-view video planes. The sub-view video stream is packetized and multiplexed in a transport stream. A header of each TS packet includes a TS priority flag. TS packets containing the metadata have a different value of TS priority flag from TS packets containing sub-view pictures.

Abstract: Provided are a method and apparatus for obtaining a minimum cost vector for making a skyline object in a multi-dimensional space. The method includes calculating respective vector values having a query point and respective moving points to which the query point is moved as both end points in a multi-dimensional space having a plurality of coordinate axes, and selecting a vector value whose moving point is included in a skyline and has the minimum distance value from the query point as the minimum vector value from among the vector values.

Abstract: An item editing device, and item editing method, and a program stored on a tangible media enable easily editing items whether the item is rectangle or an arch shape by unifying the item editing operation and reducing the number of steps.

Abstract: 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.

Abstract: A system for determining a location of stations in a cell of a job shop may include a computing device and a computer-readable storage medium in communication with the computing device. The computer-readable storage medium may include one or more programming instructions for receiving information corresponding to a workflow of a cell in a job shop. The information may include a plurality of print-related functions performable by the cell and an amount of work associated with one or more pairs of print-related functions. The computer-readable storage medium may include one or more programming instructions for identifying a plurality of stations in the cell, determining a target distance between one or more pairs of stations, generating a visual depiction of the identified stations, automatically applying the visual depiction to a floor plan, and displaying the visual depiction as applied to the floor plan to a user.

Abstract: A method of ordering visual objects presented on a display includes comparing visual objects to be placed in an overlapping condition and determining from the comparison the order in which the visual objects are to be placed. The visual objects are re-ordered and placed in the overlapping condition in accordance with the determination. Methods of creating connecting links joining source and destination visual objects as well as overlapping object and object-connecting tools are also provided.

Abstract: The invention is directed method of computer-aided design of edges connecting faces of a modeled object, the method comprising a step of:—determining (S100-S130) a structure of subsets of faces and edges of specified convex or concave type, by iteratively disconnecting (¦S120¦) faces connected by edges of one type from a parent subset, whereby said parent subset is decomposed into child subsets comprising either:—a non-connected face; or—faces connected by edges of the other type, in which case edges of said one type are maintained in said child subset, wherein said one type of edges is further alternated at each iteration of disconnecting; and the method further comprising a step of:—processing (S140) the structure from a given parent subset for rounding or filleting the one or more edges connecting child subsets thereof, according to the type of edge as specified in said given parent subset.

Abstract: Aspects of the present invention are related to systems and methods for rendering graphical objects in a printing system. According to one aspect of the present invention a graphic list may be partitioned, and the graphic-list partitions may be rendered “out-of-order” or concurrently.

Abstract: An information processing apparatus having a touch-sensitive panel and processing a gesture input performed via the touch-sensitive panel accepts an instruction from a user for transitioning from a first processing state to a second processing state; sets a number of gesture-input-based operations in accordance with the instruction accepted; and executes corresponding processing as a gesture input in the second processing state with regard to gesture inputs of the number of operations set. The information processing apparatus executes corresponding processing as a gesture input in the first processing state with regard to a gesture input after the gesture inputs of the number of operations have been performed.

Abstract: A system, method and computer program product for parameterizing a 3D surface of genus g and arbitrary topology to the 2D plane. The method includes receiving an input 3D mesh of genus g; computing n discrete harmonic one-forms on the surface of the mesh to obtain n numbers for every edge in the graph represented by an input mesh; selecting two compatible linearly independent discrete harmonic one-forms for parameterization; assigning an arbitrary vertex in the mesh as an origin, and then summing each of the two harmonic one-forms along the edges of the graph using a traversal strategy to form 2D coordinates for every other vertex of the mesh to form the 2D parameterization of the 3D surface; detecting all singularities in the 2D parameterization; and, removing faces connected to the singularity and parameterizing the vertices of the removed faces using a 2D parameterization method, and connecting these vertices using a 2D polygonalization algorithm.

Abstract: Rendering well log values. At least some of the illustrative embodiments are methods that involve: sending to a graphics processing unit (GPU) of a computer system vertices that define a panel, the sending by a main processor of the computer system, the main processor distinct from the GPU; sending a program to the GPU, the sending of the program by the main processor; sending a first set of well log values to the GPU, the sending of the first set of well log values by the main processor; executing the program by the GPU which program determines a first curve from the first set of well log values by the program executed by the GPU; and displaying on a display device of the computer system the first curve within the panel.

Abstract: A method and apparatus for generating and displaying an application flow diagram for an application. The application flow diagram includes: a set of business transaction display elements representing critical business transactions that sustain or provide revenue for an organization; a set of service display elements representing services required by the critical business transactions; a set of infrastructure display elements representing information technology (IT) infrastructure components utilized by the services; and formatted display elements (e.g., arrows) that map the business transaction display elements to the service display elements and the service display elements to the infrastructure display elements, thereby indicating an end-to-end flow of data between the critical business transactions and the IT infrastructure components.

Abstract: A system, method and computer program product for reconstructing B-Rep data for a graphic model. A method includes receiving B-Rep data of a graphic model, the B-Rep data including edges and coedges. The method includes constructing, from the B-Rep data, a vertex table having coordinates of a plurality of vertices of the graphic model and an edge table associating each edge of the graphic model with at least one of the plurality of vertices of the graphic model. The method includes storing the constructed edge table and vertex table associated with the B-Rep data.

Abstract: 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.

Abstract: A transformation region is displayed around a selection of knots defining one or more computer graphics variable curves. The transformation region includes transformation handles enabling the modification of the transformation region shape. The transformation region defines an envelope of the curves. Modifying the shape of the transformation region defines a new envelope of the curves. The input and/or output values of knots are scaled to match the modified envelope so that the computer graphics variable remains a function of its input variables. Associated tangent handles of the knots are scaled proportional to the knot value. The transformation region can include a retiming curve specifying a remapping of input variable values. Points on the retiming curve below this diagonal remap associated knots to lower input values. Point on the retiming curve above the diagonal remap associated knots to higher input values.

Abstract: A graphic module wherein, given a curve P(x,y)=P(x(t), y(t)) between two points P0(x,y)=P0(x(t0), y(t0)) and P1(x,y)=P1(x(t1), y(t1), in the screen coordinates, a calculating circuit computes a curve mid-point Phalf(x,y)=Phalf(x(thalf), y(thalf)), where thalf=(t0+t1)/2 on the curve, computes a segment mid-point PM(x,y)=(P0(x,y)+P1(x,y))/2 on segment P0P1, computes a distance function d between the curve mid-point and the segment mid-point, and, given two thresholds THR0 and THR1, with THR0<=THR1, if d<THR0, it generates line segment P0P1, and if THR0<=d<THR1, it generates two line segments P0Phalf and PhalfP1 if d>=THR1, it repeats the previous steps for the curve portions from P0 to Phalf and from Phalf to P1.

Abstract: When an interpolation point is interpolated using a curve/curved surface, represented by control points, such as a B-Spline curve/curved surface or a subdivision surface, interpolation processing is performed in such a way that a moving vector for moving each control point is calculated using position information on interpolation points constituting the point group, as well as vector information on the unit direction vector that is set for each interpolation point, and the control point is moved in the movement direction and for the movement amount of this moving vector. By, repeating the generation step of a curve/curved surface that interpolates the interpolation point and the movement step of the control point, the position of a new control point is found that fits the curve/curved surface to the positions and the unit direction vectors of the point group.

Abstract: 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.

Abstract: 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.

Abstract: A system intuitively displays medical data of a patient. The system includes a display and one or more processors. The processors are programmed to receive medical data for the patient. The medical data includes one or more medical values for one or more parameters affecting the health or wellbeing of the patient. The processors are further programmed to display a clock-like face on the display and display the medical values on the display overlaid on the clock-like face. Time for a medical value is represented as a position around a center of the clock-like face, and magnitude for a medical value is represented as deviation from the center of the clock-like face.

Abstract: 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.

Abstract: A machine motion control system includes a number of moving parts for securing test electronic devices, a machine and an axis control card mounted on the machine. The machine includes a number of servo modules and a number of sensing units. The servo modules drive and control the corresponding moving parts on the machine. Each sensing unit is electrically connected to a corresponding moving part; the sensing units are operable to sense and transmit location information of the moving parts and the machine. The axis control card is electrically connected to the moving parts, the machine, and the sensing units. The axis control card receives location information of each moving part and processes the location information to generate a corresponding command signal, and transmits the generated command signal to the servo modules to control and adjust the moving parts.

Abstract: A computer-implemented method of design of ruled surfaces may comprise the step of accessing data defining guiding curves P(u) and Q(v) and a cost function ƒ(t,w). Given P(u) and Q(v), the unknown coupling is a parameterized curve s(t(s),w(s)). The method further comprises defining an objective function of the type J=J(ƒ,t,w), involving both ƒ(t,w) and coordinates t, w of the coupling curve. Then, optimizing the objective function J makes it possible to obtain the target coupling curve. Finally, a ruled surface S(s,?)=?Q(w(s))+(1??)P(t(s))is provided, according to the guiding curves P(t(s)) and Q(w(s)), composed with the coordinates t,w of the coupling curve previously obtained. In addition, the objective function is further constrained at the optimization step such that arguments t,w of the cost function ƒ(t,w) are regulated by a regulation function ?.

Abstract: Waveform data of selected bits having jitter or noise is generated wherein the waveform date represents a serial digital signal. A signal generator displays a jitter/noise setting area and a bit selection area on a display device where jitter or noise is set and the jitter or noise settings are applied to only the bit selected with the bit selection area. The bit is selected through various ways. A user may directly input a bit pattern to be selected. Box objects corresponding to the respective bits in the digital signal may be displayed and one or more of the bits can be selected by selecting one of the box objects. Frequently used bit patterns may be stored and provided using a menu-driven interface for selecting a bit pattern. An arbitrary number of consecutive bits may be designated for receiving jitter or noise and displayed.

Abstract: 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.

Abstract: A method and apparatus for shaping a linear segment is disclosed. The method comprises the steps of selecting a dynamic bend point, determining a primary snap point based on the location of the dynamic bend point in one of four predetermined regions and snapping the dynamic bend point to the primary snap point. A secondary snap point is also determined and the dynamic bend point is snapped either to the primary snap point or to the secondary snap point, depending on the location of the dynamic bend point inside or outside a predetermined secondary snap region.

Abstract: 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.

Abstract: 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.

Abstract: The present disclosure includes, among other things, systems, methods and program products for application of bevel curves to splines.

Abstract: An image generating device comprises an acquisition unit which acquires an image drawing instruction for drawing an elliptical radial gradation from accepted target data, an extraction unit which extracts elliptical shape parameters and gradation pattern parameters from the acquired image drawing instruction, a transformation matrix generating unit which generates a transformation matrix for transforming an elliptical shape specified by the elliptical shape parameters into a perfect circular shape based on the elliptical shape parameters, an inverse matrix calculating unit which calculates an inverse matrix of the transformation matrix, a transformation unit which transforms the gradation pattern parameters using the transformation matrix, a drawing unit which draws a gradation for the perfect circular shape based on the transformed gradation pattern parameters, and a gradation generating unit which generates the elliptical radial gradation by inversely transforming the perfect circular shape (including the g

Abstract: A method of vectoring a curve having an endpoint and a tangent associated with the curve at the endpoint. The method determines a first point on the curve following the endpoint where a perpendicular distance between a first linear segment, joining the first point and the endpoint, and the curve, does not exceed a tolerance. A second point on the tangent is then determined for which a perpendicular distance from the first segment to the second point does not exceed the tolerance. The curve is then vectorized by a path formed of a plurality of linear segments, the plurality of linear segments comprising at least a second segment joining the endpoint and the second point, and a third segment joining the second point to the first point.

Abstract: A computer-implemented system and method for generating data graphical displays. The data is indicative of a plurality of variables. The system and method receive data that is to be displayed in a non-textual format. Graph style data items are retrieved that contain display characteristics for displaying the data in the non-textual format. The data is displayed in accordance with the graph style data items.

Abstract: A method for rendering graphical data is provided. In one embodiment, the method includes rendering an aliased version of one or more polygons and sampling one or more edges of the aliased polygons. The method also includes calculating a curve that approximates the edge portion and intersects a set of pixels, determining the proportional areas of the pixels located between the curve and the aliased edge portion, and rendering an anti-aliased version of the edge portion based on the proportional areas. Various devices, machine-readable media, and other methods for anti-aliasing of a graphical object are also provided.

Abstract: A system, method, and computer program for preserving design intent of a Non-Uniform Rational B-spline (NURBS) surface without representation of a parent surface, comprising representing an output surface having control points that is independent from a refinement of the surface; interpolating a base surface from the output surface; calculating a delta vector that is a difference between the output surface and the base surface; and transforming the delta vector based upon a local coordinate system of a normal vector and a tangent plane of the base surface and appropriate means and computer-readable instructions.

Abstract: A computer method and apparatus for selecting and manipulating curvilinear shapes entered by a user is shown. The curvilinear shapes are represented within the computer using parameterized equations. The representation is reduced to maximal elements. The maximal elements are extended. Registration points of the extended maximal elements are then identified. Once the registration points and maximal elements are known, curvilinear shapes can be matched using those maximal elements and registration points. Therefore a user can create a sketch that looks like part of a drawing and the computer can find the corresponding section for the user and transform it.

Abstract: A three-dimensional (3D) remeshing apparatus includes a curved surface geometry module for calculating one or more geometric elements, including a normal and a curvature, based on data of an input mesh, a vertex grouping module for grouping vertices of the mesh into a general group, an edge group, and an apex group using information of the curvature calculated by the curved surface geometry module, and a projection module for searching for one or more tangent planes corresponding to one or more of the vertices grouped by the vertex grouping module, projecting one or more corresponding vertices on each of the tangent planes, and restoring one or more edges of the input mesh.

Abstract: 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.

Abstract: A high-speed modeling system and a method of constructing a model are disclosed herein. In one embodiment, the system comprises first and second cameras, a control portion to synchronize the first and second cameras, and a projector of electromagnetic patterns. The first and second cameras are synchronized by the control portion to generate second frames a time interval after first frames are generated to thereby obtain a high frame-rate which is higher than the frame-rate of the first camera. Multiple imaging stations comprising first and second cameras may be directed to the path traveled by a mass at a high speed, in a prescribed arrangement, to model the mass with the high frame-rate system.

Abstract: A data visualisation system is disclosed that includes a data value memory, a display, and contour generator. The data value memory maintains a finite set of data values. The display is arranged to display a representation of each data value centered on respective data points. The contour generator is arranged to generate and display a representation having a cross-sectional shape of a bell-shaped curve in which each data point is displayed as an apex of the bell-shaped curve. Also disclosed is a method of data visualisation and a data visualisation computer program.

Abstract: 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.