Home
York Jong's Library tagged → View Popular
Antiobjects - Wikipedia, the free encyclopedia
The notion of antiobjects is a computational metaphor useful to conceptualize and solve hard problems by swapping computational foreground and background.
-
The notion of antiobjects is a computational metaphor useful to conceptualize and solve hard problems by swapping computational foreground and background.
-
Antiobjects turn things on their head. In the case of Pacman we put the main computation into the maze; to simulate the behavior of an air bubble we put the main computation into the water; to create a collaborative soccer game we put the main computation into the soccer field.
- 2 more annotations...
貼圖 filtering 與 MIP map 簡介 [Part 3]
如果重新取樣時，取樣點的間距比原來要大，即縮小圖形的時候，就會出現新的問題。最明顯的問題，在於取樣點間距放大時，相對的，取樣頻率也就減少了。這時，訊號中就可能會包含一些過高的頻率成份。所以，這時候會需要一個 low pass filter。
GRC | How Sub-Pixel Font Rendering Works
-
an LCD screen boasting a horizontal resolution of 800 whole pixels is actually composed of 800 red, 800 green, and 800 blue sub-pixels interleaved together (R-G-B-R-G-B-R-G-B ...) to form a linear array of 2400 single-color sub-pixels.
-
Out of sheer desperation, a technique known as 'anti-aliasing' was developed. It attempts to employ shades of gray where font designers would like to show only 'part' of a pixel. The hope is that our eyes will tend to average two adjacent gray pixels to see one in the middle. The actuality, however, is less wonderful. For small type sizes anti-aliasing merely blurs the image and reduces readability.
- 1 more annotations...
Hacker's Delight
A collection useful programming advice the author has collected over the years; small algorithms that make the programmer's task easier.
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).
Programmers Lounge - Graphics Basics: August 2007
All the basic graphics programs goes here
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.
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.
萬年曆程式
-
int W[12]={6, 2, 2, 5, 0, 3, 5, 1, 4, 6, 2, 4};
int y, m, d, w;
scanf("%d %d %d",&y, &m, &d);
w=W[m-1]+y+(y/4)-(y/100)+(y/400);
if( ((y%4)==0) && (m<3) ) {
w--;
if((y%100)==0) w++;
if((y%400)==0) w--;
}
printf("%d\n", (w+d)%7);
-
我們輸入的年份要在
1583 以後才有用，否則算出來的答案是錯的
未來數學家的挑戰 -- NP-hardness 與圍棋
-
- 定義： 若 x 為一 NP-hard 問題，則若 NP
，則 
。
也就是說，即使 P=NP，x 還不一定屬於 P，但
NP, 則 x 絕不比 NP 的問題容易 - 定義： 若 x 為一 NP-hard 問題，則若 NP
-
注意在上式中 PSPACE-complete
PSPACE，即 PSPACE-complete 是 PSPACE 中的難題，但 PSPACE-hard 不一定屬於 PSPACE
未來數學家的挑戰 -- NP-completeness
-
NP-complete 是 NP 中的難題，NP-complete 解決了
5
，
NP 就解決了。但若有一個屬於 NP 而不屬於 NP-complete 的問題解決了，則其他的 NP 問題不一定可以解決。 -
NP 是英文 nondeterministic polynomial 的縮寫，意思就是非確定性的多項式時間
- 3 more annotations...
未來數學家的挑戰
-
「一個好的問題勝過十個好解答」。
因為解答一出，此問題已是到了終點，對不斷求創新的人們而言，已不構成挑戰 -
新的問題是源頭活水，能開拓新的境界。多數人都不願沉醉在好的解答中不斷的玩味，而希望找到新的問題，不斷的思考，摸索。
PHOTORESISTOR ALGORITHMS
-
-
pseudocode:
read left_photoresistor
read right_photoresistor
if left_photoresistor detects more light than right_photoresistor
then turn robot left
if right_photoresistor detects more light than left_photoresistor
then turn robot right
if right_photoresistor detects about the same as left_photoresistor
then robot goes straight
loop
- 2 more annotations...
Selected Tags
Related Tags
Sponsored Links
Top Contributors
Groups interested in algorithm
-
Consistent Hashing
Items: 8 | Visits: 85
Created by: Arrix Z
-
Algo
Items: 2 | Visits: 25
Created by: leon zhou
Diigo is about better ways to research, share and collaborate on information. Learn more »
Join Diigo