Alberto Belussi
Abstract
This article presents a new algorithm called Snap Rounding with Restore (SRR), which aims to make geometric datasets robust and to increase the quality of geometric approximation and the preservation of topological structure. It is based on the well-known Snap Rounding algorithm but improves it by eliminating from the snap rounded arrangement the configurations in which the distance between a vertex and a nonincident edge is smaller than half the width of a pixel of the rounding grid. Therefore, the goal of SRR is exactly the same as the goal of another algorithm, Iterated Snap Rounding (ISR), and of its evolution, Iterated Snap Rounding with Bounded Drift (ISRBD). However, SRR produces an output with a quality of approximation that is on average better than ISRBD, under the viewpoint both of the distance from the original segments and of the conservation of their topological structure. The article also reports some cases where ISRBD, notwithstanding the bounded drift, produces strong topological modifications while SRR does not. A statistical analysis on a large collection of input datasets confirms these differences. It follows that the proposed Snap Rounding with Restore algorithm is suitable for applications that require robustness, a guaranteed geometric approximation, and a good topological approximation.
- Alberto Belussi, Sara Migliorini, Mauro Negri, and Giuseppe Pelagatti. 2012. Robustness of spatial relation evaluation in a distributed environment. In Proceedings of the 20th International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS’12). ACM, 446--449. Google Scholar
Digital Library
- Jean-Daniel Boissonnat and Franco P. Preparata. 2000. Robust plane sweep for intersecting segments. SIAM Journal on Computing 29, 5 (2000), 1401--1421. Google ScholarDigital Library
- Li Chen. 2001. Exact Geometric Computation: Theory and Applications. Ph.D. Dissertation. New York University, Department of Computer Science. Google ScholarDigital Library
- Mark de Berg, Dan Halperin, and Mark Overmars. 2007. An intersection-sensitive algorithm for snap rounding. Computational Geometry Theory and Applications 36, 3 (2007), 159--165. Google ScholarDigital Library
- Arno Eigenwillig, Lutz Kettner, and Nicola Wolpert. 2007. Snap rounding of bézier curves. In Proceedings of the 23rd Annual Symposium on Computational Geometry (SCG’07). ACM, 158--167. Google ScholarDigital Library
- Steven Fortune. 1998. Vertex-rounding a three-dimensional polyhedral subdivision. In Proceedings of the 14th Annual Symposium on Computational Geometry (SCG’98). ACM, 116--125. Google ScholarDigital Library
- Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, and Paul J. Tanenbaum. 1997. Snap rounding line segments efficiently in two and three dimensions. In Proceedings of the 13th Annual Symposium on Computational Geometry (SCG’97). ACM, 284--293. Google ScholarDigital Library
- Daniel H. Greene and F. Frances Yao. 1986. Finite-resolution computational geometry. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science (SFCS’86). IEEE Computer Society, 143--152. Google ScholarDigital Library
- Leonidas J. Guibas and David H. Marimont. 1995. Rounding arrangements dynamically. In Proceedings of the 11th Annual Symposium on Computational Geometry (SCG’95). ACM, 190--199. Google ScholarDigital Library
- Dan Halperin. 2010. Controlled perturbation for certified geometric computing with fixed-precision arithmetic. In Proceedings of the 3rd International Congress Conference on Mathematical Software (ICMS’10). Springer-Verlag, 92--95. Google ScholarDigital Library
- Dan Halperin and Eli Packer. 2002. Iterated snap rounding. Computational Geometry Theory and Applications 23, 2 (2002), 209--225. Google ScholarDigital Library
- Dan Halperin and Christian R. Shelton. 1998. A perturbation scheme for spherical arrangements with application to molecular modeling. Computational Geometry: Theory and Applications 10, 4 (1998), 273--288. Google ScholarDigital Library
- John Hershberger. 2011. Stable snap rounding. In Proceedings of the 27th Annual Symposium on Computational Geometry (SoCG’11). ACM, New York, NY, 197--206. Google ScholarDigital Library
- John D. Hobby. 1993. Practical Segment Intersection with Finite Precision Output. Retrieved from http://ect.bell-labs.com/who/hobby/93_2-27.pdf.Google Scholar
- John D. Hobby. 1999. Practical segment intersection with finite precision output. Computational Geometry Theory and Applications 13, 4 (1999), 199--214. Google ScholarDigital Library
- OGC 2011. OpenGIS Implementation Standard for Geographic Information -- Simple Feature Access -- Part 1: Common Architecture. OGC. Version 1.2.1.Google Scholar
- Eli Packer. 2008. Iterated snap rounding with bounded drift. Computational Geometry 40, 3 (2008), 231--251. DOI:http://dx.doi.org/10.1016/j.comgeo.2007.09.002 Google ScholarDigital Library
- Eli Packer. 2011. Controlled perturbation of sets of line segments in R2 with smart processing order. Computational Geometry: Theory and Applications 44, 5 (2011), 265--285. Google ScholarDigital Library
- Rod Thompson and Peter van Oosterom. 2006. Interchange of spatial data-inhibiting factors. In Proceedings of the 9th AGILE International Conference on Geographic Information Science.Google Scholar
Index Terms
- Snap Rounding with Restore: An Algorithm for Producing Robust Geometric Datasets
Recommendations
Iterated snap rounding with bounded drift
SCG '06: Proceedings of the twenty-second annual symposium on Computational geometrySnap Rounding and its variant, Iterated Snap Rounding, are methods for converting arbitrary-precision arrangements of segments into a fixed-precision representation (we call them SR and ISR for short). Both methods approximate each original segment by a ...
Improved output-sensitive snap rounding
SCG '06: Proceedings of the twenty-second annual symposium on Computational geometryThis paper presents new algorithms for snap rounding an arrangement A of line segments in the plane. Snap rounding defines a set of hot pixels, which are unit squares centered on the integer grid points closest to the vertices of A. Snap rounding ...
Stable snap rounding
SoCG '11: Proceedings of the twenty-seventh annual symposium on Computational geometrySnap rounding is a popular method for rounding the vertices of a planar arrangement of line segments to the integer grid. It has many advantages, including minimum perturbation of the segments, preservation of the arrangement topology, and ease of ...
Comments