Patrick J Cozzi

20070088923, Apr 19, 2007

Mar 8, 2004

10/795648

Lawrence Chiu - Cupertino CA, US
Patrick Cozzi - Drexel Hill PA, US
Patrick Eaton - Lafayette CA, US
Prasenjit Sarkar - San Jose CA, US
Krishnakumar Surugucchi - Fremont CA, US
Kaladhar Voruganti - San Jose CA, US

G06F 13/00

711159000

A system, program storage device, and method of optimizing data placement on a storage device, the method comprising establishing a specified time constraint for which the storage device is to delete data stored thereon; dividing a data object into a plurality of data bits; programming a block of data and the data bits with a logic operand if the storage device is incapable of deleting the data within the specified time constraint; creating an encoded block of data from the programmed block of data and the data bits; organizing the encoded block of data and the data bits in the storage device according to data deletion requirements; and removing the data bits from the storage device if the data bits are organized within a specified data deletion requirement, wherein the data bits are removed using a data shredding process, and wherein the logic operand comprises an exclusive-or (XOR) operator.

20130222370, Aug 29, 2013

Feb 28, 2013

13/779844

ANALYTICAL GRAPHICS INC. - , US
Patrick Cozzi - Drexel Hill PA, US
Francesco Linsalata - Berwyn PA, US
James Tucholski - Malvern PA, US

ANALYTICAL GRAPHICS INC. - Exton PA

G06T 15/00

345419

A device and method for displaying data simultaneously in two-dimensional and three-dimensional formats. A user selects data to be represented in multiple formats simultaneously. A data rendition server retrieves the data and determines the three-dimensional representations that are possible. The user then selects the three-dimensional representation desired, and the server renders the data to the user in both two-dimensional and three-dimensional formats. The data may be rendered together with static data such as digital terrain data and other static data types. Data representations may be rotated and morphed as desired by the user.

20200344172, Oct 29, 2020

Apr 17, 2020

16/851958

- Exton PA, US
Omar SHEHATA - Philadelphia PA, US
Sean LILLEY - Philadelphia PA, US
Daniel BAGNELL - Exton PA, US
Patrick COZZI - Drexel Hill PA, US

H04L 12/851
G06T 1/20

Systems, methods, devices, and non-transitory media of various embodiments enable prioritization of requests for hierarchical level of detail (HLOD) content over a communications network. Various embodiment methods may reduce load time of nodes in the HLOD data structure, such as nodes in the HLOD that may be deemed important, compared to the load time achieved in current methods. Various embodiments may provide methods for prioritizing requests for nodes.

20200344319, Oct 29, 2020

Apr 16, 2020

16/850266

- Exton PA, US
Omar SHEHATA - Philadelphia PA, US
Sean LILLEY - Philadelphia PA, US
Patrick COZZI - Drexel Hill PA, US

H04L 29/08
G06T 15/00
G06T 7/20
G06T 7/70

Systems, methods, devices, and non-transitory media of various embodiments enable culling requests for hierarchical level of detail (HLOD) content over a communications network. Various embodiment methods may reduce a number of requests associated with dynamic camera movement, compared to number of requests generated in current methods.

20190236403, Aug 1, 2019

Oct 22, 2018

16/167422

- Exton PA, US
Kangning Li - North Wales PA, US
Zakiuddin Mohammed - King of Prussia PA, US
Patrick Cozzi - Drexel Hill PA, US
Joshua Lawrence - Media PA, US

G06K 9/62
G06F 12/0846
G06F 17/30
G06F 17/18
G06F 9/28

Methods and systems for converting a point cloud dataset into a hierarchical data structure for a lossless representation of an input file are provided herein. In various embodiments the method comprises recursing subtrees using a preordered traversal for a plurality of nodes, the preordered traversal being checking a parent node and then checking children nodes and stopping the recursing of the subtrees using the preordered traversal of the plurality of nodes when a node of the plurality of nodes is a below threshold node. The below threshold node being less than a configuration specified maximum number of data points, the below threshold node being a leaf of a tileset. Further comprising, aggregating the leaf of the tileset into a lossless representation of the collection of input files.

20190172249, Jun 6, 2019

Dec 1, 2017

15/829786

- Exton PA, US
Patrick Cozzi - Drexel Hill PA, US
Sean Lilley - Exton PA, US

G06T 15/08
G06T 7/12
G06T 7/60
G06T 5/00
G06T 5/20

A system and method of real-time surface reconstruction upon unstructured point clouds via a series of screen space operations are provided herein. A point occlusion operator, performed in a deferred pass upon a simple point splat to determine point visibility and an ambient occlusion factor so as to estimate a solid angle of a visibility cone produced by each point in the splat by splitting the screen space local neighborhood of the point into sectors and accumulating the maximum viable sector angle. Points are valid or invalid. A density estimation pass is then used. Maps are used to determine the required number of region growing iterations to cover every invalid pixel. The density is then pruned by an edge creep reduction step in order minimize error around edges during the next step. A median filter is used to fill invalid pixels, while edge-preserving blur is applied to the valid pixels.

20150070353, Mar 12, 2015

Sep 3, 2014

14/475920

- Exton PA, US
Patrick John COZZI - Drexel Hill PA, US

G06T 17/10
G06T 15/06

345420

Methods, systems, and devices for the visualization of the region of a 3-dimensional space obstructed from a viewing location by an ellipsoid are disclosed. In an embodiment, the obstructed region may be defined from primitive elements which are combined using Boolean operations. The primitive elements chosen may be represented using both implicit functions and/or parametric surfaces. In an embodiment, the implicit function representation may be used to quickly determine points on candidate surfaces which may be obstructed from view. In an embodiment, the parametric representation may be used to provide ray-surface intersection solutions enabling visualization of the boundary surface of the obstruction region.