SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Hierarchical Z-buffer visibility
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Computing minimum length paths of a given homotopy class
Computational Geometry: Theory and Applications
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Progressive simplicial complexes
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Fast computation of generalized Voronoi diagrams using graphics hardware
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Visualizing large-scale telecommunication networks and services (case study)
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Interactive multi-pass programmable shading
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
ACM Transactions on Graphics (TOG)
Coloring k-colorable graphs using smaller palettes
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Near Real-Time CSG Rendering Using Tree Normalization and Geometric Pruning
IEEE Computer Graphics and Applications
A hardware-assisted visibility-ordering algorithm with applications to volume rendering
EGVISSYM'01 Proceedings of the 3rd Joint Eurographics - IEEE TCVG conference on Visualization
Simplifying a polygonal subdivision while keeping it simple
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Hardware-assisted computation of depth contours
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Application of the two-sided depth test to CSG rendering
I3D '03 Proceedings of the 2003 symposium on Interactive 3D graphics
Domain decomposition for multiresolution analysis
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
A scalable simulator for forest dynamics
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Efficient and consistent line simplification for web mapping
International Journal of Web Engineering and Technology
Locawe: a novel platform for location-aware multimedia services
Proceedings of the 7th International Conference on Mobile and Ubiquitous Multimedia
Computing terrain multi-visibility maps for a set of view segments using graphics hardware
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
| Hi-index | 0.00 |
In this paper, we present an algorithm and a system to perform dynamic view dependent simplification of large geographical maps through a novel use of graphics hardware. Given a map as a collection of non-intersecting chains and a tolerance parameter for each chain, we produce a simplified map that resembles the original map, satisfying the condition that the distance between each point on the simplified chain and the original chain is within the given tolerance parameter, and that no two chains intersect. We also present an interactive map visualization system which uses frame-to-frame coherence to perform dynamic view-dependent simplification. Our initial results indicate that we get a 3-4 fold increase in the frame rates using our simplification algorithm on maps with 1.5-2 million vertices on an SGI Onyx workstation.