Determining a node path through a node graph

Details Determining a node path through a node graph Determining a node path through a node graph

2002-01-04

2009-06-16

Picard, Leo (Department: 2125)

Computer graphics processing and selective visual display system

Computer graphics processing

Animation

C345S428000, C345S475000, C345S959000, C703S002000, C703S006000

Reexamination Certificate

active

07548241

ABSTRACT:
Determining a node path through a node graph includes modifying the node graph in accordance with a predetermined platform performance, performing a path finding process through the node graph to obtain the node path, determining if the platform performance has changed, adjusting the node graph to compensate for a change in the platform performance, and re-performing the path finding process through the adjusted node graph to obtain the node path.

REFERENCES:
patent: 4600919 (1986-07-01), Stern
patent: 4747052 (1988-05-01), Hishinuma et al.
patent: 4835712 (1989-05-01), Drebin et al.
patent: 4855934 (1989-08-01), Robinson
patent: 4901064 (1990-02-01), Deering
patent: 4905233 (1990-02-01), Cain et al.
patent: 5124914 (1992-06-01), Grangeat
patent: 5163126 (1992-11-01), Einkauf et al.
patent: 5371778 (1994-12-01), Yanof et al.
patent: 5611030 (1997-03-01), Stokes
patent: 5731819 (1998-03-01), Gagne et al.
patent: 5757321 (1998-05-01), Billyard
patent: 5786822 (1998-07-01), Sakaibara et al.
patent: 5805782 (1998-09-01), Foran
patent: 5809219 (1998-09-01), Pearce et al.
patent: 5812141 (1998-09-01), Kamen et al.
patent: 5847712 (1998-12-01), Salesin et al.
patent: 5872773 (1999-02-01), Katzela et al.
patent: 5881243 (1999-03-01), Zaumen et al.
patent: 5894308 (1999-04-01), Isaacs
patent: 5929860 (1999-07-01), Hoppe
patent: 5933148 (1999-08-01), Oka et al.
patent: 5949969 (1999-09-01), Suzuoki et al.
patent: 5966133 (1999-10-01), Hoppe
patent: 5966134 (1999-10-01), Arias
patent: 5974423 (1999-10-01), Margolin
patent: 5999189 (1999-12-01), Kajiya et al.
patent: 6054999 (2000-04-01), Strandberg
patent: 6057859 (2000-05-01), Handelman et al.
patent: 6078331 (2000-06-01), Pulli et al.
patent: 6098107 (2000-08-01), Narvaez-Guarnieri et al.
patent: 6115050 (2000-09-01), Landau et al.
patent: 6175655 (2001-01-01), George et al.
patent: 6191787 (2001-02-01), Lu et al.
patent: 6191796 (2001-02-01), Tarr
patent: 6198486 (2001-03-01), Junkins et al.
patent: 6201549 (2001-03-01), Bronskill
patent: 6208347 (2001-03-01), Migdal et al.
patent: 6219070 (2001-04-01), Baker et al.
patent: 6239808 (2001-05-01), Kirk et al.
patent: 6252608 (2001-06-01), Snyder et al.
patent: 6262737 (2001-07-01), Li et al.
patent: 6262739 (2001-07-01), Migdal et al.
patent: 6292192 (2001-09-01), Moreton
patent: 6292194 (2001-09-01), Powell, III
patent: 6317125 (2001-11-01), Persson
patent: 6337880 (2002-01-01), Cornog et al.
patent: 6388670 (2002-05-01), Naka et al.
patent: 6405071 (2002-06-01), Analoui
patent: 6437782 (2002-08-01), Pieragostini et al.
patent: 6478680 (2002-11-01), Yoshioka et al.
patent: 6559848 (2003-05-01), O'Rourke
patent: 6573890 (2003-06-01), Lengyel
patent: 6593924 (2003-07-01), Lake et al.
patent: 6593927 (2003-07-01), Horowitz et al.
patent: 6608627 (2003-08-01), Marshall et al.
patent: 6608628 (2003-08-01), Ross et al.
patent: 6970171 (2005-11-01), Baraff et al.
patent: 7050904 (2006-05-01), Powell et al.
patent: 2001/0026278 (2001-10-01), Arai et al.
patent: 2002/0101421 (2002-08-01), Pallister
Lonzano-Perez et al., “An Algorithm for Planning Collision-Free Paths Among Polyhedral Obstacles”, ACM, 1979.
Thalmann et al., “Computer Animation in Future Technologies”, University of Geneva, 1996.
Egbert et al., “Collision-Free Object Movement Using Vector Fields”, Brigham Young University, 1996.
Garcia-Luna-Aceves, “A Path-Finding Algorithm for Loop-Free Routing”, IEEE, 1997.
Hoppe, Hugues, “Smooth View-Dependent Level-of-Detail Control and its Application to Terrain Rendering”, IEEE Visualization, 1998.
Bandi et al., “Space discretization for efficient human navigation”, Swiss Federal Institute of Technology, 1998.
Bandi et al., “The use of space discretization fro autonomous virtual humans”, Swiss Federal Institute of Technology, 1998.
Leung et al., “Interactive viewing of 3D terrain models using VRML”, Syracuse Unversity, 1998.
To et al., “A method of Progressive and Selective Transmission of Multi-Resolution Models”, ACM 1999.
“Advogato's Trust Metric”, www.advogato.org, 2000.
Bandi et al., “Path finding for human motion in virtual environments,”, Elsevier Science 2000.
Ware et al., “Layout for Visualizing Large Software Structures in 3D”, University of New Brunswick, 2000.
Brockington, Mark, “Pawn Captures Wyvern: How Computer Chess Can Improve Your Pathfinding”, Gama Network, 2000.
Frohlich et al., “Autonomous and Robust Navigation for Simulated Humanoid Characters in Virtual Environments,”, IEEE, 2002.
Popovic, Jovan et al., “Progressive Simplicial Complexes”, Microsoft Research.
Hoppe, Hughes, “Progressive Meshes”, Microsoft Research, ACM 1996.
Garland et al., “Surface simplification using quadratic error metrics”, IEEE, 1997.
Lake et al., “Stylized Rendering Techniques for Scalable Real-Time 3D Animation”, 2000.
Appel, Arthur, “The Notion of Quantitative Invisibility and the Machine Rendering of Solids.” Proceedings of 22nd National Conference Association for Computing Machinery 1967.
Catmull et al., “Recursively Generated B-Spline Surfaces on Arbitrary Topological Meshes,” Computer Aided Geometric Design, 10(6):350-355 (1978).
Coelho et al., “An Algorithm for Intersecting and Trimming Parametric Meshes”, ACM SIGGRAPH, pp. 1-8 (1998).
Deering, M., “Geometry Compression,” Computer Graphics. SIGGRAPH '95, pp. 13-20, 1995.
DeRose et al., “Subdivisional Surfaces in Character Animation”, ACM, SIGGRAPH'98, pp. 85-94 (1998).
Elber, Gershon, “Interactive Line Art Rendering of Freeform Surfaces”, Eurographics'99, 18(3):C1-C12 (1999).
Gooch et al., “A Non-Photorealistic Lighting Model for Automatic Technical Illustration,” Computer Graphics Proceedings, Annual Conference Series, SIGGRAPH'98, pp. 447-452 (1998).
Gooch et al., “Interactive Technical Illustration,” ACM Interactive 3D, pp. 31-38 (1999).
Heidrich et al., “Realistic, Hardware-Accelerated Shading and Lighting,” ACM, (SIGGRAPH'99), pp. 171-178 (1999).
Kumar et al., “Interactive Display of Large Scale NURBS Models”, ACM, Symp. On Interactive 3D Graphics, pp. 51-58 (1995).
Lake et al., “Stylized Rendering Techniques for Scalable Real-Time 3D Animation”, NPAR, pp. 101-108 (2000).
Lander, Jeff, “Making Kine More Flexible,”Game Developer Magazine, 5 pgs., Nov. 1998.
Lander, Jeff, “Skin Them Bones,” Game Developer Magazine, 4 pgs., May 1998.
Pedersen, “A Framework for Interactive Texturing on Curved Surfaces”, ACM, pp. 295-301 (1996).
“pmG Introduces Messiah: Animate 3.0”, URL: http://www.digitalproducer.com/aHTM/Articles/july—2000/july—17—00/pmg—intros—messiah—animate.htm (Accessed Oct. 26, 2004) 2 pgs.
Pueyo, X. et al., “Rendering Techniques '96,” Proc. of Eurographics Rendering Workshop 1996, EUROGRAPHICS, pp. 61-70 (1996).
Rockwood, A. et al., “Real-time Rendering of Trimmed Surfaces,” Computer Graphics (SIGGRAPH '89 Proceedings) 23:107-116 (1989).
Sousa, M., et al., “Computer-Generated Graphite Pencil Rendering of 3-D Polygonal Models”, Eurographics'99, 18(3):C1950C207 (1999).
Stam, J., “Exact Evaluation of Catmull-Clark Subdivision Surfaces at Arbitrary Parameter Values”, SIGGRAPH 98 Conference Proceedings, Annual Conference Series, pp. 395-404 (1998).
Taubin et al., “3D Geometry Compression”, SIGGRAPH'98 Course Notes (1998).
Wilhelms, J. & Van Gelder, A., “Anatomically Based Modeling,” Univ. California Santa Cruz [online], 1997 [retrieved Dec. 22, 2004], retrieved from the Internet: <URL: http://graphics.stanford.edu/courses/cs448-0-spring/papers/wilhelms.pdf>.
Chow, “Optimized Geometry Compression for Real-time Rendering.” Massach

Affiliated with

Also associated with

Rating

Determining a node path through a node graph does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Determining a node path through a node graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Determining a node path through a node graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4089309