Yahoo Web Search

Search results

1. Top results related to what are the applications of computer graphics in engineering

   • what are the applications of the python reload function?

     Top Answer

     Answered Jun 08, 2009 · 6 votes

     reload is useful for reloading code that may have changed in a Python module. Usually this means a plugin system.

     Take a look at this link:

     http://www.codexon.com/posts/a-better-python-reload

     It will tell you the shortcomings of reload and a possible fix.

     Check all answers on Stack Overflow

     1/5

   • What are the applications of the shortest-path-algorithm?

     Top Answer

     Answered Apr 05, 2013 · 9 votes

     There is an interesting, not directly obvious, application of the shortest path algorithms that is probably used quite often in algorithmic trading and financial sector that deals with trading assets and goods.

     Imagine that you could convert 1000 USD to 950 EUR and then 950 EUR to 1020 CAD which you convert back to 1007 USD :) Just by converting from currency to currency you can make money.

     This situation is called arbitrage opportunity. This can be done with any asset and between different markets.

     In this case, the relations between assets are modeled as directed edge-weighted graph and finding so called negative-cycles in the graph is in fact finding these arbitrage opportunities.

     You can see more details with nice explanation and examples here: http://algs4.cs.princeton.edu/44sp/

     Other Answers

     Answered Dec 10, 2010 · 6 votes

     Given a number of cities with highways connecting them, find the shortest path from New York to Chicago.

     The traffic and length of the highways are path weights.

     Other Answers

     Answered May 06, 2012 · 5 votes

     Shortest path algorithms can be used to solve word ladder puzzles.

     For example, change the word "cat" into the word "dog" by changing one letter at a time - "cat", "bat", "bag", "bog", "dog"

     Check all answers on Stack Overflow

     2/5

   • What are the applications of binary trees?

     Top Answer

     Answered Jun 27, 2021 · 498 votes

     To squabble about the performance of binary-trees is meaningless - they are not a data structure, but a family of data structures, all with different performance characteristics. While it is true that unbalanced binary trees perform much worse than self-balancing binary trees for searching, there are many binary trees (such as binary tries) for which "balancing" has no meaning.

     Applications of binary trees

     • Binary Search Tree - Used in many search applications where data is constantly entering/leaving, such as the map and set objects in many languages' libraries.
     • Binary Space Partition - Used in almost every 3D video game to determine what objects need to be rendered.
     • Binary Tries - Used in almost every high-bandwidth router for storing router-tables.
     • Hash Trees - Used in torrents and specialized image-signatures in which a hash needs to be verified, but the whole file is not available. Also used in blockchains for eg. Bitcoin.
     • Heaps - Used in implementing efficient priority-queues, which in turn are used for scheduling processes in many operating systems, Quality-of-Service in routers, and A* (path-finding algorithm used in AI applications, including robotics and video games). Also used in heap-sort.
     • Huffman Coding Tree (Chip Uni) - Used in compression algorithms, such as those used by the .jpeg and .mp3 file-formats.
     • GGM Trees - Used in cryptographic applications to generate a tree of pseudo-random numbers.
     • Syntax Tree - Constructed by compilers and (implicitly) calculators to parse expressions.
     • Treap - Randomized data structure used in wireless networking and memory allocation.
     • T-tree - Though most databases use some form of B-tree to store data on the drive, databases which keep all (most) their data in memory often use T-trees to do so.

     The reason that binary trees are used more often than n-ary trees for searching is that n-ary trees are more complex, but usually provide no real speed advantage.

     In a (balanced) binary tree with m nodes, moving from one level to the next requires one comparison, and there are log_2(m) levels, for a total of log_2(m) comparisons.

     In contrast, an n-ary tree will require log_2(n) comparisons (using a binary search) to move to the next level. Since there are log_n(m) total levels, the search will require log_2(n)*log_n(m) = log_2(m) comparisons total. So, though n-ary trees are more complex, they provide no advantage in terms of total comparisons necessary.

     (However, n-ary trees are still useful in niche-situations. The examples that come immediately to mind are quad-trees and other space-partitioning trees, where divisioning space using only two nodes per level would make the logic unnecessarily complex; and B-trees used in many databases, where the limiting factor is not how many comparisons are done at each level but how many nodes can be loaded from the hard-drive at once)

     Other Answers

     Answered Dec 10, 2010 · 6 votes

     Given a number of cities with highways connecting them, find the shortest path from New York to Chicago.

     The traffic and length of the highways are path weights.

     Other Answers

     Answered May 06, 2012 · 5 votes

     Shortest path algorithms can be used to solve word ladder puzzles.

     For example, change the word "cat" into the word "dog" by changing one letter at a time - "cat", "bat", "bag", "bog", "dog"

     Check all answers on Stack Overflow

     3/5

   • What are the advantages of using CSS Sprites in web applications?

     Top Answer

     Answered Jul 28, 2009 · 17 votes

     The question is generally not about the amount of bandwith it might save. It is more about lowering the number of HTTP requests needed to render a webpage.

     Considering :

     • web browsers only do a few HTTP requests in parallel
     • doing an HTTP request means a round-trip to the server, which takes lots of time
     • we have "fast" internet connection, which means we download fast...

     What takes time, when doing lots of requests to get small contents (like images, icons, and the like) is the multiple round-trips to the server : you end up spending time waiting for the request to go, and the server to respond, instead of using this time to download data.

     If we can minimize the number of requests, we minimize the number of trips to the server, and use our hight-speed connection better (we download a bigger file, instead of waiting for many smaller ones).

     That's why CSS sprites are used.

     For more informations, you can have a look at, for instance : CSS Sprites: Image Slicing’s Kiss of Death

     Check all answers on Stack Overflow

     4/5

   • What are some of the applications of Order Statistics Algorithms?

     Top Answer

     Answered Oct 21, 2010 · 1 votes

     Finding the median is a common application of such algorithm. E.g. I've used it in image processing for the median filter. Min, max, k-NN also use order statistic algorithms, so that's another application.

     Check all answers on Stack Overflow

     5/5

   Show moreShow less

