序号 专利名 申请号 申请日 公开(公告)号 公开(公告)日 发明人
161 A method for designing a three dimensional modeled object in a three dimensional scene by extruding a curve EP14305249.6 2014-02-24 EP2911119A1 2015-08-26 Hong, Jean; Köhler, Manfred; Peythieux, Laura; Boyer, Chistophe; Letzelter, Frédéric; Beraud, Robert; Gunther, Mathieu

According to the invention, there is provided a computer-implemented method for designing a three dimensional modeled object in a three dimensional scene, wherein the method comprises the steps of : providing (300) a first curve; duplicating (301) the first curve to obtain a second curve; determining (302) a set of at least one starting point belonging to the first curve; determining (303) a set of at least one target point belonging to the second curve, each target point being associated at least one starting point ; linking (304) the relevant points with their associated target points by using at least a connecting curve.

162 Method For Encrypting Or Decrypting A 3D Object EP14305177.9 2014-02-11 EP2905923A1 2015-08-12 Rondao Alface, Patrice

Embodiments relates to a method for encrypting a 3D object (O) defined at least by a set of first points (pi) and a set first of faces (F), contained in a bounding box (B), the method being executed by an encryption device and comprising:

- determining (S4) a set of second points (psi) by bijection of the set of first points (pi), and a second set of faces (Fs),

- determining (S5) an encrypted 3D object (0s) defined at least by the set of second points (psi) and the second set of faces (Fs),



wherein the first points (pi) are associated with respective first indexes (i), the second points (psi) are associated with respective second indexes (sj), and a face is specified by a list of indexes,

wherein the encrypted 3D object (0s) is contained in said bounding box (B),

the method further comprising:

- partitioning the bounding box (B) into a set of first sub-boxes (nj),

- determining a set of second sub-boxes (nsj) by bijection of the set of first sub-boxes (nj), in function of a secret key (k),



wherein the position of a second point (psi) is determined in function the position of the corresponding first point (pi), the position of the first sub-box (nj) containing the corresponding first point, and the position of the second sub-box (nsj) corresponding with said first sub-box (nj).

163 SYSTEMS AND METHODS FOR CREATING A THREE-DIMENSIONAL TEXTURE ATLAS EP12879664.6 2012-06-27 EP2826023A1 2015-01-21 XU, Zitao; VISWANATHAN, Venkatraman; SENFTEN, Scott; SEMBROSKI, Charles; SUN, Ya; COLE, Mary
Systems and methods for reducing the amount of texture cache memory needed to store a texture atlas by using uniquely grouped refined triangles to create each texture atlas.
164 DISPLAY DEVICE, DISPLAY METHOD, AND PROGRAM EP12862124.0 2012-10-18 EP2800089A1 2014-11-05 ATANI, Kenichi

The display device according to the present invention is provided with a plurality of display units, a mechanism that binds together at least one part of each of the plurality of display units, and a drawing control unit that, when drawing on a specific display unit from among the plurality of display units, prioritizes drawing on, from among the display regions of the specific display unit, a specific region other than regions that include the mechanism.

