IP Library Patent Application 12865551
Patent Application
App. No. 12/865,551

REAL-TIME USER GUIDED OPTIMIZATION OF GENERAL 3D DATA

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
12/865,551
Abstract

The present invention relates to a method semi-automatic simplification of a computer graphics model, where the model is rendered on a display and user controllable pointers on display allows a user to define parts of displayed model interactively and either remove or add data to the computer model in real-time on the chosen areas using automatic simplification algorithms.

Claims (26)

1 . A method of optimizing a graphics model comprising data in three dimensions or more, comprising the steps of:

rendering at least a part of the model on a display;

receiving input from a user using a user controllable pointer delineating a subpart of the displayed model;

creating a new model by either adding data to or removing data from said chosen subpart of model; and

rendering the new model on the display.

2 . (canceled)

3 . (canceled)

4 . The method of claim 1 wherein the user controllable pointer is controllable by the user using a computer input device.

5 . The method of claim 1 , wherein the model is further defined as a mesh based model.

6 . The method of claim 5 , wherein the mesh base model includes a plurality of vertices defining edges between connected pairs of said vertices.

7 . The method of claim 1 , wherein said step of rendering at least a part of the model is further defined as transforming the graphics model to a two dimensional perspective view on the display, according to a number of camera parameters including camera position, camera orientation, and camera field of view.

8 . The method according to claim 7 further comprising the steps of:

calculating a ray vector in three dimensions or more originating from the camera position using coordinates of the pointer on the display, camera position, the camera orientation, and the camera field of view; and

determining at least one intersection data point from the graphics model that is intersected by the ray vector.

9 . The method according to claim 8 , further comprising the steps of determining at least one neighboring data point surrounding the at least one intersection data point.

10 . The method of claim 8 wherein said step of choosing a subpart of the displayed model comprises:

receiving input from a user corresponding to one or more faces of the displayed model; and

choosing subparts of the model based on a path that follows the surface of the model received by the user and originating by ray intersection.

11 . The method of claim 6 wherein adding data comprises replacing a vertex of said plurality of vertices with a pair of vertices defining a corresponding edge.

12 . The method of claim 1 and claim 6 wherein said removing data comprises removing an edge wherein the defined by a pair of vertices connected by said-the edge is replaced by and replacing the pair of vertices with a single vertex.

13 . The method of claim 12 further comprising the steps of:

creating a directed acyclic graph (DAG) having hierarchical dependencies for edge collapses from the mesh based model including the substeps of:

creating a graph root containing the mesh base wherein each vertex is represented by one node in the root, and all edges are defined as connections between root nodes, and

removing one edge from the root by moving one node from the root to become a child node belonging to the second replaced node of the removed edge.

14 . The method of claim 13 , further comprising the steps of choosing a subpart of the DAG and moving all last nodes in the chosen subpart upwards at least on step in the node hierarchy for removing data.

15 . The method of claim 13 , further comprising the steps of choosing a subpart of the DAG and moving all last nodes in the chosen subpart downwards at least on step in the node hierarchy for adding data.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 6, 2020
From: DONYA LABS AB
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 053420/0085 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 17, 2010
From: HAMEDI, KOSHJAR; JOHANSSON, GUSTAF
To: DONYA LABS AB
Reel/Frame 025380/0502 →