1557 search results - page 40 / 312 » On measuring areas of polygons |
156
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
This paper presents a method of using texture mapping with mipmapping to render a VLSI layout. Texture mapping is used to save already rasterized areas of the layout from frame to...
137
click to vote
CHI
2004
ACM
16 years 6 months ago
2004
ACM
DiamondSpin is a toolkit for the efficient prototyping of and experimentation with multi-person, concurrent interfaces for interactive shared displays. In this paper, we identify ...
156
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
174
click to vote
SIGGRAPH
1996
ACM
15 years 10 months ago
1996
ACM
We present an algorithm for real-time level of detail reduction and display of high-complexity polygonal surface data. The algorithm uses a compact and efficient regular grid repr...
152
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree T where the weight of each node is the sum of the weights of its children. A treemap ...