Pointillistic 3D rendering facilitation systems

Pointillistic primitive arrays streamline 3D rendering by reducing computational overhead and data requirements, addressing the challenges of high-quality graphics in mobile and real-time applications, enhancing performance and resource efficiency.

WO2025250548A1PCT designated stage Publication Date: 2025-12-04MORPHIC PIXEL INC
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
PCT/US2025/031054
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2024-05-28
Filing Date
2025-05-27
Publication Date
2025-12-04

AI Technical Summary

Technical Problem

Conventional 3D rendering techniques face challenges in maintaining high frame rates and visual fidelity, particularly in mobile and real-time applications, due to computational overhead and data requirements, which are exacerbated by intricate scenes and rapid object movements, leading to latency issues and resource constraints.

Method used

The use of pointillistic or multilateral primitive arrays to represent 3D objects, which are processed through streamlined rendering protocols that reduce computational burden and data requirements, enabling efficient and high-quality graphics rendering.

Benefits of technology

This approach allows for improved rendering performance and resource utilization, enabling more precise and faster animation rendering in mobile devices and bandwidth-limited scenarios, while maintaining visual quality.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure US2025031054_04122025_PF_FP_ABST
    Figure US2025031054_04122025_PF_FP_ABST
Patent Text Reader

Abstract

Systems, methods, and computer program products are disclosed in regard to virtual image data from a (raw Collada file or other) initial expression into a pointillistic or multilateral-prim array conversion that describes a first shape. The first shape is rendered in a first position, undergoes at least some rotation, and is rendered in a second position with N elements, where N > 200. The conversion allows the first shape's transition to be implemented with minimal trigonometric lookup operations notwithstanding the rotation.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] POINTILLISTIC 3D RENDERING FACILITATION SYSTEMS

[0002] RELATED APPLICATIONS

