Worst-case optimal hidden-surface removal
ACM Transactions on Graphics (TOG)
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Art gallery theorems and algorithms
Art gallery theorems and algorithms
Topologically sweeping an arrangement
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Computing the minimum Hausdorff distance for point sets under translation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects
IEEE Transactions on Pattern Analysis and Machine Intelligence
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Ranger: a tool for nearest neighbor search in high dimensions
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Motion planning amidst fat obstacles (extended abstract)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry in C
Compressing still and moving images with wavelets
Multimedia Systems - Special issue on video compression
Wavelets and subband coding
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Multiresolution analysis of arbitrary meshes
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Multiresolution analysis for surfaces of arbitrary topological type
ACM Transactions on Graphics (TOG)
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
MAPS: multiresolution adaptive parameterization of surfaces
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
A random sampling scheme for path planning
International Journal of Robotics Research
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Spheres, molecules, and hidden surface removal
Computational Geometry: Theory and Applications
Small representation of line arrangements
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
The Data Compression Book
JPEG Still Image Data Compression Standard
JPEG Still Image Data Compression Standard
Visualization of Geometric Algorithms
IEEE Transactions on Visualization and Computer Graphics
Single Resolution Compression of Arbitrary Triangular Meshes with Properties
DCC '99 Proceedings of the Conference on Data Compression
Small representation of line arrangements
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
An Experimental Study and Comparison of Topological Peeling and Topological Walk
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
An information-based exploration strategy for environment mapping with mobile robots
Robotics and Autonomous Systems
| Hi-index | 0.00 |
This paper addresses the problem of lossy compression of arrangements. Given an arrangement of $n$ lines in the plane, we show how to construct another arrangement consisting of many fewer lines. We give theoretical and empirical bounds to demonstrate the tradeoffs between the size of the new arrangement and the error from lossiness.For the specific application of computing discrepancies of point sets, we demonstrate that speedups by factors of several hundred are possible while introducing small errors. This research has been enabled by various visualization techniques and is accompanied by a video.