Polygon Simplification by Minimizing Convex Corners
暂无分享,去创建一个
Stephane Durocher | Debajyoti Mondal | Saeed Mehrabi | J. Mark Keil | Yeganeh Bahoo | Sahar Mehrpour
[1] Leonidas J. Guibas,et al. Approximating Polygons and Subdivisions with Minimum Link Paths , 1991, Int. J. Comput. Geom. Appl..
[2] Anne Ruas,et al. Generalisation of Geographic Information , 2007 .
[3] Anne Ruas,et al. Modelling the Overall Process of Generalisation , 2013 .
[4] Janosch Döcker,et al. On planar variants of the monotone satisfiability problem with bounded variable appearances , 2016, Int. J. Found. Comput. Sci..
[5] Morten Revsbæk,et al. Simplifying Massive Contour Maps , 2012, ESA.
[6] Jon G. Rokne,et al. Geometric Computations with Interval and New Robust Methods: Applications in Computer Graphics, GIS and Computational Geometry , 2003 .
[7] Alexander Pilz,et al. Geodesic-Preserving Polygon Simplification , 2014, Int. J. Comput. Geom. Appl..
[8] Mark de Berg,et al. Optimal Binary Space Partitions for Segments in the Plane , 2012, Int. J. Comput. Geom. Appl..
[9] David H. Douglas,et al. ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .
[10] Debajyoti Mondal,et al. The Complexity of Drawing a Graph in a Polygonal Region , 2018, GD.
[11] Joseph S. B. Mitchell,et al. A Polynomial time Algorithm for the Maximum Weight Independent Set Problem on Outerstring Graphs ∗ , 2013 .