[0003] [Para 0001] The application claims priority to U.S. Prov. Pat. App. 63 / 652,569 ("POINTILLISTIC 3D RENDERING FACILITATION SYSTEMS”], incorporated herein by reference to the extent not inconsistent herewith.

[0004] FIELD OF INVENTION

[0005] [Para 0002] The present disclosure relates generally to computer graphics and animation systems. More specifically, the disclosure describes methods, systems, and computer program products for efficient rendering and animation of three-dimensional [3D] shapes in virtual environments using pointillistic or multilateral primitive arrays.

[0006] BACKGROUND

[0007] [Para 0003] Three-dimensional computer graphics and animation have become ubiquitous in various fields, including entertainment, gaming, scientific visualization, and virtual / augmented reality. Conventional 3D rendering techniques typically rely on polygon mesh representations of objects, which are then processed through complex 3D pipelines to generate realistic images. These pipelines often involve numerous computationally intensive operations, including vertex transformations, lighting calculations, and rasterization.

[0008] [Para 0004] As the demand for higher quality graphics and more complex virtual environments increases, so does the computational burden on rendering systems. This challenge is particularly acute in mobile and real-time applications, where processing power and energy efficiency are constrained. Traditional rendering pipelines may struggle to maintain high frame rates and visual fidelity, especially when dealing with intricate scenes or rapid object movements.

[0009] [Para 0005] Furthermore, the transmission and storage of high-resolution 3D models can be problematic in bandwidth-limited scenarios or on devices with limited storage capacity. Conventional representations of 3D objects may require significant data transfer, leading to latency issues in networked applications or excessive storage requirements for complex scenes.

[0010] [Para 0006] In response to these challenges, there is a growing need for alternative rendering techniques that can provide efficient, high-quality 3D graphics while reducing computational overhead and data requirements. Approaches that can streamline the rendering process, particularly for animated objects undergoing complex transformations, may offer significant advantages in terms of performance and resource utilization.

[0011] [Para 0007] Recent advancements in computer graphics have explored various optimization strategies, including level-of-detail techniques, procedural generation, and novel data structures for representing 3D geometry. However, many of these approaches still rely on traditional polygon-based representations at their core, which may limit their potential for radical improvements in rendering efficiency.

[0012] [Para 0008] The development of new paradigms for representing and rendering 3D objects that can overcome the limitations of conventional polygon mesh-based systems while maintaining or improving visual quality remains an active area of research and innovation in the field of computer graphics.

[0013] BRIEF DESCRIPTION OF THE DRAWINGS

[0014] [Para 0009] Referring now to Fig. 1, there is shown a system in which one or more technologies may be incorporated.

[0015] [Para 0010] Referring now to Fig. 2, there is shown a virtual environment in which one or more animation technologies described herein may be incorporated.

[0016] [Para 0011] Referring now to Fig. 3, there is shown a system in which one or more technologies may be incorporated, one that may implement the virtual environment of Fig. 2 or instantiate the system of Fig. l.\

[0017] [Para 0012] Referring now to Fig. 4, there is shown a system that allows one or more cloud services or other facilities based in London to interact with one or more peer- to-peer or other facilities in North America in which one or more technologies may be incorporated.

[0018] [Para 0013] Referring now to Fig. 5, there is shown a server in which one or more animations may be incorporated. [Para 0014] Referring now to Fig. 6, there is shown a client, mobile, or other personal computing device in which one or more technologies maybe incorporated.

[0019] [Para 0015] Referring now to Fig. 7, there are shown components of a file, conversion, or other such informational expression in which one or more technologies may be incorporated.

[0020] [Para 0016] Referring now to Fig. 8, there is shown a magnified digital expression of an animated honeybee’s torso in a fully or other virtual environment in which one or more technologies may be incorporated.

[0021] [Para 0017] Referring now to Fig. 9, there is shown hue and other visually significant components of a data expression in which one or more technologies may be incorporated.

[0022] [Para 0018] Referring now to Fig. 10, there is shown another depiction of a virtual environment that depicts "faces” of a prim and reference frame in which one or more technologies may be incorporated.

[0023] [Para 0019] Referring now to Fig. 11, there is shown a 32-bit word in which one or more technologies may be incorporated.

[0024] [Para 0020] Referring now to Fig. 12, there is shown an attribute array in which one or more technologies may be incorporated.

[0025] [Para 0021] Referring now to Fig. 13, there is shown a data expression indicating a virtual camera vantage usable with technologies described herein.

[0026] [Para 0022] Referring now to Fig. 14, there is shown a texture of a honeybee torso as a color-indicative hexadecimal expression usable with technologies described herein.

[0027] [Para 0023] Referring now to Fig. 15, there is shown a color-indicative layer usable in one or more conversions in which one or more technologies may be incorporated.

[0028] [Para 0024] Referring now to Fig. 16, there is shown a table of various frame rates, display sizes, and other animation operating parameters in which one or more technologies may be incorporated.

[0029] [Para 0025] Referring now to Fig. 17, there are shown corner points of a bounding-box-type reference frame in which one or more technologies may be incorporated. [Para 0026] Referring now to Fig. 18, there is shown a map of honeybee torso texture as it corresponds to camera -visible prims of an animation in which one or more technologies may be incorporated.

[0030] [Para 0027] Referring now to Fig. 19, there is shown are shown up-scaled and down-scaled honeybee torso textures and corresponding reference frames in which one or more technologies may be incorporated.

[0031] [Para 0028] Referring now to Fig. 20, there is shown several illumination parameters in which one or more technologies may be incorporated.

[0032] [Para 0029] Referring now to Fig. 21, there is shown a viewpoint, near clip plane, viewing frustum, and far clip plane of a virtual environment in which one or more technologies maybe incorporated.

[0033] [Para 0030] Referring now to Fig. 22, there is shown a position, direction, position, and movement of a virtual camera in which one or more technologies may be incorporated.

[0034] [Para 0031] Referring now to Fig. 23, there is shown a schematic diagram and calculation for associating one or more camera-visible prims with a corresponding display pixel in which one or more technologies may be incorporated.

[0035] DETAILED DESCRIPTION

[0036] [Para 0032] The detailed description that follows is represented largely in terms of processes and symbolic representations of operations by conventional computer components, including a processor, memory storage devices for the processor, connected display devices, and input devices. Furthermore, some of these processes and operations may utilize conventional computer components in a heterogeneous distributed computing environment, including remote file servers, computer servers, and memory storage devices.

[0037] [Para 0033] It is intended that the terminology used in the description presented below be interpreted in its broadest reasonable manner, even though it is being used in conjunction with a detailed description of certain example embodiments. Although certain terms may be emphasized below, any terminology intended to be interpreted in any restrictive manner will be overtly and specifically defined as such. [Para 0034] The phrases "in one embodiment,” "in various embodiments,” "in some embodiments,” and the like are used repeatedly. Such phrases do not necessarily refer to the same embodiment. The terms "comprising," "having," and "including” are synonymous, unless the context dictates otherwise.

[0038] [Para 0035] "Above,” "after,” "angular,” "animated,” "converted,” "coordinated,” "cubic,” "curved,” "directional,” "enhanced,” "extrapolated,” "facing,” "faster,” "functional,” "improved,” "indicative,” "instantiated,” "intermittent,” "interpolated,” “invoked,” "local,” "mostly,” "multiple," "near," "nonzero," "optimized," "partly,” "potentially,” "primitive,” "reference,” "sampled," "scaling,” "suitably,” "visible,” "wherein,” "without,” or other such descriptors herein are used in their normal yes-or-no sense, not merely as terms of degree, unless context dictates otherwise. In light of the present disclosure, those skilled in the art will understand from context what is meant by "remote” and by other such positional descriptors used herein. Likewise, they will understand what is meant by "partly based” or other such descriptions of dependent computational variables / signals. "Numerous” as used herein refers to more than two dozen. Circuitry is "invoked" as used herein if it is called on to undergo voltage state transitions so that digital signals are transmitted therefrom or therethrough unless context dictates otherwise. Software is "invoked” as used herein if it is executed / triggered unless context dictates otherwise. One number is "on the order" of another if they differ by less than an order of magnitude (i.e., by less than a factor of ten) unless context dictates otherwise. As used herein "causing" is not limited to a proximate cause but also enabling, conjoining, or other actual causes of an event or phenomenon. "Instances” of an item may or may not be identical or similar to each other, as used herein. As used herein a rendering or other reactive motion is in "real” time if a lag thereof is less than 200 milliseconds.

[0039] [Para 0036] Terms like "processor," "center,” "unit,” "computer,” or other such descriptors herein are used in their normal sense, in reference to an inanimate structure. Such terms do not include any people, irrespective of their location or employment or other association with the thing described, unless context dictates otherwise. "For” is not used to articulate a mere intended purpose in phrases like "circuitry for” or "instruction for,” moreover, but is used normally, in descriptively identifying special purpose software or structures. [Para 0037] Reference is now made in detail to the description of the embodiments as illustrated in the drawings. While embodiments are described in connection with the drawings and related descriptions, there is no intent to limit the scope to the embodiments disclosed herein. On the contrary, the intent is to cover all alternatives, modifications and equivalents. In alternate embodiments, additional devices, or combinations of illustrated devices, may be added to, or combined, without limiting the scope to the embodiments disclosed herein.

[0040] [Para 0038] Referring now to Fig. 1, there is shown a system 100 in which a mobile device 600A borne and viewed by a user 10A interacts with regard to an augmented reality, virtual reality, or other three-dimensional ("3D”) model 136 primarily using one or more locally-implemented protocols 145A-145L. See Fig. 6. This can occur, for example, in a context in which client device 600A interacts via a wireless linkage 187A with a network 150 that thereby has intermittently limited bandwidth (e.g. due to network congestion or otherwise compromised connectivity) that causes human-detectable manifestations of delay. In other contexts a "raw” version of a 3D model 136 of interest has adequate connectivity but with human-detectable suboptimal animations in comparison to, for example, that provided by special purpose rendering platforms that are not "mobile.”

[0041] [Para 0039] In many such instances such shortcomings are due to mobile processing resources being chronically outstripped by ever-increasing animation quality standards. As a result, phenomenal animation capabilities that become viable near their source are unlikely to be fully realized even to a potential of a small display screen because of animation processing bottlenecks. By streamlining more locally-implemented protocols it is expected that some or all of such expected animation processing bottlenecks in the coming years may be relieved even without quantum computing or other mitigation. As a result, more of the events 180 portrayed in animations comprising timestamps, addresses, updates 186, and other such parameters 158 are expected to be rendered and displayed with improved precision and speed.

[0042] [Para 0040] Various tools and protocols 115A-C, 145A-L are described that can facilitate such streamlining. These may include one or more instances of conversion protocols 115A, of remote parsing protocols 115B, or of response protocols 115C that distill or transfer data [or both) as described herein. These may likewise include one or more instances of invocation protocols 145A, of local parsing protocols 145B, of implementation protocols 145C, of interpolation protocols 145D, of assignment protocols 145E, of scaling protocols 145F, of transition protocols 145G, of update protocols 145H, of illumination protocols 145i, of arithmetic protocols 145J, of modeling protocols 145K, or of rasterization protocols 145L that likewise handle animation data. It will be understood that some of these protocols may be realized in a distributed fashion (e.g. as a cloud service) or otherwise in configurations other than those shown in these figures. For example a data flow may be acted upon, in some variants, by local and remote parsing protocols 115B, 145B both.

[0043] [Para 0041] Referring now to Fig. 2, there is shown an augmented reality, virtual reality, or other virtual environment 200 in which curved shapes to be animated are each manifested as arrays 267A-B of primitives 242 (“prims”). Although only a few dozen prims are shown in each of the arrays 267A-B for illustration it is contemplated that commercial animations of each array 267 using present technologies will each include very numerous (i.e. thousands or more) prims. In some contexts a reference frame 279A with dimensions 209A-C as shown will have an origin that is initially far from an array 267B to which it pertains. Pursuant to some protocols 175, as further described below, such a reference frame 279A will be exchanged for a much more suitable frame 279B having an origin that is less than half as far from (a nominal center of) the array 267B for which the more-suitable frame 279B will be used.

[0044] [Para 0042] Each such prim 242 as described herein may comprise one or more instances of opacities 212; of hues 213; of positions 214; of binary values 217 or other informational bits 218 in a concise sequence 216; of pointers or other forms of addresses 219; of orientations 263; or of other defined aspects 220. Illumination 254 upon such an array 267A may affect, in real time, an image 265 of the array 267A or of other lighting- related effects (e.g. a shadow cast by the array 267A upon another array 267B being animated simultaneously) seen from a particular vantage 251.

[0045] [Para 0043] One or more such prim arrays 267A may likewise undergo positional transitions 290A that include one or more components of translations 291, of rotations 292 about a moving or stationary axis 268, of scaling 293, of reshaping 294, of (visibility or other attributes of) points 295, of interactions 296 with other aspects 220 of the environment 200, or of combinations of such components. A virtual camera or otherwise- characterized vantage 251 may likewise undergo positional transitions 290B that include one or more components of translations, of rotations, of scaling, of deformations or the like, or of refractory or other visible aspects 220 of the environment 200, or of combinations of such components.

[0046] [Para 0044] Each camera vantage 251 can move in 3D space, smoothly changing its corresponding viewport or frustum 266 (e.g. to a first state 380A and thereafter via one or more transitions 290B through a second state 280B along its path 288 of travel). A corresponding run time engine (see Fig. 3) keeps track of every visually relevant environmental update 186. Each vantage 251 defines a frustum 266 and uses positional data for each object visible within each image 265 that it can observe. Perspective projection is calculated as an element of scale and becomes part of Camera Visible Prim (CVP) calculations for each moving object and frustum 266. One or more origin points of each (virtual camera) vantage 251 defined (e.g. in three dimensions 209A-C) in each environment 200 by a frame implementation protocol 145C. The frustum 266 manages the viewport and what objects are visible in 3D space for the camera view.

[0047] [Para 0045] Accordingly, environmental modification data that is used in a CVP update protocol 145H includes several operating or spatial parameters 158 (or both). Each light and camera have several variables, for example, that each affect an appearance of numerous prims 242. Each client device 10A-D that performs coordinated animation sends prim modifications pertaining to a shared environment 200 in real time so that all parent and child nodes that are visible in each view frustum 266 are suitably maintained.

[0048] [Para 0046] Referring now to Fig. 3, there is shown a system 300 in which one or more mobile devices 500A-D operated by respective user(s) 10A-D may interact with or via one or more networks 150, 350 via intermittent linkages 187A-D according to one or more technologies described herein. Each such device 600A-D may contain one or more instances of virtual objects 341, of Three-dimensional Logic Elements (TLE’s) 342, of motions 345, of coordinates 346 or other size / position descriptors, or of other such expressions 349 described herein.

[0049] [Para 0047] Each such device 600A-D may likewise contain one or more instances of resolutions 361; of dimensions 209, 362; of images 265, 365; of video or audio clips 367; or of other displays 370 described herein. Likewise each such device may contain one or more instances of on-board Graphics Processing Units (GPU’s), of 3D pipelines 383, or of run time engines 385 (or a combination of these).

[0050] [Para 0048] Referring now to Fig. 4, there is shown a system 400 that allows one or more servers 500 or other facilities 460A in London to interact with one or more client devices 600 or other apparatuses 460B in North America via one or more networks 150, 350, 450 therebetween. This can occur, for example, in a context in which one or more sequences 485 of animation events are centrally coordinated among multiple users 10A-D and in which a current state 480 of such events is characterized by one or more expressions 471 such as instance of files 472, of elements 473, or of (versions of deviceexecutable) code 475, as further described below.

[0051] [Para 0049] In the interest of concision and according to standard usage in information management technologies, the functional attributes of modules described herein are set forth in natural language expressions. It will be understood by those skilled in the art that such expressions (functions or acts recited in English, e.g.) adequately describe structures identified below so that no undue experimentation will be required for their implementation. For example, any records of events 180 or other informational data identified herein may be represented digitally as a voltage configuration on one or more electrical nodes (conductive pads of an integrated circuit, e.g.) of an event-sequencing structure without any undue experimentation. Each electrical node is highly conductive, having a corresponding nominal voltage level that is spatially uniform generally throughout the node (within a device or local system as described herein, e.g.) at relevant times (at clock transitions, e.g.). Such nodes (lines on an integrated circuit or circuit board, e.g.) may each comprise a forked or other signal path adjacent one or more transistors. Moreover, many Boolean values (yes-or-no decisions, e.g.) may each be manifested as either a "low” or "high” voltage, for example, according to a complementary metal-oxide- semiconductor (CMOS), emitter-coupled logic (ECL), or other common semiconductor configuration protocol. In some contexts, for example, one skilled in the art will recognize an "electrical node set” as used herein in reference to one or more electrically conductive nodes upon which a voltage configuration (of one voltage at each node, for example, with each voltage characterized as either high or low] manifests a yes / no decision or other digital data.

[0052] [Para 0050] Such circuitry 419 may comprise one or more integrated circuits (I Cs ), for example, optionally mounted on one or more circuit boards that implementing an event-sequencing structure as generally described in U.S. Pat. Pub. No. 2015 / 0094046 but configured as described herein. Transistor-based circuitry 419 may (optionally) include one or more instances of invocation modules 421 configured for cloud -based or other remote processing, for example, (each) including an electrical node set 431 upon which a positional transition 290A-B or other informational data is represented digitally as a corresponding voltage configuration 441. Transistor-based circuitry 419 may likewise include one or more instances of update modules 422 configured for cloud-based or other remote processing, for example, including an electrical node set 432 upon which a remote participant’s action upon a background array 267B in the virtual environment 200 or other informational data is represented digitally as a corresponding voltage configuration 442. Transistor-based circuitry 419 may likewise include one or more instances of analysis modules 423 configured for cloud-based or other remote processing, for example, including an electrical node set 433 upon which a new shape-descriptive expression or other informational data is represented digitally as a corresponding voltage configuration 443. Transistor-based circuitry 419 may (optionally) likewise include one or more instances of invocation modules 424 configured for triggering remote processing (using cloud-based instances of circuitry described herein, for example), including an electrical node set 434 upon which an invocable subroutine's address or other informational data is represented digitally as a corresponding voltage configuration 444. Transistor-based circuitry 419 may likewise include one or more instances of timing modules 425 configured for cloud-based or other remote processing, for example, including an electrical node set 435 upon which an event sequence or other informational data is represented digitally as a corresponding voltage configuration 445. Transistor-based circuitry 419 may likewise include one or more instances of conversion modules 426 configured for cloudbased or other remote processing, for example, including an electrical node set 436 upon which a conversion or other informational data is represented digitally as a corresponding voltage configuration 446. [Para 0051] Referring now to Fig. 5, there is shown a server 500 in which one or more technologies may be implemented. Server 500 may include one or more instances of processors 502, of memories 504, of user inputs 508, and of (display screens or other) presentation hardware 512 all interconnected along with the network interface 506 via a bus 516. One or more network interfaces 506 allow server 500 to connect via the Internet or other networks 150, 350). Memory 504 generally comprises a random access memory ("RAM”), a read only memory ("ROM”), and a permanent mass storage device, such as a disk or solid state drive.

[0053] [Para 0052] Memory 504 may contain one or more instances of websites 514, of aggregation modules 524, of operating systems 526, or of other informational data described herein. These and other software components may be loaded from a non- transitory computer readable storage medium 518 into memory 504 of the server 500 using a drive mechanism (not shown) associated with a non-transitoiy computer readable storage medium 518, such as a floppy disc, tape, DVD / CD-ROM drive, flash card, memory card, or the like. In some embodiments, software or other digital components may be loaded via the network interface 506, rather than via a computer readable storage medium 518. Special-purpose circuitry 519 may, in some variants, include some or all of the eventsequencing logic described herein. In some embodiments server 500 may include many more components than those shown in Fig. 5, but it is not necessary that all conventional components of a server be shown in order to disclose an illustrative embodiment.

[0054] [Para 0053] Referring now to Fig. 6, there is shown a client device 600 in which one or more technologies may be implemented. Client device 600 may include one or more instances of processors 602, of memories 604, user inputs 608, and of (speakers or other) presentation hardware 612 all interconnected along with the network interface 606 via a bus 616. One or more network interfaces 606 allow device 600 to connect via the Internet or other networks 150). Memory 604 generally comprises a random-access memory ("RAM”), a read only memory ("ROM"), and a permanent mass storage device, such as a disk drive.

[0055] [Para 0054] Memory 604 may contain one or more instances of web browsers 614, of other local apps 624, of operating systems 626, or of other modules that facilitate operations described herein. These and other digital components maybe loaded from a non-transitory computer readable storage medium 618 into memory 604 of the client device 600 using a drive mechanism (not shown) associated with a non-transitory computer readable storage medium 618, such as a floppy disc, tape, DVD / CD-ROM drive, flash card, memory card, or the like. In some embodiments, software or other digital components may be loaded via the network interface 606, rather than via a computer readable storage medium 618. Special-purpose circuitry 619 (implementing an encoding or other security feature 660, e.g.) may, in some variants, include some or all of the eventsequencing logic described herein. In some embodiments client device 600 may include many more components than those shown in Fig. 6, but it is not necessary that all conventional components of a mobile device be shown in order to disclose an illustrative embodiment.

[0056] [Para 0055] In some variants and with reference to features depicted in Figs. 1-6, a rendering facilitation method and system implemented on one or more event-sequencing processors 502, 602 or other special-purpose circuitry 419, 519, 619 is described. One such method includes establishing, by one or more processors 502, 602 or invocation modules 421 serving a target computing device 600D, a first conversion of a raw Collada file or other prior expression 471 of a first shape (e.g. a curved and moving virtual object portrayed as array 267A of Fig. 2). In such expressions 471 such animated shapes are conventionally represented by (a sequence 485 of states 480 of) numerous polygonal meshes each associated with a grid array of renderable color data. Before or after arriving to a target computing device 600D, such hue or other aspects 220 may be converted into (at least) a firstarray 267A of color-containing prims 242A-D that describe a position 214 and condition (e.g. illumination or transparency) of the first curved shape and that are each pointillistic or multilateral.

[0057] [Para 0056] The "establishing" may include downloading, authorizing, performing, aggregating, or otherwise obtaining the first conversion of (at least some data that describes) the first shape to be viewed from a vantage 251 of a particular user 10D. In some variants a sequence 485 of graphical expressions 471 or other components of states 480 may be compiled by a third party (e.g. by a cloud services provider) or otherwise converted, for example, and thereafter reside locally on the target computing device 600D as the first conversion. The first conversion thereby describes the first shape in a pointillistic form as described below, without the numerous polygonal meshes each associated with conventional UV-planar grid arrays and without a primary reliance on a local 3D pipeline 383. As used herein a shape-descriptive expression is "pointillistic” if it includes hundreds or more of noncontiguous elements that each associate color or shade (or both) with a dot or point so that they effectively blend together (e.g. when viewed from a distance or rasterized).

[0058] [Para 0057] The animated rendering method also comprises causing a rendering in a first 3D vantage 251, by the one or more processors 502, 602 or a first interface module 424, a first position 214 of the first shape on a first display screen of the target computing device 600D.

[0059] [Para 0058] The method also comprises responding to a first environment update (e.g. from a user action upon the target computing device 600D or from other devices 600A-C active in the same virtual environment 200) that includes a first angular 3D positional transition 290B, between the first position 214 of the first shape and a second position 214 of the (array representing the) first shape. This "responding” can be performed by the one or more processors 502, 602 or an update module 422 (or both).

[0060] [Para 0059] Such transitions 290 may be expressed with best fit polynomials, interpolations, weighted sums, extrapolations, or other arithmetic operations that do not require significant numbers of trigonometric look up operations. The numerous N > 200 post-transition prims 242A-D of the second position of the first shape may accordingly be obtained with less than N / 2 trigonometric lookup operations, for example, notwithstanding the rotation by applying the first arithmetic protocol 145J to pretransition prims 242A-D of the (first position 214 of the) first shape.

[0061] [Para 0060] In some variants the method also comprises causing a rendering in the first 3D vantage 251, by (at least) the one or more processors 502, 602 or a second (instance of an) interface module 424, many of the N post-transition prims 242A-D of the second position 214 of the first shape onto the first display screen as a component of animating the first shape. Alternatively or additionally, such transitions 290 may affect a post-transition rendering by virtue of the vantage 251 simultaneously undergoing a transition 290B.

[0062] [Para 0061] In many contexts one or more frame-animating run time engines 385 (RTE’s) track one or more numbers for light, color, intensity, and prim "side” placements for each reference frame 279. Each such frame can thus use a number signaling which prim components are in use and how much weight each has (e.g. as a percentage). In some variants a virtual camera will likewise use numbers that show which sides it is facing and how much it is exposed to each of these sides.

[0063] [Para 0062] During a post-transition rendering each display pixel is placed on a display screen from its origin point in modeling and rasterization protocols 145K-L from a viewport image 265 generated using camera-visible prims 242 and the Run Time Engine 385. RTE 385 may, for example, use prim-based file format as generally described herein with reference to Figs. 2 and 10-23. Each camera-visible prim is adjusted based on its exposure to illumination 254. Each such prim 242 with no occlusions will then be placed in a display pixel array that will thereafter travel to a video card memory’s back buffer. By an appropriate structure and process sequencing as described herein such arithmetic protocols 145J allow higher resolution or faster 3D graphics placement (or both) than could otherwise be achieved.

[0064] [Para 0063] Referring again to Figs. 1-6, methods and systems 100, 300, 400 are described herein for 3D shape rendering (e.g. in an augmented reality or other virtual environment 200). The method includes obtaining parameters for or otherwise establishing an arithmetic protocol 145J partly based on pre-transition reference points of a first position 214 of a first shape 136 and partly based on (at least) an angular component of a 3D positional transition 290A, 290B. This can occur in a context in which an invocation module 421 causes post-transition reference positions 214 to be determined using a (3D pipeline 383 or other) trigonometric-lookup-based implementation protocol 145C based on positional transitions 290 of a vantage 251 of the first shape 136 and in which an environmental update 186 includes the 3D positional transition 290A, 290B between the first position 214 and a second position 214 of the first shape 136. See Fig. 21.

[0065] [Para 0064] Such methods and systems 100, 300, 400 may further pertain (directly or otherwise) to determining post-transition primitives 242, 1042 of the second position 214 by applying the arithmetic protocol 145) to pre-transition primitives 242, 1042 of the first position 214 (e.g. an invocation module 421 triggering an analysis module 423 to compute and apply several matrix parameters to interpolate / extrapolate the post- transition primitives 242, 1042 based on how the transition affected the reference points) in response to the environmental update 186.

[0066] [Para 0065] Such methods and systems 100, 300, 400 may likewise pertain to rendering the second position 214 of the first shape 136 on a first display screen 370 based on the post- transition primitives 242, 1042 (e.g. an invocation or interface module 421, 424 causing the one or more processors 602 aboard mobile device(s) 800 to display the shape 136 according to its "later” position, after transition 290A) in response to the environmental update 186.

[0067] [Para 0066] Referring now to Fig. 7, there is shown digital expression 700 describing layers or components of a virtual environment. For example one or more (Wavefront, Collada, or other) resource files 472, 772 or conversions 773 thereof may define some or all 3D content that can affect a rendering. Such content may include one or more instances of vectors 761, of vector norms 762, of (UV vector data or other) textures 763, efface indexes 764, of Portable Network Graphics (PNG) file references 765, of Physically Based Rendering (PBR) data 766, positions, lightings, or of otherwise expressed (animated characters, background features, virtual lenses, filters, or other) visually manifestable things 767.

[0068] [Para 0067] Referring now to Fig. 8, there is shown a magnified digital expression 749 in a fully or other virtual environment 800 with (instances of vectors 761 that define) a polygon (e.g. triangle) using XYZ dimensions 809A-C. For each planar polygonal surface this can also comprise "UV" coordinates (i.e. in a plane of polygon 860 and with in-plane dimensions U and V) that also come from a (particular instance of a Collada or other) resource file 772 used to create an image / texture overlay among the highlighted vertices of the polygon 860 (depicting part of a surface of a bee or other visually manifestable things 767).

[0069] [Para 0068] In some variants every object and character in an at least partially virtual environment 200, 800 is associated with a "bounding box” or other suitable reference frame 279 that is generated during one or more 3D parsing protocols 105B, 145B. A suitable number of reference frames, frame sizes, and other operating parameters 158 may be generated for each (character or other) thing 767 being animated. See Figs. 8- 10. [Para 0069] Referring now to Fig. 9, there is shown (another view of] a digital expression 949 that may include one or more instances of PNG files, of 32 / 64 / 128 bit static arrays, of visible aspects 920, or of components thereof. Such aspects 920 may include one or more instance of (scalar or other) opacities 912, of refractions, of hues 913, of positions 914, of sequences 916 or scalar values 917 expressed as bits 918, of tabular pointers or other types of memory addresses 919, or of combinations of these.

[0070] [Para 0070] Referring now to Fig. 10, there is shown a (depiction of a) virtual environment 1000 in which a reference frame 1079 may be treated as "containing” or otherwise addressing a corresponding (animated thing 767 or other) virtual element array 1067 made up of prims 1042. As shown prim 242C of Fig. 2 may be instantiated as a cubic prim 1042 having (as seen in the magnified view) six faces 1A-F that each directly parallel a corresponding one of the faces 1001A-F of its likewise-aligned reference frame 1079. If all the prims 1042 of a given array 1067 are likewise modeled as cubes with this alignment and a defined (zero or other) infinitesimal size, linear transition protocols 145G may be performed upon some or all of them with exceptional speed.

[0071] [Para 0071] In some variants each prim of a thing 767 may be translated, rotated, scaled, or otherwise transitioned merely by applying a transition protocol 145G to a reference frame 279, 1079 pertaining to the thing 767. In some variants dimensional axes or reference points 1078 within or suitably near the thing 767 may undergo an assignment protocol 145E so as to become an origin 1077 of the reference frame 279, 1079 and thereby enhance realistic precision of each rendering of the thing 767. In some contexts an origin 1077 can be adjusted for such proximity based on a movement or other development of the animated thing 767, for example, interacting with other animated arrays 267.

[0072] [Para 0072] Referring now to Fig. 11, there is shown a 32-bit static word 1100 configured to hold one or more object-descriptive expressions 749 primarily describing colorimetric and directional aspects 220 pertaining to a particular (camera visible or other maintained) prim 242 in an array as described herein. The static word can be 32 / 64 / 128 bit to improve resolution. Such expressions 749 may signal an orientation 263 of the prim, for example, relative to a particular vantage 251 or reference fame 1000 described herein. In this way one or more (Collada or other) resource files can be processed through an analysis module 423 to become vector information imprinted directly into numerous such static arrays. As shown the first 8 / 12 / 16 bits of the 32 / 64 / 128-bit static word 1100 designate an address or other identifier of a PNG lookup table (LUT). The 32 / 64 / 128-bit static array includes (a visual representation of) a LUT that shows all the defined colors in a simple texture map that overlays onto a vertex mesh. For example the LUT may reside at a location 0x05 where a yellow tile in a bottom left corner of a selected polygon 860 is mapped. That number may be stored in memory at a different location and instantiate a listed RGBA value.

[0073] [Para 0073] Referring now to Figs. 2, 10, and 11 in conjunction, the first bit being a "1” after the LUT in the static word 1100 of Fig. 11 signifies at least one vantage 251 facing face 1A and not face ID. The next 7 bits quantify an exposure of 32 / 127 (as a "face value” that functions as a weighting directional coefficient) associated with the PNG color of the selected face 1A. The next bit being a "0” selects a vantage 251 facing face IE and not face IB. The next 7 bits quantify an exposure of 33 / 127 to the PNG color of the selected face IE. The next bit being a "1” signals a vantage 251 facing face 1C and not face IF. The next 7 bits quantify an exposure of 63 / 127 to the PNG color of the selected face 1C. In this way a color mix update protocol 145H associates an updated weighted directional sum of three selected colors to each active prim in a given array 267, allowing each vector to be tile- imprinted so that each vantage-visible prim can be posted in just a few clock cycles.

[0074] [Para 0074] Referring now to Figs. 11 and 12 in conjunction, the first 8 bits of the 32-bit static word 1100 of Fig. 11 points to a PNG look up table (LUT) that uses an attribute array 1200 of Fig. 12. Attribute array 1200 implements a PNG file that holds the texture or color (or both) of each face value for each prim 1042. The first 8-bit section of word 1100 as shown comprises an address pointer to (an attribute in) attribute array 1200. The digital expression of each prim 1042 has an addressable location. For example the "0x05” in the PNG LUT of word 1100 is an address location for its color in a format exemplified in Fig. 12.

[0075] [Para 0075] From any directvantage 251 in a given virtual environment 200, 1000 a cubic prim 1042 like that of Fig. 10 shows at most 3 faces 1A-F. Each such face has a hue 913 that may be encoded, for example, in a 32 / 64 / 128-bit array 1200 like that of Fig. 12. Moreover the hue 913 of each camera-visible prim face will be adjusted in an illumination protocol 145i by an amount of illumination 254 or lack thereof that affects the prim. The prim is facing a specific direction inside a selected array 267, 1067 of prims (as in Figs. 2 and 10] is illuminated and is also facing a specific direction on the outside. This allows a rapid determination how much illumination 254 or shade should apply to the prim. This technology allows for better light and shading gradient values than conventional illumination and rendering protocols provide. The light position data structure is applied by an RTE 385 configured to manage (at least] all camera-visible prims of a given array 267 , 1067. Such information may thereafter be sent to a Video Array back buffer and onward to a front buffer of a corresponding display 370.

[0076] [Para 0076] Referring now to Fig. 13, there is shown a 24-bit expression 1300 pertaining to a camera vantage 251 usable with technologies described herein. Such light position data structures may be applied by one or more RTE's 385 that manage camera- visible prim data before the information goes to the Video Array Back Buffer and then to the front buffer to get displayed. A virtual camera position (e.g. vantage 251] can be used to generate a list of Camera Visible Prims (CVPs] of a thing 767 to be animated. The CVPs and their attributes will thereby establish successive virtual states 280, 480 by which the thing 767 can be animated (e.g. by display pixel frames arriving successively at a video buffer].

[0077] [Para 0077] Loading objects may advantageously use prim-based file formats as described herein for loading a virtual world or environment 200, 1000 thereof with each animated object and its attributes. Such raw files 472 are each parsed and loaded into video memory indexed by a conversion module 426 residing with one or more resource files 772 or in circuitry 419 (e.g. comprising network-resident cloud servers 500] that is remote from an animation-displaying device 600. An origin 1077 of each object gets placed in the 3D world based on a simulation’s instructions. Rotation, translation, and scale are used to position each thing 767 in its environment 200, 1000. A server-resident or other file conversion protocol 115A takes (Collada, Wavefront, or other] resource files 772 and converts them to a prim-based format as described herein.

[0078] [Para 0078] Loading each object is controlled (at least in part] by one or more RTE’s 385 or conversion protocols 115A (or both]. The commands are loaded into each RTE 385 for protocols that would otherwise require a conventional 3D pipeline 383. Each parent node or thing 767 to be animated may (optionally] have one or more "child nodes’’ (e.g. a torso] as exemplified in Fig. 7, 8, or 14. The RTE 385 will load (at least] an array of two pointers per child node. Each child node has two arrays. In some variants the TLE information is built into each prim’s LUT. These protocols use the LUT and pointer to show the first location of the array of shared values of the different prims. The EOL surrounds the entire image in the array. See Fig. 14.

[0079] An Image of 1000 by 750 Display Pixels

[0080] [Para 0079] The RTE 385 creates (each instance of) image 265 prim by prim using a prim-based file format so that the one or more arrays 267, 1067 thereof are loaded. The last prim affecting an image 265 is going to establish an End of Line (EOL) as exemplified in Fig. 14. Each Main node has child nodes. If a parent node in this case depicts a honeybee then an example of a child node would depict a texture of a torso like that of Fig. 14. This helps to distinguish among memory arrays being loaded by RTE 385. RTE 385 uses a dynamic array to keep loading parent and child nodes and keeps track of each memory location as each objects appear in each virtual environment.

[0081] [Para 0080] Managing and tracking the objects to be animated include indexing and assigning child nodes to each corresponding parent node. RTE 385 manages and tracks all animated things 767 for each camera’s frustum 266 such as hue 213, direction of illumination 254, intensity, type, occlusions, anti-aliasing, shadow maps, collision detection, secondary light sources, and other virtual attributes. These objects need to have refreshed data (at least partly) based on object movement speed and frame rate.

[0082] [Para 0081] Every second the frame rate on a 4k screen may need to update 1.2 billion prims, for example, at a frame rate of 144 frames per second (fps). Transition protocols 145G can handle real time updates at these prim values by minimizing access to a local 3D pipeline 383 or bypassing it altogether. Instead, an RTE 385 may keep track of each virtual camera’s vantage 251 based on the object movement speed and frame rate. Such protocols herein use global variables that trickle down and affect each parent and child node for real-time environment synthesis such as PBR updates 186. As used herein an update or other response is "in real time” if it occurs within less than 0.4 seconds of a prior update or cause.

[0083] [Para 0082] Up-scaling or down-scaling may be done using a scaling protocol 145F to recalculate the TLE 342 (e.g. by running through a bicubic interpolation protocol 145D). Each prim 242, 1042 is thereby given a weight for its visibility as it curves around a surface and then that indicates how much to blend into its neighboring prim. See Fig. 19.

[0084] [Para 0083] An RTE 385 tracks the light source by using the faces of RTE to represent light presence by percentage on each face 1A- F. At any given time at most 3 faces are visible to each light source. Each prim’s illumination, from lowest ambient light value to brightest specular lighting, is calculated. The light has a face value on each prim array’s reference frame 279, 1079. An RTE 385 repeatedly sends values that update any objects that have moved relative to a current vantage 251. These values include an XYZ location and other relevant aspects 220 for each illumination 254.

[0085] [Para 0084] A virtual camera having a dynamic vantage 251 can move in 3D space (e.g. along path 288), directly affecting a frustum 266 thereof through which objects are viewed. The RTE 385 keeps track of every face trigger. Each of the visible faces can move at any point in terms of the visibility. Each viewport has a frustum 266 that will establish positional data for each object. Perspective projection is calculated as part of a scaling protocol 145F for each camera-visible array 267, 1067.

[0086] [Para 0085] To allow resource-file-resident objects to undergo conversion to a prim-based file format the objects undergo a parsing protocol 145B and then are loaded into a system memory before being processed by one or more conversion protocols 115A and loaded into video memory indexed by an RTE 385 pursuant to one or more format conversion protocols 115A. An origin point of each object gets defined in a virtual environment 200, 800, 1000 based on environmental synthesis rules. For example rotation, translation, and scaling may be used to position each prim.

[0087] [Para 0086] In some variants conventionally implemented object rotation is mostly or entirely replaced with a streamlined version. An RTE 385 is configured to transition each animated thing 767 in XYZ directions of each reference frame 279, 1079 using an axis 268 of rotation or other reference points 295 thereof. This minimizes burdens of traditional rotation matrix math performed, for example, in a conventional 3D pipeline 383. The rotation is streamlined insofar that a peer user’s action or other outside influence in the environment during simulation causes a reference frame 279, 1079 to be processed using one or more physics rules implementation protocols 145C of the simulation. This also controls each angular transition’s direction and speed. A transition protocol 145G facilitating the transition can rapidly show which prims 242, 1042 are visible (or becoming visible) to a virtual camera’s vantage 251. The camera-visible prims can thereafter undergo complex movements including such rotation using one or more transition protocols 145G without always needing to go through the intense rotation matrix math calculations of a 3D pipeline 383.

[0088] [Para 0087] In some variants a (component of) translation 291 is managed much the same way using speed and direction. An RTE 385 can translate or otherwise move each object in 3D space and manage its movements across a terrain or other backdrop in a more natural fashion than was previously possible. A visible avatar being animated, for example, using one or more prim arrays 267, 1067 can be running toward, away from, or in an oblique fashion relative to a camera’s vantage 251. One or more modeling protocols 145K implemented by an RTE 385 or onboard processors 602 (or both) are configured to place the prims 242, 1042 in 3D space. This can show up in movement and animation.

[0089] [Para 0088] Illumination 254 is managed by each RTE 385, which tracks each light source using one or more faces 1A-F, 1001A-F associated with each prim array 267, 1067 to represent fractional illumination 254 on each lit (camera visible) prim face 1A-F. At any given time at most 3 faces are visible to each light source. Each source of illumination 254 has a face value on each illuminated face 1A-F, 1001A-F. RTE 385 sends values that update any objects that have moved or are affected by a camera / viewport transition 290B (or both). Such lighting information includes an XYZ location for each illumination 254 and its attributes (e.g. spectrum, intensity, and direction). See Figs. 20 and 23.

[0090] [Para 0089] Each camera vantage 251 can move in 3D space, changing its corresponding viewport or frustum 266. A corresponding RTE 385 keeps track of every changing aspect 220 of every CVR The RTE 385 uses a current frustum 266 and will have positional data for each object visible therein being animated. Perspective projection is calculated as part of a modeling protocol 145K and accordingly becomes part of the CVP calculation for each object and frustum 266. In each frame 279, 1079 the origin point of each (virtual camera) vantage 251 is established by a frame implementation protocol 145C. The frustum 266 will manage its viewport and what objects are visible in 3D space for the vantage 251. See Fig. 21.

[0091] [Para 0090] Accordingly, environmental modification data that is used in a CVP update protocol 145H includes several operating or spatial parameters 158 (or both). Each light and camera have several variables, for example, that each adjust corresponding prims 242, 1042. RTE’s 385 of client devices 10A-D each manage related CVP's so that all parent and child nodes that are visible in each view frustum 266 of the same device 10A-D are managed in real time. In terms of the animated (honeybee) thing 767 as a "parent” node of Fig. 7, for example, the "child” nodes may respectively refer to a wing, torso, or leg as shown in Fig. 8.

[0092] CVP Protocols Using TLE Technology

[0093] [Para 0091] In one operational sequence the Camera Visible Prims (CVP) of a stored array are scanned Left to Right (LTR) and Top to Bottom (TTB). After a world position and row-and-column perimeter are established, the UV / Texture image undergoes processes like scaling, rotation, scanline pattern, face- and color-blending, array and interarray interpolation to convert into a CVP and load into the back buffer. Perimeter RC is the first process which finds the CVP's in the outermost areas of each Row and Column of the image being scanned. Each object / character is stored in both a pointer array and texture / image data in an attribute array 1200.

[0094] [Para 0092] The row and column rasterization protocol 145L goes through an index that has been pre-programmed to hold camera-visible values in each 3-D Logic Element 342. Any prim face that is visible in each row or column will be programmed in the index variable at the beginning of each row and column inside the memory array. See Figs. 21-23.

[0095] [Para 0093] In regard to scaling, a ratio of two values is established that associates one or more prim components to one or more display pixels. If more than one camera visible prim 242, 1042 corresponds to one display pixel then scaling will blend (colors of) adjacent prims 242, 1042 using a color interpolation protocol 145D. This blends rows and columns of pixels to compensate for scale, for perspective projection, and for angled blending. This will create display pixels in the exact image to be displayed.

[0096] [Para 0094] In some variants and with reference to features described above, an animated rendering technology is described that includes methods performed aboard one or more first wearable, handheld, or other portable computing devices 600 in a context of a system 100, 300, 400. One such method is performed aboard a single particular portable computing device 600A-D and includes directly or otherwise establishing, by one or more on-board processors 602 of the portable computing device 600A-D, a first conversion 473 of a raw expression 471 of a first shape (e.g. a curved and moving virtual object portrayed as an array 267, 1067 of Fig. 2 or 10]. In such expressions 471 such animated shapes are conventionally represented by numerous polygonal meshes each associated with a grid array of renderable color data. Before or after (or both] arriving at the portable computing device 600A-D, (some] such aspects 220 are converted into firstarray 267, 1067 of colorcontaining prims 1042 that describe a position and condition of the first curved shape and that are each pointillistic or multilateral (or both].

[0097] [Para 0095] The animated rendering method also comprises rendering in a first 3D vantage 251, by the one or more on-board processors 602 of the portable computing device 600A-D, a first position of the first shape on a first user's local display screen (of the presentation hardware 612] of the portable computing device 600A-D.

[0098] [Para 0096] The method also comprises responding to a first environment update (e.g. a notification of an event 180 from a user of the device 600A-D or from a device, server, or other facility 460 pertaining to the same virtual environment 200] that includes a first (purely or otherwise] angular 3D positional transition 290B, between the first position of the first shape and a second position of the (array representing the] first shape through at least a (component of] rotation 292 (e.g. about a stationary or other axis 265].

[0099] [Para 0097] This "responding" may be performed by the one or more on-board processors 602 of the portable computing device 600A-D and includes establishing (1] a first arithmetic protocol 145J and (2] numerous post-transition prims of the second position of the first shape including a quantity N of such prims that is > 200. The first arithmetic protocol 145] may be established, for example, partly based on one or more origins 1077, axes 268, corners, or other pre-transition reference points 1078 describing the first position of the first shape in memory 604 of the first computing device and partly based on a first (non-zero] angular component of the first 3D positional transition 290A-B (e.g. using one or more trigonometric lookup tables] to map an angular change component (e.g. expressed in degrees or minutes] onto a field of corresponding linear transitions. Such angular components of interest may, for example, comprise an incremental roll, pitch, or yaw (or a combination of these] rotations 292 each less than 0.5 degrees in a context where such smooth animation would otherwise require a greater rate of trigonometric lookup than could be performed via a conventional 3D pipeline 383.