165 Hierarchical system and method for on-demand loading of data in a navigation system EP03026676.1 2003-11-20 EP1435507B1 2014-09-24 Schmidt, Hauke; Chen, Tuolin; Lee, Aaron
166 METHOD, APPARATUS AND SYSTEM FOR A GRAPHICAL USER INTERFACE EP11726736.9 2011-06-01 EP2577609A1 2013-04-10 TREADWAY, Oliver; KRUGER, Michael
A computer-implemented method of positioning a set of objects for display on a user interface, the user interface being generated on a surface of a three-dimensional structure, each member of the set of the objects having a size in at least two dimensions, at least some of which dimensions vary between the objects, is provided. The method includes assigning the set of objects to a two-dimensional portion having a predetermined size, for each as yet unpositioned object in the set of objects, performing a positioning process, the positioning process comprising identifying object occupancy in the portion and allocating the object to a position within the portion on the basis of a largest dimension of the object and unoccupied space in the portion, and mapping the allocated positions to a corresponding coordinate on the surface of the three-dimensional structure.
167 IMAGE PROCESSING TECHNIQUES EP09852680.9 2009-12-23 EP2517169A1 2012-10-31 AKENINE-MOLLER, Tomas; TOTH, Robert; HASSELGREN, Jon; MUNKBERG, Carol; CLARBERG, Franz
Techniques are described that can delay or even prevent use of memory to store triangles associated with tiles as well as processing resources associated with vertex shading and binning triangles. The techniques can also provide better load balancing among a set of cores, and hence provide better performance. A bounding volume is generated to represent a geometry group. Culling takes place to determine whether a geometry group is to have triangles rendered. Vertex shading and association of triangles with tiles can be performed across multiple cores in parallel. Processing resources are allocated for rasterizing tiles that have been vertex shaded and binned triangles over tiles that have yet to be vertex shaded and binned triangles. Rasterization of triangles of different tiles can be performed by multiple cores in parallel.
168 Fingerprint preview quality and segmentation EP10006755.2 2006-06-23 EP2230627A3 2012-03-28 Hills, Scott L.; Maurer, James M.

A ridge flow based fingerprint image quality determination can be achieved independent of image resolution, can be processed in real-time and includes segmentation, such as fingertip segmentation, therefore providing image quality assessment for individual fingertips within a four finger flat, dual thumb, or whole hand image. A fingerprint quality module receives from one or more scan devices ridge-flow--containing imagery which can then be assessed for one or more of quality, handedness, historical information analysis and the assignment of bounding boxes.

169 Fingerprint preview quality and segmentation EP10006755.2 2006-06-23 EP2230627A2 2010-09-22 Hills, Scott L.; Maurer, James M.

A ridge flow based fingerprint image quality determination can be achieved independent of image resolution, can be processed in real-time and includes segmentation, such as fingertip segmentation, therefore providing image quality assessment for individual fingertips within a four finger flat, dual thumb, or whole hand image. A fingerprint quality module receives from one or more scan devices ridge-flow--containing imagery which can then be assessed for one or more of quality, handedness, historical information analysis and the assignment of bounding boxes.

170 SYSTEM AND METHOD FOR RADIAL COMPONENT SCATTERING EP08742159.0 2008-03-20 EP2140428A1 2010-01-06 FRASER, Adrian; WILLIAMS, Philip, O.
A system, method, and computer program for radial component scattering, comprising calculating a bounding box for each of a plurality of parts; calculating a centroid corresponding to each of said bounding boxes; calculating a scatter circle for placement of said plurality of parts; calculating a number of locations to place said plurality of parts on said scatter circle; whereby said plurality of parts are added to an assembly view in a single operation such that a largest of said plurality of parts is at a start point, and appropriate means and computer-readable instructions.
171 USING SUPPLEMENTARY INFORMATION OF BOUNDING BOXES IN MULTI-LAYER VIDEO COMPOSITION EP07869390.0 2007-12-17 EP2100269A1 2009-09-16 JIANG, Hong
An apparatus for compositing graphical information with video may include a source of planes of video information and a renderer to provide a rendered graphical plane and bounding information specifying multiple disjoint areas that include non-transparent pixels within the rendered graphical plane. A controller may be connected to the renderer to control compositing of the rendered graphical plane based on the bounding information. A compositor may be connected to the source, the renderer, and the controller to composite the planes of video information and only the multiple disjoint areas within the rendered graphical plane based on control information from the controller.
172 Universal rasterization of graphic primitives EP08006536.0 2008-03-31 EP1988508A1 2008-11-05 Jiao, Guofang; Yu, Chun; Ruttenberg, Brian; Torzewski, William

