Abstract: Embodiments of a system and method for loading and rendering curved features in a map are described. Embodiments may include a map tool of a mapping or navigation application configured to generate a display for a map that includes one or more curved features (e.g., curved roads or curved polygons). The map tool may be executed in a client/server environment in which a server portion receives digitized map data in the form of polylines, detects a curved feature in the map data by fitting it to a parametric curve, and transmits data representing the parametric curve to a client device for subsequent rendering. The client device may render the curved feature using the received parametric curve data or, dependent on characteristics of the client device, extract data corresponding to points on the parametric curve to generate a triangle mesh for rendering the curved feature at a suitable resolution.

Abstract: Embodiments of a system and method for loading and rendering curved features in a map are described. Embodiments may include a map tool of a mapping or navigation application configured to generate a display for a map that includes one or more curved features (e.g., curved roads or curved polygons). The map tool may be executed in a client/server environment in which a server portion receives digitized map data in the form of polylines, detects a curved feature in the map data by fitting it to a parametric curve, and transmits data representing the parametric curve to a client device for subsequent rendering. The client device may render the curved feature using the received parametric curve data or, dependent on characteristics of the client device, extract data corresponding to points on the parametric curve to generate a triangle mesh for rendering the curved feature at a suitable resolution.

Abstract: A system and method for executing fully strict thread-level parallel programs and performing load balancing between concurrently executing threads may allow threads to efficiently distribute work among themselves. A parent function of a thread may spawn children on one or more processors, pushing a stack frame onto a deque, then may sync by determining whether its children remain in the deque. If not, and/or if not all stolen children have returned, the thread may abandon its stack as an orphan, acquire an empty stack, and begin stealing work from other threads. Stealing work may include identifying an element in a deque of another thread, removing the element from the deque, and executing the associated child function. If this is the last child of a parent on the other thread's orphan stack, the thread may release its stack, adopt the orphan stack of the other thread, and continue its execution.

Abstract: A user identifies an area of a digital canvas. Color gradients are determined based on a corresponding area on a reference. Brush strokes are applied in the area of the digital canvas, the brush strokes having trajectories based on the color gradients.

Abstract: A technique for editing a drawing having an existing gap line is disclosed. The technique includes editing a path, marking the existing gap line as deleted, analyzing the drawing for gaps, detecting a detected gap, and generating a gap line that closes the detected gap.

Abstract: A technique for editing is disclosed. The technique includes generating a path definition for a path, generating a plurality of subpath definitions of subpaths of the path based on an intersection of the path, associating the subpath definitions with the path definition, modifying the intersection of the path using an editing tool, and generating a plurality of modified subpath definitions of subpaths of the path based on the modified intersection of the path.

Abstract: Techniques for assigning a subpath attribute to a subpath in a drawing are disclosed. One technique includes editing the drawing to define a current path having a current subpath, matching a previous vertex in a previous path with a current vertex in the current path, and assigning a current subpath attribute to the current subpath based on the vertex match. Another technique includes editing the drawing to define a current path having a current subpath, comparing the current subpath with a previous subpath having a previous subpath attribute, and assigning a previous subpath attribute to the current subpath based on the comparison.

Abstract: A technique for searching for a gap in a drawing is disclosed. The technique includes sweeping an evaluation line across at least a portion of the drawing, detecting on the evaluation line an endpoint of a first segment, determining a distance from the endpoint to a point on the second segment, comparing the distance to a maximum gap distance, and detecting a gap.

Abstract: Techniques for assigning a region attribute to a region in a drawing are disclosed. One technique includes editing the drawing to define a current region, associating the current region with a previous region having a previous region attribute, and assigning the previous region attribute to the current region. Another technique includes deriving a previous path attribute and a relation for a previous path, editing the drawing to define a current set of paths having current regions, and assigning the previous path attribute to at least one current region based on the relation of the previous path.

Abstract: Techniques for recovering reflectance and illumination from natural image sequences, which techniques can be implemented separately, or combined. The images in a sequence of images can be aligned. The images can also be transformed into the log opponent color domain to increase filter sparseness and reduce chrominance errors. Additionally, a collection of filters spanning frequency space can be employed that reduce low frequency artifacts.

Abstract: Techniques for assigning a subpath attribute to a subpath in a drawing are disclosed. One technique includes editing the drawing to define a current path having a current subpath, matching a previous vertex in a previous path with a current vertex in the current path, and assigning a current subpath attribute to the current subpath based on the vertex match. Another technique includes editing the drawing to define a current path having a current subpath, comparing the current subpath with a previous subpath having a previous subpath attribute, and assigning a previous subpath attribute to the current subpath based on the comparison.

Abstract: A user identifies an area of a digital canvas. Color gradients are determined based on a corresponding area on a reference. Brush strokes are applied in the area of the digital canvas, the brush strokes having trajectories based on the color gradients.

Abstract: An envelope enclosing brush instances corresponding to transformations of a brush at points along a trajectory is generated. Points on the brush instances that are furthest from the trajectory are identified, and the identified points are connected based on the trajectory and the relative orientations of the brush instances.

Abstract: A graphical pattern placement technique automatically performed by a computer whereby lying in a single plane a path on an electronic document is provided and a graphical pattern is selected. Then, the graphical pattern is automatically placed along the path by a programmed computer such that the graphical pattern follows the orientation and curvature of the path.

Abstract: The invention provides a method for selecting the intensity level of each of the primary colors for displaying or printing a predetermined, desired color to be composed of a specified percent of each of the primary colors. Each primary color has available a predetermined number of discrete intensity levels ranging from minimum to maximum and is to be displayed on a matrix having a predetermined number of cells. The first step in the method is to determine a desired intensity level for each primary color and to select the number of cells of the matrix which are to display that color at that intensity level. These cells of each primary color are then arranged in the matrix in a predetermined ordering to display the desired color. The sequence of the ordering is predetermined and the same for each primary color.