Re2l: An efficient output-sensitive algorithm for computing Boolean operations on circular-arc polygons and its applications
暂无分享,去创建一个
Minyi Guo | Xiao Lin | Yong Peng | Bin Yao | Haibing Guan | Zhi-Jie Wang | Mei-e Fang | M. Guo | Haibing Guan | Xiao Lin | Bin Yao | Zhi-Jie Wang | Yong Peng | Mei Fang
[1] Minyi Guo,et al. SMe: explicit & implicit constrained-space probabilistic threshold range queries for moving objects , 2015, GeoInformatica.
[2] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.
[3] Francisco R. Feito-Higueruela,et al. Boolean operations on general planar polygons , 2000, Comput. Graph..
[4] Sylvain Pion,et al. Towards and open curved kernel , 2004, SCG '04.
[5] Yu Liu,et al. Boolean Operations on Conic Polygons , 2009, Journal of Computer Science and Technology.
[6] Borut Zalik,et al. An algorithm for polygon clipping, and for determining polygon intersections and unions , 2007, Comput. Geosci..
[7] Bala R. Vatti. A generic solution to polygon clipping , 1992, CACM.
[8] Günther Greiner,et al. Efficient clipping of arbitrary polygons , 1998, TOGS.
[9] Francisco R. Feito-Higueruela,et al. A new algorithm for computing Boolean operations on polygons , 2009, Comput. Geosci..
[10] Brian A. Barsky,et al. An analysis and algorithm for polygon clipping , 1983, CACM.
[11] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[12] Mario Cannataro,et al. Protein-to-protein interactions: Technologies, databases, and algorithms , 2010, CSUR.
[13] R. D. Andreev. Algorithm for Clpping Arbitrary Polygons , 1989, Comput. Graph. Forum.
[14] Mark de Berg,et al. Computational Geometry: Algorithms and Applications, Second Edition , 2000 .
[15] Patrick-Gilles Maillot,et al. A new, fast method for 2D polygon clipping: analysis and software implementation , 1992, TOGS.
[16] M. Carter. Computer graphics: Principles and practice , 1997 .
[17] Michael Kerber,et al. A generic algebraic kernel for non-linear geometric applications , 2011, SoCG '11.
[18] Peter R. Atherton,et al. Hidden surface removal using polygon area sorting , 1977, SIGGRAPH.
[19] John E. Hopcroft,et al. Robust set operations on polyhedral solids , 1987, IEEE Computer Graphics and Applications.
[20] Ron Wein,et al. Exact and approximate construction of offset polygons , 2007, Comput. Aided Des..
[21] Lalit M. Patnaik,et al. Systolic Architecture for Boolean Operations on Polygons and Polyhedra , 1987, Comput. Graph. Forum.
[22] Michael Ian Shamos,et al. Geometric intersection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[23] Dan Halperin,et al. CGAL Arrangements and Their Applications - A Step-by-Step Guide , 2012, Geometry and Computing.
[24] Estelle Perrin,et al. An algorithm reducing 3D Boolean operations to a 2D problem: concepts and results , 1996, Comput. Aided Des..
[25] Yuhong Liu. P. Renard, H. Demougeot-Renard, R. Froidevaux, Editors, , Geostatistics for Environmental Applications, Proceedings of the Fifth European Conference on Geostatistics for Environmental Applications (2006) Springer, New York (480pp., US$169, Hardbound, ISBN: 3-540-26533-3) , 2007, Comput. Geosci..
[26] Bang Wang,et al. Coverage problems in sensor networks: A survey , 2011, CSUR.
[27] Avraham Margalit,et al. An algorithm for computing the union, intersection or difference of two polygons , 1989, Comput. Graph..
[28] 大野 義夫,et al. Computer Graphics : Principles and Practice, 2nd edition, J.D. Foley, A.van Dam, S.K. Feiner, J.F. Hughes, Addison-Wesley, 1990 , 1991 .
[29] Jun-Hai Yong,et al. A new algorithm for Boolean operations on general polygons , 2005, Comput. Graph..
[30] Minyi Guo,et al. Probabilistic Range Query over Uncertain Moving Objects in Constrained Two-Dimensional Space , 2012, IEEE Transactions on Knowledge and Data Engineering.
[31] Ari Rappoport,et al. An efficient algorithm for line and polygon clipping , 1991, The Visual Computer.
[32] Miodrag Potkonjak,et al. Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[33] Ivan E. Sutherland,et al. Reentrant polygon clipping , 1974, Commun. ACM.