A technique for universally rasterizing graphic primitives used in computer graphics is described. Configurations of the technique include determining three edges and a bounded region in a retrofitting bounding box. Each primitive has real and intrinsic edges. The process uses no more than three real edges of any one graphic primitive. In the case of a line, a third edge is set coincident with one of its two real edges. The area between the two real edges is enclosed by opposing perimeter edges of the bounding box. In the case of a rectangle, only three real edges are used. The fourth edge corresponds to a bounding edge provided by the retrofitting bounding box. In exemplary applications, the technique may be used in mobile video-enabled devices, such as cellular phones, video game consoles, PDAs, laptop computers, video-enabled MP3 players, and the like.

173 VISUAL AND SCENE GRAPH INTERFACES EP04779498.7 2004-07-28 EP1676187A2 2006-07-05 BEDA, Joseph, S.; SCHNEIDER, Gerhard, A.; GALLO, Kevin, T.; SMITH, Adam, M.; VANDENBERG, Eric, S.; CURTIS, Donald, B.
A method and system implemented in an application programming interface (API) and an object model allows program code developers to interface in a consistent manner with a scene graph data structure to output graphics. Via the interfaces, program code writes drawing primitives such as geometry data, image data, animation data and other data to visuals that represent a drawing surface, including validation visual objects, drawing visual objects and surface visual objects. The code can also specify transform, clipping and opacity properties on visuals, and add child visuals to other visuals to build up a hierarchical scene graph. A visual manager traverses the scene graph to provide rich graphics data to lower-level graphics components.
174 Hierarchical system and method for on-demand loading of data in a navigation system EP03026676.1 2003-11-20 EP1435507A2 2004-07-07 Schmidt, Hauke; Chen, Tuolin; Lee, Aaron

A system providing three-dimensional visual navigation for a mobile unit includes a location calculation unit for calculating an instantaneous position of the mobile unit, a viewpoint control unit for determining a viewing frustum from the instantaneous position, a scenegraph manager in communication with at least one geo-database to obtain geographic object data associated with the viewing frustum and generating a scenegraph organizing the geographic object data, and a scenegraph renderer which graphically renders the scenegraph in real time. To enhance depiction, a method for blending images of different resolutions in the scenegraph reduces abrupt changes as the mobile unit moves relative to the depicted geographic objects. Data structures for storage and run-time access of information regarding the geographic object data permit on-demand loading of the data based on the viewing frustum and allow the navigational system to dynamically load, on-demand, only those objects that are visible to the user.

