Decentralized and coordinate-free computation of critical points and surface networks in a discretized scalar field

References

• Akkaya, K., Demirbas, M., and Aygun, R.S., 2008. The impact of data aggregation on the performance of wireless sensor networks. Wireless Communications and Mobile Computing, 8 (2), 171–193.
   Web of Science ®Google Scholar
• Akyildiz, I., et al., 2002. A survey on sensor networks. IEEE Communications Magazine, 40 (8), 102–114.
   Web of Science ®Google Scholar
• Alzoubi, K., et al., 2003. Geometric spanners for wireless ad hoc networks. IEEE Transactions on Parallel and Distributed Systems, 14 (4), 408–421.
   Web of Science ®Google Scholar
• Ayala, R., Fernández, L., and Vilches, J., 2010. The number of critical elements of discrete Morse functions on non-compact surfaces. Topology and Its Applications, 157 (1), 90–101.
   Web of Science ®Google Scholar
• Bajaj, C. and Schikore, D., 1998. Topology preserving data simplification with error bounds. Computers & Graphics, 22 (1), 3–12.
   Web of Science ®Google Scholar
• Banchoff, T., 1970. Critical points and curvature for embedded polyhedral surfaces. The American Mathematical Monthly, 77 (5), 475–485.
   Web of Science ®Google Scholar
• Biasotti, S., et al., 2008. Describing shapes by geometrical-topological properties of real functions. ACM Computing Surveys, 40 (4), 12:1–12:87.
   Web of Science ®Google Scholar
• Biasotti, S., Falcidieno, B., and Spagnuolo, M., 2004. Surface shape understanding based on extended Reeb graphs. In: S. Rana, ed. Topological data structures for surfaces: an introduction for geographical information science. Oxford: Wiley, 87–102.
   Google Scholar
• Bradley, A.P., 1997. The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition, 30 (7), 1145–1159.
   Web of Science ®Google Scholar
• Buckland, M. and Gey, F., 1994. The relationship between recall and precision. Journal of the American Society for Information Science, 45, 12–19.
   Web of Science ®Google Scholar
• Carr, H., Snoeyink, J., and Axen, U., 2003. Computing contour trees in all dimensions. Computational Geometry: Theory and Applications, 24, 75–94.
   Web of Science ®Google Scholar
• Chiang, Y.J. and Lu, X., 2005. Simple and optimal output-sensitive computation of contour trees. Computational Geometry: Theory and Applications, 165–195.
   Web of Science ®Google Scholar
• Chong, C.Y. and Kumar, S., 2003. Sensor networks: evolution, opportunities, and challenges. Proceedings of the IEEE, 91 (8), 1247–1256.
   Web of Science ®Google Scholar
• Danovaro, E., et al., 2006. A multi-resolution representation for terrain morphology. In: M. Raubal, H. Miller, A. Frank, and M. Goodchild, eds. Geographic information science, Vol. 4197 of Lecture notes in computer science. Berlin/Heidelberg: Springer, 33–46.
   Google Scholar
• Davis, J. and Goadrich, M., 2006. The relationship between Precision-Recall and ROC curves. In: Proceedings of the 23rd international conference on machine learning, ICML ′06 Pittsburgh, Pennsylvania. New York, NY: ACM, 233–240.
   Google Scholar
• Duckham, M., 2013. Decentralized spatial computing: foundations of geosensor networks. Berlin: Springer.
   Google Scholar
• Edelsbrunner, H., et al., 2004. Time-varying Reeb graphs for continuous space-time data. In: Proceedings of the 20th Annual Symposium on Computational Geometry, SCG ′04 New York, NY: ACM, 366–372.
   Google Scholar
• Edelsbrunner, H., Harer, J., and Zomorodian, A., 2003. Hierarchical Morse Smale complexes for piecewise linear 2 manifolds. Discrete and Computational Geometry, 30, 87–107.
   Web of Science ®Google Scholar
• Estrin, D., et al., 2002. Connecting the physical world with pervasive networks. IEEE Pervasive Computing, 1 (1), 59–69.
   Google Scholar
• Fawcett, T., 2006. An introduction to ROC analysis. Pattern Recognition Letters, 27 (8), 861–874.
   Web of Science ®Google Scholar
• Forman, R., 2002. A user’s guide to discrete Morse theory. Séminaire Lotharingien de Combinatoire, 48, B48c.
   Google Scholar
• Forman, R., 1998. Morse theory for cell complexes. Advances in Mathematics, 134 (1), 90–145.
   Web of Science ®Google Scholar
• Goutte, C. and Gaussier, E., 2005. A probabilistic interpretation of precision, recall and F-score, with implications for evaluation. In: D. Losada and J. Fernández-Luna, eds. Advances in information retrieval, Vol. 3408 of Lecture notes in computer science. Berlin/Heidelberg: Springer, 345–359.
   Google Scholar
• Greiner, M., Pfeiffer, D., and Smith, R., 2000. Principles and practical application of the receiver-operating characteristic analysis for diagnostic tests. Preventive Veterinary Medicine, 45 (1), 23–41.
   PubMed Web of Science ®Google Scholar
• Horanont, T. and Shibasaki, R., 2008. An implementation of mobile sensing for large-scale urban monitoring. In: International Workshop on Urban, Community, and Social Applications of Networked Sensing Systems (UrbanSense08).
   Google Scholar
• Kreveld, M.V., et al., 1997. Contour trees and small seed sets for isosurface traversal. In: Proc. 13th Annual Symposium on Computational Geometry, SCG ′97, Nice, France, June. New York, NY, USA: ACM, 212–220.
   Google Scholar
