Dr. Zhonggui Chen (陈中贵)
Dr. Zhonggui Chen (陈中贵)
We are looking for intelligent, self-motivated, and dedicated graduate students. If you are interested in our research directions, please feel free to contact me.(招收研究生)
Jul. 2007 - Mar. 2008
| Centroidal Power Diagrams with Capacity Constraints: Computation, Applications, and Extension
Shi-Qing Xin, Bruno Lévy, *Zhonggui Chen, Lei Chu, Yaohui Yu, Changhe Tu, and Wenping Wang
ACM Transactions on Graphics, 35, 6, Article 244:1-12, 2016
|Surface Mosaic Synthesis with Irregular Tiles
Wenchao Hu, *Zhonggui Chen, Hao Pan, Yizhou Yu, Eitan Grinspun, Wenping Wang
IEEE Transactions on Visualization and Computer Graphics , 22(3):1302-1313, 2016
|B-spline Surface Fitting with Knot Position Optimization
Yuhua Zhang, Juan Cao, Zhonggui Chen, Xiaoming Zeng
Computers & Graphics (Proc. SMI), 58:73-83, 2016
|Ray–triangular Bézier patch intersection using hybrid
Yanhong Liu, Juan Cao, Zhonggui Chen, Xiaoming Zeng
Frontiers of Information Technology & Electronic Engineering, 2016, 17(10):1018-1030.
计算机辅助设计与图形学学报, 2016 , 28 ( 12 ): 2060-2066
软件学报, 2016, 27(suppl.(2)):1-13
图学学报, 36(3):367-375, 2015
|Poisson-Disk Sampling through Disk Packing
Guanghui Liang, Lin Lu, Zhonggui Chen, Chenglei Yang
Computational Visual Media (Proc. CVM), 1(1):17-26, 2015
|Line Segment Extraction for Large Scale Unorganized Point Clouds
Yangbin Lin, Cheng Wang, Jun Cheng, Bili Chen, Fukai Jia, Zhonggui Chen, Jonathan Li
ISPRS Journal of Photogrammetry and Remote Sensing, 102:172-183, 2015
|Adaptive Knot Placement in Non-uniform B-spline Surface Fitting
Juan Cao, Yongsheng Ouyang, *Zhonggui Chen, Xiaoming Zeng
Journal of Computer-Aided Design & Computer Graphics, 27(1): 60-67, 2015
|Revisiting Optimal Delaunay Triangulation for 3D Graded Mesh Generation
Zhonggui Chen, Wenping Wang, Bruno Lévy, Ligang Liu, Feng Sun
SIAM Journal on Scientific Computing, 36(3), A930-A954, 2014
|Approximation by Piecewise Polynomials on Voronoi Tessellation
Zhonggui Chen, Yanyang Xiao, Juan Cao
Graphical Models (Proc. GMP 2014), 76(5), 522-531, 2014
|Feature-Preserving Method for Mosaic Image Generation
Zhonggui Chen, Yongsheng Ouyang, Juan Cao
Journal of Computer-Aided Design & Computer Graphics, 26(4):520-527, 2014
[Paper 7M](in Chinese)
|Isotropic Surface Remeshing Using Constrained Centroidal Delaunay Mesh
Zhonggui Chen, Juan Cao, Wenping Wang
Computer Graphics Forum (Proc. Pacific Graphics), 31(7): 2077–2085, 2012
Abstract: We develop a novel isotropic remeshing method based on constrained centroidal Delaunay mesh (CCDM), a generalization of centroidal patch triangulation from 2D to mesh surface. Our method starts with resampling an input mesh with a vertex distribution according to a user-defined density function. The initial remeshing result is then progressively optimized by alternatively recovering the Delaunay mesh and moving each vertex to the centroid of its 1-ring neighborhood. The key to making such simple iterations work is an efficient optimization framework that combines both local and global optimization methods.
|Variational Blue Noise Sampling
Zhonggui Chen, Zhan Yuan, Yi-King Choi, Ligang Liu, Wenping Wang
IEEE Transactions on Visualization and Computer Graphics,18(10):1784-1796,2012
[Website] [Paper 19M] [Appendix 9M] [Video 36M]
Abstract: Blue noise point sampling is one of the core algorithms in computer graphics. In this paper we present a new and versatile variational framework for generating point distributions with high-quality blue noise characteristics while precisely adapting to given density functions. Different from previous approaches based on discrete settings of capacity-constrained Voronoi tessellation, we cast the blue noise sampling generation as a variational problem with continuous settings. Based on an accurate evaluation of the gradient of an energy function, an efficient optimization is developed which delivers significantly faster performance than the previous optimization-based methods. Our framework can easily be extended to generating blue noise point samples on manifold surfaces and for multi-class sampling.
|Spherical DCB-spline Surfaces with Hierarchical and
Adaptive knot Insertion
Juan Cao, Xin Li, Zhonggui Chen, Hong Qin
IEEE Transactions on Visualization and Computer Graphics, 18(8): 1290-1303, 2012
[Website] [Paper 1.5M]
Abstract: This paper develops a novel surface fitting scheme for automatically reconstructing a genus-0 object into a continuous parametric spline surface. A key contribution for making such a fitting method both practical and accurate is our spherical generalization of the Delaunay configuration B-spline (DCB-spline), a new non-tensor-product spline. In this framework, we efficiently compute Delaunay configurations on sphere by the union of two planar Delaunay configurations. Also, we develop a hierarchical and adaptive method that progressively improves the fitting quality by new knot-insertion strategies guided by surface geometry and fitting error. Within our framework, a genus-0 model can be converted to a single spherical spline representation whose root mean square error is tightly bounded within a user-specified tolerance.
An Intrinsic Algorithm for Computing Geodesic Distance Fields on Triangle Meshes with Holes
Dao T.P. Quynh, Ying He, Shi-Qing Xin, Zhonggui Chen
Graphical Models (Proc. Geometric Modeling and Processing), 74(4): 209-220, 2012
Abstract: As a fundamental concept, geodesics play an important role in many geometric modeling applications. However, geodesics are highly sensitive to topological changes; a small topological shortcut may result in a significantly large change of geodesic distance and path. Most of the existing discrete geodesic algorithms can only be applied to noise-free meshes. In this paper, we present a new algorithm to compute the meaningful approximate geodesics on polygonal meshes with holes. Without the explicit hole filling, our algorithm is completely intrinsic and independent of the embedding space; thus, it has the potential for isometrically deforming objects as well as meshes in high dimensional space. Furthermore, our method can guarantee the exact solution if the surface is developable.
Topology Improvement for Constructing Optimal
Zhonggui Chen, Juan Cao, Chenhui Yang
Journal of Computer-Aided Design & Computer Graphics, 23(12), 1967-1974, 2011
[Paper 0.5M (in Chinese)]
Abstract: Optimal Delaunay triangulation (ODT for short) is an optimization-based method for mesh generation. From the point of view of numerical optimization, the existing ODT method is a local optimization method, which is easy to get stuck at a bad local minimum corresponding to a mesh with low quality. In this paper, a topology improvement method is introduced into the ODT optimization procedure, which effectively enables ODT method to become unstuck from a poor local minimum and to proceed with optimization, therefore improves the qualities of generated meshes. The proposed topology improvement consists of only local operations of edge flipping, which is easy to implement.
Completion Using Global Optimization
Zhonggui Chen, Ligang Liu, Wang Guojin
Journal of Computer Research and Development, 46(1):144-150, 2009
[Paper 0.5M(in Chinese)]
Abstract: Image completion, which aims to remove objects or recover the damaged portions in a given image, is an important task in photo editing. Recently, exemplar-based methods are considered to complete images with large portions removed. However, structure inconsistency of the reconstructed texture often appear when using those methods. In this paper, a new exemplar-based algorithm is proposed to obtain global texture consistency by using global optimization. First, an energy function is defined for measuring the quality of the reconstructed region. Then, the image completion problem is formulated as minimization of the energy function which is done in an iterative form. Finally, the slight color differences between the known region and the filled region are revised by the Poisson image editing method.
Martin Kilian, Simon Floery, Zhonggui Chen, Niloy J. Mitra, Alla Sheffer, Helmut Pottmann
ACM Transactions on Graphics (Proc. ACM SIGGRAPH), 27, 75:1–75:9, 2008
[Website] [Paper 4M] [Talk 21M]
Abstract: Fascinating and elegant shapes may be folded from a single planar sheet of material without stretching, tearing or cutting, if one incorporates curved folds into the design. We present an optimization based computational framework for design and digital reconstruction of surfaces which can be produced by curved folding. Our work not only contributes to applications in architecture and industrial design, but it also provides a new way to study the complex and largely unexplored phenomena arising in curved folding.
with Curved Creases
Martin Kilian, Simon Flöry, Zhonggui Chen, Niloy J. Mitra, Alla Sheffer, Helmut Pottmann
Advances in Architectural Geometry 2008: 33-36
Abstract: Motivated by the potential and interest in the use of curved folding for various geometric design purposes, we investigate this topic from the perspective of geometric modeling. Developable surfaces are well studied in differential geometry. They are surfaces which can be unfolded into the plane while preserving the length of all curves on the surface. Developable surfaces are composed of planar patches and patches of ruled surfaces with the special property that all points of a ruling have the same tangent plane. Such torsal ruled surfaces consist of pieces of cylinders, cones, and tangent surfaces, i.e., their rulings are either parallel, pass through a common point, or are tangent to a curve (curve of regression), respectively.
Parameterization via Aligning Optimal Local
Zhonggui Chen, Ligang Liu, Zhengyue Zhang, and Guojin Wang.
Proceedings of the 2007 ACM symposium on Solid and physical modeling, 291–296
[Paper 0.4M] [Talk]
Abstract: This paper presents a novel parameterization method for a nonclosed triangular mesh. For every flattened 1-ring neighbors, we choose a local coordinate frame, and the local geometry structure is represented as local parametric coordinates. Then the global optimal parametric coordinates are attained by aligning all the local parametric planes while preserving the local structure as much as possible. The boundary conditions are not necessary in our method, thus no high distortion appears around the boundary, and distortion is uniformly distributed over parametric domain. In addition, our method can operate directly on mesh surface which has holes without any preprocessing of surface partition. Furthermore, linear constraints are allowed in the parameterization in a least squares sense.
Easy Mesh Cutting
Zhongping Ji, Ligang Liu, Zhonggui Chen, and Guojin Wang.
Computer Graphics Forum (Proc. Eurographics), 25(3):283–291, 2006.
[Website] [Paper 4.2M] [Video 15M] [Talk 3.7M]
Abstract: We present Easy Mesh Cutting, an intuitive and easy-to-use mesh cutout tool. Users can cut meaningful components from meshes by simply drawing freehand sketches on the mesh. Our system provides instant visual feedback to obtain the cutting results based on an improved region growing algorithm using a feature sensitive metric. The cutting boundary can be automatically optimized or easily edited by users. Extensive experimentation shows that our approach produces good cutting results while requiring little skill or effort from the user and provides a good user experience. Based on the easy mesh cutting framework, we introduce two applications including sketch-based mesh editing and mesh merging for geometry processing.
2015.01 - 2018.12 National Natural Science Foundation of China (No. 61472332) PI
2014.01 - 2016.12 Fundamental Research Funds for the Central Universities (No. 20720140520) PI
2012.01 - 2014.12 National Natural Science Foundation of China (No. 61100107) PI
2012.01 - 2014.12 Natural Science Foundation of Fujian Province (No. 2012J01291) PI
2012.01 - 2014.12 National Natural Science Foundation of China (No. 61100105) Co-PI
2011.04 - 2014.03 Natural Science Foundation of Fujian Province (No. 2011J05007) Co-PI
Attending Academic Conferences
Prof. Dominique Michelucci (University of Dijon, France), Jul.06-Jul.14, 2014
Prof. Ying He (Nanyang Technological University, Singapore), Sep.28-Oct.7, 2011
Prof. Wenping Wang (The University of Hong Kong, Hong Kong), Jan. 06-21, Jul.17-30, Aug. 21-Sep.3, 2011; Jul. 7-Sept.5, 2013
Prof. Hiromasa Suzuki (The University of Tokyo, Japan), Dec. 19-Dec 21, 2009