Paul Guerrero
Michael Wimmer
Peter Wonka
Abstract
We propose a method for propagating edit operations in 2D vector graphics, based on geometric relationship functions. These functions quantify the geometric relationship of a point to a polygon, such as the distance to the boundary or the direction to the closest corner vertex. The level sets of the relationship functions describe points with the same relationship to a polygon. For a given query point, we first determine a set of relationships to local features, construct all level sets for these relationships, and accumulate them. The maxima of the resulting distribution are points with similar geometric relationships. We show extensions to handle mirror symmetries, and discuss the use of relationship functions as local coordinate systems. Our method can be applied, for example, to interactive floorplan editing, and it is especially useful for large layouts, where individual edits would be cumbersome. We demonstrate populating 2D layouts with tens to hundreds of objects by propagating relatively few edit operations.
Supplemental Material
Available for Download
Supplemental movie and image files for, Edit propagation using geometric relationship functions
- H. Avron, A. Sharf, C. Greif, and D. Cohen-Or. 2010. L1-sparse reconstruction of sharp point set surfaces. ACM Trans. Graph. 29, 5, 135:1--135:12. Google Scholar
Digital Library
- E. Behar and J.-M. Lien. 2011. Fast and robust 2d minkowski sum using reduced convolution. In Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS'11). 1573--1578.Google ScholarCross Ref
- S. Belongie, J. Malik, and J. Puzicha. 2002. Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Mach. Intell. 24, 4, 509--522. Google ScholarDigital Library
- M. Bokeloh, M. Wand, V. Koltun, and H.-P. Seidel. 2011. Pattern-aware shape deformation using sliding dockers. In Proceedings of the SIGGRAPH Asia Conference (SA'11). 123:1--123:10. Google ScholarDigital Library
- M. Bokeloh, M. Wand, H.-P. Seidel, and V. Koltun. 2012. An algebraic model for parameterized shape editing. ACM Trans. Graph. 31, 4, 78:1--78:10. Google ScholarDigital Library
- M. Fisher, D. Ritchie, M. Savva, T. Funkhouser, and P. Hanrahan. 2012. Example-based synthesis of 3d object arrangements. ACM Trans. Graph. 31, 6, 135:1--135:11. Google ScholarDigital Library
- M. Fisher, M. Savva, and P. Hanrahan. 2011. Characterizing structural relationships in scenes using graph kernels. ACM Trans. Graph. 30, 4, 34:1--34:12. Google ScholarDigital Library
- S. Fleishman, I. Drori, and D. Cohen-Or. 2003. Bilateral mesh denoising. In ACM SIGGRAPH Papers (SIGGRAPH'03). ACM Press, New York, 950--953. Google ScholarDigital Library
- R. Gal, O. Sorkine, N. J. Mitra, and D. Cohen-Or. 2009. Iwires: An analyze-and-edit approach to shape manipulation. ACM Trans. Graph. 28, 3, 33:1--33:10. Google ScholarDigital Library
- J. Gil and M. Werman. 1993. Computing 2-d min, median, and max filters. IEEE Trans. Pattern Anal. Mach. Intell. 15, 5, 504--507. Google ScholarDigital Library
- K. Hormann and M. S. Floater. 2006. Mean value coordinates for arbitrary planar polygons. ACM Trans. Graph. 25, 4, 1424--1441. Google ScholarDigital Library
- P. Joshi, M. Meyer, T. Derose, B. Green, and T. Sanocki. 2007. Harmonic coordinates for character articulation. ACM Trans. Graph. 26, 3. Google ScholarDigital Library
- D. Kroon. 2011. Shape context based corresponding point models. Matlab File Exchange. http://www.mathworks.com/matlabcentral/fileexchange/30845-shape-context-based-corresponding-point-models.Google Scholar
- Y. Lipman, D. Levin, and D. Cohen-Or. 2008. Green coordinates. ACM Trans. Graph. 27 3, 78:1--78:10. Google ScholarDigital Library
- P. Merrell, E. Schkufza, Z. Li, M. Agrawala, and V. Koltun. 2011. Interactive furniture layout using interior design guidelines. ACM Trans. Graph. 30, 4, 87:1--87:10. Google ScholarDigital Library
- J. Solomon, A. Nguyen, A. Butscher, M. Ben-Chen, and L. Guibas. 2012. Soft maps between surfaces. Comput. Graph. Forum 31, 5, 1617--1626. Google ScholarDigital Library
- O. Weber, R. Poranne, and C. Gotsman. 2012. Biharmonic coordinates. Comput. Graph. Forum 31, 2409--2422. Google ScholarDigital Library
- Y.-T. Yeh, L. Yang, M. Watson, N. D. Goodma, and P. Hanrahan. 2012. Synthesizing open worlds with constraints using locally annealed reversible jump mcmc. ACM Trans. Graph. 31, 4, 56:1--56:11. Google ScholarDigital Library
- L.-F. Yu, S.-K. Yeung, C.-K. Tang, D. Terzopoulos, T. F. Chan, and S. J. Osher. 2011. Make it home: Automatic optimization of furniture arrangement. ACM Trans. Graph. 30, 4, 86:1--86:12. Google ScholarDigital Library
- Y. Zheng, X. Chen, M.-M. Cheng, K. Zhou, S.-M. Hu, and N. J. Mitra. 2012. Interactive images: Cuboid proxies for smart image manipulation. ACM Trans. Graph. 31, 4, 99:1--99:11. Google ScholarDigital Library
- Y. Zheng, H. Fu, D. Cohen-Or, O. K.-C. Au, and C.-L. Tai. 2011. Component-wise controllers for structure-preserving shape manipulation. Comput. Graph. Forum 30, 2, 563--572.Google ScholarCross Ref
Index Terms
- Edit propagation using geometric relationship functions
Recommendations
Antialiasing recovery for edit propagation
VRCAI '11: Proceedings of the 10th International Conference on Virtual Reality Continuum and Its Applications in IndustryEdit propagation on images/videos has become more and more popular in recent years due to simple and intuitive interaction. It propagates sparse user edits to the whole data following the policy that nearby regions with similar appearances receive ...
Efficient manifold-preserving edit propagation using quad-tree data structures
In this paper, we propose an edit propagation algorithm using quad-tree data structures for image manipulation. First, we use a quad-tree to adaptively group all pixels into clusters. Then, we build a manifold-preserving propagation function based on ...
Sparse pixel sampling for appearance edit propagation
Edit propagation is an appearance-editing method using sparsely provided edit strokes from users. Although edit propagation has a wide variety of applications, it is computationally complex, owing to the need to solve large linear systems. To reduce the ...
Comments