2. www.geeksforgeeks.org › applications-of-computerApplications of Computer Graphics - GeeksforGeeks

   www.geeksforgeeks.org › applications-of-computer

   • Cached

   Jul 30, 2019 · Last Updated : 30 Jul, 2019. Computer graphics deals with creation, manipulation and storage of different type of images and objects. Some of the applications of computer graphics are: Computer Art: Using computer graphics we can create fine and commercial art which include animation packages, paint packages.

3. www.coursera.org › articles › computer-graphicsWhat Is Computer Graphics? A Guide to Getting Started

   www.coursera.org › articles › computer-graphics

   • Cached

   Jun 15, 2023 · Written by Coursera • Updated on Jun 15, 2023. Discover different types of computer graphics, software programs for designing them, careers —and the steps to entering this field.

4. www3.cs.stonybrook.edu › ~qin › coursesIntroduction to Computer Graphics Techniques and Applications

   www3.cs.stonybrook.edu › ~qin › courses

   Why Computer Graphics? • Applications (In essence, computer graphics is application-driven) – Entertainment: Movies, Video games – Graphical user interface (GUI) – Computer aided design and manufacturing (CAD/CAM) – Engineering analysis and business – Medical applications – Computer Art – Engineering Analysis

5. open.umn.edu › opentextbooks › textbooksIntroduction to Computer Graphics - Open Textbook Library

   open.umn.edu › opentextbooks › textbooks

   • Cached

   Introduction to Computer Graphics is a free, on-line textbook covering the fundamentals of computer graphics and computer graphics programming. This book is meant for use as a textbook in a one-semester course that would typically be taken by undergraduate computer science majors in their third or fourth year of college.

6. en.wikipedia.org › wiki › Computer_graphicsComputer graphics - Wikipedia

   en.wikipedia.org › wiki › Computer_graphics

   • Cached

   Computer graphics is often differentiated from the field of visualization, although the two fields have many similarities. Applications. Computer graphics may be used in the following areas: Augmented reality; Computational biology; Computational photography; Computational physics; Computer-aided design; Computing; Design; Digital art ...

7. en.wikipedia.org › wiki › Computer_graphicsComputer graphics (computer science) - Wikipedia

   en.wikipedia.org › wiki › Computer_graphics

   • Cached

   Applications of computer graphics include: Print design. Digital art. Special effects. Video games. Visual effects. History.

8. ocw.mit.edu › courses › 6-837-computer-graphics-fallComputer Graphics | Electrical Engineering and Computer ...

   ocw.mit.edu › courses › 6-837-computer-graphics-fall

   • Cached

   This course provides introduction to computer graphics algorithms, software and hardware. Topics include: ray tracing, the graphics pipeline, transformations, texture mapping, shadows, sampling, global illumination, splines, animation and color. This course offers 6 Engineering Design Points in MIT's EECS program.