[0100] [Para 0098] Such transitions 290 may be expressed with best fit polynomials, interpolations, weighted sums, matrix multiplications, extrapolations, or other arithmetic operations that do not require significant numbers of trigonometric look up operations for satisfactorily precise animation, particularly if they are expressed in relation to an origin that is "suitably near" the first array. (As used herein an origin point is “suitably near" a prim array if all of the prims thereof are offset from the reference point by less than 100 times a diameter of the array.) With such proximity the numerous N > 200 post-transition prims 242, 1042 of the second position of the first shape may accordingly be obtained with less than N / 2 trigonometric lookup operations notwithstanding the rotation 292 by applying the first arithmetic protocol 145J to pre-transition prims 242, 1042 of the (first position of the) first shape.

[0101] [Para 0099] In some variants the method also comprises rendering, in the first 3D vantage 251, by (at least) the one or more processors 602, many of the N post-transition prims 242, 1042 of the second position of the first shape onto the first display screen of the portable computing device 600A-D as a component of animating the first user’s local shape. Alternatively or additionally, such transitions may affect a post-transition rendering by virtue of the vantage 251 undergoing a transition 290B.

[0102] [Para 0100] Many implementations of methods described herein can place each resulting display pixel in rows and columns with higher resolution or faster updates (or both) than are available by using a corresponding 3D pipeline 383. Such performance improvements are made possible herein by conventional 3D surfaces (e.g. expressed as textured triangles) being converted to or otherwise established as prims. Each prim is directly or otherwise defined by numbers that establish which direction(s) it faces and what parts of the prim are exposed to a given vantage 251. "Prims" as portrayed in Fig. 10 are exemplified as cubic primitives for clarity but it will be understood that other geometries can likewise be implemented using technologies herein. Although it is convenient to envision each "prim” as being infinitesimally small, the term "pointillistic” may likewise encompass prim arrays in which prims have a nonzero size, and potentially even elements that overlap. See Figs. 2 and 10. [Para 0101 ] Referring now to Fig. 14, there is shown a texture 1443 of a honeybee torso as a color-indicative hexadecimal expression 1400 usable with technologies described herein.

[0103] [Para 0102] Referring now to Fig. 15, there is shown a color-indicative layer 1500 usable in one or more conversions 773 in which one or more technologies may be incorporated.

[0104] [Para 0103] Referring now to Fig. 16, there is shown a table 1600 of various frame rates, display sizes, and other animation operating parameters in which one or more technologies may be incorporated.

[0105] [Para 0104] Referring now to Fig. 17, there are shown corner points of a bounding-box-type reference frames 1700 in which one or more technologies may be incorporated. Such frames 1700 are characterized by several reference points 171-178 on respective corners of the frame 1700 as shown, providing a foundation for using a transition 290 of only a minority of a shapes point transitions to derive an arithmetic protocol 145J that can be used for computing a remainder of the point transitions for an extremely efficient rendering (e.g. reducing rendering times of each shape by more than 50%).

[0106] [Para 0105] Referring now to Fig. 18, there is shown a map of honeybee torso texture as it corresponds to camera-visible prims 242, 1042 of an animation 1800 At a given point, for example a rendered portion 1801 and an unrendered potion 1802 of the shape (e.g. of the torso) are both maintained local to the rendering display (e.g. within a kilometer) to characterize the shape in such a way that its rendered visible portion can transition as the shape moves. This can occur, for example, in a context in which a viewing frustum moves incrementally or in which a slight shape position shift makes a different portion of the shape need rendering (e.g. to include a shape part that rotates into view and exclude a shape part that rotates out of view).

[0107] [Para 0106] Referring now to Fig. 19, there is shown are shown up-scaled and down-scaled honeybee torso textures and corresponding reference frames 1900 in which one or more technologies maybe incorporated.

[0108] [Para 0107] Referring now to Fig. 20, there are shown several illumination parameters 2000 in which one or more technologies may be incorporated.

[0109] [Para 0108] Referring now to Fig. 21, there is shown a viewpoint 2051, near clip plane 2061, viewing frustum 2066, and far clip plane 2062 of a virtual environment 2100 in which one or more technologies may be incorporated.

[0110] [Para 0109] Referring now to Fig. 22, there is shown a position, direction, position, and movement of a virtual camera 2200 in which one or more technologies may be incorporated. As shown a textured object moves along path 2188 from earlier positions to a "first” position 2191 and then to a "second” position 2192. [Para 0110] Referring now to Fig. 23, there is shown a schematic weighted diagram 2300 and simplified calculation 2360 for associating sides 23A, 23B, 23E of each camera-visible prim 2342 with a number of corresponding display pixels 2352 as shown. The diagram breaks down how the prims 2342 are given a weight using a top view profile. Each prim 2342 has an angle or percentage inside the 3D Logic Element (TLE) word. The visibility of each prim 2342 is determined relative to each (virtual) camera 2351. As each prim 2342 is angled away from the camera 2351 then it will have less weight or visibility. The weight or visibility may be expressed as a number, for example, and used in an averaging or interpolation protocol. Any prim 2342 directly facing the camera 2351 will, for example, have a 100% visibility. Pixels 2342 will also be made brighter to the degree that they face one or more (sources of) lights 2354. In one example of mapped display pixels 2352 a (nominally) sparser scale 2388A (of about 1.2 to 1) is shown. In another example of mapped display pixels 2352 a denser scale 2388B (of about 1.5 pixels per prim) is shown.

[0111] [Para 0111] After scaling protocol and weighting protocols are applied to each camera- visible prim, a rasterization protocol 145L interpolates among neighboring display pixels. If the Display Pixel to Prim ratio is 25 to 1 and the weight of a given prim is 80% then that prim is only 80% visible inside a 25-pixel block. The next 20 display pixels will be filled with that prim instead of the 25 because it is only 80% of 25 (i.e. 20).

[0112] [Para 0112] In light of teachings herein, numerous existing techniques may be applied for configuring special-purpose circuitry or other structures effective for streamlining animation quality or speed using prims and protocols as described herein without undue experimentation. See, e.g., U.S. Pat. 11734890 ("Three-dimensional model recovery from two-dimensional images”); U.S. Pat. 11704864 ("Static rendering for a combination of background and foreground objects”); U.S. Pat. 11475367 ("Systems and methods for training matrix-based differentiable programs”); U.S. Pat. 11610370 ("Joint shape and appearance optimization through topology sampling”); U.S. Pat. 10546405 ("Techniques and workflows for computer graphics animation system”); U.S. Pat. 10109103 ("Method of determining occluded ingress and egress routes using nav-cell to nav-cell visibility pre-computation”); U.S. Pat. 9852512 ("Reduced homography based on structural redundancy of conditioned motion”); and U.S. Pub. 2010060640 ("Interactive atmosphere - active environmental rendering”).

[0113] [Para 0113] Although various operational flows are presented in a sequence (s), it should be understood that the various operations may be performed in other orders than those which are illustrated or may be performed concurrently. Examples of such alternate orderings may include overlapping, interleaved, interrupted, reordered, incremental, preparatory, supplemental, simultaneous, reverse, or other variant orderings, unless context dictates otherwise. Furthermore, terms like "responsive to,” "related to," or other past-tense adjectives are generally not intended to exclude such variants, unless context dictates otherwise.

[0114] [Para 0114] While various system, method, article of manufacture, or other embodiments or aspects have been disclosed above, also, other combinations of embodiments or aspects will be apparent to those skilled in the art in view of the above disclosure. The various embodiments and aspects disclosed above are for purposes of illustration and are not intended to be limiting, with the true scope and spirit being indicated in the final claim set that follows.

[0115] [Para 0115] In the numbered clauses below, first combinations of aspects and embodiments are articulated in a shorthand form such that (1) according to respective embodiments, for each instance in which a "component” or other such identifiers appear to be introduced (e.g., with "a" or "an,") more than once in a given chain of clauses, such designations may either identify the same user or distinct entities; and (2) what might be called "dependent” clauses below may or may not incorporate, in respective embodiments, the features of "independent" clauses to which they refer or other features described above.

[0116] CLAUSES

[0117] Clause 1. A method for 3D shape rendering in an augmented reality or other virtual environment 200, 800, 1000 comprising: invoking transistor-based circuitry configured to establish an arithmetic protocol 145J partly based on pre-transition reference points 1078 of a first position 214, 2191 of a first shape 136 and partly based on (at least) an angular component of a 3D positional transition 290A, 290B (e.g. an invocation module 421 causing posttransition reference positions to be determined using a lookup-based implementation protocol 145C based on positional transitions 290 of the vantage 251 of the first shape 136) in response to an environmental update 186 that includes the 3D positional transition 290A, 290B, between the first position 214, 2191 and a second position 214, 2192 of the first shape 136; invoking transistor-based circuitry configured to determine post-transition primitives 242, 1042 of the second position 214, 2192 by applying the arithmetic protocol 145) to pre-transition primitives 242, 1042 of the first position 214, 2191 (e.g. an invocation module 421 triggering an analysis module 423 to compute and apply several matrix parameters to interpolate / extrapolate the post- transition primitives 242, 1042 based on how the transition affected the reference points 171-178, 1078) in response to the environmental update 186; and invoking transistor-based circuitry configured to render the second position 214, 2192 of the first shape 136 on a first display screen 370 based on the posttransition primitives 242, 1042 (e.g. an invocation or interface module 421, 424 causing the one or more processors 602 aboard mobile device(s) 800 to display the shape 136 according to its "later” position, after transition 290A) in response to the environmental update 186.

[0118] Clause 2. The method of any of the above clauses including preparation that comprises: invoking transistor-based circuitry (e.g. an invocation and conversion modules 421, 426 jointly) configured to establish a first conversion of a raw expression 471 of the first shape 136 into a first array 267, 1067 of color-containing primitives 242, 1042 that describe a position 214 and condition of the first shape 136; and invoking transistor-based circuitry configured to render the first position 214, 2191 of the first shape 136 on the first display screen 370 based on the first array 267, 1067 (e.g. another invocation and interface module 421, 424 jointly causing one or more processors 602 aboard mobile device(s) 800 to display the shape 136 via presentation hardware 612 according to an "earlier” position, before transition 290A).

[0119] Clause 3. The method of any of the above clauses whereby at least one instance of each mentioned invoking occurs aboard one or more portable devices 800 that are in motion.

[0120] Clause 4. The method of any of the above clauses whereby the 3D positional transition 290A corresponds to (at least part of) a virtual motion of the first shape 136 with (nominal) rotation and without deformation that depicts a real-world physical item in real time.

[0121] Clause 5. The method of any of the above clauses whereby the 3D positional transition 290A corresponds to a virtual motion of the first shape 136 with rotation that depicts in real time a real-world physical item monitored by a camera of a portable device 800 that includes the first display screen 370.

[0122] Clause 6. The method of any of the above clauses whereby the 3D positional transition 290A corresponds to a virtual motion of the first shape 136 comprising (nominal) expansion of or with shrinkage of the first shape 136.

[0123] Clause 7. The method of any of the above clauses whereby the 3D positional transition 290A corresponds to a real-world physical item (e.g. a projectile, motor vehicle, soap bubble, or honeybee) moving relative to (at least) a viewpoint 2051 of or viewing frustum 266, 2066 corresponding to the first display screen 370.

[0124] Clause 8. The method of any of the above clauses whereby the second position 214, 2192 of the first shape 136 is rendered on the first display screen 370 while the 3D positional transition 290A comprises a virtual motion of the first shape 136 that depicts a physical item moving relative to the first display screen 370.

[0125] Clause 9. The method of any of the above clauses whereby the second position 214, 2192 of the first shape 136 is rendered on the first display screen 370 while the 3D positional transition 290A comprises a virtual motion of the first shape 136 that depicts a physical item moving relative to a camera of a mobile device 800. Clause 10. The method of any of the above clauses whereby the second position 214, 2192 of the first shape 136 is rendered on the first display screen 370 while the first display screen 370 is borne by and visible to a human user 10.

[0126] Clause 11. The method of any of the above clauses whereby the second position 214, 2192 of the first shape 136 is rendered on the first display screen 370 while the 3D positional transition 290A comprises a virtual motion of the first shape 136 that depicts in real time a (nominally) simultaneously moving physical item.

[0127] Clause 12. The method of any of the above clauses whereby the second position 214, 2192 of the first shape 136 is rendered on the first display screen 370 while the 3D positional transition 290A comprises a virtual motion of the first shape 136 with rotation along a curved path that depicts in real time a moving physical item (apparently) having the first shape 136.

[0128] Clause 13. The method of any of the above clauses whereby the second position 214, 2192 of the first shape 136 is rendered on the first display screen 370 while the first display screen 370 is borne by a human user 10 and while the 3D positional transition 290A comprises a virtual motion of the first shape 136 with rotation along a curved path that depicts in real time a real-world physical item moving relative to (at least) a viewpoint 2051 of or viewing frustum 266, 2066 corresponding to the first display screen 370.

[0129] Clause 14. The method of any of the above clauses whereby at least one instance of each recited circuitry invocation thereof occurs aboard a single portable device 800 that includes the first display screen 370.

[0130] Clause 15. The method of any of the above clauses wherein at least one instance of each recited circuitry invocation thereof occurs aboard a moving portable device 800.

[0131] Clause 16. The method of any of the above clauses whereby at least one instance of the second position 214, 2192 of the first shape 136 is rendered on the first display screen 370 while the first display screen 370 is held or otherwise borne by a human user 10.

[0132] Clause 17. The method of any of the above clauses whereby at least one instance of the second position 214, 2192 of the first shape 136 is rendered on the first display screen 370 while the first display screen 370 is borne by a (nominally) moving human user 10.

[0133] Clause 18. The method of any of the above clauses wherein at least one instance of each mentioned invoking occurs aboard a portable device 800.

[0134] Clause 19. The method of any of the above clauses whereby at least one instance of each mentioned invoking occurs aboard one or more portable devices 800 that are in motion.

[0135] Clause 20. The method of any of the above clauses whereby at least one instance of the mentioned invoking occurs aboard a first (at least partly) surgically implanted portable device 800.

[0136] Clause 21. The method of any of the above clauses whereby at least one instance of the mentioned invoking occurs aboard a handheld portable device 800.

[0137] Clause 22. The method of any of the above clauses wherein at least one instance of a mentioned invoking occurs aboard a wearable (instance of a) portable device 800.

[0138] Clause 23. The method of any of the above clauses wherein the first conversion comprises converting a polygonal mesh representation of the first shape 136 into the first array 267, 1067 of color-containing primitives 242, 1042.

[0139] Clause 24. The method of any of the above clauses wherein the arithmetic protocol 145) is established so that one or more trigonometric lookup operations applied to reference points of the first shape 136 at the first position 214, 2191 are associated with corresponding reference points of the first shape 136 at the second position 214, 2192 and wherein many other points of the first shape 136 at the second position 214, 2192 are determined by applying (at least) a best fit polynomial to, an interpolation to, a weighted sum to, or an extrapolation to corresponding points of the first shape 136 at the first position 214, 2191 without any trigonometric lookup operations.

[0140] Clause 25. The method of any of the above clauses wherein determining the post-transition primitives 242, 1042 comprises: obtaining N post-transition primitives 242, 1042 — where N > 200 — directly or otherwise using less than N / 2 trigonometric lookup operations. Clause 26. The method of any of the above clauses comprising: establishing a reference frame 279, 1079 for the first array 267, 1067 wherein the reference frame 279, 1079 has an origin point 1077 that is suitably near the first array 267, 1067 and wherein the pre-transition reference points 1078 are based on the reference frame 279, 1079.

[0141] Clause 27. The method of any of the above clauses comprising: establishing a reference frame 279, 1079 for the first array 267, 1067 wherein the reference frame 279, 1079 has an origin point 1077 that is very near the first array 267, 1067 at least insofar that the origin point 1077 is less than ten times a diameter of the first array 267, 1067 from all primitives 242, 1042 in the firstarray 267, 1067.

[0142] Clause 28. The method of any of the above clauses comprising: adjusting an origin point 1077 of a reference frame 279, 1079 for the first array 267, 1067 based on movement of the first shape 136 repeatedly during animation so as to maintain a proximity between the origin point 1077 and the first array 267, 1067.

[0143] Clause 29. The method of any of the above clauses wherein the origin point 1077 is less than four times a diameter of the first array 267, 1067 from all primitives 242, 1042 in the first array 267, 1067.

[0144] Clause 30. The method of any of the above clauses wherein device-executable instructions further cause an origin point 1077 to be adjusted repeatedly based on movement of the first shape 136 so as to maintain a suitable proximity between the origin point 1077 and the first array 267, 1067 during animation.

[0145] Clause 31. The method of any of the above clauses comprising: establishing a first conversion of a raw expression 471 of a first shape 136 into a first array 267, 1067 of color-containing primitives 242, 1042 that describe a position 214 and condition of the first shape 136; rendering a first position 214, 2191 of the first shape 136 on a display screen 370 based on the first array 267, 1067; responding to an environment update 186 that includes a 3D positional transition 290A, 290B, between the first position 214, 2191 and a second position 214, 2192 of the first shape 136 by: establishing an arithmetic protocol 145) based on pre-transition reference points 1078 of the first position 214, 2191 and an angular component of the 3D positional transition 290A, 290B; and determining post-transition primitives 242, 1042 of the second position 214, 2192 by applying the arithmetic protocol 145J to pre-transition primitives 242, 1042 of the first position 214, 2191; and rendering the second position 214, 2192 of the first shape 136 on the display screen 370 based on the post-transition primitives 242, 1042.