175 A METHOD OF RENDERING A GRAPHICS IMAGE EP00990894.8 2000-12-22 EP1412922A1 2004-04-28 CHUA, Gim, Guan,Block 406; SERRA, Luis; NG, Hern
A method of rendering a graphics image in which rendering is only carried out in a region to be changed is disclosed. In a preferred form the image includes a plurality of objects and the method comprises the step of: determining if each object has changed so that the object is required to be displayed differently in a subsequent frame; determining a bounding region of each changed object in the subsequent frame; determining a bounding region of each changed object in a frame prior to the subsequent frame; and combining the bounding regions to form an aggregate region and rendering the image only within the aggregate region.
176 METHOD FOR CREATING SPATIALLY BALANCED BOUNDING VOLUME HIERARCHIES FOR USE IN A COMPUTER GENERATED DISPLAY OF A COMPLEX STRUCTURE EP95937033.0 1995-10-26 EP0789895A1 1997-08-20 BRECHNER, Eric, L.; BOURASSA, Virgil, E.
Disclosed is a method for processing an arbitrary collection of objects, forming a complex structure, into a hierarchy of bounding volumes, from a root volume bounding all objects, to sub-volumes bounding individual objects or assemblies thereof, for use as successive approximations to said objects in a computer generated display. The method includes the first step of creating a bounding volume for each of the objects. Selected bounding volumes are then processed through a combining algorithm determining whether or not, based upon a geometric relationship between the bounding volumes and the higher level, root volume, the selected bounding volumes can be combined. If it is determined that the bounding volumes can be combined, a new bounding volume is created with the combined volumes comprising sub-volumes thereof. This process systematically repeats and attempts to combine all sub-volumes. The combining algorithm preferably allows a combination if the volumes of the combination of the sub-volume is smaller than a fixed percentage of the parent volume. When a pair can combine, it is replaced by a box bounding volume that contains the pair as sub-volumes, and the process continues. In this way, a bounding volume hierarchy for all objects and assemblies within a complex structure is created.
177 SYSTEM AND METHOD OF THREE-DIMENSIONAL MODEL GENERATION PCT/US2015038243 2015-06-29 WO2016003863A3 2016-04-14 SARKIS MICHEL ADIB; SUNDARESAN SAIRAM; LIN KUEN-HAN
A method includes generating, at an electronic device, a three-dimensional model of an object based on a sequence of images captured by an image capture device associated with the electronic device. The method further includes displaying the three-dimensional model via a display device associated with the electronic device. The method also includes, based on detecting that the three-dimensional model includes an anomaly, presenting, via the display device, one or more selectable options to enable correction of the anomaly.
178 LANDMARK DETECTION WITH SPATIAL AND TEMPORAL CONSTRAINTS IN MEDICAL IMAGING PCT/US2015034618 2015-06-08 WO2015191414A3 2016-02-25 SCUTARU MIHAI; VOIGT INGMAR; MANSI TOMMASO; IONASEC RAZVAN; HOULE HELENE C; TATPATI ANAND VINOD; COMANICIU DORIN; GEORGESCU BOGDAN; EL-ZEHIRY NOHA YOUSSRY
Anatomy, such as papillary muscle, is automatically detected (34) and/or detected in real-time. For automatic detection (34) of small anatomy, machine-learnt classification with spatial (32) and temporal (e.g., Markov) (34) constraints is used. For real-time detection, sparse machine-learnt detection (34) interleaved with optical flow tracking (38) is used.
179 SINGLE-PASS BOUNDING BOX CALCULATION PCT/US2010020782 2010-01-12 WO2010088029A2 2010-08-05 TONG XIN; LI CHEN; LI JINYU
Embodiments for single-pass bounding box calculation are disclosed. In accordance with one embodiment, the single-pass bounding box calculation includes rendering a first target to a 2-dimensional screen space, whereby the first target includes at least six pixels. The calculation further includes producing transformed vertices in a set of geometry primitives based on an application-specified transformation. The calculation also includes generating six new points for each transformed vertex in the set of geometry primitives. The calculation additionally includes producing an initial third coordinate value for each pixel by rendering the at least six new points generate for each pixel to each corresponding pixel. The calculation further includes producing a post-rasterization value for each pixel by rasterizing the at least six new points rendered to each pixel with each corresponding pixel. Finally, the calculation includes computing bounding box information for the set of geometry primitives based on the produced third coordinate values.
180 METHOD AND DEVICE FOR CONTACT SIMULATION USING LAYERED DEPTH IMAGES PCT/FR2009050170 2009-02-04 WO2009101327A3 2009-10-15 FAURE FRANCOIS JEAN ROGER
The invention relates to a method for the interactive simulation of an intersection between at least two volumetric objects modelled using geometric primitives. The method first comprises applying a Layered Depth Image (LDI) algorithm along a first display axis in order to determine a set of contact pixels. According to the invention, the method comprises: - calculating an intersection volume (V) from the contact pixels; - at each summit of the geometric primitives, calculating a partial derivative of the size of the intersection volume (V) relative to the coordinate of the summit along the projection axis; repeating the preceding steps for the two other orthogonal display axes in order to determine a vector containing the partial derivatives of the size of the volume relative to the coordinates of each of the summits; and - at each summit, associating a force f calculated from said partial derivatives.
QQ群二维码
意见反馈