26 search results - page 4 / 6 » An Improved TIN Compression Using Delaunay Triangulation |
COMPGEOM
2003
ACM
14 years 2 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
APVIS
2008
13 years 11 months ago
2008
Effectively visualizing complex node-link graphs which depict relationships among data nodes is a challenging task due to the clutter and occlusion resulting from an excessive amo...
COMGEO
2010
ACM
13 years 9 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
ISVC
2007
Springer
14 years 3 months ago
2007
Springer
Visualization of glyphs has a long history in medical imaging but gains much more power when the glyphs are properly placed to fill the screen. Glyph packing is often performed vi...
SMI
2003
IEEE
14 years 2 months ago
2003
IEEE
This paper proposes a digital watermarking algorithm for 2D vector digital maps. The watermark is a robust, informed-detection watermark to be used to prevent such abuses as an in...