Skip to main content

Close
Get the best research tool on the web today,and free!
Connect with people with common interests!
Play Webslides

York 's Bookmarks tagged algorithm   View Popular

You are here: Diigo Home > York 's Bookmarks

Expand All 1 - 20 of 35 Next ›

Hacker's Delight

A collection useful programming advice the author has collected over the years; small algorithms that make the programmer's task easier.

Tags: book, choice, programming, algorithm, embedded on 2008-09-02 and saved by2 people -All Annotations (0) -About

more fromwww.hackersdelight.org

貼圖 filtering 與 MIP map 簡介 [Part 3]

如果重新取樣時,取樣點的間距比原來要大,即縮小圖形的時候,就會出現新的問題。最明顯的問題,在於取樣點間距放大時,相對的,取樣頻率也就減少了。這時,訊號中就可能會包含一些過高的頻率成份。所以,這時候會需要一個 low pass filter。

Tags: graphics, algorithm, filter, sampling on 2008-06-17 -All Annotations (0) -About

more fromwww.csie.ntu.edu.tw

Line drawing algorithm - Wikipedia, the free encyclopedia

A line drawing algorithm is a graphical algorithm for approximating a line segment on discrete graphical media. On discrete media, such as pixel-based displays and printers, line drawing requires such an approximation (in nontrivial cases).

Tags: graphics, algorithm on 2008-05-03 -All Annotations (0) -About

more fromen.wikipedia.org

Programmers Lounge - Graphics Basics: August 2007

All the basic graphics programs goes here

Tags: graphics, algorithm, C on 2008-04-30 -All Annotations (0) -About

more fromprogrammers-lounge-basicgraphics.blogspot.com

Midpoint circle algorithm - Wikipedia, the free encyclopedia

In computer graphics, the midpoint circle algorithm is an algorithm used to determine the points needed for drawing a circle. The algorithm is a variant of Bresenham's line algorithm, although not invented by Bresenham. The algorithm is therefore also sometimes referred to as Bresenham's circle algorithm.

Tags: graphics, algorithm on 2008-04-30 and saved by2 people -All Annotations (0) -About

more fromen.wikipedia.org

Bresenham's line algorithm - Wikipedia, the free encyclopedia

The Bresenham line algorithm is an algorithm that determines which points in an n-dimensional raster should be plotted in order to form a close approximation to a straight line between two given points. It is commonly used to draw lines on a computer screen, as it uses only integer addition, subtraction and bit shifting all of which are very cheap operations in standard computer architectures. It is one of the earliest algorithms developed in the field of computer graphics.

Tags: algorithm, graphics on 2008-04-19 -All Annotations (0) -About

more fromen.wikipedia.org

2Expand

萬年曆程式

2Expand

未來數學家的挑戰 -- NP-hardness 與圍棋

5Expand

未來數學家的挑戰 -- NP-completeness

1Expand

未來數學家的挑戰 -- NP-complete 問題之近似解

2Expand

未來數學家的挑戰

4Expand

PHOTORESISTOR ALGORITHMS

1 - 20 of 35 Next ›
List 20 50 100

Notation: * = Private bookmark and comment| = Clipping [?] | = Public highlight [?]