default search action
SMI 2009: Beijing, China
- Jun-Hai Yong, Michela Spagnuolo, Wenping Wang:
IEEE International Conference on Shape Modeling and Applications, SMI 2009, Beijing, China, 26-28 June 2009. IEEE Computer Society 2009, ISBN 978-1-4244-4068-9 - Zhixun Su, Hui Wang, Junjie Cao:
Mesh denoising based on differential coordinates. 1-6 - Zhong Li, B. Barsky, Xiaogang Jin:
An effective third-order local fitting patch and its application. 7-14 - Bo Shu, Xianjie Qiu, Zhaoqi Wang:
Image based modeling via plane sweep based surface growing. 15-20 - Chuhua Xian, Hongwei Lin, Shuming Gao:
Automatic generation of coarse bounding cages from dense meshes. 21-27 - Yongwei Miao, Pablo Diaz-Gutierrez, Renato Pajarola, M. Gopi, Jieqing Feng:
Shape isophotic error netric controllable re-sampling for point-sampled surfaces. 28-35 - Halim Benhabiles, Jean-Philippe Vandeborre, Guillaume Lavoué, Mohamed Daoudi:
A framework for the objective evaluation of segmentation algorithms using a ground-truth of human segmented 3D-models. 36-43 - Shankar Krishnan, Suresh Venkatasubramanian:
Approximate shape matching and symmetry detection for 3D shapes with guaranteed error bounds. 44-51 - Chongyang Deng, Xunnian Yang:
Interpolation over arbitrary topology meshes using Doo-Sabin surfaces. 52-57 - Wenbing Ge, Gang Xu, Kin-Chuen Hui, Guoping Wang:
Detail-preserving axial deformation using curve pairs. 58-65 - Alan Brunton, Stefanie Wuhrer, Chang Shu, Prosenjit Bose, Erik D. Demaine:
Filling holes in triangular meshes by curve unfolding. 66-72 - Hichem Barki, Florence Denis, Florent Dupont:
Contributing vertices-based Minkowski sum of a non-convex polyhedron without fold and a convex polyhedron. 73-80 - Yaron Holdstein, Anath Fischer, Lev Podshivalov, Pinhas Z. Bar-Yoseph:
Volumetric texture synthesis of bone micro-structure as a base for scaffold design. 81-88 - Lili Wan:
Parts-based 2D shape decomposition by convex hull. 89-95 - Min Liu, Karthik Ramani:
On minimal orthographic view covers for polyhedra. 96-102 - Ming Luo, Adrian G. Bors:
Shape watermarking based on minimizing the quadric error metric. 103-110 - Fan Chen, Ye Zhao:
Distance field transform with an adaptive iteration method. 111-118 - Huanxi Zhao, Xia Qiu, Luming Liang, Chuan Sun, Beiji Zou:
Curvature normal vector driven interpolatory subdivision. 119-125 - Caiming Zhang, Feng Li, Dongmei Niu, Xingqiang Yang:
Interpolation to C1 boundary conditions by polynomial of degree six. 126-131 - Oleg Fryazinov, Alexander A. Pasko, Valery Adzhiev:
An exact representation of polygonal objects by C1-continuous scalar fields based on binary space partitioning. 132-139 - Jean-Philippe Pernot, Franca Giannini, Bianca Falcidieno, Jean-Claude Léon:
Parameterised free-form feature templates. 140-147 - Jens Kerber, Art Tevs, Alexander G. Belyaev, Rhaleb Zayer, Hans-Peter Seidel:
Feature sensitive bas relief generation. 148-154 - Andrew Nealen, Justus Pett, Marc Alexa, Takeo Igarashi:
GridMesh: Fast and high quality 2D Mesh generation for interactive 3D shape modeling. 155-162 - Wei Li, Youngung Shon, Sara McMains:
Haptic rendering using C1 continuous reconstructed distance fields. 163-170 - Wei Zeng, Miao Jin, Feng Luo, Xianfeng Gu:
Canonical homotopy class representative using hyperbolic structure. 171-178 - Jean-Claude Léon, Leila De Floriani, Franck Hétroy:
Classification of non-manifold singularities from transformations of 2-manifolds. 179-184 - Dan Albocher, Gershon Elber:
On the computation of the minimal ellipse enclosing a set of planar curves. 185-192 - Miao Jin, Wei Zeng, Ning Ding, Xianfeng Gu:
Computing Fenchel-Nielsen coordinates in Teichmuller shape Space. 193-200 - Mehdi Baba-ali, David Marcheix, Xavier Skapin:
An edge matching technique for non-planar face intersections in geometric parametric models. 201-208
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.