Simplifying a polygonal subdivision while keeping it simple
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
Medians and beyond: new aggregation techniques for sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
A line in the sand: a wireless sensor network for target detection, classification, and tracking
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Military communications systems and technologies
Power-conserving computation of order-statistics over sensor networks
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Topological hole detection in wireless sensor networks and its applications
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Ef.cient Continuous Mapping in Sensor Networks Using Isolines
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Proceedings of the 3rd international conference on Embedded networked sensor systems
Deterministic boundary recognition and topology extraction for large sensor networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Contour map matching for event detection in sensor networks
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Boundary recognition in sensor networks by topological methods
Proceedings of the 12th annual international conference on Mobile computing and networking
The Tenet architecture for tiered sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Towards a sensor network architecture: lowering the waistline
HOTOS'05 Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10
Boundary estimation in sensor networks: theory and methods
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Contour approximation in sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Catching elephants with mice: sparse sampling for monitoring sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
Detecting basic topological changes in sensor networks by local aggregation
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Spatio-temporal monitoring using contours in large-scale wireless sensor networks
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Routing and Aggregation Strategies for Contour Map Applications in Sensor Networks
WWIC 2009 Proceedings of the 7th International Conference on Wired/Wireless Internet Communications
Preliminaries for Topological Change Detection Using Sensor Networks
GSN '09 Proceedings of the 3rd International Conference on GeoSensor Networks
Catching elephants with mice: Sparse sampling for monitoring sensor networks
ACM Transactions on Sensor Networks (TOSN)
Source location anonymity for sensor networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Estimation of a population size in large-scale wireless sensor networks
Journal of Computer Science and Technology - Special section on trust and reputation management in future computing systmes and applications
Efficient tracking of 2D objects with spatiotemporal properties in wireless sensor networks
Distributed and Parallel Databases
| Hi-index | 0.00 |
We consider the problem of approximating a family of isocontours in a sensor fleld with a topologically-equivalent family of simple polygons. Our algorithm is simple and distributed, it gracefully adapts to any user-specified representation size k, and it delivers a worst-case guarantee for the quality of approximation. In particular, we prove that the topology-respecting Hausdorff error in our k -vertex approximation is within a small constant factor of the optimal error possible with Θ(k/log m) vertices, where m is the number of contours. Evaluation of the algorithm on real data suggests that the size increase factor in practice is a constant near 2 .6, and shows no error increase. Our simulation results using a variety of synthetic and real data show that the algorithm smoothly handles complex isocontours, even for representation sizes as small as 32 or 48. Because isocontours are widely used to represent and communicate bi-variate signals, our technique is broadly applicable to innetwork aggregation and summarization of spatial data in sensor networks.