检索结果-内蒙古大学图书馆

A Motion-guided Interface for modeling 3D Multi-functional Furniture

COMPUTER GRAPHICS FORUM 2021年第7期40卷 229-240页

作者： Chen, Minchan Lau, Manfred City Univ Hong Kong Hong Kong Peoples R China

While non-expert 3D design systems are helpful for performing conceptual design, most existing works focused on modeling static objects. However, the 3D modeling interfaces can include more interactions between the user and the models that are dynamic (and can be interacted with). In this paper, we propose a 3D modeling system for the conceptual design of interactable multi-functional furniture. Our contribution is in the design and development of a motion-guided interface. The key idea is that users should create interactable furniture components as if they are interacting with them with their hands. We conducted a preliminary user study to explore users' preferred hand gestures for creating various dynamic furniture components, implemented a 3D modeling system with the preferred gestures as a basis for the motion-guided user interface, and conducted an evaluation user study to demonstrate that our user interface is user-friendly and efficient for novice designers to perform conceptual furniture designs.

关键词： CCS Concepts • computing methodologies → shape modeling • Human-centered computing → Gestural input

来源：评论

学校读者我要写书评

暂无评论

computing Surface PolyCube-Maps by Constrained Voxelization

引用

COMPUTER GRAPHICS FORUM 2019年第7期38卷 299-309页

作者： Yang, Yang Fu, Xiao-Ming Liu, Ligang Univ Sci & Technol China Hefei Anhui Peoples R China

We present a novel method to compute bijective PolyCube-maps with low isometric distortion. Given a surface and its pre-axis-aligned shape that is not an exact PolyCube shape, the algorithm contains two steps: (i) construct a PolyCube shape to approximate the pre-axis-aligned shape;and (ii) generate a bijective, low isometric distortion mapping between the constructed PolyCube shape and the input surface. The PolyCube construction is formulated as a constrained optimization problem, where the objective is the number of corners in the constructed PolyCube, and the constraint is to bound the approximation error between the constructed PolyCube and the input pre-axis-aligned shape while ensuring topological validity. A novel erasing-and-filling solver is proposed to solve this challenging problem. Centeral to the algorithm for computing bijective PolyCube-maps is a quad mesh optimization process that projects the constructed PolyCube onto the input surface with high-quality quads. We demonstrate the efficacy of our algorithm on a data set containing 300 closed meshes. Compared to state-of-the-art methods, our method achieves higher practical robustness and lower mapping distortion.

关键词： CCS Concepts • computing methodologies → shape modeling

来源：评论

学校读者我要写书评

暂无评论

Topology Preserving Simplification of Medial Axes in 3D Models

引用

COMPUTER GRAPHICS FORUM 2019年第7期38卷 607-616页

作者： Chu, Yiyao Hou, Fei Wang, Wencheng Li, Lei Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China

We propose an efficient method for topology-preserving simplification of medial axes of 3D models. Existing methods either cannot preserve the topology during medial axes simplification or have the problem of being geometrically inaccurate or computationally expensive. To tackle these issues, we restrict our topology-checking to the areas around the topological holes to avoid unnecessary checks in other areas. Our algorithm can keep high precision even when the medial axis is simplified to be in very few vertices. Furthermore, we parallelize the medial axes simplification procedure to enhance the performance significantly. Experimental results show that our method can preserve the topology with highly efficient performance, much superior to the existing methods in terms of topology preservation, accuracy and performance.

关键词： CCS Concepts • computing methodologies → shape modeling shape analysis

来源：评论

学校读者我要写书评

暂无评论

Practical Fabrication of Discrete Chebyshev Nets

引用

COMPUTER GRAPHICS FORUM 2020年第7期39卷 13-26页

作者： Liu, Hao-Yu Liu, Zhong-Yuan Zhao, Zheng-Yu Liu, Ligang Fu, Xiao-Ming Univ Sci & Technol China Hefei Peoples R China

We propose a computational and practical technique to allow home users to fabricate discrete Chebyshev nets for various 3D models. The success of our method relies on two key components. The first one is a novel and simple method to approximate discrete integrable, unit-length, and angle-bounded frame fields, used to model discrete Chebyshev nets. Central to our field generation process is an alternating algorithm that takes turns executing one pass to enforce integrability and another pass to approach unit length while bounding angles. The second is a practical fabrication specification. The discrete Chebyshev net is first partitioned into a set of patches to facilitate manufacturing. Then, each patch is assigned a specification on pulling, bend, and fold to fit the nets. We demonstrate the capability and feasibility of our method in various complex models.

