Minimum area enclosure and alpha hull of a set of freeform planar closed curves
暂无分享,去创建一个
[1] S. Chandra. CFD analysis of PACE Formula-1 car , 2011 .
[2] Martin Held,et al. Heuristics for the Generation of Random Polygons , 1996, CCCG.
[3] Se-Jong Oh,et al. A New Concave Hull Algorithm and Concaveness Measure for n-dimensional Datasets , 2012, J. Inf. Sci. Eng..
[4] Bidyut Baran Chaudhuri,et al. A Novel Approach to Computation of the Shape of a Dot Pattern and Extraction of Its Perceptual Border , 1997, Comput. Vis. Image Underst..
[5] Yuan-Shin Lee,et al. 2-Phase approach to global tool interference avoidance in 5-axis machining , 1995, Comput. Aided Des..
[6] Gershon Elber,et al. On the computation of the minimal ellipse enclosing a set of planar curves , 2009, 2009 IEEE International Conference on Shape Modeling and Applications.
[7] Thomas Auer,et al. Rpg { Heuristics for the Generation of Random Polygons , 1998 .
[8] Herbert Edelsbrunner,et al. Three-dimensional alpha shapes , 1992, VVS.
[9] Gershon Elber,et al. Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions , 2011, Comput. Aided Des..
[10] Stian Ripegutu Johannessen. Use of CFD to Study Hydrodynamic Loads on Free-Fall Lifeboats in the Impact Phase. : A verification and validation study. , 2012 .
[11] Manfredo P. do Carmo,et al. Differential geometry of curves and surfaces , 1976 .
[12] J. O´Rourke,et al. Computational Geometry in C: Arrangements , 1998 .
[13] Jin Liu,et al. Detail feature recognition and decomposition in solid model , 2002, Comput. Aided Des..
[14] John Beidler,et al. Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.
[15] Michael E. Mortenson,et al. Geometric Modeling , 2008, Encyclopedia of GIS.
[16] Sándor P. Fekete,et al. Area optimization of simple polygons , 1993, SCG '93.
[17] Jin J. Chou. Voronoi diagrams for planar shapes , 1995, IEEE Computer Graphics and Applications.
[18] Gershon Elber,et al. The Convex Hull of Freeform Surfaces , 2004, Computing.
[19] H. Piaggio. Differential Geometry of Curves and Surfaces , 1952, Nature.
[20] Roddy MacLeod,et al. Coarse Filters for Shape Matching , 2002, IEEE Computer Graphics and Applications.
[21] Otfried Cheong,et al. The Voronoi Diagram of Curved Objects , 1995, SCG '95.
[22] Mahmoud Melkemi,et al. Computing the shape of a planar points set , 2000, Pattern Recognit..
[23] Les A. Piegl,et al. The NURBS book (2nd ed.) , 1997 .
[24] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[25] B. Gurumoorthy,et al. Constructing medial axis transform of planar domains with curved boundaries , 2003, Comput. Aided Des..
[26] Les A. Piegl,et al. The NURBS Book , 1995, Monographs in Visual Communication.
[27] Antony Galton,et al. What Is the Region Occupied by a Set of Points? , 2006, GIScience.
[28] David G. Kirkpatrick,et al. On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.
[29] B. Gurumoorthy,et al. Constructing medial axis transform of extruded and revolved 3D objects with free-form boundaries , 2005, Comput. Aided Des..
[30] Ioannis Z. Emiris,et al. A real-time and exact implementation of the predicates for the Voronoi diagram of parametric ellipses , 2007, Symposium on Solid and Physical Modeling.
[31] Gershon Elber,et al. Efficient convex hull computation for planar freeform curves , 2011, Comput. Graph..
[32] Joseph O'Rourke,et al. Computational Geometry in C. , 1995 .
[33] Antony Galton,et al. Efficient generation of simple polygons for characterizing the shape of a set of points in the plane , 2008, Pattern Recognit..
[34] Junyi Xu,et al. A Concave Hull algorithm for scattered data and its applications , 2010, 2010 3rd International Congress on Image and Signal Processing.
[35] Vasyl Tereshchenko,et al. Generating a Simple Polygonalizations , 2011, 2011 15th International Conference on Information Visualisation.
[36] Maribel Yasmina Santos,et al. Concave hull: A k-nearest neighbours approach for the computation of the region occupied by a set of points , 2007, GRAPP.
[37] Gershon Elber,et al. Geometric constraint solver using multivariate rational spline functions , 2001, SMA '01.
[38] D E R Clark,et al. Convex hull of a planar set of straight and circular line segments , 1999 .
[39] Michel Pocchiola,et al. Computing the visibility graph via pseudo-triangulations , 1995, SCG '95.
[40] Gershon Elber,et al. The Convex Hull of Rational Plane Curves , 2001, Graph. Model..
[41] Martin Held,et al. On the Computational Geometry of Pocket Machining , 1991, Lecture Notes in Computer Science.
[42] Cecil G. Armstrong,et al. Modelling requirements for finite-element analysis , 1994, Comput. Aided Des..
[43] Josef Hoschek,et al. Fundamentals of computer aided geometric design , 1996 .
[44] Ioannis Z. Emiris,et al. Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses , 2009, Symposium on Solid and Physical Modeling.
[45] Gershon Elber,et al. Precise Voronoi cell extraction of free-form rational planar closed curves , 2005, SPM '05.
[46] Mohsen Rezayat,et al. Midsurface abstraction from 3D solid models: general theory, applications , 1996, Comput. Aided Des..