[0146] Clause 32. A system 100, 300, 400 comprising: the transistor-based circuitry of any one of the above method clauses.

[0147] Clause 33. The method of any of the above clauses wherein one or more deviceexecutable code segments correspond to and define each of the protocols and wherein each of the protocols is performed by invoking its corresponding device-executable code segment(s) via one or more processors 502, 602.

[0148] Clause 34. A system 100, 300, 400 for 3D shape rendering in an augmented reality or other virtual environment 200, 800, 1000 comprising: transistor-based circuitry configured to establish an arithmetic protocol 145) partly based on pre-transition reference points 1078 of a first position 214, 2191 of a first shape 136 and partly based on (at least) an angular component of a 3D positional transition 290A, 290B (e.g. an invocation module 421 causing post-transition reference positions to be determined using a lookup-based implementation protocol 145C based on positional transitions 290 of the vantage 251 of the first shape 136) in response to an environmental update 186 that includes the 3D positional transition 290A, 290B, between the first position 214, 2191 and a second position 214, 2192 of the first shape 136; transistor-based circuitry configured to determine post-transition primitives 242, 1042 of the second position 214, 2192 by applying the arithmetic protocol 145) to pre-transition primitives 242, 1042 of the first position 214, 2191 (e.g. an invocation module 421 triggering an analysis module 423 to compute and apply several matrix parameters to interpolate / extrapolate the post- transition primitives 242, 1042 based on how the transition affected the reference points in lieu of further trigonometric lookups) in response to the environmental update 186; and transistor-based circuitry configured to render the second position 214, 2192 of the first shape 136 on a first display screen 370 based on the post-transition primitives 242, 1042 (e.g. another invocation or interface module 421, 424 causing the one or more processors 602 aboard mobile device(s) 800 to display the shape 136 according to its "later” position, after transition 290A) in response to the environmental update 186.

[0149] Clause 35. The computing system of any of the above system clauses wherein an instance of invocation and interface modules 421, 424 thereof configured to establish the first conversion of the raw expression 471 of the first shape 136 into the first array

[0150] 267, 1067 of color-containing primitives 242, 1042 that describe the position 214 and condition of the first shape 136 resides on a single integrated circuit chip.

[0151] Clause 36. The computing system of any of the above system clauses wherein an instance of invocation and interface modules 421, 424 thereof configured to establish the first conversion of the raw expression 471 of the first shape 136 into the first array

[0152] 267, 1067 of color-containing primitives 242, 1042 that describe the position 214 and condition of the first shape 136 (is included and) resides in a single apparatus.

[0153] Clause 37. The computing system of any of the above system clauses wherein an instance of invocation and interface modules 421, 424 thereof configured to establish the first conversion of the raw expression 471 of the first shape 136 into the first array

[0154] 267, 1067 of color-containing primitives 242, 1042 that describe the position 214 and condition of the first shape 136 resides in a single portable device 800.

[0155] Clause 38. The computing system of any of the above system clauses wherein (at least) an instance of invocation and interface modules 421, 424 thereof configured to establish the first conversion of the raw expression 471 of the first shape 136 into the first array 267, 1067 of mostly color-containing primitives 242, 1042 that describe the position 214 and condition of the first shape 136 (is included and) resides in one or more cloud-resident servers 500. Clause 39. The computing system of any of the above system clauses and configured to perform a method of at least a corresponding one of the above method clauses.

[0156] [Para 0116] While various system, method, article of manufacture, or other embodiments or aspects have been disclosed above, also, other combinations of embodiments or aspects will be apparent to those skilled in the art in view of the above disclosure. The various embodiments and aspects disclosed above are for purposes of illustration and are not intended to be limiting, with the true scope and spirit being indicated in the final claim set that follows.

Claims

ClaimsWhat is claimed is:Claim 1. A method for 3D shape rendering comprising: invoking first transistor-based circuitry configured to establish a first conversion of a raw expression of a first shape into a first array of pre-transition primitives that describe a first position of said first shape; invoking second transistor-based circuitry configured to render said first position of said first shape on a display screen based on said first array. invoking third transistor-based circuitry configured to establish an arithmetic protocol partly based on pre-transition reference points of said first position of a first shape and partly based on an angular component of a 3D positional transition lookupbased implementation protocol based on positional transitions caused by an environmental update that includes said 3D positional transition, between said first position and a second position of said first shape; invoking fourth transistor-based circuitry configured to determine post-transition primitives of said second position by applying said arithmetic protocol to said pretransition primitives of said first position caused by said environmental update; and invoking fifth transistor-based circuitry configured to render said second position of said first shape on a display screen based on said post-transition primitives caused by said environmental update whereby said second position of said first shape renders in real time a real-world physical item in motion.Claim 2. The method for 3D shape rendering of Claim 1 wherein said first conversion of said raw expression of said first shape into said first array of said pretransition primitives comprises converting a polygonal mesh representation of said first shape into said first array, which includes color-containing primitives.Claim 3. The method for 3D shape rendering of Claim 1 wherein said arithmetic protocol is established so that one or more trigonometric lookup operations applied to reference points of said first shape at said first position are associated with corresponding reference points of said first shape at said second position and wherein many other points of said first shape at said second position are determined by applying at least a best fitpolynomial to, an interpolation to, a weighted sum to, or an extrapolation to corresponding points of said first shape at said first position without any trigonometric lookup operations.Claim 4. The method for 3D shape rendering of Claim 1 wherein determining said post-transition primitives comprises: obtaining N of said post-transition primitives — where N > 1000 — using less than N / 2 trigonometric lookup operations.Claim 5. The method for 3D shape rendering of Claim 1 comprising: establishing a reference frame for said first array wherein said reference frame has an origin point that is adequately near said first array at least insofar that said origin point is less than 1000 times a diameter of said first array from all primitives in said first array and wherein said pre-transition reference points are based on said reference frame.Claim 6. The method for 3D shape rendering of Claim 1 comprising: adjusting an origin point of a reference frame for said first array based on movement of said first shape repeatedly during animation so as to maintain a proximity between said origin point and said first array.Claim 7. The method for 3D shape rendering of Claim 1 whereby said 3D positional transition corresponds to at least part of a virtual motion of said first shape with nominal rotation and without deformation that depicts said real-world physical item in real time.Claim 8. The method for 3D shape rendering of Claim 1 whereby said 3D positional transition corresponds to a virtual motion of said first shape with rotation that depicts in real time said real-world physical item monitored by a camera of a portable device that includes said first display screen.Claim 9. The method for 3D shape rendering of Claim 1 whereby said 3D positional transition corresponds to said real-world physical item moving relative to at least a viewpoint of or viewing frustum corresponding to said first display screen.Claim 10. The method for 3D shape rendering of Claim 1 whereby said second position of said first shape is rendered on said first display screen while said 3D positional transition comprises a virtual motion of said first shape that depicts said real-world physical item moving relative to said first display screen or relative to a camera.Claim 11. The method for 3D shape rendering of Claim 1 whereby said second position of said first shape is rendered on said first display screen while said first display screen is borne by and visible to a moving human user.Claim 12. The method for 3D shape rendering of Claim 1 whereby at least one instance of each of said invocations occurs aboard a single portable device that includes said first display screen.Claim 13. The method for 3D shape rendering of Claim 1 wherein said arithmetic protocol partly based on said pre-transition reference points of said first position of said first shape and partly based on said angular component of said 3D positional transition caused by said environmental update is based on several trigonometric lookups but does not include any further trigonometric lookups and wherein said arithmetic protocol is used aboard a mobile device in computing many thousands of said post-transition primitives in less than 100 milliseconds and in lieu of further trigonometric lookups.Claim 14. The method for 3D shape rendering of Claim 1 wherein said arithmetic protocol includes matrix multiplication but does not include any trigonometric lookup function and wherein said fourth and fifth transistor-based circuitry thereby invoked both reside aboard a portable device that includes said display screen but not any 3D pipeline.Claim 15. The method for 3D shape rendering of Claim 1 whereby said second position of said first shape is rendered on said first display screen while said 3D positional transition comprises a virtual motion of said first shape with rotation along a curved path and without deformation.Claim 16. A method for 3D shape rendering comprising: invoking transistor-based circuitry configured to establish an arithmetic protocol partly based on pre-transition reference points of a first position of a first shape and partly based on an angular component of a 3D positional transition caused by an environmental update that includes said 3D positional transition, between a first position and a second position of said first shape; invoking transistor-based circuitry configured to determine post-transition primitives of said second position by applying said arithmetic protocol to pre-transition primitives of said first position caused by said environmental update; andinvoking transistor-based circuitry configured to render said second position of said first shape on a display screen based on said post-transition primitives caused by said environmental update.Claim 17. The method for 3D shape rendering of Claim 16 including preparation that comprises: invoking transistor-based circuitry configured to establish a first conversion of a raw expression of said first shape into a first array of color-containing primitives that describe a position of said first shape; and invoking transistor-based circuitry configured to render said first position of said first shape on said display screen based on said first array whereby said second position of said first shape is rendered on said first display screen while said 3D positional transition comprises a virtual motion of said first shape with rotation along a curved path and without deformation that renders in real time a real-world physical item in motion.Claim 18. A computer program product for 3D shape rendering comprising: one or more tangible, nonvolatile storage media; and machine instructions borne on said one or more tangible, nonvolatile storage media which, when running on one or more computer systems, cause said one or more computer systems to perform said method of Claim 16.Claim 19. A system for 3D shape rendering comprising: transistor-based circuitry configured to establish an arithmetic protocol partly based on pre-transition reference points of a first position of a first shape and partly based on an angular component of a 3D positional transition caused by an environmental update that includes said 3D positional transition, between said first position and a second position of said first shape; transistor-based circuitry configured to determine post-transition primitives of said second position by applying said arithmetic protocol to pre-transition primitives of said first position caused by said environmental update; and transistor-based circuitry configured to render said second position of said first shape on a display screen based on said post-transition primitives caused by said environmental update.

Citation Information

Patent Citations

  • A method for surface reconstruction of 3D models based on a 3D scanning device

    CN106408664B

  • Three-dimensional model optimization method and system based on modeling software script

    CN114004939A

  • Hybrid interactive mode for rendering medical images with ray tracing

    US20190221027A1

  • Methods and apparatus to transition between 2d and 3D renderings of augmented reality content

    US20220366643A1