关键词： CCS Concepts • computing methodologies → shape modeling

来源：评论

学校读者我要写书评

暂无评论

Constrained Remeshing Using Evolutionary Vertex Optimization

引用

COMPUTER GRAPHICS FORUM 2022年第2期41卷 237-247页

作者： Zhang, Wen-Xiang Wang, Qi Guo, Jia-Peng Chai, Shuangming Liu, Ligang Fu, Xiao-Ming Univ Sci & Technol China Hefei Peoples R China

We propose a simple yet effective method to perform surface remeshing with hard constraints, such as bounding approximation errors and ensuring Delaunay conditions. The remeshing is formulated as a constrained optimization problem, where the variables contain the mesh connectivity and the mesh geometry. To solve it effectively, we adopt traditional local operations, including edge split, edge collapse, edge flip, and vertex relocation, to update the variables. Central to our method is an evolutionary vertex optimization algorithm, which is derivative-free and robust. The feasibility and practicability of our method are demonstrated in two applications, including error-bounded Delaunay mesh simplification and error-bounded angle improvement with a given number of vertices, over many models. Compared to state-of-the-art methods, our method achieves higher remeshing quality.

关键词： CCS Concepts • computing methodologies → shape modeling

来源：评论

学校读者我要写书评

暂无评论

FAKIR : An algorithm for revealing the anatomy and pose of statues from raw point sets

引用

COMPUTER GRAPHICS FORUM 2020年第7期39卷 375-385页

作者： Fu, Tong Chaine, Raphaelle Digne, Julie Univ Lyon CNRS UCBL Lyon France

3D acquisition of archaeological artefacts has become an essential part of cultural heritage research for preservation or restoration purpose. Statues, in particular, have been at the center of many projects. In this paper, we introduce a way to improve the understanding of acquired statues representing real or imaginary creatures by registering a simple and pliable articulated model to the raw point set data. Our approach performs a Forward And bacKward Iterative Registration (FAKIR) which proceeds joint by joint, needing only a few iterations to converge. We are thus able to detect the pose and elementary anatomy of sculptures, with possibly non realistic body proportions. By adapting our simple skeleton, our method can work on animals and imaginary creatures.

关键词： CCS Concepts • computing methodologies → shape modeling Point‐based models

来源：评论

学校读者我要写书评

暂无评论

Greedy Cut Construction for Parameterizations

引用

COMPUTER GRAPHICS FORUM 2020年第2期39卷 191-202页

作者： Zhu, Tianyu Ye, Chunyang Chai, Shuangming Fu, Xiao-Ming Univ Sci & Technol China Hefei Anhui Peoples R China Shining 3D Tech Co Ltd Hangzhou Peoples R China

We present a novel method to construct short cuts for parameterizations with low isometric distortion. The algorithm contains two steps: (i) detect feature points, where the distortion is usually concentrated;and (ii) construct a cut by connecting the detected feature points. Central to each step is a greedy method. After generating a redundant feature point set, a greedy filtering process is performed to identify the feature points required for low isometric distortion parameterizations. This filtering process discards the feature points that are useless for distortion reduction while still enabling us to obtain low isometric distortion. Next, we formulate the process of connecting the detected feature points as a Steiner tree problem. To find an approximate solution, we first successively and greedily produce a collection of auxiliary points. Then, a cut is constructed by connecting the feature points and auxiliary points. In the 26,299 test cases in which an exact solution to the Steiner tree problem is available, the length of the cut obtained by our method is on average 0.17% longer than optimal. Compared to state-of-the-art cut construction methods, our method is one order of magnitude faster and generates shorter cuts while achieving similar isometric distortion.

关键词： CCS Concepts • computing methodologies → shape modeling

来源：评论

学校读者我要写书评

暂无评论

Topology-Aware Surface Reconstruction for Point Clouds

引用

COMPUTER GRAPHICS FORUM 2020年第5期39卷 197-207页

