Approximate convex decomposition of polyhedra and its applications
暂无分享,去创建一个
[1] Paul L. Rosin,et al. A Rectilinearity Measurement for Polygons , 2002, ECCV.
[2] Andrei Khodakovsky,et al. Globally smooth parameterizations with low distortion , 2003, ACM Trans. Graph..
[3] Martin D. Levine,et al. Recovering parametric geons from multiview range data , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.
[4] Tiow Seng Tan,et al. Decomposing polygon meshes for interactive applications , 2001, I3D '01.
[5] Jack Sklansky,et al. Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.
[6] Micha Sharir,et al. On shortest paths in polyhedral spaces , 1986, STOC '84.
[7] Pierre Alliez,et al. Variational shape approximation , 2004, ACM Trans. Graph..
[8] Paul L. Rosin,et al. A Convexity Measurement for Polygons , 2002, BMVC.
[9] Chandrajit L. Bajaj,et al. Convex Decomposition of Polyhedra and Robustness , 1992, SIAM J. Comput..
[10] Bruno Lévy,et al. Least squares conformal maps for automatic texture atlas generation , 2002, ACM Trans. Graph..
[11] TalAyellet,et al. Hierarchical mesh decomposition using fuzzy clustering and cuts , 2003 .
[12] Hans-Peter Seidel,et al. Fast and robust detection of crest lines on meshes , 2005, SPM '05.
[13] Gérard G. Medioni,et al. Part decomposition and description of 3D shapes , 1994, Proceedings of 12th International Conference on Pattern Recognition.
[14] Hugues Hoppe,et al. Spherical parametrization and remeshing , 2003, ACM Trans. Graph..
[15] Jeff Erickson,et al. Optimally Cutting a Surface into a Disk , 2002, SCG '02.
[16] Shimin Hu,et al. Feature sensitive mesh segmentation , 2006, SPM '06.
[17] DeCarloDoug,et al. Suggestive contours for conveying shape , 2003 .
[18] Fujio Yamaguchi,et al. Computer-Aided Geometric Design , 2002, Springer Japan.
[19] Nancy M. Amato,et al. Approximate convex decomposition of polygons , 2004, SCG '04.
[20] Martin D. Levine,et al. 3D part segmentation using simulated electrical charge distributions , 1996, Proceedings of 13th International Conference on Pattern Recognition.
[21] HoppeHugues,et al. Spherical parametrization and remeshing , 2003 .
[22] J. Hershberger,et al. Speeding Up the Douglas-Peucker Line-Simplification Algorithm , 1992 .
[23] Bernard Chazelle,et al. Decomposition Algorithms in Geometry , 1994 .
[24] Wayne E. Carlson,et al. Shape transformation for polyhedral objects , 1992, SIGGRAPH.
[25] Tamal K. Dey,et al. Shape Segmentation and Matching with Flow Discretization , 2003, WADS.
[26] Bernard Chazelle,et al. Strategies for polyhedral surface decomposition: an experimental study , 1995, SCG '95.
[27] Konstantin Mischaikow,et al. Feature-based surface parameterization and texture mapping , 2005, TOGS.
[28] Jarek Rossignac,et al. Tribox bounds for three-dimensional objects , 1999, Comput. Graph..
[29] Chandrajit L. Bajaj,et al. Identifying flat and tubular regions of a shape by unstable manifolds , 2006, SPM '06.
[30] B. Faverjon,et al. Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .
[31] J. Mark Keil,et al. Polygon Decomposition , 2000, Handbook of Computational Geometry.
[32] Szymon Rusinkiewicz,et al. Estimating curvatures and their derivatives on triangle meshes , 2004, Proceedings. 2nd International Symposium on 3D Data Processing, Visualization and Transmission, 2004. 3DPVT 2004..
[33] Ross T. Whitaker,et al. Partitioning 3D Surface Meshes Using Watershed Segmentation , 1999, IEEE Trans. Vis. Comput. Graph..
[34] Hans-Peter Seidel,et al. Feature sensitive mesh segmentation with mean shift , 2005, International Conference on Shape Modeling and Applications 2005 (SMI' 05).
[35] Nancy M. Amato,et al. Simultaneous shape decomposition and skeletonization , 2006, SPM '06.
[36] Chee-Keng Yap,et al. Approximate Euclidean Shortest Paths in 3-Space , 1997, Int. J. Comput. Geom. Appl..
[37] Markus H. Gross,et al. Multi‐scale Feature Extraction on Point‐Sampled Surfaces , 2003, Comput. Graph. Forum.
[38] Dinesh Manocha,et al. Proceedings of the 2007 ACM Symposium on Solid and Physical Modeling, Beijing, China, June 4-6, 2007 , 2007, Symposium on Solid and Physical Modeling.
[39] Hans-Peter Seidel,et al. Ridge-valley lines on meshes via implicit surface fitting , 2004, ACM Trans. Graph..
[40] Abraham Kandel,et al. Mean and maximum common subgraph of two graphs , 2000, Pattern Recognit. Lett..
[41] Ronald N. Perry,et al. Adaptively sampled distance fields: a general representation of shape for computer graphics , 2000, SIGGRAPH.
[42] Hans-Peter Seidel,et al. Mesh scissoring with minima rule and part salience , 2005, Comput. Aided Geom. Des..
[43] Ralph R. Martin,et al. Segmenting reliefs on triangle meshes , 2006, SPM '06.
[44] C. Bajaj. Algebraic Geometry and its Applications , 1994 .
[45] B. Joe. Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions , 1994 .
[46] Adam Finkelstein,et al. Suggestive contours for conveying shape , 2003, ACM Trans. Graph..
[47] Markus H. Gross,et al. Multiresolution feature extraction for unstructured meshes , 2001, Proceedings Visualization, 2001. VIS '01..
[48] Mathieu Desbrun,et al. Removing excess topology from isosurfaces , 2004, TOGS.
[49] Lydia E. Kavraki,et al. A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..
[50] Ayellet Tal,et al. Hierarchical mesh decomposition using fuzzy clustering and cuts , 2003, ACM Trans. Graph..
[51] Bernard Chazelle,et al. Convex decompositions of polyhedra , 1981, STOC '81.
[52] E. R. White. Assessment of Line-Generalization Algorithms Using Characteristic Points , 1985 .
[53] KhodakovskyAndrei,et al. Globally smooth parameterizations with low distortion , 2003 .
[54] Szymon Rusinkiewicz,et al. Modeling by example , 2004, ACM Trans. Graph..
[55] J. Sack,et al. Handbook of computational geometry , 2000 .
[56] Ayellet Tal,et al. Polyhedron realization for shape transformation , 1998, The Visual Computer.