Mar 2011 to 2000 Senior Product ConsultantDistrict of Columbia Public Schools Washington, DC Aug 2008 to Mar 2011 Master EducatorZaner-Bloser Educational Publishing Co. Columbus, OH Aug 2005 to Oct 2008 National Literacy ConsultantEdison Schools, Inc New York, NY Nov 2001 to Aug 2005 National Curriculum Coordinator-Secondary Reading and Language ArtsEdison Schools, Inc
Aug 2000 to Aug 2005 National and International Learning Environment Educator and TrainerFriendship-Edison Public Charter School Washington, DC Aug 1999 to Nov 2001 Lead Teacher and Reading/Language Arts Educator
Education:
Trinity University Washington, DC 1996 M.Ed. in Curriculum and InstructionUniversity of Virginia Charlottesville, VA 1994 B.A. in Government and Foreign Affairs
A computer graphics system efficiently implements a pixel zoom function. The graphics system includes a rasterizer designed to define a new zoomed (enlarged or reduced) raster image of a region in an original raster image having pixels defined in a coordinate system with orthogonal first and second axes (x,y), the region comprising a plurality of original pixels. The region to be zoomed can be modified differently along its x, y axes. In other words, the region may be enlarged (positive zoom) along one axis, while reduced (negative zoom) along the other axis, or either enlarged or reduced by different magnitudes (zoomX, zoomY) along the x, y axes. Furthermore, the zoom magnitudes may be integers (integer zoomX, integer zoomY) or floating point numbers (float zoomX, float zoomY). The rasterizer is designed to (1) determine a starting raster position for the zoomed raster image; (2) determine a first number of first pixels along the first axis for each row of the original pixels; and (3) determine, for each row of the original pixels, a second number of second pixels along the second axis for each column of the original pixels. A rendering mechanism associated with the pixel zoom system is designed to render the zoomed image based upon the starting raster position, the first numbers corresponding with the original pixel rows, the second numbers corresponding with the original pixel columns.
Pixel Zoom System And Method For A Computer Graphics System
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G09G 500
US Classification:
345660, 345667
Abstract:
A computer graphics system efficiently implements a pixel zoom function. The graphics system includes a rasterizer designed to define a new zoomed (enlarged or reduced) raster image of a region in an original raster image having pixels defined in a coordinate system with orthogonal first and second axes (x,y), the region comprising a plurality of original pixels. The region to be zoomed can be modified differently along its x, y axes. In other words, the region may be enlarged (positive zoom) along one axis, while reduced (negative zoom) along the other axis, or either enlarged or reduced by different magnitudes (zoomX, zoomY) along the x, y axes. Furthermore, the zoom magnitudes may be integers (integer zoomX, integer zoomY) or floating point numbers (float zoomX, float zoomY). The rasterizer is designed to (1) determine a starting raster position for the zoomed raster image; (2) determine a first number of first pixels along the first axis for each row of the original pixels; and (3) determine, for each row of the original pixels, a second number of second pixels along the second axis for each column of the original pixels. A rendering mechanism associated with the pixel zoom system is designed to render the zoomed image based upon the starting raster position, the first numbers corresponding with the original pixel rows, the second numbers corresponding with the original pixel columns.
Precise Gradient Calculation System And Method For A Texture Mapping System Of A Computer Graphics System
A gradient calculation system efficiently calculates precise gradients for planar surfaces of primitives in computer graphics systems using exact closed form solutions. The system is particularly suited for calculating gradients to enable selection of an appropriate texture map resolution in a texture mapping system. In architecture, the gradient calculation system can be implemented in software, hardware, or a combination thereof, and is more particularly implemented as follows. A texture mapping system is provided with a plurality of MIP maps with different texel resolutions. A gradient calculation system associated with the texture mapping system computes texel gradients relative to a pixel of a primitive using closed form equations that result in exact gradients. MIP map selection logic associated with the texture mapping system selects an appropriate MIP map for the pixel from the plurality of MIP maps based upon the calculated exact gradients. Optionally, the system may further include a performance optimization feature for assigning the appropriate MIP map to subsequent pixels of, preferably, the entire primitive, or secondarily, to subsequent pixels of a span of the primitive, when certain gradient criteria are met.
Methods For High Precision, Memory Efficient Surface Normal Compression And Expansion
Don W Dyer - Fort Collins CO Paul E Martz - Fort Collins CO Teresa M Morrison - Fort Collins CO
Assignee:
Hewlett-Packard Company - Palo Alto CA
International Classification:
G06F 1500
US Classification:
345429
Abstract:
A high precision, memory efficient method for the compression of surface normals into quantized normals and the inverse method for the expansion of those quantized surface normals back into surface normals. The surface of a three dimensional figure is conceptually divided into small areas, and the effective surface normal for each of these areas is related to the surface normal of a unit sphere tessellated into a similar number of small areas or tiles. A quantized normal is defined to be the tile number on the surface of the unit sphere. For a particular three dimensional figure, instead of storing surface unit normal values of {X,Y,Z} for each coordinate, the quantized surface normal value (i. e. , the tile number) is stored. Thus, for a surface normal expressed in Cartesian coordinates, a compression ratio of 6:1 is possible depending upon the memory required to store real and integer values and the desired accuracy.
Methods For High Precision, Memory Efficient Surface Normal Compression And Expansion
Don W Dyer - Fort Collins CO Paul E Martz - Fort Collins CO Teresa M Morrison - Fort Collins CO
Assignee:
Hewlett Packard Company - Palo Alto CA
International Classification:
G06F 1500
US Classification:
345420
Abstract:
A high precision, memory efficient method for the compression of surface normals into quantized normals and the inverse method for the expansion of those quantized surface normals back into surface normals. The surface of a three dimensional figure is conceptually divided into small areas, and the effective surface normal for each of these areas is related to the surface normal of a unit sphere tessellated into a similar number of small areas or tiles. A quantized normal is defined to be the tile number on the surface of the unit sphere. For a particular three dimensional figure, instead of storing surface unit normal values of {X,Y,Z} for each coordinate, the quantized surface normal value (i. e. , the tile number) is stored. Thus, for a surface normal expressed in Cartesian coordinates, a compression ratio of 6:1 is possible depending upon the memory required to store real and integer values and the desired accuracy.
- Santa Clara CA, US Teresa Morrison - Fort Collins CO, US
Assignee:
Intel Corporation - Santa Clara CA
International Classification:
G06F 9/50 G06F 9/38 G06F 15/80
Abstract:
A method and apparatus for providing a scalable compute fabric are provided herein. The method can include determining a workflow for processing by the scalable compute fabric, wherein the workflow is based on an instruction set. A pipeline can be configured dynamically for processing the workflow, and the workflow is executed using the pipeline. A computing device can include a first group of two or more processing cores, a second group of two or more processing cores, and a third group of two or more processing cores. One or more of the first group of two or more processing cores, the second group of two or more processing cores, and the third group of two or more processing cores can power down based on a type of task to be performed.
- Santa Clara CA, US Teresa Morrison - Fort Collins CO, US
Assignee:
Intel Corporation - Santa Clara CA
International Classification:
G06F 9/30 G06F 15/78
Abstract:
A method and apparatus for providing a scalable compute fabric are provided herein. The method includes determining a workflow for processing by the scalable compute fabric, wherein the workflow is based on an instruction set. A pipeline in configured dynamically for processing the workflow, and the workflow is executed using the pipeline.
Teresa Morrison - Fort Collins CO, US Scott A. Krig - Folsom CA, US
International Classification:
G06F 15/76
US Classification:
712 30
Abstract:
A apparatus and computing device for providing a configurable ring network are provided herein. The apparatus includes logic to configure a ring processor for each of a plurality of processing elements, and logic to network each ring processor, wherein each ring processor communicates with other ring processors using a set of commands.
Isbn (Books And Publications)
Dun & Bradstreet's Guide to Doing Business Around the World