作者： Bruel-Gabrielsson, Rickard Ganapathi-Subramanian, Vignesh Skraba, Primoz Guibas, Leonidas J. Stanford Univ Stanford CA 94305 USA Unbox AI Stanford CA 94305 USA Queen Mary Univ London London England Jozef Stefan Inst Ljubljana Slovenia

We present an approach to incorporate topological priors in the reconstruction of a surface from a point scan. We base the reconstruction on basis functions which are optimized to provide a good fit to the point scan while satisfying predefined topological constraints. We optimize the parameters of a model to obtain a likelihood function over the reconstruction domain. The topological constraints are captured by persistence diagrams which are incorporated within the optimization algorithm to promote the correct topology. The result is a novel topology-aware technique which can (i) weed out topological noise from point scans, and (ii) capture certain nuanced properties of the underlying shape which could otherwise be lost while performing surface reconstruction. We show results reconstructing shapes with multiple potential topologies, compare to other classical surface construction techniques, and show the completion of real scan data.

关键词： CCS Concepts • Theory of computation → Computational geometry • computing methodologies → shape modeling • Mathematics of computing → Algebraic topology

来源：评论

学校读者我要写书评

暂无评论

SDF-StyleGAN: Implicit SDF-Based StyleGAN for 3D shape Generation

引用

COMPUTER GRAPHICS FORUM 2022年第5期41卷 51-63页

作者： Zheng, X. Liu, Y. Wang, P. Tong, X. Tsinghua Univ Beijing Peoples R China Microsoft Res Asia Beijing Peoples R China

We present a StyleGAN2-based deep learning approach for 3D shape generation, called SDF-StyleGAN, with the aim of reducing visual and geometric dissimilarity between generated shapes and a shape collection. We extend StyleGAN2 to 3D generation and utilize the implicit signed distance function (SDF) as the 3D shape representation, and introduce two novel global and local shape discriminators that distinguish real and fake SDF values and gradients to significantly improve shape geometry and visual quality. We further complement the evaluation metrics of 3D generative models with the shading-image-based Frechet inception distance (FID) scores to better assess visual quality and shape distribution of the generated shapes. Experiments on shape generation demonstrate the superior performance of SDF-StyleGAN over the state-of-the-art. We further demonstrate the efficacy of SDF-StyleGAN in various tasks based on GAN inversion, including shape reconstruction, shape completion from partial point clouds, single-view image-based shape generation, and shape style editing. Extensive ablation studies justify the efficacy of our framework design. Our code and trained models are available at https://***/Zhengxinyang/SDF- StyleGAN.

关键词： CCS Concepts • computing methodologies → shape modeling Volumetric models Neural networks

来源：评论

学校读者我要写书评

暂无评论

Nonlinear Deformation Synthesis via Sparse Principal Geodesic Analysis

引用

COMPUTER GRAPHICS FORUM 2020年第5期39卷 119-132页

作者： Sassen, Josua Hildebrandt, Klaus Rumpf, Martin Univ Bonn Inst Numer Simulat Bonn Germany Delft Univ Technol Delft Netherlands

This paper introduces the construction of a low-dimensional nonlinear space capturing the variability of a non-rigid shape from a data set of example poses. The core of the approach is a Sparse Principal Geodesic Analysis (SPGA) on the Riemannian manifold of discrete shells, in which a pose of a non-rigid shape is a point. The SPGA is invariant to rigid body motions of the poses and supports large deformation. Since the Riemannian metric measures the membrane and bending distortions of the shells, the sparsity term forces the modes to describe largely decoupled and localized deformations. This property facilitates the analysis of articulated shapes. The modes often represent characteristic articulations of the shape and usually come with a decomposing of the spanned subspace into low-dimensional widely decoupled subspaces. For example, for human models, one expects distinct, localized modes for the bending of elbow or knee whereas some more modes are required to represent shoulder articulation. The decoupling property can be used to construct useful starting points for the computation of the nonlinear deformations via a superposition of shape submanifolds resulting from the decoupling. In a preprocessing stage, samples of the individual subspaces are computed, and, in an online phase, these are interpolated multilinearly. This accelerates the construction of nonlinear deformations and makes the method applicable for interactive applications. The method is compared to alternative approaches and the benefits are demonstrated on different kinds of input data.

关键词： CCS Concepts • computing methodologies → shape modeling

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：