• Krishnamachari, L., Estrin, D., and Wicker, S., 2002. The impact of data aggregation in wireless sensor networks. In: Proc. 22nd International Conference on Distributed Computing Systems Workshops, Vienna, Austria, July. IEEE, 575–578.
   Google Scholar
• Leonard, N., et al., 2007. Collective motion, sensor networks, and ocean sampling. Proceedings of the IEEE, 95 (1), 48–74.
   Web of Science ®Google Scholar
• Lewiner, T., Lopes, H., and Tavares, G., 2004. Applications of Forman’s discrete Morse theory to topology visualization and mesh compression. IEEE Transactions on Visualization and Computer Graphics, 10 (5), 499–508.
   PubMed Web of Science ®Google Scholar
• Lewiner, T., 2012. Critical sets in discrete Morse theories: relating Forman and piecewise-linear approaches. Computer Aided Geometric Design, 1 (1995), 1–13.
   Google Scholar
• Li, X.Y., Calinescu, G., and Wan, P.J., 2002. Distributed construction of a planar spanner and routing for ad hoc wireless networks. In: Proc. 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), Vol. 3, New York, NY, USA, June. IEEE, 1268–1277.
   Google Scholar
• Lynch, N.A., 1996. Distributed algorithms. San Francisco, CA: Morgan Kaufmann.
   Google Scholar
• Madden, S., et al., 2002. TAG: A tiny aggregation service for ad-hoc sensor networks. In: Proc. 5th Symposium on Operating System Design and Implementation (OSDI), Boston, MA, USA, Dec.. New York, NY, USA: ACM, 131–146.
   Google Scholar
• MATLAB, 2010. Version 7.10.0 (R2010a). Natick, MA: MathWorks.
   Google Scholar
• Matsumoto, Y., 2002. An Introduction to Morse Theory. Vol. 208. USA: American Mathematical Society.
   Google Scholar
• Maxwell, J.C., 1870. On hills and dales. Philosophical Magazine Series 4, 40, 421–427.
   Google Scholar
• Milnor, J., 1969. Morse theory. Princeton University Press.
   Google Scholar
• Murty, R., et al., 2008. CitySense: an urban-scale wireless sensor network and testbed. In: IEEE conference on technologies for homeland security IEEE May 2008, Waltham MA USA. 583–588.
   Google Scholar
• Nittel, S., 2009. A survey of geosensor networks: advances in dynamic environmental monitoring. Sensors, 9 (7), 5664–5678.
   PubMed Web of Science ®Google Scholar
• Pfaltz, J.L., 1976. Surface networks. Surface Networks, 8, 77–93.
   Google Scholar
• Reininghaus, J., et al., 2010. TADD: A computational framework for data analysis using discrete Morse theory. In: K. Fukuda, J. Hoeven, M. Joswig and N. Takayama, eds. Mathematical Software - ICMS 2010., Vol. 6327 of Lecture Notes in Computer Science, Berlin/Heidelberg: Springer, 198–208.
   Google Scholar
• Santini, S., Ostermaier, B., and Vitaletti, A., 2008. First experiences using wireless sensor networks for noise pollution monitoring. In: Proceedings of the workshop on real-world wireless sensor networks, REALWSN ′08 New York, NY: ACM, 61–65.
   Google Scholar
• Santoro, N., 2007. Design and analysis of distributed algorithms. Hoboken, New Jersey, USA: John Wiley & Sons, Inc.
   Google Scholar
• Sarkar, R., et al., 2008. Iso-contour queries and gradient descent with guaranteed delivery in sensor networks. In: Proceedings of the 27th IEEE Conference on Computer Communications (INFOCOM), April. Phoenix, AZ: IEEE, 960–967.
   Google Scholar
• Schneider, B. and Wood, J., 2004. Construction of metric surface networks from raster-based DEMs. In: S. Rana, ed. Topological data structures for surfaces: an introduction for geographical information science. Chichester, WS, UK: John Wiley & Sons, Ltd., 53–70.
   Google Scholar
• Shinagawa, Y., Kunii, T., and Kergosien, Y., 1991. Surface coding based on Morse theory. IEEE Computer Graphics and Applications, 11 (5), 66–78.
   Web of Science ®Google Scholar
• Skraba, P., et al., 2006. Sweeps over wireless sensor networks. In: Proceedings of the 5th international conference on Information Processing in Sensor Networks (IPSN), New York, NY: ACM, 143–151.
   Google Scholar
• Smale, S., 1960. Morse inequalities for a dynamical system. Bulletin of The American Mathematical Society, 66 (1), 43–49.
   Google Scholar
• Takahashi, S., et al., 1995. Algorithms for extracting correct critical points and constructing topological graphs from discrete geographical elevation data. Computer Graphics Forum, 14 (3), 181–192.
   Web of Science ®Google Scholar
• Willensky, U., 1999. NetLogo. Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL. Available from: http://ccl.northwestern.edu/netlogo/ [Accessed 20 June 2013].
   Google Scholar
• Wood, J. and Rana, S., 2000. Constructing weighted surface networks for the representation and analysis of surface topology. In: Proceedings of the geocomputation, Greenwich, London, UK, Aug. 23–25.
   Google Scholar
• Zhu, X., Sarkar, R., and Gao, J., 2009. Topological data processing for distributed sensor networks with Morse-Smale decomposition. In: Proceedings of the IEEE conference on computer communications (INFOCOM) April 2009, Rio de Janeiro Brazil, IEEE, 2911–2915.
   Google Scholar